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
lower_bound
Searches the B+ tree and returns an iterator to the first pair equal to or greater than key, or end() if all keys are smaller.
benchmark/lib/stx/btree_multimap.h:366
Method
lower_bound
Searches the B+ tree and returns an iterator to the first pair equal to or greater than key, or end() if all keys are smaller.
benchmark/lib/stx/btree.h:1855
Function
main
check.c:1712
Function
main
benchmark.cc:2830
Function
main
benchmark/lib/cpp-btree/btree_bench.cc:591
Function
main
benchmark/lib/judyarray/judy64na.c:1869
Function
map_clear
benchmark/lib/libdynamic/map.c:183
Function
map_element_empty
benchmark/lib/libdynamic/map.c:105
Function
map_size
benchmark/lib/libdynamic/map.c:91
Method
max_bucket_count
benchmark/lib/google/sparsehash/sparsehashtable.h:550
Method
max_bucket_count
benchmark/lib/google/sparsehash/densehashtable.h:509
Method
max_size
benchmark/lib/cpp-btree/safe_btree.h:375
Method
max_size
benchmark/lib/cpp-btree/btree_container.h:105
Method
max_size
benchmark/lib/cpp-btree/btree.h:1140
Method
max_size
benchmark/lib/google/sparsehash/sparsehashtable.h:547
Method
max_size
benchmark/lib/google/sparsehash/densehashtable.h:506
Method
max_size
Returns the largest possible size of the B+ Tree. This is just a function required by the STL standard, the B+ Tree can hold more items.
benchmark/lib/stx/btree_set.h:333
Method
max_size
Returns the largest possible size of the B+ Tree. This is just a function required by the STL standard, the B+ Tree can hold more items.
benchmark/lib/stx/btree_multiset.h:334
Method
max_size
Returns the largest possible size of the B+ Tree. This is just a function required by the STL standard, the B+ Tree can hold more items.
benchmark/lib/stx/btree_map.h:321
Method
max_size
Returns the largest possible size of the B+ Tree. This is just a function required by the STL standard, the B+ Tree can hold more items.
benchmark/lib/stx/btree_multimap.h:322
Method
max_size
Returns the largest possible size of the B+ Tree. This is just a function required by the STL standard, the B+ Tree can hold more items.
benchmark/lib/stx/btree.h:1741
Method
maybe_shrink
Used after a string of deletes. Returns true if we actually shrunk. TODO(csilvers): take a delta so we can take into account inserts done after shrin
benchmark/lib/google/sparsehash/sparsehashtable.h:564
Method
maybe_shrink
Used after a string of deletes. Returns true if we actually shrunk. TODO(csilvers): take a delta so we can take into account inserts done after shrin
benchmark/lib/google/sparsehash/densehashtable.h:524
Function
mem
benchmark.cc:842
Method
merge_inner
Merge two inner nodes. The function moves all key/childid pairs from right to left and sets right's slotuse to zero. The right slot is then removed by
benchmark/lib/stx/btree.h:3293
Method
merge_leaves
Merge two leaf nodes. The function moves all key/data pairs from right to left and sets right's slotuse to zero. The right slot is then removed by the
benchmark/lib/stx/btree.h:3262
Method
merge_nodes
benchmark/lib/cpp-btree/btree.h:2096
Method
move_from
Implementation is like copy_from, but it destroys the table of the "from" guy by freeing sparsetable memory as we iterate. This is useful in resizing
benchmark/lib/google/sparsehash/sparsehashtable.h:680
Method
multi_checker
Default constructor.
benchmark/lib/cpp-btree/btree_test.h:449
Method
mutable_internal_allocator
Allocator routines.
benchmark/lib/cpp-btree/btree.h:1234
Method
mutable_iter
benchmark/lib/cpp-btree/safe_btree.h:90
Method
mutable_key_comp
benchmark/lib/cpp-btree/btree.h:1113
Method
mutable_rightmost
benchmark/lib/cpp-btree/btree.h:546
Method
mutable_rightmost
benchmark/lib/cpp-btree/btree.h:1224
Method
mutable_root
benchmark/lib/cpp-btree/btree.h:1215
Method
mutable_size
benchmark/lib/cpp-btree/btree.h:550
Method
mutable_size
The size of the tree is stored in the root node.
benchmark/lib/cpp-btree/btree.h:1231
Function
nedtrie_func
benchmark.cc:483
Method
new_internal_node
Node creation/deletion routines.
benchmark/lib/cpp-btree/btree.h:1242
Method
new_internal_root_node
benchmark/lib/cpp-btree/btree.h:1247
Method
new_leaf_node
benchmark/lib/cpp-btree/btree.h:1252
Method
new_leaf_root_node
benchmark/lib/cpp-btree/btree.h:1257
Method
node_stats
benchmark/lib/cpp-btree/btree.h:894
Method
nodes
benchmark/lib/cpp-btree/safe_btree.h:380
Method
nodes
benchmark/lib/cpp-btree/btree_container.h:110
Method
nodes
benchmark/lib/cpp-btree/btree.h:1167
Method
nodes
Return the total number of nodes
benchmark/lib/stx/btree.h:1274
Method
nonempty_bucket_count
benchmark/lib/google/sparsehash/densehashtable.h:510
Method
num_table_copies
Accessor function for statistics gathering.
benchmark/lib/google/sparsehash/sparsehashtable.h:432
Method
num_table_copies
Accessor function for statistics gathering.
benchmark/lib/google/sparsehash/densehashtable.h:345
Function
operator!=
benchmark/lib/google/sparsehash/libc_allocator_with_realloc.h:114
Function
operator!=
benchmark/lib/nedtries/nedtrie.h:1617
Method
operator!=
benchmark/lib/cpp-btree/safe_btree.h:114
Method
operator!=
benchmark/lib/cpp-btree/btree_container.h:130
Method
operator!=
benchmark/lib/cpp-btree/btree.h:797
Method
operator!=
benchmark/lib/google/sparsehash/sparsehashtable.h:199
Method
operator!=
benchmark/lib/google/sparsehash/sparsehashtable.h:254
Method
operator!=
benchmark/lib/google/sparsehash/sparsehashtable.h:306
Method
operator!=
benchmark/lib/google/sparsehash/sparsehashtable.h:1065
Method
operator!=
benchmark/lib/google/sparsehash/densehashtable.h:188
Method
operator!=
benchmark/lib/google/sparsehash/densehashtable.h:246
Method
operator!=
benchmark/lib/google/sparsehash/densehashtable.h:1053
Method
operator!=
Inequality relation. Based on operator==.
benchmark/lib/stx/btree_set.h:429
Method
operator!=
Inequality relation. Based on operator==.
benchmark/lib/stx/btree_multiset.h:429
Method
operator!=
Inequality relation. Based on operator==.
benchmark/lib/stx/btree_map.h:418
Method
operator!=
Inequality relation. Based on operator==.
benchmark/lib/stx/btree_multimap.h:418
Method
operator!=
Inequality of iterators
benchmark/lib/stx/btree.h:624
Method
operator!=
Inequality of iterators
benchmark/lib/stx/btree.h:827
Method
operator!=
Inequality of iterators
benchmark/lib/stx/btree.h:1031
Method
operator!=
Inequality of iterators
benchmark/lib/stx/btree.h:1238
Method
operator!=
Inequality relation. Based on operator==.
benchmark/lib/stx/btree.h:1963
Method
operator()
benchmark.cc:506
Method
operator()
benchmark/lib/cpp-btree/btree_test.h:507
Method
operator()
benchmark/lib/cpp-btree/btree_test.h:519
Method
operator()
benchmark/lib/cpp-btree/btree_test.h:534
Method
operator()
benchmark/lib/cpp-btree/btree_test.cc:119
Method
operator()
benchmark/lib/cpp-btree/btree_bench.cc:56
Method
operator()
benchmark/lib/cpp-btree/btree.h:209
Method
operator()
benchmark/lib/cpp-btree/btree.h:221
Method
operator()
benchmark/lib/cpp-btree/btree.h:236
Method
operator()
benchmark/lib/cpp-btree/btree.h:252
Method
operator()
benchmark/lib/cpp-btree/btree.h:360
Method
operator()
benchmark/lib/cpp-btree/btree.h:368
Method
operator()
Convert a fake pair type to just the first component
benchmark/lib/stx/btree.h:390
Method
operator()
Identity "convert" a real pair type to just the first component
benchmark/lib/stx/btree.h:404
Method
operator()
Function call "less"-operator resulting in true if x < y.
benchmark/lib/stx/btree.h:1388
Method
operator*
This reference value is potentially invalidated by any non-const method on the tree; it is NOT safe.
benchmark/lib/cpp-btree/safe_btree.h:124
Method
operator*
benchmark/lib/cpp-btree/btree_container.h:241
Method
operator*
benchmark/lib/cpp-btree/btree.h:805
Method
operator*
Happy dereferencer
benchmark/lib/google/sparsehash/sparsehashtable.h:183
Method
operator*
Happy dereferencer
benchmark/lib/google/sparsehash/sparsehashtable.h:238
Method
operator*
Happy dereferencer
benchmark/lib/google/sparsehash/sparsehashtable.h:290
Method
operator*
Happy dereferencer
benchmark/lib/google/sparsehash/densehashtable.h:172
Method
operator*
Happy dereferencer
benchmark/lib/google/sparsehash/densehashtable.h:230
Method
operator*
Dereference the iterator, this is not a value_type& because key and value are not stored together
benchmark/lib/stx/btree.h:514
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:717
Method
operator*
Dereference the iterator, this is not a value_type& because key and value are not stored together
benchmark/lib/stx/btree.h:917
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:1124
Method
operator++
benchmark/lib/cpp-btree/safe_btree.h:146
Method
operator++
benchmark/lib/cpp-btree/btree.h:820
← previous
next →
801–900 of 1,190, ranked by callers