From 40ea83a25137cdef045817be909fdfb28aafdda0 Mon Sep 17 00:00:00 2001 From: Alex Gaetano Padula Date: Tue, 27 Aug 2024 05:42:36 -0400 Subject: [PATCH] package clean up --- btree.go | 1 + btree_test.go | 4 ---- 2 files changed, 1 insertion(+), 4 deletions(-) diff --git a/btree.go b/btree.go index 02ad32c..ba04ce0 100644 --- a/btree.go +++ b/btree.go @@ -1004,6 +1004,7 @@ func (b *BTree) rangeKeys(start, end []byte, x *Node) ([]interface{}, error) { return keys, nil } +// removeNilFromKeys removes nil keys from a slice of keys func removeNilFromKeys(keys []*Key) []*Key { newKeys := make([]*Key, 0) for _, key := range keys { diff --git a/btree_test.go b/btree_test.go index 03a3bdd..7b97be4 100644 --- a/btree_test.go +++ b/btree_test.go @@ -18,7 +18,6 @@ package btree import ( "fmt" - "log" "os" "strconv" "testing" @@ -126,9 +125,6 @@ func TestBTree_Delete(t *testing.T) { if err != nil { t.Fatal(err) } - - log.Println("Deleted key", i) - key, err := btree.Get([]byte(strconv.Itoa(i))) if key != nil { t.Fatalf("expected key to be nil")