MCPcopy Create free account

hub / github.com/arafatkatze/DataViz / functions

Functions773 in github.com/arafatkatze/DataViz

⨍ Functions 773◇ Types & classes 47
↓ 4 callersFunctionbenchmarkRemove
(b *testing.B, tree *Tree, size int)
trees/btree/btree_test.go:1120
↓ 4 callersFunctionbenchmarkRemove
(b *testing.B, tree *Tree, size int)
trees/redblacktree/redblacktree_test.go:603
↓ 4 callersFunctionbenchmarkRemove
(b *testing.B, list *List, size int)
lists/doublylinkedlist/doublylinkedlist_test.go:494
↓ 4 callersFunctionbenchmarkRemove
(b *testing.B, list *List, size int)
lists/arraylist/arraylist_test.go:495
↓ 4 callersFunctionbenchmarkRemove
(b *testing.B, list *List, size int)
lists/singlylinkedlist/singlylinkedlist_test.go:417
↓ 4 callersMethoddeleteChild
(node *Node, index int)
trees/btree/btree.go:647
↓ 4 callersMethodgrandparent
()
trees/redblacktree/redblacktree.go:369
↓ 4 callersFunctionrotate
(c int8, s *Node)
trees/avltree/avltree.go:416
↓ 4 callersFunctionsameElements
(a []interface{}, b []interface{})
maps/treemap/treemap_test.go:117
↓ 3 callersMethodAdd
Add appends a value at the end of the list
lists/arraylist/arraylist.go:37
↓ 3 callersMethodCeiling
Ceiling finds ceiling node of the input key, return the ceiling node or nil if no ceiling is found. Second return parameter is true if ceiling was fou
trees/avltree/avltree.go:161
↓ 3 callersMethodCeiling
Ceiling finds ceiling node of the input key, return the ceiling node or nil if no ceiling is found. Second return parameter is true if ceiling was fou
trees/redblacktree/redblacktree.go:234
↓ 3 callersMethodClear
Clear removes all elements from the list.
lists/doublylinkedlist/doublylinkedlist.go:197
↓ 3 callersMethodClear
Clear removes all elements from the list.
lists/singlylinkedlist/singlylinkedlist.go:177
↓ 3 callersMethodFloor
Floor Finds floor node of the input key, return the floor node or nil if no ceiling is found. Second return parameter is true if floor was found, othe
trees/avltree/avltree.go:132
↓ 3 callersMethodFloor
Floor Finds floor node of the input key, return the floor node or nil if no ceiling is found. Second return parameter is true if floor was found, othe
trees/redblacktree/redblacktree.go:205
↓ 3 callersMethodValues
Values returns all elements in the list.
lists/doublylinkedlist/doublylinkedlist.go:165
↓ 3 callersMethodValues
Values returns all elements in the list.
lists/singlylinkedlist/singlylinkedlist.go:145
↓ 3 callersMethodminEntries
()
trees/btree/btree.go:332
↓ 3 callersFunctionremoveFix
(c int8, t **Node)
trees/avltree/avltree.go:358
↓ 3 callersMethodreplaceNode
(old *Node, new *Node)
trees/redblacktree/redblacktree.go:415
↓ 2 callersMethodBegin
Begin resets the iterator to its initial state (one-before-first) Call Next() to fetch the first element if any.
trees/btree/iterator.go:166
↓ 2 callersMethodCurrentNode
CurrentNode returns the current node of the iterator
trees/btree/iterator.go:148
↓ 2 callersMethodEnd
End moves the iterator past the last element (one-past-the-end). Call Prev() to fetch the last element if any.
trees/btree/iterator.go:174
↓ 2 callersFunctionGetSortedValues
GetSortedValues returns sorted container's elements with respect to the passed comparator. Does not effect the ordering of elements within the contain
containers/containers.go:24
↓ 2 callersMethodMap
Map invokes the given function once for each element and returns a container containing the values returned by the given function as key/value pairs.
maps/treemap/enumerable.go:22
↓ 2 callersMethodMap
Map invokes the given function once for each element and returns a container containing the values returned by the given function.
lists/doublylinkedlist/enumerable.go:19
↓ 2 callersMethodMap
Map invokes the given function once for each element and returns a container containing the values returned by the given function.
lists/arraylist/enumerable.go:19
↓ 2 callersMethodMap
Map invokes the given function once for each element and returns a container containing the values returned by the given function.
lists/singlylinkedlist/enumerable.go:23
↓ 2 callersFunctionNewWith
NewWith instantiates a B-tree with the order (maximum number of children) and a custom key comparator.
trees/btree/btree.go:54
↓ 2 callersMethodPut
Put inserts key-value pair into the map. Key should adhere to the comparator's type assertion, otherwise method panics.
maps/treemap/treemap.go:45
↓ 2 callersMethodSelect
Select returns a new container containing all elements for which the given function returns a true value.
maps/treemap/enumerable.go:33
↓ 2 callersMethodSelect
Select returns a new container containing all elements for which the given function returns a true value.
lists/doublylinkedlist/enumerable.go:29
↓ 2 callersMethodSelect
Select returns a new container containing all elements for which the given function returns a true value.
lists/arraylist/enumerable.go:29
↓ 2 callersMethodSelect
Select returns a new container containing all elements for which the given function returns a true value.
lists/singlylinkedlist/enumerable.go:33
↓ 2 callersMethodSize
()
containers/containers_test.go:20
↓ 2 callersMethodbottom
(d int)
trees/avltree/avltree.go:429
↓ 2 callersMethodbubbleDownIndex
Performs the "bubble down" operation. This is to place the element that is at the index of the heap in its correct place so that the heap maintains th
trees/binaryheap/binaryheap.go:121
↓ 2 callersMethoddeleteCase1
(node *Node)
trees/redblacktree/redblacktree.go:490
↓ 2 callersFunctiondoublerot
(c int8, s *Node)
trees/avltree/avltree.go:394
↓ 2 callersMethodgrowBy
Expand the array if necessary, i.e. capacity will be reached if we add n elements
lists/arraylist/arraylist.go:191
↓ 2 callersMethodinsert
(node *Node, entry *Entry)
trees/btree/btree.go:377
↓ 2 callersMethodinsertCase1
(node *Node)
trees/redblacktree/redblacktree.go:430
↓ 2 callersMethodlookup
(key interface{})
trees/redblacktree/redblacktree.go:353
↓ 2 callersMethodmaxEntries
()
trees/btree/btree.go:328
↓ 2 callersMethodmiddle
()
trees/btree/btree.go:336
↓ 2 callersMethodrebalance
rebalance rebalances the tree after deletion if necessary and returns true, otherwise false. Note that we first delete the entry and then call rebalan
trees/btree/btree.go:561
↓ 2 callersMethodresize
(cap int)
lists/arraylist/arraylist.go:184
↓ 2 callersMethodright
(node *Node)
trees/btree/btree.go:497
↓ 2 callersMethodsearchRecursively
searchRecursively searches recursively down the tree starting at the startNode
trees/btree/btree.go:360
↓ 2 callersFunctionsinglerot
(c int8, s *Node)
trees/avltree/avltree.go:387
↓ 2 callersMethodsplit
(node *Node)
trees/btree/btree.go:407
↓ 2 callersMethodwalk1
(a int)
trees/avltree/avltree.go:453
↓ 2 callersMethodwithinRange
Check that the index is within bounds of the list
trees/binaryheap/binaryheap.go:188
↓ 2 callersMethodwithinRange
Check that the index is within bounds of the list
stacks/arraystack/arraystack.go:113
↓ 1 callersMethodBegin
Begin resets the iterator to its initial state (one-before-first) Call Next() to fetch the first element if any.
trees/avltree/iterator.go:97
↓ 1 callersMethodBegin
Begin resets the iterator to its initial state (one-before-first) Call Next() to fetch the first element if any.
trees/redblacktree/iterator.go:132
↓ 1 callersMethodBegin
Begin resets the iterator to its initial state (one-before-first) Call Next() to fetch the first element if any.
trees/binaryheap/iterator.go:56
↓ 1 callersMethodBegin
Begin resets the iterator to its initial state (one-before-first) Call Next() to fetch the first element if any.
lists/doublylinkedlist/iterator.go:74
↓ 1 callersMethodBegin
Begin resets the iterator to its initial state (one-before-first) Call Next() to fetch the first element if any.
lists/arraylist/iterator.go:55
↓ 1 callersMethodBegin
Begin resets the iterator to its initial state (one-before-first) Call Next() to fetch the first element if any.
lists/singlylinkedlist/iterator.go:59
↓ 1 callersMethodBegin
Begin resets the iterator to its initial state (one-before-first) Call Next() to fetch the first element if any.
stacks/arraystack/iterator.go:56
↓ 1 callersMethodClear
Clear removes all nodes from the tree.
trees/avltree/avltree.go:183
↓ 1 callersMethodClear
Clear removes all nodes from the tree.
trees/btree/btree.go:216
↓ 1 callersMethodClear
Clear removes all nodes from the tree.
trees/redblacktree/redblacktree.go:256
↓ 1 callersMethodEmpty
Empty returns true if tree does not contain any nodes.
trees/avltree/avltree.go:83
↓ 1 callersMethodEmpty
Empty returns true if tree does not contain any nodes
trees/redblacktree/redblacktree.go:146
↓ 1 callersMethodEnd
End moves the iterator past the last element (one-past-the-end). Call Prev() to fetch the last element if any.
trees/avltree/iterator.go:104
↓ 1 callersMethodEnd
End moves the iterator past the last element (one-past-the-end). Call Prev() to fetch the last element if any.
trees/redblacktree/iterator.go:139
↓ 1 callersMethodEnd
End moves the iterator past the last element (one-past-the-end). Call Prev() to fetch the last element if any.
trees/binaryheap/iterator.go:62
↓ 1 callersMethodEnd
End moves the iterator past the last element (one-past-the-end). Call Prev() to fetch the last element if any.
lists/doublylinkedlist/iterator.go:81
↓ 1 callersMethodEnd
End moves the iterator past the last element (one-past-the-end). Call Prev() to fetch the last element if any.
lists/arraylist/iterator.go:61
↓ 1 callersMethodEnd
End moves the iterator past the last element (one-past-the-end). Call Prev() to fetch the last element if any.
stacks/arraystack/iterator.go:62
↓ 1 callersFunctionIntComparator
IntComparator provides a basic comparison on int
utils/comparator.go:39
↓ 1 callersMethodKeys
Keys returns all keys in-order
trees/redblacktree/redblacktree.go:156
↓ 1 callersMethodLeftKey
LeftKey returns the left-most (min) key or nil if tree is empty.
trees/btree/btree.go:232
↓ 1 callersMethodLeftValue
LeftValue returns the left-most value or nil if tree is empty.
trees/btree/btree.go:240
↓ 1 callersFunctionNewWithStringComparator
NewWithStringComparator instantiates an AVL tree with the StringComparator, i.e. keys are of type string.
trees/avltree/avltree.go:47
↓ 1 callersFunctionNewWithStringComparator
NewWithStringComparator instantiates a B-tree with the order (maximum number of children) and the StringComparator, i.e. keys are of type string.
trees/btree/btree.go:67
↓ 1 callersFunctionNewWithStringComparator
NewWithStringComparator instantiates a red-black tree with the StringComparator, i.e. keys are of type string.
trees/redblacktree/redblacktree.go:57
↓ 1 callersFunctionNewWithStringComparator
NewWithStringComparator instantiates a new empty heap with the StringComparator, i.e. elements are of type string.
trees/binaryheap/binaryheap.go:41
↓ 1 callersMethodNext
Next moves the iterator to the next element and returns true if there was a next element in the container. If Next() returns true, then next element's
trees/avltree/iterator.go:32
↓ 1 callersMethodNext
Next moves the iterator to the next element and returns true if there was a next element in the container. If Next() returns true, then next element's
trees/btree/iterator.go:32
↓ 1 callersMethodNext
Next moves the iterator to the next element and returns true if there was a next element in the container. If Next() returns true, then next element's
trees/redblacktree/iterator.go:31
↓ 1 callersMethodNext
Next moves the iterator to the next element and returns true if there was a next element in the container. If Next() returns true, then next element's
trees/binaryheap/iterator.go:24
↓ 1 callersMethodNext
Next moves the iterator to the next element and returns true if there was a next element in the container. If Next() returns true, then next element's
lists/doublylinkedlist/iterator.go:25
↓ 1 callersMethodNext
Next moves the iterator to the next element and returns true if there was a next element in the container. If Next() returns true, then next element's
lists/arraylist/iterator.go:24
↓ 1 callersMethodNext
Next moves the iterator to the next element and returns true if there was a next element in the container. If Next() returns true, then next element's
lists/singlylinkedlist/iterator.go:29
↓ 1 callersMethodNext
Next moves the iterator to the next element and returns true if there was a next element in the container. If Next() returns true, then next element's
stacks/arraystack/iterator.go:24
↓ 1 callersMethodNodeColor
NodeColor returns the current element's node color Does not modify the state of the iterator.
trees/redblacktree/iterator.go:126
↓ 1 callersMethodPrev
Prev moves the iterator to the next element and returns true if there was a previous element in the container. If Prev() returns true, then next eleme
trees/avltree/iterator.go:52
↓ 1 callersMethodPrev
Prev moves the iterator to the previous element and returns true if there was a previous element in the container. If Prev() returns true, then previo
trees/btree/iterator.go:91
↓ 1 callersMethodPrev
Prev moves the iterator to the previous element and returns true if there was a previous element in the container. If Prev() returns true, then previo
trees/redblacktree/iterator.go:73
↓ 1 callersMethodPrev
Prev moves the iterator to the previous element and returns true if there was a previous element in the container. If Prev() returns true, then previo
trees/binaryheap/iterator.go:34
↓ 1 callersMethodPrev
Prev moves the iterator to the previous element and returns true if there was a previous element in the container. If Prev() returns true, then previo
lists/doublylinkedlist/iterator.go:44
↓ 1 callersMethodPrev
Prev moves the iterator to the previous element and returns true if there was a previous element in the container. If Prev() returns true, then previo
lists/arraylist/iterator.go:34
↓ 1 callersMethodPrev
Prev moves the iterator to the previous element and returns true if there was a previous element in the container. If Prev() returns true, then previo
stacks/arraystack/iterator.go:34
↓ 1 callersMethodPut
Put inserts node into the tree. Key should adhere to the comparator's type assertion, otherwise method panics.
trees/avltree/avltree.go:53
↓ 1 callersMethodPut
Put inserts key-value pair node into the tree. If key already exists, then its value is updated with the new value. Key should adhere to the comparato
trees/btree/btree.go:74
↓ 1 callersMethodPut
Put inserts node into the tree. Key should adhere to the comparator's type assertion, otherwise method panics.
trees/redblacktree/redblacktree.go:63
← previousnext →101–200 of 773, ranked by callers