MCPcopy Create free account

hub / github.com/arafatkatze/DataViz / functions

Functions773 in github.com/arafatkatze/DataViz

⨍ Functions 773◇ Types & classes 47
FunctionBenchmarkBTreeRemove1000
(b *testing.B)
trees/btree/btree_test.go:1224
FunctionBenchmarkBTreeRemove10000
(b *testing.B)
trees/btree/btree_test.go:1235
FunctionBenchmarkBTreeRemove100000
(b *testing.B)
trees/btree/btree_test.go:1246
FunctionBenchmarkBinaryHeapPop100
(b *testing.B)
trees/binaryheap/binaryheap_test.go:306
FunctionBenchmarkBinaryHeapPop1000
(b *testing.B)
trees/binaryheap/binaryheap_test.go:317
FunctionBenchmarkBinaryHeapPop10000
(b *testing.B)
trees/binaryheap/binaryheap_test.go:328
FunctionBenchmarkBinaryHeapPop100000
(b *testing.B)
trees/binaryheap/binaryheap_test.go:339
FunctionBenchmarkBinaryHeapPush100
(b *testing.B)
trees/binaryheap/binaryheap_test.go:350
FunctionBenchmarkBinaryHeapPush1000
(b *testing.B)
trees/binaryheap/binaryheap_test.go:358
FunctionBenchmarkBinaryHeapPush10000
(b *testing.B)
trees/binaryheap/binaryheap_test.go:369
FunctionBenchmarkBinaryHeapPush100000
(b *testing.B)
trees/binaryheap/binaryheap_test.go:380
FunctionBenchmarkDoublyLinkedListAdd100
(b *testing.B)
lists/doublylinkedlist/doublylinkedlist_test.go:546
FunctionBenchmarkDoublyLinkedListAdd1000
(b *testing.B)
lists/doublylinkedlist/doublylinkedlist_test.go:554
FunctionBenchmarkDoublyLinkedListAdd10000
(b *testing.B)
lists/doublylinkedlist/doublylinkedlist_test.go:565
FunctionBenchmarkDoublyLinkedListAdd100000
(b *testing.B)
lists/doublylinkedlist/doublylinkedlist_test.go:576
FunctionBenchmarkDoublyLinkedListGet100
(b *testing.B)
lists/doublylinkedlist/doublylinkedlist_test.go:502
FunctionBenchmarkDoublyLinkedListGet1000
(b *testing.B)
lists/doublylinkedlist/doublylinkedlist_test.go:513
FunctionBenchmarkDoublyLinkedListGet10000
(b *testing.B)
lists/doublylinkedlist/doublylinkedlist_test.go:524
FunctionBenchmarkDoublyLinkedListGet100000
(b *testing.B)
lists/doublylinkedlist/doublylinkedlist_test.go:535
FunctionBenchmarkDoublyLinkedListRemove100
(b *testing.B)
lists/doublylinkedlist/doublylinkedlist_test.go:587
FunctionBenchmarkDoublyLinkedListRemove1000
(b *testing.B)
lists/doublylinkedlist/doublylinkedlist_test.go:598
FunctionBenchmarkDoublyLinkedListRemove10000
(b *testing.B)
lists/doublylinkedlist/doublylinkedlist_test.go:609
FunctionBenchmarkDoublyLinkedListRemove100000
(b *testing.B)
lists/doublylinkedlist/doublylinkedlist_test.go:620
FunctionBenchmarkGoSortRandom
(b *testing.B)
utils/sort_test.go:95
FunctionBenchmarkRedBlackTreeGet100
(b *testing.B)
trees/redblacktree/redblacktree_test.go:611
FunctionBenchmarkRedBlackTreeGet1000
(b *testing.B)
trees/redblacktree/redblacktree_test.go:622
FunctionBenchmarkRedBlackTreeGet10000
(b *testing.B)
trees/redblacktree/redblacktree_test.go:633
FunctionBenchmarkRedBlackTreeGet100000
(b *testing.B)
trees/redblacktree/redblacktree_test.go:644
FunctionBenchmarkRedBlackTreePut100
(b *testing.B)
trees/redblacktree/redblacktree_test.go:655
FunctionBenchmarkRedBlackTreePut1000
(b *testing.B)
trees/redblacktree/redblacktree_test.go:663
FunctionBenchmarkRedBlackTreePut10000
(b *testing.B)
trees/redblacktree/redblacktree_test.go:674
FunctionBenchmarkRedBlackTreePut100000
(b *testing.B)
trees/redblacktree/redblacktree_test.go:685
FunctionBenchmarkRedBlackTreeRemove100
(b *testing.B)
trees/redblacktree/redblacktree_test.go:696
FunctionBenchmarkRedBlackTreeRemove1000
(b *testing.B)
trees/redblacktree/redblacktree_test.go:707
FunctionBenchmarkRedBlackTreeRemove10000
(b *testing.B)
trees/redblacktree/redblacktree_test.go:718
FunctionBenchmarkRedBlackTreeRemove100000
(b *testing.B)
trees/redblacktree/redblacktree_test.go:729
FunctionBenchmarkSinglyLinkedListAdd100
(b *testing.B)
lists/singlylinkedlist/singlylinkedlist_test.go:469
FunctionBenchmarkSinglyLinkedListAdd1000
(b *testing.B)
lists/singlylinkedlist/singlylinkedlist_test.go:477
FunctionBenchmarkSinglyLinkedListAdd10000
(b *testing.B)
lists/singlylinkedlist/singlylinkedlist_test.go:488
FunctionBenchmarkSinglyLinkedListAdd100000
(b *testing.B)
lists/singlylinkedlist/singlylinkedlist_test.go:499
FunctionBenchmarkSinglyLinkedListGet100
(b *testing.B)
lists/singlylinkedlist/singlylinkedlist_test.go:425
FunctionBenchmarkSinglyLinkedListGet1000
(b *testing.B)
lists/singlylinkedlist/singlylinkedlist_test.go:436
FunctionBenchmarkSinglyLinkedListGet10000
(b *testing.B)
lists/singlylinkedlist/singlylinkedlist_test.go:447
FunctionBenchmarkSinglyLinkedListGet100000
(b *testing.B)
lists/singlylinkedlist/singlylinkedlist_test.go:458
FunctionBenchmarkSinglyLinkedListRemove100
(b *testing.B)
lists/singlylinkedlist/singlylinkedlist_test.go:510
FunctionBenchmarkSinglyLinkedListRemove1000
(b *testing.B)
lists/singlylinkedlist/singlylinkedlist_test.go:521
FunctionBenchmarkSinglyLinkedListRemove10000
(b *testing.B)
lists/singlylinkedlist/singlylinkedlist_test.go:532
FunctionBenchmarkSinglyLinkedListRemove100000
(b *testing.B)
lists/singlylinkedlist/singlylinkedlist_test.go:543
FunctionBenchmarkTreeMapGet100
(b *testing.B)
maps/treemap/treemap_test.go:494
FunctionBenchmarkTreeMapGet1000
(b *testing.B)
maps/treemap/treemap_test.go:505
FunctionBenchmarkTreeMapGet10000
(b *testing.B)
maps/treemap/treemap_test.go:516
FunctionBenchmarkTreeMapGet100000
(b *testing.B)
maps/treemap/treemap_test.go:527
FunctionBenchmarkTreeMapPut100
(b *testing.B)
maps/treemap/treemap_test.go:538
FunctionBenchmarkTreeMapPut1000
(b *testing.B)
maps/treemap/treemap_test.go:546
FunctionBenchmarkTreeMapPut10000
(b *testing.B)
maps/treemap/treemap_test.go:557
FunctionBenchmarkTreeMapPut100000
(b *testing.B)
maps/treemap/treemap_test.go:568
FunctionBenchmarkTreeMapRemove100
(b *testing.B)
maps/treemap/treemap_test.go:579
FunctionBenchmarkTreeMapRemove1000
(b *testing.B)
maps/treemap/treemap_test.go:590
FunctionBenchmarkTreeMapRemove10000
(b *testing.B)
maps/treemap/treemap_test.go:601
FunctionBenchmarkTreeMapRemove100000
(b *testing.B)
maps/treemap/treemap_test.go:612
FunctionByteComparator
ByteComparator provides a basic comparison on byte
utils/comparator.go:207
MethodClear
Clear removes all elements from the map.
maps/treemap/treemap.go:83
MethodClear
()
containers/containers_test.go:24
MethodClear
Clear removes all elements from the heap.
trees/binaryheap/binaryheap.go:93
MethodClear
Clear removes all elements from the list.
lists/arraylist/arraylist.go:122
MethodClear
Clear removes all elements from the stack.
stacks/arraystack/arraystack.go:62
MethodContains
Contains check if values (one or more) are present in the set. All values have to be present in the set for the method to return true. Performance tim
lists/doublylinkedlist/doublylinkedlist.go:141
MethodContains
Contains checks if elements (one or more) are present in the set. All elements have to be present in the set for the method to return true. Performanc
lists/arraylist/arraylist.go:74
MethodContains
Contains checks if values (one or more) are present in the set. All values have to be present in the set for the method to return true. Performance ti
lists/singlylinkedlist/singlylinkedlist.go:121
MethodEach
Each calls the given function once for each element, passing that element's key and value.
maps/treemap/enumerable.go:13
MethodEach
Each calls the given function once for each element, passing that element's index and value.
containers/enumerable.go:6
MethodEach
Each calls the given function once for each element, passing that element's index and value.
lists/doublylinkedlist/enumerable.go:10
MethodEach
Each calls the given function once for each element, passing that element's index and value.
lists/arraylist/enumerable.go:10
MethodEach
Each calls the given function once for each element, passing that element's index and value.
lists/singlylinkedlist/enumerable.go:14
MethodEmpty
Empty returns true if map does not contain any elements
maps/treemap/treemap.go:63
MethodEmpty
()
containers/containers_test.go:16
MethodEmpty
Empty returns true if heap does not contain any elements.
trees/binaryheap/binaryheap.go:83
MethodEmpty
Empty returns true if list does not contain any elements.
lists/doublylinkedlist/doublylinkedlist.go:187
MethodEmpty
Empty returns true if list does not contain any elements.
lists/arraylist/arraylist.go:112
MethodEmpty
Empty returns true if list does not contain any elements.
lists/singlylinkedlist/singlylinkedlist.go:167
MethodEmpty
Empty returns true if stack does not contain any elements.
stacks/arraystack/arraystack.go:52
MethodEnd
End moves the iterator past the last element (one-past-the-end). Call Prev() to fetch the last element if any.
maps/treemap/iterator.go:57
MethodEnd
End moves the iterator past the last element (one-past-the-end). Call Prev() to fetch the last element if any.
containers/iterator.go:72
MethodFind
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
maps/treemap/enumerable.go:71
MethodFind
Find passes each element of the container to the given function and returns the first (index,value) for which the function is true or -1,nil otherwise
containers/enumerable.go:28
MethodFind
Find passes each element of the container to the given function and returns the first (index,value) for which the function is true or -1,nil otherwise
lists/doublylinkedlist/enumerable.go:67
MethodFind
Find passes each element of the container to the given function and returns the first (index,value) for which the function is true or -1,nil otherwise
lists/arraylist/enumerable.go:67
MethodFind
Find passes each element of the container to the given function and returns the first (index,value) for which the function is true or -1,nil otherwise
lists/singlylinkedlist/enumerable.go:71
MethodFirst
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
maps/treemap/iterator.go:64
MethodFirst
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:26
MethodFirst
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
trees/avltree/iterator.go:112
MethodFirst
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
trees/btree/iterator.go:183
MethodFirst
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
trees/redblacktree/iterator.go:147
MethodFirst
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
trees/binaryheap/iterator.go:69
MethodFirst
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
lists/doublylinkedlist/iterator.go:89
MethodFirst
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
lists/arraylist/iterator.go:68
MethodFirst
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
lists/singlylinkedlist/iterator.go:67
MethodFirst
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
stacks/arraystack/iterator.go:69
FunctionFloat32Comparator
Float32Comparator provides a basic comparison on float32
utils/comparator.go:179
FunctionFloat64Comparator
Float64Comparator provides a basic comparison on float64
utils/comparator.go:193
← previousnext →301–400 of 773, ranked by callers