.

all_test.go

@@ -216,7 +216,10 @@ loop:
 		case *d:
 			switch op {
 			case opGet:
-				panic("TODO")
+				// tried to search for key > max k in x
+				if !ok && i >= x.c {
+					i = x.c - 1
+				}
 
 			case opSet:
 				if !ok {

btree.go

@@ -862,6 +862,10 @@ func (t *Tree) Put(k interface{} /*K*/, upd func(oldV interface{} /*V*/, exists
 				t.insert(dd, i, k, newV)
 			} else {
 				t.hitDi = i
+				// if it was only Get landed past max key - adjust it to valid entry
+				if t.hitDi >= dd.c {
+					t.hitDi--
+				}
 			}
 			return
 
@@ -881,6 +885,10 @@ func (t *Tree) Put(k interface{} /*K*/, upd func(oldV interface{} /*V*/, exists
 				t.overflow(p, dd, pi, i, k, newV)
 			} else {
 				t.hitDi = i
+				// see about "valid entry" ^^^
+				if t.hitDi >= dd.c {
+					t.hitDi--
+				}
 			}
 			return
 		}
@@ -937,6 +945,10 @@ func (t *Tree) Put(k interface{} /*K*/, upd func(oldV interface{} /*V*/, exists
 
 				if !written {
 					t.hitD, t.hitDi = x, i
+					// see about "valid entry" ^^^
+					if t.hitDi >= x.c {
+						t.hitDi--
+					}
 					break
 				}