Add main

Author: amit-davidson

btree.go

@@ -1,4 +1,6 @@
-package db
+package main
+
+var DefaultMinItems = 128
 
 type Item struct {
 	key   string
@@ -11,19 +13,19 @@ type Node struct {
 	childNodes []*Node
 }
 
+type Tree struct {
+	root *Node
+	minItems int
+	maxItems int
+}
+
 func newItem(key string, value interface{}) *Item {
 	return &Item{
 		key:   key,
 		value: value,
 	}
 }
 
-type Tree struct {
-	root *Node
-	minItems int
-	maxItems int
-}
-
 func newTreeWithRoot(root *Node, minItems int) *Tree {
 	bucket := &Tree{
 		root:    root,

btree_test.go

@@ -1,4 +1,4 @@
-package db
+package main
 
 import (
 	"github.com/stretchr/testify/require"
@@ -58,25 +58,6 @@ func createTestMockTree() *Tree {
 	return newTreeWithRoot(root, minItems)
 }
 
-func createTestMockTreeWithout7() *Tree {
-	root := NewEmptyNode()
-	root.addItems("2", "5")
-
-	child0 := NewEmptyNode()
-	child0.addItems("0", "1")
-	root.addChildNode(child0)
-
-	child1 := NewEmptyNode()
-	child1.addItems("3", "4")
-	root.addChildNode(child1)
-
-	child2 := NewEmptyNode()
-	child2.addItems("6", "8", "9")
-	root.addChildNode(child2)
-
-	return &Tree{root: root}
-}
-
 func (n *Node) addItems(keys ...string) *Node {
 	for _, key := range keys {
 		n.items = append(n.items, newItem(key, key))

main.go

@@ -0,0 +1,20 @@
+package main
+
+import "fmt"
+
+func main()  {
+	minimumItemsInNode := DefaultMinItems
+	tree := NewTree(minimumItemsInNode)
+	value := "0"
+	tree.Put(value, value)
+
+	retVal := tree.Find(value)
+	fmt.Printf("Returned value is key:%s value:%s \n", retVal.key, retVal.value)
+
+	tree.Remove(value)
+
+	retVal = tree.Find(value)
+	fmt.Print("Returned value is nil")
+}
+
+