MCPcopy Create free account

hub / github.com/consistent-milk12/masstree / functions

Functions2,313 in github.com/consistent-milk12/masstree

↓ 16 callersMethodas_mut
(&self)
src/suffix.rs:556
↓ 16 callersMethodclear
(&self, slot: usize)
src/suffix/inline.rs:472
↓ 16 callersMethodor_insert
(self, default: P::Value)
src/tree/generic/entry.rs:126
↓ 16 callersMethodpop
(&mut self)
src/tree/range/scan_state.rs:430
↓ 16 callersMethodprev
(ki: isize)
src/tree/range/helper.rs:290
↓ 16 callersMethodscan
Scan a range with a visitor callback. Return `false` to stop early. More efficient than the iterator API when you don't need to own keys (avoids `Vec
src/tree/range/api.rs:183
↓ 16 callersMethodwriteln_prefixed
(&mut self, text: &str)
src/tree/generic/print.rs:110
↓ 15 callersMethodcurrent_len
(&self)
src/tree/range/cursor_key.rs:187
↓ 15 callersMethodinsert
(&self)
examples/url_cache.rs:94
↓ 15 callersMethodksuf
(&self, slot: usize)
src/leaf15.rs:502
↓ 15 callersFunctionsetup_tree
(keys: &[[u8; KEY_SIZE]])
benches/concurrent_read_write_general.rs:116
↓ 15 callersMethodvalue
(&self)
src/tree/range/iterator/scan_entry.rs:46
↓ 14 callersMethodikey
(&self, slot: usize)
src/leaf15.rs:770
↓ 14 callersMethodinitialized
(self)
src/tree/range/iterator/iter_flags.rs:57
↓ 14 callersMethodload
(&self, slot: usize)
src/policy/inline_values.rs:81
↓ 14 callersMethodparent_unguarded
(&self)
src/leaf15.rs:1278
↓ 14 callersMethodset_root
(&mut self, root: *const u8)
src/tree/range/scan_state.rs:273
↓ 14 callersMethodstore
(&self, slot: usize, output: &V)
src/policy/inline_values.rs:96
↓ 13 callersMethodget_ref
( &self, key: &[u8], guard: &'g LocalGuard<'_>, )
src/tree/generic/optimistic_reads.rs:871
↓ 13 callersMethodis_leaf
(&self)
src/nodeversion.rs:232
↓ 13 callersMethodis_value_empty_relaxed
(&self, slot: usize)
src/leaf15.rs:373
↓ 13 callersMethodmark_root
(&self)
src/nodeversion.rs:626
↓ 13 callersMethodprefetch_value
(&self, slot: usize)
src/leaf15.rs:334
↓ 12 callersMethoddeleted_layer
(&self)
src/leaf15.rs:1328
↓ 12 callersMethodget
Get a cached response, returning None if not found or expired If an expired entry is found, it is removed lazily (on-access cleanup).
examples/url_cache.rs:142
↓ 12 callersMethodlen
(&self)
src/tree/generic/batch.rs:347
↓ 12 callersMethodprefetch_for_search_adaptive
(&self, size: usize)
src/leaf15.rs:858
↓ 12 callersMethodremove
(&mut self, i: usize)
src/permuter.rs:337
↓ 12 callersMethodset_keylenx
(&self, slot: usize, keylenx: u8)
src/leaf15.rs:912
↓ 12 callersMethodset_ki
(&mut self, ki: usize)
src/tree/range/scan_state.rs:300
↓ 12 callersMethodsuffix
(&self)
src/tree/range/cursor_key.rs:167
↓ 11 callersMethodalloc_leaf_direct
(&self, is_root: bool, is_layer_root: bool)
src/alloc15.rs:233
↓ 11 callersMethodback_exhausted
(&self)
src/tree/range/iterator.rs:268
↓ 11 callersMethodcreate_session
Create a new session for a user
examples/session_store.rs:155
↓ 11 callersMethodis_empty
(&self)
src/tree/range/scan_state.rs:445
↓ 11 callersMethodkey
(&self)
src/tree/range/iterator/scan_entry.rs:40
↓ 11 callersMethodkeylenx
(&self, slot: usize)
src/leaf15.rs:886
↓ 11 callersMethodprefetch_for_search
(&self)
src/leaf15.rs:842
↓ 11 callersMethodpush
(&mut self, ptr: *mut u8)
src/tree/generic/batch.rs:39
↓ 11 callersMethodset_last_ikey
(&mut self, ikey: u64)
src/tree/range/scan_state.rs:312
↓ 11 callersFunctionsetup_indexset
(keys: &[[u8; KEY_SIZE]])
benches/concurrent_read_write.rs:141
↓ 11 callersFunctionsetup_masstree15
(keys: &[[u8; KEY_SIZE]])
benches/concurrent_read_write_masstree.rs:39
↓ 11 callersFunctionsetup_masstree15
(keys: &[[u8; KEY_SIZE]])
benches/concurrent_read_write.rs:118
↓ 11 callersFunctionsetup_skipmap
(keys: &[[u8; KEY_SIZE]])
benches/concurrent_read_write_general.rs:162
↓ 11 callersFunctionsetup_skipmap
(keys: &[[u8; KEY_SIZE]])
benches/concurrent_read_write.rs:131
↓ 11 callersFunctionsetup_tree_index
(keys: &[[u8; KEY_SIZE]])
benches/concurrent_read_write_general.rs:129
↓ 11 callersFunctionsetup_tree_index
(keys: &[[u8; KEY_SIZE]])
benches/concurrent_read_write.rs:151
↓ 11 callersMethodsize
(&self)
src/leaf15.rs:1032
↓ 11 callersMethodunshift
(&mut self)
src/tree/range/cursor_key.rs:271
↓ 11 callersMethodunshift_all
(&mut self)
src/key.rs:221
↓ 10 callersMethodclear
(&self, slot: usize)
src/policy/box_values.rs:343
↓ 10 callersMethodclear_upper_bound
(&mut self)
src/tree/range/iterator/iter_flags.rs:265
↓ 10 callersMethodcompact
(&mut self, active_slots: impl Iterator<Item = usize>)
src/suffix/compact.rs:93
↓ 10 callersMethodcurrent_ikey
(&self)
src/tree/range/cursor_key.rs:131
↓ 10 callersMethoddebug_assert_valid
(&self)
src/permuter.rs:439
↓ 10 callersMethodis_empty
(&self)
src/leaf15.rs:1039
↓ 10 callersMethodload_value
(&self, slot: usize)
src/leaf15.rs:257
↓ 10 callersMethodlock
(&self)
src/nodeversion.rs:485
↓ 10 callersMethodnext_raw
(&self, guard: &impl Guard)
src/leaf15.rs:1076
↓ 10 callersMethodrange_forward
Forward-only range iterator (skips ~300 bytes of backward state init).
src/tree/range/api.rs:58
↓ 10 callersMethodremove
Remove a key from the tree. Returns an owned clone of the removed value if the key existed. The internal EBR guard is released before returning, so t
src/tree/generic.rs:790
↓ 10 callersMethodrequire_duplicate_check
(&mut self)
src/tree/range/iterator/iter_flags.rs:122
↓ 10 callersMethodset_ikey
(&self, idx: usize, key: u64)
src/internode/loom_tests.rs:36
↓ 10 callersFunctionshuffled_write_decisions
Generate a shuffled array of operation types (true = write, false = read).
benches/concurrent_read_write_masstree.rs:53
↓ 9 callersMethodchild_unguarded
(&self, i: usize)
src/internode/accessors.rs:159
↓ 9 callersMethodcount
(&self)
src/suffix/inline.rs:199
↓ 9 callersMethoddelta_net
(&self, before: &MemSnapshot)
benches/memory_total.rs:98
↓ 9 callersMethodget
(&self, slot: usize)
src/suffix/inline.rs:345
↓ 9 callersMethodget_leaf_ptr
(&self)
src/tree/range/scan_state.rs:690
↓ 9 callersMethodkey
(&self)
src/tree/generic/entry.rs:105
↓ 9 callersMethodlen
(&self)
src/tree/coalesce.rs:165
↓ 9 callersMethodneeds_duplicate_check
(self)
src/tree/range/iterator/iter_flags.rs:67
↓ 9 callersMethodscan_batch_ref
Batch scan with zero-copy references and reduced dispatch overhead. Eliminates `match state {}` dispatch per entry vs [`scan_ref`](Self::scan_ref), i
src/tree/range/api_ref.rs:81
↓ 9 callersMethodset_permutation_relaxed
(&self, perm: Permuter15)
src/leaf15.rs:1001
↓ 9 callersFunctionsetup_masstree
(n: usize)
benches/tail_latency.rs:69
↓ 9 callersFunctionsetup_skipmap
(n: usize)
benches/tail_latency.rs:84
↓ 9 callersFunctionsetup_tree_index
(n: usize)
benches/tail_latency.rs:106
↓ 9 callersMethodused
(&self)
src/suffix/inline.rs:185
↓ 8 callersMethodassign
Assign suffix metadata (writer operation - requires lock).
src/inline/loom_tests.rs:56
↓ 8 callersMethodassign_from_key
( &self, slot: usize, key: &Key<'_>, value: Option<P::Output>, guard:
src/leaf15.rs:2373
↓ 8 callersMethodback_initialized
(&self)
src/tree/range/iterator.rs:277
↓ 8 callersFunctionbucket_layout
(nl: usize)
src/node_pool.rs:70
↓ 8 callersMethodcheck_blink_chain
( &self, leaf: &LeafNode15<P>, target_ikey: u64, guard: &LocalGuard<'_>, )
src/tree/generic/optimistic_reads.rs:302
↓ 8 callersMethodclear_duplicate_check
(&mut self)
src/tree/range/iterator/iter_flags.rs:116
↓ 8 callersMethodfor_each_intra_leaf_batch
(mut self, mut visitor: F)
src/tree/range/iterator/batch_forward.rs:256
↓ 8 callersMethodget_meta
Get slot metadata (reader operation). Returns (offset, len) or None if empty.
src/inline/loom_tests.rs:43
↓ 8 callersMethodhash
(&self, state: &mut H)
src/policy.rs:123
↓ 8 callersMethodinitialize
Initialize the iterator (lazy initialization on first `next()` call).
src/tree/range/iterator.rs:299
↓ 8 callersMethodnext
(&mut self)
src/tree/range/scan_state.rs:318
↓ 8 callersFunctionpin_thread
Pin current thread to a specific core (if pinning is enabled)
benches/mttest.rs:101
↓ 8 callersMethodprev_unguarded
(&self)
src/leaf15.rs:1242
↓ 8 callersFunctionprint_results
(test: &str, threads: usize, results: &[ThreadResult])
benches/mttest.rs:420
↓ 8 callersFunctionreset_timeout
Reset timeout flag and increment generation before each benchmark. This invalidates any timer threads from previous benchmarks.
benches/mttest.rs:63
↓ 8 callersMethodscan_ref
Scan a range with zero-copy `&V` references. Eliminates 2 atomic ops per entry vs [`Self::scan`] (no Arc increment). Value references are only valid
src/tree/range/api_ref.rs:53
↓ 8 callersMethodset_permutation
(&self, perm: Permuter15)
src/leaf15.rs:995
↓ 8 callersFunctionshould_stop
(op_count: u64)
benches/mttest.rs:77
↓ 8 callersFunctionstart_timeout_timer
Spawn a timer thread that sets the timeout flag after `duration`. Uses generation-based invalidation to prevent stale timers from affecting later benc
benches/mttest.rs:85
↓ 8 callersMethodteardown_tree
(&self, root_ptr: *mut u8)
src/alloc15.rs:223
↓ 8 callersFunctionthread_seed
Generate divergent seed for thread t to avoid correlation. Uses multiplicative hashing to spread seeds across the space.
benches/range_masstree15.rs:45
↓ 8 callersFunctiontree_index_upsert_sync
TreeIndex upsert emulation via remove-then-reinsert.
benches/concurrent_read_write.rs:95
← previousnext →101–200 of 2,313, ranked by callers