assert

pkg/bptree/bptree.go

@@ -274,6 +274,7 @@ func (t *BPTree) Insert(key pointer.ReferencedValue, value pointer.MemoryPointer
 		if err != nil {
 			return err
 		}
+
 		return t.MetaPage.SetRoot(pointer.MemoryPointer{Offset: uint64(offset), Length: uint32(len(buf))})
 	}
 

pkg/btree/btree.go

@@ -106,7 +106,7 @@ func (t *BTree) Insert(key pointer.ReferencedId, vector hnsw.Point) error {
 			return err
 		}
 
-		offset, err := t.PageFile.Write(buf)
+		offset, err := t.PageFile.NewPage(buf)
 		if err != nil {
 			return err
 		}

pkg/btree/btree_test.go

@@ -123,7 +123,7 @@ func TestBTree(t *testing.T) {
 			t.Fatal(err)
 		}
 		mp := newTestMetaPage(t, p)
-		tree := &BTree{PageFile: p, MetaPage: mp, Width: uint16(6)}
+		tree := &BTree{PageFile: p, MetaPage: mp, Width: uint16(6), VectorDim: 2}
 		if err := tree.Insert(pointer.ReferencedId{Value: 1}, hnsw.Point{2, 2}); err != nil {
 			t.Fatal(err)
 		}
@@ -193,3 +193,27 @@ func TestBTree(t *testing.T) {
 		}
 	})
 }
+
+func TestBTree_SequentialInsertionTest(t *testing.T) {
+	b := buftest.NewSeekableBuffer()
+	p, err := pagefile.NewPageFile(b)
+	if err != nil {
+		t.Fatal(err)
+	}
+	tree := &BTree{PageFile: p, MetaPage: newTestMetaPage(t, p), VectorDim: 2}
+	for i := 0; i < 256; i++ {
+		if err := tree.Insert(pointer.ReferencedId{Value: hnsw.Id(i)}, hnsw.Point{float32(i), float32(i)}); err != nil {
+			t.Fatal(err)
+		}
+	}
+
+	for i := 0; i < 256; i++ {
+		k, _, err := tree.Find(pointer.ReferencedId{Value: hnsw.Id(i)})
+		if err != nil {
+			t.Fatal(err)
+		}
+		if k.Value != hnsw.Id(i) {
+			t.Fatalf("expected to find key %d", i)
+		}
+	}
+}