scriptoriumadmin/featurebase
1
0
Fork 0
mirror of https://github.com/featurebasedb/featurebase.git synced 2026-10-07 11:27:50 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

update roaring container benchmarks to do both slice and btree

Browse source
This commit is contained in:
Matt Jaffee 2019-03-05 15:46:13 -06:00
parent e54dbd6731
commit 831195e7d2
No known key found for this signature in database
GPG key ID: 08A3DFFF987B11BF
1 changed files with 58 additions and 35 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

93
roaring/roaring_test.go
View file

@ -1457,64 +1457,87 @@ const (
MaxContainerVal = 0xffff
)
func BenchmarkContainerLinear(b *testing.B) {
var bmFuncs = []func(a ...uint64) *roaring.Bitmap{roaring.NewBitmap, roaring.NewBTreeBitmap}
var bmFuncNames = []string{"slice", "btree"}
for n := 0; n < b.N; n++ {
bm := roaring.NewFileBitmap()
for row := uint64(1); row < NumRows; row++ {
for col := uint64(1); col < NumColums; col++ {
bm.Add(row*pilosa.ShardWidth + (col * MaxContainerVal))
func BenchmarkContainerLinear(b *testing.B) {
for i, bmMaker := range bmFuncs {
b.Run(fmt.Sprintf("%v", bmFuncNames[i]), func(b *testing.B) {
for n := 0; n < b.N; n++ {
bm := bmMaker()
for row := uint64(1); row < NumRows; row++ {
for col := uint64(1); col < NumColums; col++ {
bm.Add(row*pilosa.ShardWidth + (col * MaxContainerVal))
}
}
}
}
})
}
}
func BenchmarkContainerReverse(b *testing.B) {
for n := 0; n < b.N; n++ {
bm := roaring.NewFileBitmap()
for row := NumRows - 1; row >= 1; row-- {
for col := NumColums - 1; col >= 1; col-- {
bm.Add(row*pilosa.ShardWidth + (col * MaxContainerVal))
for i, bmMaker := range bmFuncs {
b.Run(fmt.Sprintf("%v", bmFuncNames[i]), func(b *testing.B) {
for n := 0; n < b.N; n++ {
bm := bmMaker()
for row := NumRows - 1; row >= 1; row-- {
for col := NumColums - 1; col >= 1; col-- {
bm.Add(row*pilosa.ShardWidth + (col * MaxContainerVal))
}
}
}
}
})
}
}
func BenchmarkContainerColumn(b *testing.B) {
for n := 0; n < b.N; n++ {
bm := roaring.NewFileBitmap()
for col := uint64(1); col < NumColums; col++ {
for row := uint64(1); row < NumRows; row++ {
bm.Add(row*pilosa.ShardWidth + (col * MaxContainerVal))
for i, bmMaker := range bmFuncs {
b.Run(fmt.Sprintf("%v", bmFuncNames[i]), func(b *testing.B) {
for n := 0; n < b.N; n++ {
bm := bmMaker()
for col := uint64(1); col < NumColums; col++ {
for row := uint64(1); row < NumRows; row++ {
bm.Add(row*pilosa.ShardWidth + (col * MaxContainerVal))
}
}
}
}
})
}
}
func BenchmarkContainerOutsideIn(b *testing.B) {
middle := NumRows / uint64(2)
for n := 0; n < b.N; n++ {
bm := roaring.NewFileBitmap()
for col := uint64(1); col < NumColums; col++ {
for row := uint64(1); row < middle; row++ {
bm.Add(row*pilosa.ShardWidth + (col * MaxContainerVal))
bm.Add((NumRows-row)*pilosa.ShardWidth + (col * MaxContainerVal))
for i, bmMaker := range bmFuncs {
b.Run(fmt.Sprintf("%v", bmFuncNames[i]), func(b *testing.B) {
middle := NumRows / uint64(2)
for n := 0; n < b.N; n++ {
bm := bmMaker()
for col := uint64(1); col < NumColums; col++ {
for row := uint64(1); row < middle; row++ {
bm.Add(row*pilosa.ShardWidth + (col * MaxContainerVal))
bm.Add((NumRows-row)*pilosa.ShardWidth + (col * MaxContainerVal))
}
}
}
}
})
}
}
func BenchmarkContainerInsideOut(b *testing.B) {
reflect.TypeOf(bmFuncs[0]).Name()
middle := NumRows / uint64(2)
for n := 0; n < b.N; n++ {
bm := roaring.NewFileBitmap()
for col := uint64(1); col < NumColums; col++ {
for row := uint64(1); row <= middle; row++ {
bm.Add((middle+row)*pilosa.ShardWidth + (col * MaxContainerVal))
bm.Add((middle-row)*pilosa.ShardWidth + (col * MaxContainerVal))
for i, bmMaker := range bmFuncs {
b.Run(fmt.Sprintf("%v", bmFuncNames[i]), func(b *testing.B) {
for n := 0; n < b.N; n++ {
bm := bmMaker()
for col := uint64(1); col < NumColums; col++ {
for row := uint64(1); row <= middle; row++ {
bm.Add((middle+row)*pilosa.ShardWidth + (col * MaxContainerVal))
bm.Add((middle-row)*pilosa.ShardWidth + (col * MaxContainerVal))
}
}
}
}
})
}
}