Functions — github.com/Lagrang/bztree-rs

CodeHub MCPcopy Create free account

hub / github.com/Lagrang/bztree-rs / functions

Functions249 in github.com/Lagrang/bztree-rs

⨍ Functions 249◇ Types & classes 34

↓ 1 callersMethodconditional_get

( &'g self, key: &Q, status_word: &StatusWord, guard: &'g Guard, )

src/node/mod.rs:272

↓ 1 callersMethodexact_len

(&self, guard: &Guard)

src/node/mod.rs:706

↓ 1 callersMethodfind_edge_node

Return leaf node which contains max known key of the tree. Also return key in parent node which points to this leaf(or `None` if this is root node).

src/lib.rs:1447

↓ 1 callersMethodget_siblings

Get left and right siblings for entry identified by key. Warning**: this method can be called only for **read-only** nodes, it ignores any updates ma

src/node/mod.rs:339

↓ 1 callersMethodinsert_pos_inf_node

When interim node doesn't contains +Inf node and client tries to insert key which is greater than any other key in the tree, we should update interim'

src/lib.rs:1402

↓ 1 callersMethodmerge_root

(&self, root_ptr: &NodePointer<K, V>, guard: &Guard)

↓ 1 callersMethodmerge_with_interim

( &self, other: &Self, merged_node_capacity: usize, guard: &Guard, )

src/node/mod.rs:612

↓ 1 callersMethodmerge_with_sibling

Merge node with one of it's sibling if possible.

↓ 1 callersMethodnext_leaf

src/scanner.rs:81

↓ 1 callersMethodnext_leaf_rev

src/scanner.rs:123

↓ 1 callersMethodpeek_next_back

src/node/scanner.rs:115

↓ 1 callersMethodpoints_to_leaf

(&self, node_ptr: &LeafNode<K, V>)

src/lib.rs:1659

↓ 1 callersMethodremaining_capacity

(&self, guard: &Guard)

src/node/mod.rs:692

↓ 1 callersMethodremove_empty_parent

Method will remove parent node from grandparent. Method suppose that underutilized parent contains only 1 link to child node and this child is empty.

↓ 1 callersMethodsize_hint

src/node/scanner.rs:140

↓ 1 callersMethodsplit_root

(&self, root: &NodePointer<K, V>, guard: &Guard)

src/lib.rs:1136

↓ 1 callersMethodstatus_word

src/node/mod.rs:714

↓ 1 callersMethodto_leaf_node

src/lib.rs:1675

↓ 1 callersMethodtry_split

Try split passed node. If node requires split of it's parents, method return new split context with parent node as split node.

src/lib.rs:1040

↓ 1 callersMethodtry_split_node

( &self, node: &NodePointer<K, V>, overflow_node_key: &Key<K>, parent_node: &I

src/lib.rs:1209

↓ 1 callersMethodunfroze

src/node/status_word.rs:36

Functionadd_and_delete

tests/concurrent.rs:279

Functionall_operations_combinations

tests/single_threaded.rs:420

Functionbackward_delete

src/lib.rs:1979

(mut ops: Ops<K, V>)

tests/history_verifier.rs:34

Methodborrow_mut

src/node/status_word.rs:165

Functioncheck_kv_drop

tests/single_threaded.rs:522

Functioncombined_inserts_and_upserts

tests/single_threaded.rs:157

Functioncompact_node

src/node/mod.rs:1354

Functioncompute_with_value_delete

tests/concurrent.rs:720

Functioncompute_with_value_update

tests/concurrent.rs:672

Functionconcurrent

(c: &mut Criterion)

benches/bztree_bench.rs:11

Functionconditional_insert

src/lib.rs:2577

Functionconditional_op_combinations

tests/single_threaded.rs:467

Functionconditional_remove

src/lib.rs:2604

Functioncreate_deleted_metadata

src/node/mod.rs:1831

Functioncreate_empty_status_word

src/node/status_word.rs:187

Functioncreate_filled_status_word

src/node/status_word.rs:195

Functioncreate_reserved_metadata

src/node/mod.rs:1815

Functioncreate_visible_metadata

src/node/mod.rs:1823

src/lib.rs:1480

Functiondelete_from_midpoint

src/lib.rs:2014

Functiondelete_keys

src/node/mod.rs:1277

Functiondelete_non_existing_keys

src/node/mod.rs:1303

Functiondelete_to_midpoint

src/lib.rs:2064

src/node/metadata.rs:30

Functiondeletes_at_random_positions

tests/single_threaded.rs:227

Functiondeletes_starting_from_tree_end

tests/single_threaded.rs:204

Functiondeletes_starting_from_tree_start

tests/single_threaded.rs:181

Methodderef_mut

src/lib.rs:1537

src/node/mod.rs:1010

tests/single_threaded.rs:717

(&self, other: &Key<Q>)

src/lib.rs:1774

(&self, other: &Self)

tests/single_threaded.rs:705

src/lib.rs:2475

(&'g self, guard: &'g Guard)

(&self, f: &mut Formatter<'_>)

src/lib.rs:2648

(&self, f: &mut Formatter<'_>)

src/node/mod.rs:1037

(&self, f: &mut Formatter<'_>)

src/node/status_word.rs:95

(&self, f: &mut Formatter<'_>)

tests/single_threaded.rs:744

Functionforward_delete

src/lib.rs:1927

Functionforward_scan

src/lib.rs:2114

src/scanner.rs:296

(node: InterimNodeRef<K, V>)

src/lib.rs:1640

src/node/metadata.rs:60

(status_word: &StatusWord)

src/node/status_word.rs:22

(ops: &Ops<K, V>)

tests/history_verifier.rs:30

Methodfrom_leaf_root

(root: &'g LeafNode<K, V>, key_range: Range, guard: &'g Guard)

src/scanner.rs:29

Methodfrom_non_leaf_root

( root: &'g InterimNode<K, V>, key_range: Range, guard: &'g Guard, )

src/scanner.rs:52

(&self, state: &mut H)

tests/single_threaded.rs:711

Methodinit_with_capacity

(mut sorted_elements: Vec<(K, V)>, capacity: u16)

src/node/mod.rs:73

Functioninsert_and_search

src/node/mod.rs:1213

Functioninsert_existing_key

src/node/mod.rs:1247

Functioninsert_full_nodess

src/lib.rs:1829

Functioninsert_min_sized_node

src/lib.rs:1807

Functioninsert_of_non_overlaping_keys_and_search

tests/concurrent.rs:39

Methodintersects

(range: &(Bound<&Key<K>>, Bound<&Key<K>>), intersects_with: &KeyRange<K>)

src/scanner.rs:174

src/node/mod.rs:1643

tests/single_threaded.rs:332

Functioniter_on_empty_sorted_space

src/node/mod.rs:1706

Functioniter_on_empty_unsorted_space

src/node/mod.rs:1734

Functioniter_reverted

src/node/mod.rs:1675

Functionkey_search

tests/concurrent.rs:338

src/lib.rs:2503

Functionliveness

tests/concurrent.rs:772

Functionmake_frozen

src/node/status_word.rs:217

Functionmerge_nodes

src/node/mod.rs:1393

Functionmin_sized_node_inserts

tests/single_threaded.rs:101

Functionmixed_scan

src/lib.rs:2268

Functionmixed_scan

tests/single_threaded.rs:382

Functionmixed_scan_on_root_node

src/lib.rs:2307

Create new tree with default node size.

( status_word: &StatusWord, node: &'a Node<K, V>, key_range: impl RangeBounds<Q>,

src/node/scanner.rs:21

src/node/mod.rs:1843

src/node/status_word.rs:109

(ref_cnt: &AtomicUsize)

tests/single_threaded.rs:672

tests/history_verifier.rs:145

Methodnew_interim

(node: InterimNode<K, V>)

src/lib.rs:1653

(node: LeafNode<K, V>)

src/lib.rs:1647

Methodnew_parent

( parent_node: &InterimNode<K, V>, overflow_node_key: &Key<K>, left_key: K

src/lib.rs:1218

← previous next →101–200 of 249, ranked by callers