func BenchmarkIterate(b *testing.B) {
tree := btree.TreeNew(cznicCmp)
for i := 0; i < len(fixture.TestData); i++ {
tree.Set(fixture.TestData[i].Key, fixture.TestData[i].Value)
}
b.ResetTimer()
for i := 0; i < b.N; i++ {
// only errors on empty trees; meh api
iter, err := tree.SeekFirst()
if err != nil {
b.Fatalf("tree.SeekFirst: %v", err)
}
for {
k, v, err := iter.Next()
if err == io.EOF {
break
}
if err != nil {
b.Fatalf("iter.Next: %v", err)
}
_ = k
_ = v
}
iter.Close()
}
}
func BenchmarkSortedInsert(b *testing.B) {
for i := 0; i < b.N; i++ {
tree := btree.TreeNew(cznicCmp)
for i := 0; i < len(fixture.SortedTestData); i++ {
tree.Set(fixture.SortedTestData[i].Key, fixture.SortedTestData[i].Value)
}
}
}