Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/amadvance/tommyds
/ functions
Functions
1,190 in github.com/amadvance/tommyds
⨍
Functions
1,190
◇
Types & classes
265
Method
operator++
benchmark/lib/google/sparsehash/sparsehashtable.h:195
Method
operator++
benchmark/lib/google/sparsehash/sparsehashtable.h:250
Method
operator++
benchmark/lib/google/sparsehash/sparsehashtable.h:302
Method
operator++
benchmark/lib/google/sparsehash/densehashtable.h:184
Method
operator++
benchmark/lib/google/sparsehash/densehashtable.h:242
Method
operator++
Postfix++ advance the iterator to the next slot
benchmark/lib/stx/btree.h:560
Method
operator++
Postfix++ advance the iterator to the next slot
benchmark/lib/stx/btree.h:763
Method
operator++
Postfix++ advance the iterator to the next slot
benchmark/lib/stx/btree.h:967
Method
operator++
Postfix++ advance the iterator to the previous slot
benchmark/lib/stx/btree.h:1174
Method
operator--
benchmark/lib/cpp-btree/safe_btree.h:151
Method
operator--
benchmark/lib/cpp-btree/btree.h:825
Method
operator--
Postfix-- backstep the iterator to the last slot
benchmark/lib/stx/btree.h:598
Method
operator--
Postfix-- backstep the iterator to the last slot
benchmark/lib/stx/btree.h:801
Method
operator--
Postfix-- backstep the iterator to the last slot
benchmark/lib/stx/btree.h:1005
Method
operator--
Postfix-- backstep the iterator to the next slot
benchmark/lib/stx/btree.h:1212
Method
operator->
This pointer value is potentially invalidated by any non-const method on the tree; it is NOT safe.
benchmark/lib/cpp-btree/safe_btree.h:130
Method
operator->
benchmark/lib/cpp-btree/btree.h:808
Method
operator->
benchmark/lib/google/sparsehash/sparsehashtable.h:184
Method
operator->
benchmark/lib/google/sparsehash/sparsehashtable.h:239
Method
operator->
benchmark/lib/google/sparsehash/sparsehashtable.h:291
Method
operator->
benchmark/lib/google/sparsehash/densehashtable.h:173
Method
operator->
benchmark/lib/google/sparsehash/densehashtable.h:231
Method
operator->
Dereference the iterator. Do not use this if possible, use key() and data() instead. The B+ tree does not stored key and data together.
benchmark/lib/stx/btree.h:523
Method
operator->
Dereference the iterator. Do not use this if possible, use key() and data() instead. The B+ tree does not stored key and data together.
benchmark/lib/stx/btree.h:726
Method
operator->
Dereference the iterator. Do not use this if possible, use key() and data() instead. The B+ tree does not stored key and data together.
benchmark/lib/stx/btree.h:927
Method
operator->
Dereference the iterator. Do not use this if possible, use key() and data() instead. The B+ tree does not stored key and data together.
benchmark/lib/stx/btree.h:1134
Function
operator<
benchmark/lib/nedtries/nedtrie.h:1621
Method
operator<
Total ordering relation of B+ trees of the same type. It uses std::lexicographical_compare() for the actual comparison of elements.
benchmark/lib/stx/btree_set.h:436
Method
operator<
Total ordering relation of B+ trees of the same type. It uses std::lexicographical_compare() for the actual comparison of elements.
benchmark/lib/stx/btree_multiset.h:436
Method
operator<
Total ordering relation of B+ trees of the same type. It uses std::lexicographical_compare() for the actual comparison of elements.
benchmark/lib/stx/btree_map.h:425
Method
operator<
Total ordering relation of B+ trees of the same type. It uses std::lexicographical_compare() for the actual comparison of elements.
benchmark/lib/stx/btree_multimap.h:425
Method
operator<
Total ordering relation of B+ trees of the same type. It uses std::lexicographical_compare() for the actual comparison of elements.
benchmark/lib/stx/btree.h:1970
Function
operator<=
benchmark/lib/nedtries/nedtrie.h:1625
Method
operator<=
Less-equal relation. Based on operator<.
benchmark/lib/stx/btree_set.h:448
Method
operator<=
Less-equal relation. Based on operator<.
benchmark/lib/stx/btree_multiset.h:448
Method
operator<=
Less-equal relation. Based on operator<.
benchmark/lib/stx/btree_map.h:437
Method
operator<=
Less-equal relation. Based on operator<.
benchmark/lib/stx/btree_multimap.h:437
Method
operator<=
Less-equal relation. Based on operator<.
benchmark/lib/stx/btree.h:1982
Function
operator==
benchmark/lib/cpp-btree/btree_test.h:50
Function
operator==
benchmark/lib/google/sparsehash/libc_allocator_with_realloc.h:108
Function
operator==
benchmark/lib/nedtries/nedtrie.h:1629
Method
operator==
Equality/inequality operators.
benchmark/lib/cpp-btree/safe_btree.h:111
Method
operator==
benchmark/lib/cpp-btree/btree_container.h:118
Method
operator==
benchmark/lib/cpp-btree/btree.h:794
Method
operator==
Comparison.
benchmark/lib/google/sparsehash/sparsehashtable.h:198
Method
operator==
Comparison.
benchmark/lib/google/sparsehash/sparsehashtable.h:253
Method
operator==
Comparison.
benchmark/lib/google/sparsehash/sparsehashtable.h:305
Method
operator==
COMPARISON
benchmark/lib/google/sparsehash/sparsehashtable.h:1048
Method
operator==
Comparison.
benchmark/lib/google/sparsehash/densehashtable.h:187
Method
operator==
Comparison.
benchmark/lib/google/sparsehash/densehashtable.h:245
Method
operator==
COMPARISON
benchmark/lib/google/sparsehash/densehashtable.h:1036
Method
operator==
Equality relation of B+ trees of the same type. B+ trees of the same size and equal elements are considered equal.
benchmark/lib/stx/btree_set.h:423
Method
operator==
Equality relation of B+ trees of the same type. B+ trees of the same size and equal key (counts) are considered equal.
benchmark/lib/stx/btree_multiset.h:423
Method
operator==
Equality relation of B+ trees of the same type. B+ trees of the same size and equal elements (both key and data) are considered equal.
benchmark/lib/stx/btree_map.h:412
Method
operator==
Equality relation of B+ trees of the same type. B+ trees of the same size and equal elements (both key and data) are considered equal. Beware of the r
benchmark/lib/stx/btree_multimap.h:412
Method
operator==
Equality of iterators
benchmark/lib/stx/btree.h:618
Method
operator==
Equality of iterators
benchmark/lib/stx/btree.h:821
Method
operator==
Equality of iterators
benchmark/lib/stx/btree.h:1025
Method
operator==
Equality of iterators
benchmark/lib/stx/btree.h:1232
Method
operator==
Equality relation of B+ trees of the same type. B+ trees of the same size and equal elements (both key and data) are considered equal. Beware of the r
benchmark/lib/stx/btree.h:1957
Function
operator>
benchmark/lib/nedtries/nedtrie.h:1633
Method
operator>
Greater relation. Based on operator<.
benchmark/lib/stx/btree_set.h:442
Method
operator>
Greater relation. Based on operator<.
benchmark/lib/stx/btree_multiset.h:442
Method
operator>
Greater relation. Based on operator<.
benchmark/lib/stx/btree_map.h:431
Method
operator>
Greater relation. Based on operator<.
benchmark/lib/stx/btree_multimap.h:431
Method
operator>
Greater relation. Based on operator<.
benchmark/lib/stx/btree.h:1976
Function
operator>=
benchmark/lib/nedtries/nedtrie.h:1637
Method
operator>=
Greater-equal relation. Based on operator<.
benchmark/lib/stx/btree_set.h:454
Method
operator>=
Greater-equal relation. Based on operator<.
benchmark/lib/stx/btree_multiset.h:454
Method
operator>=
Greater-equal relation. Based on operator<.
benchmark/lib/stx/btree_map.h:443
Method
operator>=
Greater-equal relation. Based on operator<.
benchmark/lib/stx/btree_multimap.h:443
Method
operator>=
Greater-equal relation. Based on operator<.
benchmark/lib/stx/btree.h:1988
Method
overhead
benchmark/lib/cpp-btree/safe_btree.h:386
Method
overhead
benchmark/lib/cpp-btree/btree_container.h:116
Method
overhead
The overhead of the btree structure in bytes per node. Computed as the total number of bytes used by the btree minus the number of bytes used for stor
benchmark/lib/cpp-btree/btree.h:1204
Method
print
Print out the B+ tree structure with keys onto the given ostream. This function requires that the header is compiled with BTREE_DEBUG and that key_typ
benchmark/lib/stx/btree_set.h:556
Method
print
Print out the B+ tree structure with keys onto the given ostream. This function requires that the header is compiled with BTREE_DEBUG and that key_typ
benchmark/lib/stx/btree_multiset.h:556
Method
print
Print out the B+ tree structure with keys onto the given ostream. This function requires that the header is compiled with BTREE_DEBUG and that key_typ
benchmark/lib/stx/btree_map.h:574
Method
print
Print out the B+ tree structure with keys onto the given ostream. This function requires that the header is compiled with BTREE_DEBUG and that key_typ
benchmark/lib/stx/btree_multimap.h:565
Method
print
Print out the B+ tree structure with keys onto the given ostream. This function requires that the header is compiled with BTREE_DEBUG and that key_typ
benchmark/lib/stx/btree.h:3556
Method
print_leaves
Print out only the leaves via the double linked list.
benchmark/lib/stx/btree_set.h:562
Method
print_leaves
Print out only the leaves via the double linked list.
benchmark/lib/stx/btree_multiset.h:562
Method
print_leaves
Print out only the leaves via the double linked list.
benchmark/lib/stx/btree_map.h:580
Method
print_leaves
Print out only the leaves via the double linked list.
benchmark/lib/stx/btree_multimap.h:571
Method
print_leaves
Print out only the leaves via the double linked list.
benchmark/lib/stx/btree.h:3564
Method
print_node
Recursively descend down the tree and print out nodes.
benchmark/lib/stx/btree.h:3581
Method
rbegin
benchmark/lib/cpp-btree/safe_btree.h:221
Method
rbegin
benchmark/lib/cpp-btree/btree_container.h:64
Method
rbegin
benchmark/lib/cpp-btree/btree.h:956
Method
rbegin
Constructs a read/data-write reverse iterator that points to the first invalid slot in the last leaf of the B+ tree. Uses STL magic.
benchmark/lib/stx/btree_set.h:290
Method
rbegin
Constructs a read/data-write reverse iterator that points to the first invalid slot in the last leaf of the B+ tree. Uses STL magic.
benchmark/lib/stx/btree_multiset.h:291
Method
rbegin
Constructs a read/data-write reverse iterator that points to the first invalid slot in the last leaf of the B+ tree. Uses STL magic.
benchmark/lib/stx/btree_map.h:278
Method
rbegin
Constructs a read/data-write reverse iterator that points to the first invalid slot in the last leaf of the B+ tree. Uses STL magic.
benchmark/lib/stx/btree_multimap.h:279
Method
rbegin
Constructs a read/data-write reverse iterator that points to the first invalid slot in the last leaf of the B+ tree. Uses STL magic.
benchmark/lib/stx/btree.h:1601
Function
rbt_compare
benchmark.cc:451
Method
read_metadata
benchmark/lib/google/sparsehash/sparsehashtable.h:1081
Method
read_metadata
benchmark/lib/google/sparsehash/densehashtable.h:1069
Method
read_nopointer_data
Only meaningful if value_type is a POD.
benchmark/lib/google/sparsehash/sparsehashtable.h:1094
Method
read_nopointer_data
When reading, we have to override the potential const-ness of *it
benchmark/lib/google/sparsehash/densehashtable.h:1100
Method
realloc_or_die
benchmark/lib/google/sparsehash/densehashtable.h:1141
← previous
next →
901–1,000 of 1,190, ranked by callers