MCPcopy Create free account

hub / github.com/arafatkatze/DataViz / functions

Functions773 in github.com/arafatkatze/DataViz

↓ 1 callersMethodRightKey
RightKey returns the right-most (max) key or nil if tree is empty.
trees/btree/btree.go:253
↓ 1 callersMethodRightValue
RightValue returns the right-most value or nil if tree is empty.
trees/btree/btree.go:261
↓ 1 callersMethodSize
Size returns number of elements within the heap.
trees/binaryheap/binaryheap.go:88
↓ 1 callersMethodString
String returns a string representation of container
trees/avltree/avltree.go:189
↓ 1 callersMethodString
String returns a string representation of container
trees/redblacktree/redblacktree.go:262
↓ 1 callersFunctionStringComparator
StringComparator provides a fast comparison on strings
utils/comparator.go:15
↓ 1 callersFunctionTimeComparator
TimeComparator provides a basic comparison on time.Time
utils/comparator.go:235
↓ 1 callersMethodValues
Values returns all values in-order based on the key.
trees/redblacktree/redblacktree.go:166
↓ 1 callersMethodappendChildren
(fromNode *Node, toNode *Node)
trees/btree/btree.go:636
↓ 1 callersMethodbubbleDown
Performs the "bubble down" operation. This is to place the element that is at the root of the heap in its correct place so that the heap maintains the
trees/binaryheap/binaryheap.go:115
↓ 1 callersMethodbubbleUp
Performs the "bubble up" operation. This is to place a newly inserted element (i.e. last element in the list) in its correct place so that the heap ma
trees/binaryheap/binaryheap.go:174
↓ 1 callersMethoddelete
delete deletes an entry in node at entries' index ref.: https://en.wikipedia.org/wiki/B-tree#Deletion
trees/btree/btree.go:538
↓ 1 callersMethoddeleteCase2
(node *Node)
trees/redblacktree/redblacktree.go:497
↓ 1 callersMethoddeleteCase3
(node *Node)
trees/redblacktree/redblacktree.go:511
↓ 1 callersMethoddeleteCase4
(node *Node)
trees/redblacktree/redblacktree.go:524
↓ 1 callersMethoddeleteCase5
(node *Node)
trees/redblacktree/redblacktree.go:537
↓ 1 callersMethoddeleteCase6
(node *Node)
trees/redblacktree/redblacktree.go:557
↓ 1 callersMethodheight
()
trees/btree/btree.go:297
↓ 1 callersMethodinsertCase2
(node *Node)
trees/redblacktree/redblacktree.go:438
↓ 1 callersMethodinsertCase3
(node *Node)
trees/redblacktree/redblacktree.go:445
↓ 1 callersMethodinsertCase4
(node *Node)
trees/redblacktree/redblacktree.go:457
↓ 1 callersMethodinsertCase5
(node *Node)
trees/redblacktree/redblacktree.go:469
↓ 1 callersMethodinsertIntoInternal
(node *Node, entry *Entry)
trees/btree/btree.go:398
↓ 1 callersMethodinsertIntoLeaf
(node *Node, entry *Entry)
trees/btree/btree.go:384
↓ 1 callersMethodleft
(node *Node)
trees/btree/btree.go:484
↓ 1 callersMethodleftSibling
leftSibling returns the node's left sibling and child index (in parent) if it exists, otherwise (nil,-1) key is any of keys in node (could even be del
trees/btree/btree.go:512
↓ 1 callersMethodmaxChildren
()
trees/btree/btree.go:320
↓ 1 callersMethodmaximumNode
()
trees/redblacktree/redblacktree.go:480
↓ 1 callersFunctionmin
(x, y int)
trees/btree/btree.go:138
↓ 1 callersMethodminChildren
()
trees/btree/btree.go:324
↓ 1 callersFunctionoutput
(node *Node, prefix string, isTail bool, str *string)
trees/avltree/avltree.go:474
↓ 1 callersFunctionoutput
(node *Node, prefix string, isTail bool, str *string)
trees/redblacktree/redblacktree.go:274
↓ 1 callersMethodoutput
(buffer *bytes.Buffer, node *Node, level int, isTail bool)
trees/btree/btree.go:283
↓ 1 callersMethodprependChildren
(fromNode *Node, toNode *Node)
trees/btree/btree.go:630
↓ 1 callersMethodput
(key interface{}, value interface{}, p *Node, qp **Node)
trees/avltree/avltree.go:254
↓ 1 callersFunctionputFix
(c int8, t **Node)
trees/avltree/avltree.go:337
↓ 1 callersMethodremove
(key interface{}, qp **Node)
trees/avltree/avltree.go:283
↓ 1 callersFunctionremoveMin
(qp **Node, minKey *interface{}, minVal *interface{})
trees/avltree/avltree.go:319
↓ 1 callersMethodrightSibling
rightSibling returns the node's right sibling and child index (in parent) if it exists, otherwise (nil,-1) key is any of keys in node (could even be d
trees/btree/btree.go:525
↓ 1 callersMethodshouldSplit
(node *Node)
trees/btree/btree.go:316
↓ 1 callersMethodshrink
Shrink the array if necessary, i.e. when size is shrinkFactor percent of current capacity
lists/arraylist/arraylist.go:215
↓ 1 callersMethodsplitNonRoot
(node *Node)
trees/btree/btree.go:420
↓ 1 callersMethodsplitRoot
()
trees/btree/btree.go:453
↓ 1 callersMethoduncle
()
trees/redblacktree/redblacktree.go:376
↓ 1 callersFunctionvisHelperMap
(node *Node, KeyChildLeft *map[int]int, KeyChildRight *map[int]int, KeyIntMap map[interface{}]int)
trees/avltree/avltree.go:238
MethodAll
All passes each element of the container to the given function and returns true if the function returns true for all elements.
maps/treemap/enumerable.go:58
MethodAll
All passes each element of the container to the given function and returns true if the function returns true for all elements.
containers/enumerable.go:23
MethodAll
All passes each element of the container to the given function and returns true if the function returns true for all elements.
lists/doublylinkedlist/enumerable.go:54
MethodAll
All passes each element of the collection to the given function and returns true if the function returns true for all elements.
lists/arraylist/enumerable.go:54
MethodAll
All passes each element of the container to the given function and returns true if the function returns true for all elements.
lists/singlylinkedlist/enumerable.go:58
MethodAny
Any passes each element of the container to the given function and returns true if the function ever returns true for any element.
maps/treemap/enumerable.go:46
MethodAny
Map invokes the given function once for each element and returns a container containing the values returned by the given function. TODO would apprecia
containers/enumerable.go:19
MethodAny
Any passes each element of the container to the given function and returns true if the function ever returns true for any element.
lists/doublylinkedlist/enumerable.go:42
MethodAny
Any passes each element of the collection to the given function and returns true if the function ever returns true for any element.
lists/arraylist/enumerable.go:42
MethodAny
Any passes each element of the container to the given function and returns true if the function ever returns true for any element.
lists/singlylinkedlist/enumerable.go:46
MethodAppend
Append appends a value (one or more) at the end of the list (same as Add())
lists/doublylinkedlist/doublylinkedlist.go:54
MethodAppend
Append appends a value (one or more) at the end of the list (same as Add())
lists/singlylinkedlist/singlylinkedlist.go:52
MethodBegin
Begin resets the iterator to its initial state (one-before-first) Call Next() to fetch the first element if any.
maps/treemap/iterator.go:51
MethodBegin
Begin resets the iterator to its initial state (one-before-first) Call Next() to fetch the first element if any.
containers/iterator.go:21
FunctionBenchmarkAVLTreeGet100
(b *testing.B)
trees/avltree/avltree_test.go:611
FunctionBenchmarkAVLTreeGet1000
(b *testing.B)
trees/avltree/avltree_test.go:622
FunctionBenchmarkAVLTreeGet10000
(b *testing.B)
trees/avltree/avltree_test.go:633
FunctionBenchmarkAVLTreeGet100000
(b *testing.B)
trees/avltree/avltree_test.go:644
FunctionBenchmarkAVLTreePut100
(b *testing.B)
trees/avltree/avltree_test.go:655
FunctionBenchmarkAVLTreePut1000
(b *testing.B)
trees/avltree/avltree_test.go:663
FunctionBenchmarkAVLTreePut10000
(b *testing.B)
trees/avltree/avltree_test.go:674
FunctionBenchmarkAVLTreePut100000
(b *testing.B)
trees/avltree/avltree_test.go:685
FunctionBenchmarkAVLTreeRemove100
(b *testing.B)
trees/avltree/avltree_test.go:696
FunctionBenchmarkAVLTreeRemove1000
(b *testing.B)
trees/avltree/avltree_test.go:707
FunctionBenchmarkAVLTreeRemove10000
(b *testing.B)
trees/avltree/avltree_test.go:718
FunctionBenchmarkAVLTreeRemove100000
(b *testing.B)
trees/avltree/avltree_test.go:729
FunctionBenchmarkArrayListAdd100
(b *testing.B)
lists/arraylist/arraylist_test.go:547
FunctionBenchmarkArrayListAdd1000
(b *testing.B)
lists/arraylist/arraylist_test.go:555
FunctionBenchmarkArrayListAdd10000
(b *testing.B)
lists/arraylist/arraylist_test.go:566
FunctionBenchmarkArrayListAdd100000
(b *testing.B)
lists/arraylist/arraylist_test.go:577
FunctionBenchmarkArrayListGet100
(b *testing.B)
lists/arraylist/arraylist_test.go:503
FunctionBenchmarkArrayListGet1000
(b *testing.B)
lists/arraylist/arraylist_test.go:514
FunctionBenchmarkArrayListGet10000
(b *testing.B)
lists/arraylist/arraylist_test.go:525
FunctionBenchmarkArrayListGet100000
(b *testing.B)
lists/arraylist/arraylist_test.go:536
FunctionBenchmarkArrayListRemove100
(b *testing.B)
lists/arraylist/arraylist_test.go:588
FunctionBenchmarkArrayListRemove1000
(b *testing.B)
lists/arraylist/arraylist_test.go:599
FunctionBenchmarkArrayListRemove10000
(b *testing.B)
lists/arraylist/arraylist_test.go:610
FunctionBenchmarkArrayListRemove100000
(b *testing.B)
lists/arraylist/arraylist_test.go:621
FunctionBenchmarkArrayStackPop100
(b *testing.B)
stacks/arraystack/arraystack_test.go:275
FunctionBenchmarkArrayStackPop1000
(b *testing.B)
stacks/arraystack/arraystack_test.go:286
FunctionBenchmarkArrayStackPop10000
(b *testing.B)
stacks/arraystack/arraystack_test.go:297
FunctionBenchmarkArrayStackPop100000
(b *testing.B)
stacks/arraystack/arraystack_test.go:308
FunctionBenchmarkArrayStackPush100
(b *testing.B)
stacks/arraystack/arraystack_test.go:319
FunctionBenchmarkArrayStackPush1000
(b *testing.B)
stacks/arraystack/arraystack_test.go:327
FunctionBenchmarkArrayStackPush10000
(b *testing.B)
stacks/arraystack/arraystack_test.go:338
FunctionBenchmarkArrayStackPush100000
(b *testing.B)
stacks/arraystack/arraystack_test.go:349
FunctionBenchmarkBTreeGet100
(b *testing.B)
trees/btree/btree_test.go:1128
FunctionBenchmarkBTreeGet1000
(b *testing.B)
trees/btree/btree_test.go:1139
FunctionBenchmarkBTreeGet10000
(b *testing.B)
trees/btree/btree_test.go:1150
FunctionBenchmarkBTreeGet100000
(b *testing.B)
trees/btree/btree_test.go:1161
FunctionBenchmarkBTreePut100
(b *testing.B)
trees/btree/btree_test.go:1172
FunctionBenchmarkBTreePut1000
(b *testing.B)
trees/btree/btree_test.go:1180
FunctionBenchmarkBTreePut10000
(b *testing.B)
trees/btree/btree_test.go:1191
FunctionBenchmarkBTreePut100000
(b *testing.B)
trees/btree/btree_test.go:1202
FunctionBenchmarkBTreeRemove100
(b *testing.B)
trees/btree/btree_test.go:1213
← previousnext →201–300 of 773, ranked by callers