.

all_test.go

@@ -27,7 +27,7 @@ var caller = func(s string, va ...interface{}) {
 }
 
 func dbg(s string, va ...interface{}) {
-	return
+	//return
 	if s == "" {
 		s = strings.Repeat("%v ", len(va))
 	}
@@ -223,11 +223,11 @@ func TestSetGet0(t *testing.T) {
 }
 
 func TestSetGet1(t *testing.T) {
-	//const N = 40000
+	const N = 40000
 	//const N = 21
-	const N = 41
-	//for _, x := range []int{0, -1, 0x555555, 0xaaaaaa, 0x333333, 0xcccccc, 0x314159} {
-	for _, x := range []int{0x314159} {
+	//const N = 41
+	for _, x := range []int{0, -1, 0x555555, 0xaaaaaa, 0x333333, 0xcccccc, 0x314159} {
+	//for _, x := range []int{0x314159} {
 	//for _, x := range []int{0} {
 		r := TreeNew(cmp)
 		set := r.Set
@@ -235,7 +235,7 @@ func TestSetGet1(t *testing.T) {
 		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

@@ -641,30 +641,30 @@ 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/%v), %v @%d)\n%s", k, v, t.hit, t.hitIdx, t.hitMinKMInf, t.hitMinK, 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/%v), %v @%d)\n%s", k, v, t.hit, t.hitIdx, t.hitMinKMInf, t.hitMinK, 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)
 	if i >= 0 {
-		dbg("hit found\t-> %d, %v", i, ok)
+		//dbg("hit found\t-> %d, %v", i, ok)
 		//dd, p, pi := t.hit, t.hitP, t.hitPi
 		dd := t.hit
 
 		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
 
@@ -733,7 +733,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
@@ -743,7 +743,7 @@ 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.hitMinK = minK
@@ -752,7 +752,7 @@ func (t *Tree) Set(k interface{} /*K*/, v interface{} /*V*/) {
 				t.hitMaxKInf = maxKInf
 
 			default:
-				dbg("overflow")
+				//dbg("overflow")
 				t.overflow(p, x, pi, i, k, v)
 				t.hitMinK = minK
 				t.hitMinKMInf = minKMInf