|
| 1 | +//go:build go1.23 |
| 2 | +// +build go1.23 |
| 3 | + |
| 4 | +package roaring |
| 5 | + |
| 6 | +import ( |
| 7 | + "math/rand" |
| 8 | + "testing" |
| 9 | +) |
| 10 | + |
| 11 | +func BenchmarkIterator123(b *testing.B) { |
| 12 | + bm := NewBitmap() |
| 13 | + domain := 100000000 |
| 14 | + count := 10000 |
| 15 | + for j := 0; j < count; j++ { |
| 16 | + v := uint32(rand.Intn(domain)) |
| 17 | + bm.Add(v) |
| 18 | + } |
| 19 | + i := IntIterator{} |
| 20 | + expectedCardinality := bm.GetCardinality() |
| 21 | + counter := uint64(0) |
| 22 | + |
| 23 | + b.Run("simple iteration with alloc", func(b *testing.B) { |
| 24 | + for n := 0; n < b.N; n++ { |
| 25 | + counter = 0 |
| 26 | + i := bm.Iterator() |
| 27 | + for i.HasNext() { |
| 28 | + i.Next() |
| 29 | + counter++ |
| 30 | + } |
| 31 | + } |
| 32 | + b.StopTimer() |
| 33 | + }) |
| 34 | + if counter != expectedCardinality { |
| 35 | + b.Fatalf("Cardinalities don't match: %d, %d", counter, expectedCardinality) |
| 36 | + } |
| 37 | + b.Run("simple iteration", func(b *testing.B) { |
| 38 | + for n := 0; n < b.N; n++ { |
| 39 | + counter = 0 |
| 40 | + i.Initialize(bm) |
| 41 | + for i.HasNext() { |
| 42 | + i.Next() |
| 43 | + counter++ |
| 44 | + } |
| 45 | + } |
| 46 | + b.StopTimer() |
| 47 | + }) |
| 48 | + if counter != expectedCardinality { |
| 49 | + b.Fatalf("Cardinalities don't match: %d, %d", counter, expectedCardinality) |
| 50 | + } |
| 51 | + b.Run("values iteration", func(b *testing.B) { |
| 52 | + for n := 0; n < b.N; n++ { |
| 53 | + counter = 0 |
| 54 | + Values(bm)(func(_ uint32) bool { |
| 55 | + counter++ |
| 56 | + return true |
| 57 | + }) |
| 58 | + } |
| 59 | + b.StopTimer() |
| 60 | + }) |
| 61 | + if counter != expectedCardinality { |
| 62 | + b.Fatalf("Cardinalities don't match: %d, %d", counter, expectedCardinality) |
| 63 | + } |
| 64 | + b.Run("reverse iteration with alloc", func(b *testing.B) { |
| 65 | + for n := 0; n < b.N; n++ { |
| 66 | + counter = 0 |
| 67 | + ir := bm.ReverseIterator() |
| 68 | + for ir.HasNext() { |
| 69 | + ir.Next() |
| 70 | + counter++ |
| 71 | + } |
| 72 | + } |
| 73 | + b.StopTimer() |
| 74 | + }) |
| 75 | + if counter != expectedCardinality { |
| 76 | + b.Fatalf("Cardinalities don't match: %d, %d", counter, expectedCardinality) |
| 77 | + } |
| 78 | + ir := IntReverseIterator{} |
| 79 | + |
| 80 | + b.Run("reverse iteration", func(b *testing.B) { |
| 81 | + for n := 0; n < b.N; n++ { |
| 82 | + counter = 0 |
| 83 | + ir.Initialize(bm) |
| 84 | + for ir.HasNext() { |
| 85 | + ir.Next() |
| 86 | + counter++ |
| 87 | + } |
| 88 | + } |
| 89 | + b.StopTimer() |
| 90 | + }) |
| 91 | + if counter != expectedCardinality { |
| 92 | + b.Fatalf("Cardinalities don't match: %d, %d", counter, expectedCardinality) |
| 93 | + } |
| 94 | + b.Run("backward iteration", func(b *testing.B) { |
| 95 | + for n := 0; n < b.N; n++ { |
| 96 | + counter = 0 |
| 97 | + Backward(bm)(func(_ uint32) bool { |
| 98 | + counter++ |
| 99 | + return true |
| 100 | + }) |
| 101 | + } |
| 102 | + b.StopTimer() |
| 103 | + }) |
| 104 | + if counter != expectedCardinality { |
| 105 | + b.Fatalf("Cardinalities don't match: %d, %d", counter, expectedCardinality) |
| 106 | + } |
| 107 | + |
| 108 | + b.Run("many iteration with alloc", func(b *testing.B) { |
| 109 | + for n := 0; n < b.N; n++ { |
| 110 | + counter = 0 |
| 111 | + buf := make([]uint32, 1024) |
| 112 | + im := bm.ManyIterator() |
| 113 | + for n := im.NextMany(buf); n != 0; n = im.NextMany(buf) { |
| 114 | + counter += uint64(n) |
| 115 | + } |
| 116 | + } |
| 117 | + b.StopTimer() |
| 118 | + }) |
| 119 | + if counter != expectedCardinality { |
| 120 | + b.Fatalf("Cardinalities don't match: %d, %d", counter, expectedCardinality) |
| 121 | + } |
| 122 | + im := ManyIntIterator{} |
| 123 | + buf := make([]uint32, 1024) |
| 124 | + |
| 125 | + b.Run("many iteration", func(b *testing.B) { |
| 126 | + for n := 0; n < b.N; n++ { |
| 127 | + counter = 0 |
| 128 | + im.Initialize(bm) |
| 129 | + for n := im.NextMany(buf); n != 0; n = im.NextMany(buf) { |
| 130 | + counter += uint64(n) |
| 131 | + } |
| 132 | + } |
| 133 | + b.StopTimer() |
| 134 | + }) |
| 135 | + if counter != expectedCardinality { |
| 136 | + b.Fatalf("Cardinalities don't match: %d, %d", counter, expectedCardinality) |
| 137 | + } |
| 138 | + |
| 139 | + b.Run("values iteration 1.23", func(b *testing.B) { |
| 140 | + for n := 0; n < b.N; n++ { |
| 141 | + counter = 0 |
| 142 | + for range Values(bm) { |
| 143 | + counter++ |
| 144 | + } |
| 145 | + } |
| 146 | + b.StopTimer() |
| 147 | + }) |
| 148 | + if counter != expectedCardinality { |
| 149 | + b.Fatalf("Cardinalities don't match: %d, %d", counter, expectedCardinality) |
| 150 | + } |
| 151 | + |
| 152 | + b.Run("backward iteration 1.23", func(b *testing.B) { |
| 153 | + for n := 0; n < b.N; n++ { |
| 154 | + counter = 0 |
| 155 | + for range Backward(bm) { |
| 156 | + counter++ |
| 157 | + } |
| 158 | + } |
| 159 | + b.StopTimer() |
| 160 | + }) |
| 161 | + if counter != expectedCardinality { |
| 162 | + b.Fatalf("Cardinalities don't match: %d, %d", counter, expectedCardinality) |
| 163 | + } |
| 164 | +} |
0 commit comments