mirror of
https://github.com/featurebasedb/featurebase.git
synced 2026-08-28 10:54:59 +00:00
08659c350b
This commit moves the computation of the intersection count to the `roaring` package so that no allocations are required. The implementation operates at the roaring container level and has specialized functions for array-array, array-bitmap, and bitmap-bitmap container pairs.
125 lines
1.9 KiB
Go
125 lines
1.9 KiB
Go
package roaring
|
|
|
|
import "testing"
|
|
|
|
func TestBSFQ(t *testing.T) {
|
|
result := BSFQ(2)
|
|
if result != 1 {
|
|
t.Fatalf("BSF INCORRECT: %d", result)
|
|
}
|
|
}
|
|
|
|
func TestBSFQ_CompareGo(t *testing.T) {
|
|
v := uint64(1)
|
|
for i := 0; i < 64; i++ {
|
|
if BSFQ(v) != trailingZeroN(v) {
|
|
t.Fatalf("BSF INCORRECT: %d %d", BSFQ(v), trailingZeroN(v))
|
|
}
|
|
if v == 0 {
|
|
v = 1
|
|
} else {
|
|
v *= 2
|
|
}
|
|
}
|
|
/*
|
|
if bsfq(0) != trailingZeroN(0) {
|
|
fmt.Println(bsfq(0))
|
|
t.Fatalf("BSF INCORRECT")
|
|
}
|
|
*/
|
|
}
|
|
func BenchmarkBSF(b *testing.B) {
|
|
for i := 0; i < b.N; i++ {
|
|
BSFQ(uint64(i))
|
|
}
|
|
}
|
|
|
|
func BenchmarkTrailingZeroN(b *testing.B) {
|
|
for i := 0; i < b.N; i++ {
|
|
trailingZeroN(uint64(i))
|
|
}
|
|
}
|
|
|
|
func BenchmarkPOPCNTQ(b *testing.B) {
|
|
for i := 0; i < b.N; i++ {
|
|
POPCNTQ(uint64(i))
|
|
}
|
|
}
|
|
|
|
func BenchmarkPopcount(b *testing.B) {
|
|
for i := 0; i < b.N; i++ {
|
|
popcount(uint64(i))
|
|
}
|
|
}
|
|
|
|
func BenchmarkPopcntAsm(b *testing.B) {
|
|
// run the Fib function b.N times
|
|
for n := 0; n < b.N; n++ {
|
|
popcntAsm(0xdeadbeef)
|
|
}
|
|
}
|
|
|
|
func BenchmarkPopcntGo(b *testing.B) {
|
|
// run the Fib function b.N times
|
|
for n := 0; n < b.N; n++ {
|
|
popcntGo(0xdeadbeef)
|
|
}
|
|
}
|
|
|
|
func getData() []uint64 {
|
|
return []uint64{
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
0xdeadbeef,
|
|
}
|
|
}
|
|
|
|
func BenchmarkPopcntSliceGo(b *testing.B) {
|
|
d := getData()
|
|
for n := 0; n < b.N; n++ {
|
|
popcntSliceGo(d)
|
|
}
|
|
}
|
|
|
|
func BenchmarkPopcntSliceAsm(b *testing.B) {
|
|
d := getData()
|
|
for n := 0; n < b.N; n++ {
|
|
popcntSliceAsm(d)
|
|
}
|
|
}
|
|
|
|
func BenchmarkPopcntSlice(b *testing.B) {
|
|
d := getData()
|
|
for n := 0; n < b.N; n++ {
|
|
popcntSlice(d)
|
|
}
|
|
}
|