Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/arafatkatze/DataViz
/ functions
Functions
773 in github.com/arafatkatze/DataViz
⨍
Functions
773
◇
Types & classes
47
↓ 1 callers
Method
RightKey
RightKey returns the right-most (max) key or nil if tree is empty.
trees/btree/btree.go:253
↓ 1 callers
Method
RightValue
RightValue returns the right-most value or nil if tree is empty.
trees/btree/btree.go:261
↓ 1 callers
Method
Size
Size returns number of elements within the heap.
trees/binaryheap/binaryheap.go:88
↓ 1 callers
Method
String
String returns a string representation of container
trees/avltree/avltree.go:189
↓ 1 callers
Method
String
String returns a string representation of container
trees/redblacktree/redblacktree.go:262
↓ 1 callers
Function
StringComparator
StringComparator provides a fast comparison on strings
utils/comparator.go:15
↓ 1 callers
Function
TimeComparator
TimeComparator provides a basic comparison on time.Time
utils/comparator.go:235
↓ 1 callers
Method
Values
Values returns all values in-order based on the key.
trees/redblacktree/redblacktree.go:166
↓ 1 callers
Method
appendChildren
(fromNode *Node, toNode *Node)
trees/btree/btree.go:636
↓ 1 callers
Method
bubbleDown
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 callers
Method
bubbleUp
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 callers
Method
delete
delete deletes an entry in node at entries' index ref.: https://en.wikipedia.org/wiki/B-tree#Deletion
trees/btree/btree.go:538
↓ 1 callers
Method
deleteCase2
(node *Node)
trees/redblacktree/redblacktree.go:497
↓ 1 callers
Method
deleteCase3
(node *Node)
trees/redblacktree/redblacktree.go:511
↓ 1 callers
Method
deleteCase4
(node *Node)
trees/redblacktree/redblacktree.go:524
↓ 1 callers
Method
deleteCase5
(node *Node)
trees/redblacktree/redblacktree.go:537
↓ 1 callers
Method
deleteCase6
(node *Node)
trees/redblacktree/redblacktree.go:557
↓ 1 callers
Method
height
()
trees/btree/btree.go:297
↓ 1 callers
Method
insertCase2
(node *Node)
trees/redblacktree/redblacktree.go:438
↓ 1 callers
Method
insertCase3
(node *Node)
trees/redblacktree/redblacktree.go:445
↓ 1 callers
Method
insertCase4
(node *Node)
trees/redblacktree/redblacktree.go:457
↓ 1 callers
Method
insertCase5
(node *Node)
trees/redblacktree/redblacktree.go:469
↓ 1 callers
Method
insertIntoInternal
(node *Node, entry *Entry)
trees/btree/btree.go:398
↓ 1 callers
Method
insertIntoLeaf
(node *Node, entry *Entry)
trees/btree/btree.go:384
↓ 1 callers
Method
left
(node *Node)
trees/btree/btree.go:484
↓ 1 callers
Method
leftSibling
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 callers
Method
maxChildren
()
trees/btree/btree.go:320
↓ 1 callers
Method
maximumNode
()
trees/redblacktree/redblacktree.go:480
↓ 1 callers
Function
min
(x, y int)
trees/btree/btree.go:138
↓ 1 callers
Method
minChildren
()
trees/btree/btree.go:324
↓ 1 callers
Function
output
(node *Node, prefix string, isTail bool, str *string)
trees/avltree/avltree.go:474
↓ 1 callers
Function
output
(node *Node, prefix string, isTail bool, str *string)
trees/redblacktree/redblacktree.go:274
↓ 1 callers
Method
output
(buffer *bytes.Buffer, node *Node, level int, isTail bool)
trees/btree/btree.go:283
↓ 1 callers
Method
prependChildren
(fromNode *Node, toNode *Node)
trees/btree/btree.go:630
↓ 1 callers
Method
put
(key interface{}, value interface{}, p *Node, qp **Node)
trees/avltree/avltree.go:254
↓ 1 callers
Function
putFix
(c int8, t **Node)
trees/avltree/avltree.go:337
↓ 1 callers
Method
remove
(key interface{}, qp **Node)
trees/avltree/avltree.go:283
↓ 1 callers
Function
removeMin
(qp **Node, minKey *interface{}, minVal *interface{})
trees/avltree/avltree.go:319
↓ 1 callers
Method
rightSibling
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 callers
Method
shouldSplit
(node *Node)
trees/btree/btree.go:316
↓ 1 callers
Method
shrink
Shrink the array if necessary, i.e. when size is shrinkFactor percent of current capacity
lists/arraylist/arraylist.go:215
↓ 1 callers
Method
splitNonRoot
(node *Node)
trees/btree/btree.go:420
↓ 1 callers
Method
splitRoot
()
trees/btree/btree.go:453
↓ 1 callers
Method
uncle
()
trees/redblacktree/redblacktree.go:376
↓ 1 callers
Function
visHelperMap
(node *Node, KeyChildLeft *map[int]int, KeyChildRight *map[int]int, KeyIntMap map[interface{}]int)
trees/avltree/avltree.go:238
Method
All
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
Method
All
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
Method
All
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
Method
All
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
Method
All
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
Method
Any
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
Method
Any
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
Method
Any
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
Method
Any
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
Method
Any
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
Method
Append
Append appends a value (one or more) at the end of the list (same as Add())
lists/doublylinkedlist/doublylinkedlist.go:54
Method
Append
Append appends a value (one or more) at the end of the list (same as Add())
lists/singlylinkedlist/singlylinkedlist.go:52
Method
Begin
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
Method
Begin
Begin resets the iterator to its initial state (one-before-first) Call Next() to fetch the first element if any.
containers/iterator.go:21
Function
BenchmarkAVLTreeGet100
(b *testing.B)
trees/avltree/avltree_test.go:611
Function
BenchmarkAVLTreeGet1000
(b *testing.B)
trees/avltree/avltree_test.go:622
Function
BenchmarkAVLTreeGet10000
(b *testing.B)
trees/avltree/avltree_test.go:633
Function
BenchmarkAVLTreeGet100000
(b *testing.B)
trees/avltree/avltree_test.go:644
Function
BenchmarkAVLTreePut100
(b *testing.B)
trees/avltree/avltree_test.go:655
Function
BenchmarkAVLTreePut1000
(b *testing.B)
trees/avltree/avltree_test.go:663
Function
BenchmarkAVLTreePut10000
(b *testing.B)
trees/avltree/avltree_test.go:674
Function
BenchmarkAVLTreePut100000
(b *testing.B)
trees/avltree/avltree_test.go:685
Function
BenchmarkAVLTreeRemove100
(b *testing.B)
trees/avltree/avltree_test.go:696
Function
BenchmarkAVLTreeRemove1000
(b *testing.B)
trees/avltree/avltree_test.go:707
Function
BenchmarkAVLTreeRemove10000
(b *testing.B)
trees/avltree/avltree_test.go:718
Function
BenchmarkAVLTreeRemove100000
(b *testing.B)
trees/avltree/avltree_test.go:729
Function
BenchmarkArrayListAdd100
(b *testing.B)
lists/arraylist/arraylist_test.go:547
Function
BenchmarkArrayListAdd1000
(b *testing.B)
lists/arraylist/arraylist_test.go:555
Function
BenchmarkArrayListAdd10000
(b *testing.B)
lists/arraylist/arraylist_test.go:566
Function
BenchmarkArrayListAdd100000
(b *testing.B)
lists/arraylist/arraylist_test.go:577
Function
BenchmarkArrayListGet100
(b *testing.B)
lists/arraylist/arraylist_test.go:503
Function
BenchmarkArrayListGet1000
(b *testing.B)
lists/arraylist/arraylist_test.go:514
Function
BenchmarkArrayListGet10000
(b *testing.B)
lists/arraylist/arraylist_test.go:525
Function
BenchmarkArrayListGet100000
(b *testing.B)
lists/arraylist/arraylist_test.go:536
Function
BenchmarkArrayListRemove100
(b *testing.B)
lists/arraylist/arraylist_test.go:588
Function
BenchmarkArrayListRemove1000
(b *testing.B)
lists/arraylist/arraylist_test.go:599
Function
BenchmarkArrayListRemove10000
(b *testing.B)
lists/arraylist/arraylist_test.go:610
Function
BenchmarkArrayListRemove100000
(b *testing.B)
lists/arraylist/arraylist_test.go:621
Function
BenchmarkArrayStackPop100
(b *testing.B)
stacks/arraystack/arraystack_test.go:275
Function
BenchmarkArrayStackPop1000
(b *testing.B)
stacks/arraystack/arraystack_test.go:286
Function
BenchmarkArrayStackPop10000
(b *testing.B)
stacks/arraystack/arraystack_test.go:297
Function
BenchmarkArrayStackPop100000
(b *testing.B)
stacks/arraystack/arraystack_test.go:308
Function
BenchmarkArrayStackPush100
(b *testing.B)
stacks/arraystack/arraystack_test.go:319
Function
BenchmarkArrayStackPush1000
(b *testing.B)
stacks/arraystack/arraystack_test.go:327
Function
BenchmarkArrayStackPush10000
(b *testing.B)
stacks/arraystack/arraystack_test.go:338
Function
BenchmarkArrayStackPush100000
(b *testing.B)
stacks/arraystack/arraystack_test.go:349
Function
BenchmarkBTreeGet100
(b *testing.B)
trees/btree/btree_test.go:1128
Function
BenchmarkBTreeGet1000
(b *testing.B)
trees/btree/btree_test.go:1139
Function
BenchmarkBTreeGet10000
(b *testing.B)
trees/btree/btree_test.go:1150
Function
BenchmarkBTreeGet100000
(b *testing.B)
trees/btree/btree_test.go:1161
Function
BenchmarkBTreePut100
(b *testing.B)
trees/btree/btree_test.go:1172
Function
BenchmarkBTreePut1000
(b *testing.B)
trees/btree/btree_test.go:1180
Function
BenchmarkBTreePut10000
(b *testing.B)
trees/btree/btree_test.go:1191
Function
BenchmarkBTreePut100000
(b *testing.B)
trees/btree/btree_test.go:1202
Function
BenchmarkBTreeRemove100
(b *testing.B)
trees/btree/btree_test.go:1213
← previous
next →
201–300 of 773, ranked by callers