MCPcopy Create free account

hub / github.com/amadvance/tommyds / functions

Functions1,190 in github.com/amadvance/tommyds

⨍ Functions 1,190◇ Types & classes 265
↓ 4 callersMethodshrink_factor
benchmark/lib/google/sparsehash/hashtable-common.h:74
↓ 4 callersMethodsize
benchmark/lib/google/sparsehash/sparsehashtable.h:546
↓ 4 callersFunctionsort
benchmark/lib/judyarray/judy64na.c:1648
↓ 4 callersFunctiontommy_array_set
* Sets the element at the specified position. * You must be sure that space for this position is already * allocated calling tommy_array_grow(). */
tommyds/tommyarray.h:105
↓ 4 callersFunctiontommy_chain_concat
* Concatenates two chains. * \param first_tail Tail of the first chain. * \param second_head Head of the second chain. */
tommyds/tommychain.h:80
↓ 4 callersFunctiontommy_hashlin_done
tommyds/tommyhashlin.c:75
↓ 4 callersFunctiontommy_hashlin_init
tommyds/tommyhashlin.c:57
↓ 4 callersFunctiontommy_hashtable_done
tommyds/tommyhashtbl.c:56
↓ 4 callersFunctiontommy_hashtable_init
tommyds/tommyhashtbl.c:36
↓ 4 callersFunctiontommy_list_insert_tail_not_empty
\internal * Inserts an element at the tail of a non-empty list. * The element is inserted at the tail of the list. The list cannot be empty. * \par
tommyds/tommylist.h:184
↓ 4 callersFunctiontommy_tree_insert
tommyds/tommytree.c:141
↓ 4 callersFunctiontommy_trie_inplace_insert
tommyds/tommytrieinp.c:127
↓ 4 callersFunctiontommy_trie_inplace_remove
tommyds/tommytrieinp.c:218
↓ 4 callersFunctiontommy_trie_inplace_search
* Searches an element in the trie. * You have to provide the key of the element you want to find. * If more elements with the same key are present,
tommyds/tommytrieinp.h:217
↓ 4 callersFunctiontommy_trie_insert
tommyds/tommytrie.c:153
↓ 3 callersFunctionAllocateHashTable
benchmark/lib/google/libchash.c:1159
↓ 3 callersFunctionDenseIsEmpty
benchmark/lib/google/libchash.c:700
↓ 3 callersFunctionFind
benchmark/lib/google/libchash.c:1011
↓ 3 callersFunctionHashFirstBucket
benchmark/lib/google/libchash.c:1285
↓ 3 callersFunctionHashInsert
benchmark/lib/google/libchash.c:1254
↓ 3 callersFunctionHashNextBucket
benchmark/lib/google/libchash.c:1296
↓ 3 callersFunctionbtree_compare_keys
benchmark/lib/cpp-btree/btree.h:263
↓ 3 callersFunctionbuffer_data
benchmark/lib/libdynamic/buffer.c:117
↓ 3 callersFunctionbuffer_insert
benchmark/lib/libdynamic/buffer.c:81
↓ 3 callersFunctionbuffer_reserve
benchmark/lib/libdynamic/buffer.c:51
↓ 3 callersFunctionbuffer_size
benchmark/lib/libdynamic/buffer.c:41
↓ 3 callersMethodequal_range
benchmark/lib/cpp-btree/btree_test.h:212
↓ 3 callersMethodinc_num_ht_copies
benchmark/lib/google/sparsehash/hashtable-common.h:125
↓ 3 callersMethodinsert2
Attempt to insert a key/data pair into the B+ tree. This function is the same as the other insert, however if key_type == data_type then the non-templ
benchmark/lib/stx/btree_map.h:490
↓ 3 callersMethodinsert2
Attempt to insert a key/data pair into the B+ tree. This function is the same as the other insert, however if key_type == data_type then the non-templ
benchmark/lib/stx/btree_multimap.h:490
↓ 3 callersMethodinsert_multi
benchmark/lib/cpp-btree/btree.h:1799
↓ 3 callersMethodinternal_btree
Access to the underlying btree.
benchmark/lib/cpp-btree/safe_btree.h:349
↓ 3 callersFunctionis_listed
* If the data structure should be in the graph, even if with no data. * It allows to have equal graphs also if in some platforms a data structure is
benchmark.cc:798
↓ 3 callersMethodis_root
Getter for whether the node is the root of the tree. The parent of the root of the tree is the leftmost node in the tree which is guaranteed to be a l
benchmark/lib/cpp-btree/btree.h:538
↓ 3 callersMethodlower_bound
Finds the first element whose key is not less than key.
benchmark/lib/cpp-btree/btree.h:970
↓ 3 callersFunctionmap_at
benchmark/lib/libdynamic/map.c:110
↓ 3 callersFunctionmap_insert
benchmark/lib/libdynamic/map.c:128
↓ 3 callersFunctionmap_rehash
benchmark/lib/libdynamic/map.c:45
↓ 3 callersFunctionnedtriebitscanr
benchmark/lib/nedtries/nedtrie.h:132
↓ 3 callersFunctionsink
benchmark/lib/cpp-btree/btree_bench.cc:162
↓ 3 callersMethodsize
benchmark/lib/google/sparsehash/densehashtable.h:505
↓ 3 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/sparsehashtable.h:493
↓ 3 callersFunctiontommy_allocator_alloc
tommyds/tommyalloc.c:81
↓ 3 callersFunctiontommy_array_done
tommyds/tommyarray.c:47
↓ 3 callersFunctiontommy_array_init
tommyds/tommyarray.c:33
↓ 3 callersFunctiontommy_array_memory_usage
tommyds/tommyarray.c:79
↓ 3 callersFunctiontommy_arrayblk_grow
tommyds/tommyarrayblk.c:50
↓ 3 callersFunctiontommy_arrayblkof_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/tommyarrayblkof.h:89
↓ 3 callersFunctiontommy_arrayof_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/tommyarrayof.h:96
↓ 3 callersFunctiontommy_hashdyn_done
tommyds/tommyhashdyn.c:45
↓ 3 callersFunctiontommy_hashdyn_init
tommyds/tommyhashdyn.c:34
↓ 3 callersFunctiontommy_hashlin_stable
* Set the hashtable in stable state. */
tommyds/tommyhashlin.c:46
↓ 3 callersFunctiontommy_haszero_u32
* Check if the specified word has a byte at 0. * \return 0 or 1. */
tommyds/tommytypes.h:515
↓ 3 callersFunctiontommy_tree_delta
tommyds/tommytree.c:42
↓ 3 callersFunctiontommy_tree_remove
tommyds/tommytree.c:183
↓ 3 callersFunctiontommy_tree_remove_existing
tommyds/tommytree.c:235
↓ 3 callersFunctiontommy_trie_inplace_remove_existing
tommyds/tommytrieinp.c:238
↓ 3 callersFunctiontommy_trie_remove_existing
tommyds/tommytrie.c:275
↓ 3 callersMethodvalue_destroy
benchmark/lib/cpp-btree/btree.h:725
↓ 3 callersMethodvalue_init
benchmark/lib/cpp-btree/btree.h:719
↓ 3 callersFunctionvector_size
benchmark/lib/libdynamic/vector.c:30
↓ 2 callersFunctionDelete
benchmark/lib/google/libchash.c:1117
↓ 2 callersFunctionHash
benchmark/lib/google/libchash.c:886
↓ 2 callersFunctionHashDeleteLast
benchmark/lib/google/libchash.c:1269
↓ 2 callersFunctionHashDoLoad
benchmark/lib/google/libchash.c:1402
↓ 2 callersFunctionInsert
benchmark/lib/google/libchash.c:1072
↓ 2 callersFunctionNextPow2
benchmark/lib/google/libchash.c:1063
↓ 2 callersFunctionRehash
benchmark/lib/google/libchash.c:960
↓ 2 callersMethodbegin
Constructs a read/data-write iterator that points to the first slot in the first leaf of the B+ tree.
benchmark/lib/stx/btree.h:1573
↓ 2 callersMethodbinary_search_plain_compare
benchmark/lib/cpp-btree/btree.h:625
↓ 2 callersFunctionbuffer_assert
benchmark/lib/libdynamic/buffer.c:21
↓ 2 callersFunctionbuffer_clear
benchmark/lib/libdynamic/buffer.c:109
↓ 2 callersFunctionbuffer_construct
benchmark/lib/libdynamic/buffer.c:29
↓ 2 callersFunctionbuffer_erase
benchmark/lib/libdynamic/buffer.c:103
↓ 2 callersFunctiondel_key
benchmark/lib/cube/binary-search-tesseract-1.0.c:215
↓ 2 callersMethoddestructive_end
benchmark/lib/google/sparsehash/sparsehashtable.h:420
↓ 2 callersMethodempty
benchmark/lib/google/sparsehash/densehashtable.h:507
↓ 2 callersMethodend
benchmark/lib/cpp-btree/safe_btree.h:215
↓ 2 callersMethodend
benchmark/lib/google/sparsehash/sparsehashtable.h:374
↓ 2 callersMethodend
benchmark/lib/google/sparsehash/densehashtable.h:309
↓ 2 callersMethodenlarge_factor
benchmark/lib/google/sparsehash/hashtable-common.h:68
↓ 2 callersMethodenlarge_threshold
benchmark/lib/google/sparsehash/hashtable-common.h:81
↓ 2 callersMethoderase
Deletion routines.
benchmark/lib/cpp-btree/btree_container.h:334
↓ 2 callersMethodfill
Fill the struct with the current B+ tree's properties, itemcount is not filled.
benchmark/lib/stx/btree.h:3807
↓ 2 callersFunctionfind_index
benchmark/lib/cube/binary-search-tesseract-1.0.c:83
↓ 2 callersFunctionfind_key
benchmark/lib/cube/binary-search-tesseract-1.0.c:453
↓ 2 callersMethodfind_multi
benchmark/lib/cpp-btree/btree.h:1073
↓ 2 callersMethodfind_unique
Finds the iterator corresponding to a key or returns end() if the key is not present.
benchmark/lib/cpp-btree/btree.h:1065
↓ 2 callersMethodfullness
benchmark/lib/cpp-btree/btree_test.h:370
↓ 2 callersMethodget_allocator
benchmark/lib/google/sparsehash/sparsehashtable.h:429
↓ 2 callersMethodget_allocator
Return the base node allocator provided during construction.
benchmark/lib/stx/btree.h:1445
↓ 2 callersFunctionget_micros
benchmark/lib/cpp-btree/btree_bench.cc:78
↓ 2 callersFunctionhashdyn_shrink_step
* Shrink. */
tommyds/tommyhashdyn.c:130
↓ 2 callersFunctionhashlin_shrink_step
* Shrink one step. */
tommyds/tommyhashlin.c:180
↓ 2 callersMethodincrement_by
benchmark/lib/cpp-btree/btree.h:1688
↓ 2 callersMethodinitialize
Delayed initialisation of constructed node
benchmark/lib/stx/btree.h:265
↓ 2 callersMethodinsert_value
benchmark/lib/cpp-btree/btree.h:1422
↓ 2 callersFunctionis_select
* If the data structure should be measured. */
benchmark.cc:809
↓ 2 callersFunctionjudy_data
benchmark/lib/judyarray/judy64na.c:354
↓ 2 callersFunctionjudy_key
benchmark/lib/judyarray/judy64na.c:425
← previousnext →101–200 of 1,190, ranked by callers