MCPcopy Create free account

hub / github.com/amadvance/tommyds / functions

Functions1,190 in github.com/amadvance/tommyds

⨍ Functions 1,190◇ Types & classes 265
↓ 2 callersFunctionjudy_radix
benchmark/lib/judyarray/judy64na.c:726
↓ 2 callersMethodkey_comp
benchmark/lib/cpp-btree/safe_btree.h:371
↓ 2 callersMethodkey_comp
Constant access to the key comparison object sorting the B+ tree
benchmark/lib/stx/btree.h:1395
↓ 2 callersFunctionmap_erase
benchmark/lib/libdynamic/map.c:143
↓ 2 callersFunctionmap_release_all
benchmark/lib/libdynamic/map.c:35
↓ 2 callersFunctionnano
check.c:141
↓ 2 callersFunctionnano
benchmark.cc:566
↓ 2 callersMethodnum_ht_copies
benchmark/lib/google/sparsehash/hashtable-common.h:122
↓ 2 callersFunctionopen
benchmark.cc:860
↓ 2 callersMethodoverhead
benchmark/lib/cpp-btree/btree_test.h:371
↓ 2 callersMethodrebalance_left_to_right
benchmark/lib/cpp-btree/btree.h:1506
↓ 2 callersMethodrebalance_right_to_left
benchmark/lib/cpp-btree/btree.h:1459
↓ 2 callersMethodremove_value
benchmark/lib/cpp-btree/btree.h:1441
↓ 2 callersFunctionremove_w_node
benchmark/lib/cube/binary-search-tesseract-1.0.c:583
↓ 2 callersFunctionremove_x_node
benchmark/lib/cube/binary-search-tesseract-1.0.c:625
↓ 2 callersFunctionremove_y_node
benchmark/lib/cube/binary-search-tesseract-1.0.c:670
↓ 2 callersFunctionremove_z_node
benchmark/lib/cube/binary-search-tesseract-1.0.c:705
↓ 2 callersMethodresize
Though the docs say this should be num_buckets, I think it's much more useful as num_elements. As a special feature, calling with req_elements==0 wil
benchmark/lib/google/sparsehash/sparsehashtable.h:722
↓ 2 callersFunctionrnd
benchmark.cc:628
↓ 2 callersMethodset_position
benchmark/lib/cpp-btree/btree.h:526
↓ 2 callersMethodshrink_size
benchmark/lib/google/sparsehash/hashtable-common.h:97
↓ 2 callersMethodshrink_threshold
benchmark/lib/google/sparsehash/hashtable-common.h:87
↓ 2 callersMethodsize
Return the number of key/data pairs in the B+ tree
benchmark/lib/stx/btree.h:1728
↓ 2 callersMethodsplit
benchmark/lib/cpp-btree/btree.h:1551
↓ 2 callersMethodswap
benchmark/lib/cpp-btree/btree_test.h:306
↓ 2 callersMethodswap
Many STL algorithms use swap instead of copy constructors
benchmark/lib/google/sparsehash/densehashtable.h:734
↓ 2 callersMethodtest_deleted
These are public so the iterators can use them True if the item at position bucknum is "deleted" marker
benchmark/lib/google/sparsehash/densehashtable.h:408
↓ 2 callersMethodtest_empty
These are public so the iterators can use them True if the item at position bucknum is "empty" marker
benchmark/lib/google/sparsehash/densehashtable.h:460
↓ 2 callersFunctiontest_operation
benchmark.cc:2659
↓ 2 callersFunctiontommy_allocator_free
tommyds/tommyalloc.c:135
↓ 2 callersFunctiontommy_array_ref
* Gets a reference of the element at the specified position. * You must be sure that space for this position is already * allocated calling tommy_ar
tommyds/tommyarray.h:88
↓ 2 callersFunctiontommy_arrayblk_get
* Gets the element at the specified position. * You must be sure that space for this position is already * allocated calling tommy_arrayblk_grow().
tommyds/tommyarrayblk.h:113
↓ 2 callersFunctiontommy_arrayblk_ref
* Gets a reference of the element at the specified position. * You must be sure that space for this position is already * allocated calling tommy_ar
tommyds/tommyarrayblk.h:87
↓ 2 callersFunctiontommy_arrayblk_set
* Sets the element at the specified position. * You must be sure that space for this position is already * allocated calling tommy_arrayblk_grow().
tommyds/tommyarrayblk.h:103
↓ 2 callersFunctiontommy_arrayblkof_grow
tommyds/tommyarrayblkof.c:51
↓ 2 callersFunctiontommy_arrayof_grow
tommyds/tommyarrayof.c:59
↓ 2 callersFunctiontommy_chain_merge_degenerated
* Merges two chains managing special degenerated cases. * It's functionally equivalent to tommy_chain_merge() but faster with already ordered chains.
tommyds/tommychain.h:131
↓ 2 callersFunctiontommy_hash_u32
tommyds/tommyhash.c:86
↓ 2 callersFunctiontommy_hash_u64
tommyds/tommyhash.c:135
↓ 2 callersFunctiontommy_hashdyn_memory_usage
tommyds/tommyhashdyn.c:219
↓ 2 callersFunctiontommy_hashdyn_remove_existing
tommyds/tommyhashdyn.c:150
↓ 2 callersFunctiontommy_hashdyn_resize
* Resize the bucket vector. */
tommyds/tommyhashdyn.c:53
↓ 2 callersFunctiontommy_hashdyn_search
* Searches an element in the hashtable. * You have to provide a compare function and the hash of the element you want to find. * If more equal eleme
tommyds/tommyhashdyn.h:223
↓ 2 callersFunctiontommy_hashlin_memory_usage
tommyds/tommyhashlin.c:329
↓ 2 callersFunctiontommy_hashlin_remove_existing
tommyds/tommyhashlin.c:258
↓ 2 callersFunctiontommy_hashlin_search
* Searches an element in the hashtable. * You have to provide a compare function and the hash of the element you want to find. * If more equal eleme
tommyds/tommyhashlin.h:272
↓ 2 callersFunctiontommy_hashtable_memory_usage
tommyds/tommyhashtbl.c:137
↓ 2 callersFunctiontommy_hashtable_remove_existing
tommyds/tommyhashtbl.c:72
↓ 2 callersFunctiontommy_hashtable_search
* Searches an element in the hashtable. * You have to provide a compare function and the hash of the element you want to find. * If more equal eleme
tommyds/tommyhashtbl.h:207
↓ 2 callersFunctiontommy_list_concat
* Concats two lists. * The second list is concatenated at the first list. * \param first The first list. * \param second The second list. After thi
tommyds/tommylist.h:266
↓ 2 callersFunctiontommy_list_tail
* Gets the tail of the list. * \return The tail node. For empty lists 0 is returned. */
tommyds/tommylist.h:132
↓ 2 callersFunctiontommy_strhash_u32
tommyds/tommyhash.c:185
↓ 2 callersFunctiontommy_tree_rotate_left
tommyds/tommytree.c:53
↓ 2 callersFunctiontommy_tree_rotate_right
tommyds/tommytree.c:64
↓ 2 callersFunctiontommy_tree_search
tommyds/tommytree.c:215
↓ 2 callersFunctiontommy_tree_search_compare
tommyds/tommytree.c:225
↓ 2 callersFunctiontommy_tree_search_node
tommyds/tommytree.c:197
↓ 2 callersFunctiontommy_trie_init
tommyds/tommytrie.c:77
↓ 2 callersFunctiontommy_trie_inplace_init
tommyds/tommytrieinp.c:96
↓ 2 callersFunctiontommy_trie_inplace_memory_usage
tommyds/tommytrieinp.c:278
↓ 2 callersFunctiontommy_trie_memory_usage
tommyds/tommytrie.c:330
↓ 2 callersMethodtree
benchmark/lib/cpp-btree/safe_btree.h:87
↓ 2 callersFunctiontrie_bucket_remove_existing
tommyds/tommytrie.c:170
↓ 2 callersFunctiontrie_inplace_bucket_remove
tommyds/tommytrieinp.c:148
↓ 2 callersMethodupper_bound
benchmark/lib/cpp-btree/btree_test.h:206
↓ 2 callersMethodupper_bound
Finds the first element whose key is greater than key.
benchmark/lib/cpp-btree/btree.h:980
↓ 2 callersMethodvalue
benchmark/lib/cpp-btree/btree.h:556
↓ 2 callersFunctionvector_at
benchmark/lib/libdynamic/vector.c:57
↓ 1 callersFunctionClearHashTable
benchmark/lib/google/libchash.c:1178
↓ 1 callersFunctionDenseAllocate
benchmark/lib/google/libchash.c:684
↓ 1 callersFunctionDenseClear
benchmark/lib/google/libchash.c:678
↓ 1 callersFunctionDenseFind
benchmark/lib/google/libchash.c:705
↓ 1 callersFunctionDenseNextBucket
benchmark/lib/google/libchash.c:733
↓ 1 callersFunctionFreeHashTable
benchmark/lib/google/libchash.c:1201
↓ 1 callersFunctionGenerateDigits
benchmark/lib/cpp-btree/btree_test.h:489
↓ 1 callersFunctionHTSetupKeyTrunc
benchmark/lib/google/libchash.c:317
↓ 1 callersFunctionHTscalloc
HTscalloc() -- safe calloc * allocates memory and initializes it to 0, or crashes if * the allocation fails. */
benchmark/lib/google/libchash.c:255
↓ 1 callersFunctionHTsrealloc
HTsrealloc() -- safe calloc * grows the amount of memory from a source, or crashes if * the allocation fails. */
benchmark/lib/google/libchash.c:273
↓ 1 callersFunctionHashFindOrInsert
benchmark/lib/google/libchash.c:1243
↓ 1 callersFunctionHashLoad
benchmark/lib/google/libchash.c:1461
↓ 1 callersMethodRun
benchmark/lib/cpp-btree/btree_bench.cc:133
↓ 1 callersFunctionRunBenchmarks
benchmark/lib/cpp-btree/btree_bench.cc:108
↓ 1 callersFunctionSparseAllocate
benchmark/lib/google/libchash.c:489
↓ 1 callersFunctionSparseFind
benchmark/lib/google/libchash.c:522
↓ 1 callersFunctionSparseIsEmpty
benchmark/lib/google/libchash.c:516
↓ 1 callersFunctionSparseNextBucket
benchmark/lib/google/libchash.c:577
↓ 1 callersMethodStart
benchmark/lib/cpp-btree/btree_bench.cc:115
↓ 1 callersMethodStop
benchmark/lib/cpp-btree/btree_bench.cc:120
↓ 1 callersFunctionallocate
benchmark/lib/google/sparsehash/libc_allocator_with_realloc.h:63
↓ 1 callersFunctionallocator_reset
* Reset the allocator and free all. */
tommyds/tommyalloc.c:61
↓ 1 callersMethodbegin
Iterator routines.
benchmark/lib/cpp-btree/btree_container.h:60
↓ 1 callersMethodbegin
ITERATOR FUNCTIONS
benchmark/lib/google/sparsehash/sparsehashtable.h:372
↓ 1 callersMethodbegin
ITERATOR FUNCTIONS
benchmark/lib/google/sparsehash/densehashtable.h:307
↓ 1 callersMethodbinary_search_compare_to
benchmark/lib/cpp-btree/btree.h:641
↓ 1 callersMethodbucket_count
benchmark/lib/google/sparsehash/sparsehashtable.h:549
↓ 1 callersMethodbucket_count
benchmark/lib/google/sparsehash/densehashtable.h:508
↓ 1 callersFunctionbuffer_capacity
benchmark/lib/libdynamic/buffer.c:46
↓ 1 callersFunctionbuffer_compact
benchmark/lib/libdynamic/buffer.c:65
↓ 1 callersFunctionbuffer_insert_fill
benchmark/lib/libdynamic/buffer.c:90
↓ 1 callersFunctionbuffer_roundup
benchmark/lib/libdynamic/buffer.c:7
← previousnext →201–300 of 1,190, ranked by callers