How to use NewNode method of internal Package

...108		return err109	}110	if !opts.SkipPreFlight {111		util.PrintHeader(out, "Running Pre-Flight Checks On New Node", '=')112		if err = executor.RunNewNodePreFlightCheck(*plan, newNode); err != nil {113			return err114		}115	}116	updatedPlan, err := executor.AddNode(plan, newNode, opts.Roles, opts.RestartServices)117	if err != nil {118		return err119	}120	if err := planner.Write(updatedPlan); err != nil {121		return fmt.Errorf("error updating plan file to include the new node: %v", err)122	}123	return nil124}125// returns an error if the plan contains a node that is "equivalent"126// to the new node that is being added...

1package main2import (3	"fmt"4	"sort"5)6const MAX_KEYS = 27type NodeType int8const (9	LEAF NodeType = iota10	INTERNAL11)12type Node interface {13	Type() NodeType14	Parent() *InternalNode15	SetParent(node *InternalNode)16}17// ------------------------------------------------------------18// Leaf19type LeafNode struct {20	keys   []int21	parent *InternalNode22}23func (n *LeafNode) Type() NodeType {24	return LEAF25}26func NewLeafNode() *LeafNode {27	return &LeafNode{28		keys:   make([]int, 0, MAX_KEYS),29		parent: nil,30	}31}32func (n *LeafNode) Parent() *InternalNode {33	return n.parent34}35func (n *LeafNode) SetParent(parent *InternalNode) {36	n.parent = parent37}38type InternalNode struct {39	keys     []int40	children []Node41	parent   *InternalNode42}43func (n *InternalNode) Type() NodeType {44	return INTERNAL45}46func NewInternalNode() *InternalNode {47	return &InternalNode{48		keys:     make([]int, 0, MAX_KEYS),49		children: make([]Node, 0, MAX_KEYS+1),50	}51}52func (n *InternalNode) Parent() *InternalNode {53	return n.parent54}55func (n *InternalNode) SetParent(parent *InternalNode) {56	n.parent = parent57}58// ------------------------------------------------------------59type BTree struct {60	root Node61}62func NewBTree() *BTree {63	return &BTree{64		root: NewLeafNode(),65	}66}67func (tree *BTree) Insert(key int) {68	root := tree.root69	if root.Type() == LEAF {70		midKey, newNode := tree.insertIntoLeaf(root.(*LeafNode), key)71		if newNode != nil {72			newRoot := NewInternalNode()73			newRoot.keys = append(newRoot.keys, midKey)74			newRoot.children = append(newRoot.children, root)75			newRoot.children = append(newRoot.children, newNode)76			root.SetParent(newRoot)77			newNode.SetParent(newRoot)78			tree.root = newRoot79		}80	} else {81		tree.insertIntoInternal(root.(*InternalNode), key)82	}83}84func (tree *BTree) Print() {85	tree.printNode(tree.root)86}87func (tree *BTree) printNode(node Node) {88	if node.Type() == LEAF {89		tree.printLeaf(node.(*LeafNode))90	} else {91		tree.printInternal(node.(*InternalNode))92	}93}94func (tree *BTree) printInternal(node *InternalNode) {95	fmt.Printf("keys: %v\n", node.keys)96	for _, v := range node.children {97		if v != nil {98			tree.printNode(v)99		} else {100			fmt.Println("[nil]")101		}102	}103}104func (tree *BTree) printLeaf(node *LeafNode) {105	fmt.Printf("%v\n", node.keys)106}107func (tree *BTree) insertIntoLeaf(node *LeafNode, key int) (int, Node) {108	if len(node.keys) == MAX_KEYS {109		// TODO: split110		mid := len(node.keys) / 2111		midKey := node.keys[mid]112		newNode := NewLeafNode()113		newNode.keys = append(newNode.keys, node.keys[mid:]...)114		node.keys = node.keys[:mid]115		if key < midKey {116			tree.insertIntoLeaf(node, key)117		} else {118			tree.insertIntoLeaf(newNode, key)119		}120		return midKey, newNode121	} else {122		node.keys = append(node.keys, key)123		sort.Ints(node.keys)124		return 0, nil125	}126}127func (tree *BTree) insertIntoInternal(node *InternalNode, key int) {128	idx := findInChildren(node, key)129	for node.children[idx].Type() != LEAF {130		node = node.children[idx].(*InternalNode)131		idx = findInChildren(node, key)132	}133	midKey, newLeaf := tree.insertIntoLeaf(node.children[idx].(*LeafNode), key)134	if newLeaf != nil {135		tree.insertIntoParent(node, midKey, newLeaf)136	}137	// if newLeaf != nil {138	// 	newNode := NewInternalNode()139	// 	newNode.keys = append(newNode.keys, midKey)140	// 	newNode.children = append(newNode.children, node.children[idx])141	// 	newNode.children = append(newNode.children, newLeaf)142	// 	fmt.Printf("inserting %d newnode %v\n", midKey, newNode)143	// 	tree.insertIntoParent(node, midKey, newNode)144	// }145}146func (tree *BTree) insertIntoParent(node *InternalNode, key int, child Node) {147	if len(node.keys) == MAX_KEYS {148		// split149		mid := len(node.keys) / 2150		midKey := node.keys[mid]151		newNode := NewInternalNode()152		newNode.keys = append(newNode.keys, node.keys[mid:]...)153		newNode.children = append(newNode.children, nil)154		newNode.children = append(newNode.children, node.children[mid+1:]...)155		node.keys = node.keys[:mid]156		node.children = node.children[:mid+1]157		if key < midKey {158			tree.insertIntoParent(node, key, child)159		} else {160			tree.insertIntoParent(newNode, key, child)161		}162		if node == tree.root {163			newRoot := NewInternalNode()164			newRoot.keys = append(newRoot.keys, midKey)165			newRoot.children = append(newRoot.children, node)166			newRoot.children = append(newRoot.children, newNode)167			node.parent = newRoot168			tree.root = newRoot169		} else {170			tree.insertIntoParent(node.parent, midKey, newNode)171		}172	} else {173		i := 0174		for len(node.keys) > i && key > node.keys[i] {175			i++176		}177		node.keys = append(node.keys, 0)178		copy(node.keys[i+1:], node.keys[i:])179		node.keys[i] = key180		node.children = append(node.children, nil)181		copy(node.children[i+2:], node.children[i+1:])182		node.children[i+1] = child183		child.SetParent(node)184	}185}186// func insertIntoLeaf(node *LeafNode, key int) (int, Node) {187// 	if len(node.keys) == MAX_KEYS {188// 		// TODO: split189// 		mid := len(node.keys) / 2190// 		midKey := node.keys[mid]191// 		newNode := NewLeafNode()192// 		newNode.keys = append(newNode.keys, node.keys[mid:]...)193// 		node.keys = node.keys[:mid]194// 		if key < midKey {195// 			insertIntoLeaf(node, key)196// 		} else {197// 			insertIntoLeaf(newNode, key)198// 		}199// 		return midKey, newNode200// 	} else {201// 		node.keys = append(node.keys, key)202// 		sort.Ints(node.keys)203// 		return 0, nil204// 	}205// }206func findInChildren(subroot *InternalNode, key int) int {207	i := 0208	for len(subroot.keys) > i && key > subroot.keys[i] {209		i++210	}211	return i212}213func main() {214	tree := NewBTree()215	tree.Insert(5)216	tree.Insert(2)217	tree.Insert(3)218	tree.Insert(1)219	tree.Insert(4)220	tree.Insert(7)221	tree.Insert(8)222	tree.Print()223}...

1func main() {2    node := NewNode()3    fmt.Println(node)4}5func main() {6    node := internal.NewNode()7    fmt.Println(node)8}9func main() {10    node := internal/internal.NewNode()11    fmt.Println(node)12}

1func main() {2    n := NewNode("test")3    fmt.Println(n)4}5func main() {6    n := NewNode("test")7    fmt.Println(n)8}9func main() {10    n := NewNode("test")11    fmt.Println(n)12}13func main() {14    n := NewNode("test")15    fmt.Println(n)16}17func main() {18    n := NewNode("test")19    fmt.Println(n)20}21func main() {22    n := NewNode("test")23    fmt.Println(n)24}25func main() {26    n := NewNode("test")27    fmt.Println(n)28}29func main() {30    n := NewNode("test")31    fmt.Println(n)32}33func main() {34    n := NewNode("test")35    fmt.Println(n)36}37func main() {38    n := NewNode("test")39    fmt.Println(n)40}41func main() {42    n := NewNode("test")43    fmt.Println(n)44}45func main() {46    n := NewNode("test")47    fmt.Println(n)48}49func main() {50    n := NewNode("test")51    fmt.Println(n)52}53func main() {54    n := NewNode("test")55    fmt.Println(n)56}

1import (2func main() {3	n := internal.NewNode(1)4	fmt.Println(n)5}6type Node struct {7}8func NewNode(value int) *Node {9	return &Node{value}10}11type Node struct {12}13func NewNode(value int) *Node {14	return &Node{value}15}16import (17func main() {18	n := internal.NewNode(1)19	fmt.Println(n)20}21type Node struct {22}23func NewNode(value int) *Node {24	return &Node{value}25}26import (27func main() {28	n := internal.NewNode(

1import (2func main() {3    golconfig.ConfigInit("config.json")4    golhashmap.NewNode("key", "value")5    fmt.Println("key: " + golhashmap.GetNode("key"))6}7import (8func main() {9    golconfig.ConfigInit("config.json")10    golhashmap.NewNode("key", "value")11    fmt.Println("key: " + golhashmap.GetNode("key"))12}13import (14func main() {15    golconfig.ConfigInit("config.json")16    golhashmap.NewNode("key", "value")17    fmt.Println("key: " + golhashmap.GetNode("key"))18}19import (20func main() {21    golconfig.ConfigInit("config.json")22    golhashmap.NewNode("key", "value")23    fmt.Println("key: " + golhashmap.GetNode("key"))24}25import (26func main() {27    golconfig.ConfigInit("config.json")28    golhashmap.NewNode("key", "value")29    fmt.Println("key: " + golhashmap.GetNode("key"))30}

1func main() {2    node := internal.NewNode("abc")3    fmt.Println(node)4}5func main() {6    node := internal.NewNode("abc")7    fmt.Println(node)8}9type Node struct {10}11func NewNode(value string) *Node {12    return &Node{value: value}13}14func main() {15    node := internal.NewNode("abc")16    fmt.Println(node)17}18func main() {19    node := internal.NewNode("abc")20    fmt.Println(node)21}

1import (2func main() {3    a := internal.NewNode(1)4    fmt.Println(a)5}6&{1 <nil>}7import (8func main() {9    a := internal.NewNode(1)10    fmt.Println(a)11    b := internal.node{2, nil}12    fmt.Println(b)13}14import (15func main() {16    b := internal.node{2, nil}17    fmt.Println(b)18}