.

all_test.go

@@ -226,15 +226,15 @@ func TestSetGet1(t *testing.T) {
 	//const N = 21
 	const N = 41
 	//for _, x := range []int{0, -1, 0x555555, 0xaaaaaa, 0x333333, 0xcccccc, 0x314159} {
-	//for _, x := range []int{0x314159} {
-	for _, x := range []int{0} {
+	for _, x := range []int{0x314159} {
+	//for _, x := range []int{0} {
 		r := TreeNew(cmp)
 		set := r.Set
 		a := make([]int, N)
 		for i := range a {
 			a[i] = (i ^ x) << 1
 		}
-		dbg("", a)
+		//dbg("", a)
 		for i, k := range a {
 			set(k, k^x)
 			if g, e := r.Len(), i+1; g != e {

btree.go

@@ -634,13 +634,13 @@ func (t *Tree) SeekLast() (e *Enumerator, err error) {
 
 // Set sets the value associated with k.
 func (t *Tree) Set(k interface{} /*K*/, v interface{} /*V*/) {
-	dbg("--- PRE Set(%v, %v)\t(%v @%d, %v/%v, %v @%d)\n%s", k, v, t.hit, t.hitIdx, t.hitMaxKInf, t.hitMaxK, t.hitP, t.hitPi, t.dump())
-	defer func() {
-		//if r := recover(); r != nil {
-		//	panic(r)
-		//}
-		dbg("--- POST\n%s\n====\n", t.dump())
-	}()
+	//dbg("--- PRE Set(%v, %v)\t(%v @%d, %v/%v, %v @%d)\n%s", k, v, t.hit, t.hitIdx, t.hitMaxKInf, t.hitMaxK, t.hitP, t.hitPi, t.dump())
+	//defer func() {
+	//	//if r := recover(); r != nil {
+	//	//	panic(r)
+	//	//}
+	//	dbg("--- POST\n%s\n====\n", t.dump())
+	//}()
 
 	// check if we can do the update nearby previous change
 	i, ok := t.hitFind(k)
@@ -651,13 +651,13 @@ func (t *Tree) Set(k interface{} /*K*/, v interface{} /*V*/) {
 
 		switch {
 		case ok:
-			dbg("ok'")
+			//dbg("ok'")
 			dd.d[i].v = v
 			t.hitIdx = i
 			return
 
 		case dd.c < 2*kd:
-			dbg("insert'")
+			//dbg("insert'")
 			t.insert(dd, i, k, v)
 			return
 
@@ -716,7 +716,7 @@ func (t *Tree) Set(k interface{} /*K*/, v interface{} /*V*/) {
 			// data page found - perform the update
 			switch {
 			case ok:
-				dbg("ok")
+				//dbg("ok")
 				x.d[i].v = v
 				t.hit, t.hitIdx = x, i
 				t.hitP, t.hitPi = p, pi
@@ -724,14 +724,14 @@ func (t *Tree) Set(k interface{} /*K*/, v interface{} /*V*/) {
 				t.hitMaxKInf = maxKInf
 
 			case x.c < 2*kd:
-				dbg("insert")
+				//dbg("insert")
 				t.insert(x, i, k, v)
 				t.hitP, t.hitPi = p, pi
 				t.hitMaxK = maxK
 				t.hitMaxKInf = maxKInf
 
 			default:
-				dbg("overflow")
+				//dbg("overflow")
 				t.overflow(p, x, pi, i, k, v)
 				t.hitMaxK = maxK
 				t.hitMaxKInf = maxKInf