MCPcopy Create free account

hub / github.com/arafatkatze/DataViz / functions

Functions773 in github.com/arafatkatze/DataViz

⨍ Functions 773◇ Types & classes 47
↓ 461 callersMethodPut
(key interface{}, value interface{})
maps/maps.go:18
↓ 175 callersFunctionassertValidTreeNode
(t *testing.T, node *Node, expectedEntries int, expectedChildren int, keys []int, hasParent bool)
trees/btree/btree_test.go:1056
↓ 128 callersMethodAdd
(values ...interface{})
lists/lists.go:21
↓ 113 callersMethodSize
()
containers/containers.go:17
↓ 104 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
containers/iterator.go:35
↓ 92 callersMethodValue
Value returns the current element's value. Does not modify the state of the iterator.
containers/iterator.go:39
↓ 75 callersMethodPush
(value interface{})
stacks/stacks.go:12
↓ 68 callersMethodKey
Key returns the current element's key. Does not modify the state of the iterator.
containers/iterator.go:43
↓ 65 callersMethodRemove
(key interface{})
maps/maps.go:20
↓ 63 callersFunctionassertValidTree
(t *testing.T, tree *Tree, expectedSize int)
trees/btree/btree_test.go:1050
↓ 60 callersMethodIndex
Index returns the current element's index. Does not modify the state of the iterator.
containers/iterator.go:17
↓ 54 callersMethodGet
(index int)
lists/lists.go:19
↓ 47 callersFunctionNewWithIntComparator
NewWithIntComparator instantiates a B-tree with the order (maximum number of children) and the IntComparator, i.e. keys are of type int.
trees/btree/btree.go:62
↓ 38 callersFunctionNew
New instantiates a new empty list
lists/doublylinkedlist/doublylinkedlist.go:34
↓ 38 callersFunctionNew
New instantiates a new empty list
lists/arraylist/arraylist.go:32
↓ 38 callersMethodValues
()
containers/containers.go:19
↓ 37 callersMethodGet
(key interface{})
maps/maps.go:19
↓ 34 callersFunctionNew
New instantiates a new empty list
lists/singlylinkedlist/singlylinkedlist.go:32
↓ 33 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
containers/iterator.go:93
↓ 30 callersFunctionNewWithIntComparator
NewWithIntComparator instantiates an AVL tree with the IntComparator, i.e. keys are of type int.
trees/avltree/avltree.go:42
↓ 30 callersFunctionNewWithIntComparator
NewWithIntComparator instantiates a red-black tree with the IntComparator, i.e. keys are of type int.
trees/redblacktree/redblacktree.go:52
↓ 23 callersMethodEmpty
()
containers/containers.go:16
↓ 21 callersFunctionnodeColor
(node *Node)
trees/redblacktree/redblacktree.go:570
↓ 19 callersMethodBegin
Begin resets the iterator to its initial state (one-before-first) Call Next() to fetch the first element if any.
containers/iterator.go:47
↓ 19 callersMethodIterator
Iterator returns a stateful iterator whose elements are key/value pairs.
trees/avltree/iterator.go:24
↓ 19 callersMethodIterator
Iterator returns a stateful iterator whose elements are key/value pairs.
trees/btree/iterator.go:24
↓ 19 callersMethodIterator
Iterator returns a stateful iterator whose elements are key/value pairs.
trees/redblacktree/iterator.go:23
↓ 19 callersFunctionNew
New instantiates a new empty stack
stacks/arraystack/arraystack.go:28
↓ 19 callersFunctionNewWithIntComparator
NewWithIntComparator instantiates a new empty heap with the IntComparator, i.e. elements are of type int.
trees/binaryheap/binaryheap.go:36
↓ 18 callersFunctionNewWithIntComparator
NewWithIntComparator instantiates a tree map with the IntComparator, i.e. keys are of type int.
maps/treemap/treemap.go:34
↓ 18 callersMethodRemove
(index int)
lists/lists.go:20
↓ 17 callersMethodIterator
Iterator returns a stateful iterator whose elements are key/value pairs.
maps/treemap/iterator.go:18
↓ 16 callersMethodEnd
End moves the iterator past the last element (one-past-the-end). Call Prev() to fetch the last element if any.
containers/iterator.go:97
↓ 15 callersMethodContains
(values ...interface{})
lists/lists.go:22
↓ 15 callersMethodFirst
First moves the iterator to the first element and returns true if there was a first element in the container. If First() returns true, then first elem
containers/iterator.go:52
↓ 15 callersMethodKeys
()
maps/maps.go:21
↓ 15 callersFunctionToString
ToString converts a value to string.
utils/utils.go:17
↓ 14 callersMethodIterator
Iterator returns a stateful iterator whose values can be fetched by an index.
lists/doublylinkedlist/iterator.go:17
↓ 14 callersMethodIterator
Iterator returns a stateful iterator whose values can be fetched by an index.
lists/arraylist/iterator.go:16
↓ 13 callersMethodLast
Last moves the iterator to the last element and returns true if there was a last element in the container. If Last() returns true, then last element's
containers/iterator.go:102
↓ 13 callersMethodPop
()
stacks/stacks.go:13
↓ 12 callersMethodFromJSON
FromJSON populates containers's elements from the input JSON representation.
containers/serialization.go:12
↓ 12 callersMethodInsert
(index int, values ...interface{})
lists/lists.go:25
↓ 12 callersFunctionNewWithStringComparator
NewWithStringComparator instantiates a tree map with the StringComparator, i.e. keys are of type string.
maps/treemap/treemap.go:39
↓ 12 callersMethodToJSON
ToJSON outputs the JSON representation of containers's elements.
containers/serialization.go:6
↓ 12 callersMethodsearch
search searches only within the single node among its entries
trees/btree/btree.go:341
↓ 11 callersMethodSort
(comparator utils.Comparator)
lists/lists.go:23
↓ 10 callersMethodIterator
Iterator returns a stateful iterator whose values can be fetched by an index.
lists/singlylinkedlist/iterator.go:21
↓ 9 callersMethodClear
()
containers/containers.go:18
↓ 9 callersMethodHeight
Height returns the height of the tree.
trees/btree/btree.go:222
↓ 9 callersMethodisLeaf
(node *Node)
trees/btree/btree.go:308
↓ 8 callersMethodAll
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:51
↓ 8 callersMethodAny
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.
containers/enumerable.go:47
↓ 8 callersMethodFind
Find passes each element of the container to the given function and returns the first (key,value) for which the function is true or nil,nil otherwise
containers/enumerable.go:56
↓ 8 callersMethodwithinRange
Check that the index is within bounds of the list
lists/doublylinkedlist/doublylinkedlist.go:324
↓ 7 callersMethodIterator
Iterator returns a stateful iterator whose values can be fetched by an index.
trees/binaryheap/iterator.go:16
↓ 7 callersMethodIterator
Iterator returns a stateful iterator whose values can be fetched by an index.
stacks/arraystack/iterator.go:16
↓ 7 callersMethodPeek
()
stacks/stacks.go:14
↓ 7 callersMethodwithinRange
Check that the index is within bounds of the list
lists/arraylist/arraylist.go:180
↓ 6 callersMethodAdd
Add appends a value (one or more) at the end of the list (same as Append())
lists/doublylinkedlist/doublylinkedlist.go:39
↓ 6 callersMethodAdd
Add appends a value (one or more) at the end of the list (same as Append())
lists/singlylinkedlist/singlylinkedlist.go:37
↓ 6 callersMethodSwap
(index1, index2 int)
lists/lists.go:24
↓ 6 callersMethoddeleteEntry
(node *Node, index int)
trees/btree/btree.go:641
↓ 6 callersFunctionsetParent
(nodes []*Node, parent *Node)
trees/btree/btree.go:478
↓ 6 callersMethodsibling
()
trees/redblacktree/redblacktree.go:383
↓ 6 callersMethodwithinRange
Check that the index is within bounds of the list
lists/singlylinkedlist/singlylinkedlist.go:271
↓ 5 callersMethodLeft
Left returns the left-most (min) node or nil if tree is empty.
trees/btree/btree.go:227
↓ 5 callersMethodRight
Right returns the right-most (max) node or nil if tree is empty.
trees/btree/btree.go:248
↓ 5 callersFunctionSort
Sort sorts values (in-place) with respect to the given comparator. Uses Go's sort (hybrid of quicksort for large and then insertion sort for smaller
utils/sort.go:12
↓ 5 callersMethodrotateLeft
(node *Node)
trees/redblacktree/redblacktree.go:393
↓ 5 callersMethodrotateRight
(node *Node)
trees/redblacktree/redblacktree.go:404
↓ 4 callersMethodEach
Each calls the given function once for each element, passing that element's key and value.
containers/enumerable.go:34
↓ 4 callersMethodEmpty
Empty returns true if tree does not contain any nodes
trees/btree/btree.go:110
↓ 4 callersMethodIndexOf
IndexOf returns index of provided element
lists/doublylinkedlist/doublylinkedlist.go:174
↓ 4 callersMethodIndexOf
IndexOf returns index of provided element
lists/arraylist/arraylist.go:99
↓ 4 callersMethodIndexOf
IndexOf returns index of provided element
lists/singlylinkedlist/singlylinkedlist.go:154
↓ 4 callersMethodLeft
Left returns the minimum element of the AVL tree or nil if the tree is empty.
trees/avltree/avltree.go:114
↓ 4 callersMethodLeft
Left returns the left-most (min) node or nil if tree is empty.
trees/redblacktree/redblacktree.go:176
↓ 4 callersMethodRight
Right returns the maximum element of the AVL tree or nil if the tree is empty.
trees/avltree/avltree.go:120
↓ 4 callersMethodRight
Right returns the right-most (max) node or nil if tree is empty.
trees/redblacktree/redblacktree.go:187
↓ 4 callersFunctionbenchmarkAdd
(b *testing.B, list *List, size int)
lists/doublylinkedlist/doublylinkedlist_test.go:486
↓ 4 callersFunctionbenchmarkAdd
(b *testing.B, list *List, size int)
lists/arraylist/arraylist_test.go:487
↓ 4 callersFunctionbenchmarkAdd
(b *testing.B, list *List, size int)
lists/singlylinkedlist/singlylinkedlist_test.go:409
↓ 4 callersFunctionbenchmarkGet
(b *testing.B, m *Map, size int)
maps/treemap/treemap_test.go:470
↓ 4 callersFunctionbenchmarkGet
(b *testing.B, tree *Tree, size int)
trees/avltree/avltree_test.go:587
↓ 4 callersFunctionbenchmarkGet
(b *testing.B, tree *Tree, size int)
trees/btree/btree_test.go:1104
↓ 4 callersFunctionbenchmarkGet
(b *testing.B, tree *Tree, size int)
trees/redblacktree/redblacktree_test.go:587
↓ 4 callersFunctionbenchmarkGet
(b *testing.B, list *List, size int)
lists/doublylinkedlist/doublylinkedlist_test.go:478
↓ 4 callersFunctionbenchmarkGet
(b *testing.B, list *List, size int)
lists/arraylist/arraylist_test.go:479
↓ 4 callersFunctionbenchmarkGet
(b *testing.B, list *List, size int)
lists/singlylinkedlist/singlylinkedlist_test.go:401
↓ 4 callersFunctionbenchmarkPop
(b *testing.B, heap *Heap, size int)
trees/binaryheap/binaryheap_test.go:298
↓ 4 callersFunctionbenchmarkPop
(b *testing.B, stack *Stack, size int)
stacks/arraystack/arraystack_test.go:267
↓ 4 callersFunctionbenchmarkPush
(b *testing.B, heap *Heap, size int)
trees/binaryheap/binaryheap_test.go:290
↓ 4 callersFunctionbenchmarkPush
(b *testing.B, stack *Stack, size int)
stacks/arraystack/arraystack_test.go:259
↓ 4 callersFunctionbenchmarkPut
(b *testing.B, m *Map, size int)
maps/treemap/treemap_test.go:478
↓ 4 callersFunctionbenchmarkPut
(b *testing.B, tree *Tree, size int)
trees/avltree/avltree_test.go:595
↓ 4 callersFunctionbenchmarkPut
(b *testing.B, tree *Tree, size int)
trees/btree/btree_test.go:1112
↓ 4 callersFunctionbenchmarkPut
(b *testing.B, tree *Tree, size int)
trees/redblacktree/redblacktree_test.go:595
↓ 4 callersFunctionbenchmarkRemove
(b *testing.B, m *Map, size int)
maps/treemap/treemap_test.go:486
↓ 4 callersFunctionbenchmarkRemove
(b *testing.B, tree *Tree, size int)
trees/avltree/avltree_test.go:603
next →1–100 of 773, ranked by callers