func main() {
t, err := btree.New(50) // branching factor of the btree. For high performance 100 is optimal.
if err != nil {
panic(err)
}
t.Insert(Int(8)) // Btree accepts btee.Comper interface
fmt.Println(
t.Find(Int(8)),
t.Delete(Int(8)),
t.Find(Int(8)),
)
}
func TestSmallOrder() {
for i := 5; i < 10; i++ {
s, _ := btree.New(i)
for j := 0; j < testnum/10; j++ {
s.Insert(btree.Int(j))
}
for j := 0; j < testnum/10; j++ {
if s.Find(btree.Int(j)) == false {
panic("Can't find a value.")
}
}
s2, _ := btree.New(i)
for j := testnum / 10; j >= 0; j-- {
s2.Insert(btree.Int(j))
}
for j := testnum / 10; j >= 0; j-- {
if s2.Find(btree.Int(j)) == false {
panic("Cant find a value.")
}
}
}
}
func BenchmarkInsert() {
order := 100
p, _ := btree.New(order)
fmt.Println("Measuring performance. Order is ", order, ", iteration count is ", perfnum, ":") // (1 million inserts in C++ version with ints only takes 0.1 secs if order is 100.)
tim := time.Now()
for i := 0; i < perfnum; i++ {
p.Insert(btree.Int(i))
}
fmt.Println("Took ", time.Since(tim))
fmt.Println("Measuring find of every value:")
tim = time.Now()
for i := 0; i < perfnum; i++ {
p.Find(btree.Int(i))
}
fmt.Println("Took ", time.Since(tim))
}
func TestBtree() {
order := 100
// Small order test
a, _ := btree.New(order)
for i := 0; i < testnum; i++ {
a.Insert(btree.Int(i))
}
for i := 0; i < testnum; i++ {
if a.Find(btree.Int(i)) == false {
fmt.Println(i)
panic("Cant find value.")
}
}
//arr := a.GetAll()
//leafTest(a, arr)
b, _ := btree.New(order)
for i := testnum; i > 0; i-- {
b.Insert(btree.Int(i))
}
for i := testnum; i > 0; i-- {
if b.Find(btree.Int(i)) == false {
fmt.Println(i)
panic("Cant find value.")
}
}
//leafTest(b, arr)
if a.TreeSize() != testnum {
panic("Tree \"a\" size is not correct.")
}
if b.TreeSize() != testnum {
panic("Tree \"b\" size is not correct.")
}
u, _ := btree.New(order)
for i := 0; i < testnum; i++ {
u.Insert(btree.Int(i % 2))
}
for i := 0; i < 2; i++ {
if u.Find(btree.Int(i)) == false {
panic("Cant find value at unique test.")
}
}
fmt.Println("Insert duplicates, then delete all of them and cry if any not found...")
for ord := 5; ord < 43; ord++ {
dup_inc, _ := btree.New(ord)
dup_dec, _ := btree.New(ord)
for mod := 2; mod < 47; mod++ {
for k := 0; k <= testnum/5; k++ {
dup_inc.Insert(btree.Int(k % mod))
}
for k := 0; k <= testnum/5; k++ {
if dup_inc.Delete(btree.Int(k%mod)) == false {
panic("Dupe test failed.")
}
}
for k := testnum / 5; k >= 0; k-- {
dup_dec.Insert(btree.Int(k % mod))
}
for k := testnum / 5; k >= 0; k-- {
if dup_dec.Delete(btree.Int(k%mod)) == false {
panic("Dupe test failed.")
}
}
}
}
fmt.Println("Doing some slightly controlled stress test.")
for ord := 5; ord <= 31; ord++ {
m := make(map[int]int)
tes, _ := btree.New(5)
deletion_count := 0
for i := 0; i <= tnum*200; i++ {
c := rand.Int() % (tnum * 15)
v, ok := m[c]
if ok != tes.Find(btree.Int(c)) {
fmt.Println(v, ok)
panic("Deviation from map.")
}
if ok == true {
m[c]++
} else {
m[c] = 1
}
tes.Insert(btree.Int(c))
c = rand.Int() % (tnum * 15)
v, ok = m[c]
if ok != tes.Find(btree.Int(c)) {
panic("Bad.")
}
if ok == true {
if v == 1 {
delete(m, c)
} else {
m[c]--
}
if tes.Delete(btree.Int(c)) == false {
panic("Cant find value.")
}
deletion_count++
}
}
fmt.Println(" Ran with order ", ord, " deleted ", deletion_count)
}
fmt.Println("Test ran successfully.")
}
