MCPcopy Index your code

hub / github.com/amit-davidson/btree / functions

Functions50 in github.com/amit-davidson/btree

⨍ Functions 50◇ Types & classes 3
↓ 180 callersFunctionNewEmptyNode
()
btree.go:159
↓ 179 callersMethodaddItems
(keys ...string)
btree_test.go:61
↓ 148 callersMethodaddChildNode
(child *Node)
btree_test.go:14
↓ 31 callersFunctionnewTreeWithRoot
(root *Node, minItems int)
btree.go:29
↓ 19 callersFunctionareTreesEqual
(t *testing.T, t1, t2 *Tree)
btree_test.go:20
↓ 14 callersMethodRemove
Remove removes a key from the tree. It finds the correct node and the index to remove the item from and removes it. When performing the search, the an
btree.go:78
↓ 8 callersMethodPut
Put adds a key to the tree. It finds the correct node and the insertion index and adds the item. When performing the search, the ancestors are returne
btree.go:47
↓ 8 callersMethodisLeaf
()
btree.go:182
↓ 6 callersMethodFind
Find Returns an item according based on the given key by performing a binary search.
btree.go:105
↓ 6 callersFunctionNewTree
(minItems int)
btree.go:39
↓ 4 callersFunctionnewItem
(key string, value interface{})
btree.go:22
↓ 3 callersFunctionNewNode
(bucket *Tree, value []*Item, childNodes []*Node)
btree.go:166
↓ 3 callersMethodfindKey
findKey finds the node with the key, it's index in the parent's items and a list of its ancestors (not including the node itself). The parent's items
btree.go:118
↓ 3 callersMethodisOverPopulated
()
btree.go:186
↓ 2 callersMethodaddItem
addItem adds an item at a given position. If the item is in the end, then the list is appended. Otherwise, the list is shifted and the item is inserte
btree.go:211
↓ 2 callersFunctioncreateTestMockTree
()
btree_test.go:42
↓ 2 callersMethodgetNodes
getNodes returns a list of nodes based on their indexes (the breadcrumbs) from the root p \ a b \ / \ c d e f For [0,1,0] -
btree.go:149
↓ 2 callersMethodsplit
split rebalances the tree after adding. After insertion the modified node has to be checked to make sure it didn't exceed the maximum number of elemen
btree.go:242
↓ 1 callersFunctionareNodesEqual
(t *testing.T, n1, n2 *Node)
btree_test.go:24
↓ 1 callersFunctionareTreesEqualHelper
(t *testing.T, n1, n2 *Node)
btree_test.go:31
↓ 1 callersFunctionisFirst
(index int)
btree.go:178
↓ 1 callersFunctionisLast
(index int, parentNode *Node)
btree.go:174
↓ 1 callersMethodisUnderPopulated
()
btree.go:190
↓ 1 callersFunctionmerge
(pNode *Node, unbalancedNodeIndex int)
btree.go:390
↓ 1 callersMethodrebalanceRemove
rebalanceRemove rebalances the tree after a remove operation. This can be either by rotating to the right, to the left or by merging. Firstly, the sib
btree.go:275
↓ 1 callersMethodremoveItemFromInternal
(index int)
btree.go:306
↓ 1 callersMethodremoveItemFromLeaf
(index int)
btree.go:302
↓ 1 callersFunctionrotateLeft
(aNode, pNode, bNode *Node, bNodeIndex int)
btree.go:360
↓ 1 callersFunctionrotateRight
(aNode, pNode, bNode *Node, bNodeIndex int)
btree.go:330
FunctionTest_BucketAddAndRebalanceSplit
(t *testing.T)
btree_test.go:108
FunctionTest_BucketAddMultiple
(t *testing.T)
btree_test.go:96
FunctionTest_BucketAddSingle
(t *testing.T)
btree_test.go:68
FunctionTest_BucketFindNode
(t *testing.T)
btree_test.go:757
FunctionTest_BucketRemoveFromInnerNodeAndRotateLeft
(t *testing.T)
btree_test.go:375
FunctionTest_BucketRemoveFromInnerNodeAndRotateRight
(t *testing.T)
btree_test.go:444
FunctionTest_BucketRemoveFromInnerNodeAndUnion
(t *testing.T)
btree_test.go:513
FunctionTest_BucketRemoveFromLeafAndRotateLeft
(t *testing.T)
btree_test.go:569
FunctionTest_BucketRemoveFromLeafAndRotateRight
(t *testing.T)
btree_test.go:635
FunctionTest_BucketRemoveFromLeafAndUnion
(t *testing.T)
btree_test.go:701
FunctionTest_BucketRemoveFromRootAndRebalanceMergeFromUnbalanced
Test_BucketRemoveFromRootAndRebalanceMergeFromUnbalanced tests when the unbalanced node is not the most left one so the merge has to happen from the u
btree_test.go:340
FunctionTest_BucketRemoveFromRootAndRebalanceMergeToUnbalanced
Test_BucketRemoveFromRootAndRebalanceMergeToUnbalanced tests when the unbalanced node is the most left one so the merge has to happen from the right n
btree_test.go:304
FunctionTest_BucketRemoveFromRootAndRotateLeft
(t *testing.T)
btree_test.go:226
FunctionTest_BucketRemoveFromRootAndRotateRight
(t *testing.T)
btree_test.go:264
FunctionTest_BucketRemoveFromRootSingleElement
(t *testing.T)
btree_test.go:79
FunctionTest_BucketRemoveFromRootWithoutRebalance
(t *testing.T)
btree_test.go:195
FunctionTest_BucketSplitAndMerge
(t *testing.T)
btree_test.go:143
FunctionTest_BucketUpdateNode
(t *testing.T)
btree_test.go:799
MethodaddChild
addChild adds a child at a given position. If the child is in the end, then the list is appended. Otherwise, the list is shifted and the child is inse
btree.go:224
MethodfindKey
findKey iterates all the items and finds the key. If the key is found, then the item is returned. If the key isn't found then it means we have to keep
btree.go:196
Functionmain
()
main.go:5