Functions — github.com/Lagrang/bztree-rs

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

Functions249 in github.com/Lagrang/bztree-rs

Insert key-value pair to tree if no elements with same key already exists. # Return Returns true if key-value pair successfully inserted, otherwise fa

src/lib.rs:142

↓ 87 callersMethodclone

(&self)

src/lib.rs:1543

↓ 68 callersMethodclone

(&self)

tests/single_threaded.rs:682

↓ 48 callersMethodinsert

(&mut self, key: K, value: V, start: Instant)

tests/history_verifier.rs:151

↓ 47 callersMethodrange

Create tree range scanner which will return values whose keys is in passed range. Visibility of changes made in tree during scan, described in [BzTre

src/lib.rs:309

↓ 37 callersMethoditer

Create iterator through all key-values of tree. Iterator based on tree range scanner and have same changes visibility guarantees. # Examples ``` use

src/lib.rs:342

↓ 34 callersMethoditer

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

src/node/mod.rs:385

↓ 33 callersMethodinsert

(&'g self, key: K, value: V, guard: &'g Guard)

src/node/mod.rs:109

↓ 28 callersFunctioncheck_scan

(node: &Node<T, T>, range: R, expected_size: usize)

src/node/mod.rs:1796

↓ 28 callersMethodstatus_word

(&self)

src/lib.rs:1710

↓ 24 callersMethodupsert

Insert key-value pair if not already exists, otherwise replace value of existing element. # Return Returns value previously associated with same key o

src/lib.rs:190

↓ 23 callersMethoddelete

(&mut self, key: K, start: Instant)

tests/history_verifier.rs:159

↓ 22 callersMethodget

Get value associated with key. # Examples ``` use bztree::BzTree; let tree = BzTree::new(); let guard = crossbeam_epoch::pin(); let key = "key".to_

src/lib.rs:279

↓ 22 callersMethodkey

(&self)

src/node/mod.rs:1074

↓ 21 callersMethodexec

(self, guard: &Guard)

src/lib.rs:1611

↓ 19 callersMethodestimated_len

(&self, guard: &Guard)

src/node/mod.rs:700

↓ 19 callersMethodlen

(&self, guard: &Guard)

src/lib.rs:1683

↓ 18 callersMethoddelete

Delete value associated with key. # Return Returns removed value if key found in tree. # Examples ``` use bztree::BzTree; let tree = BzTree::new();

src/lib.rs:239

↓ 18 callersMethodis_frozen

Node frozen and cannot be changed

src/node/status_word.rs:71

↓ 18 callersMethodlen

(&self)

src/node/scanner.rs:171

↓ 18 callersMethodrange

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

src/node/mod.rs:376

↓ 17 callersMethoddelete

Remove value associated with passed key. ## Return: Value associated with removed key

src/node/mod.rs:164

↓ 17 callersMethodnode

(&self)

src/lib.rs:1793

↓ 17 callersMethodreserved_records

How many records was reserved(but may be not used for KVs) in node

src/node/status_word.rs:76

↓ 16 callersMethodborrow

(&self)

tests/single_threaded.rs:730

↓ 15 callersMethodbuild

(&mut self)

src/node/status_word.rs:141

↓ 14 callersMethodnext

(&mut self)

src/scanner.rs:205

↓ 13 callersMethodcmp

(&self, other: &Self)

src/lib.rs:1741

↓ 13 callersFunctiontest

(tree_creator: TreeSupplier, test: F)

tests/concurrent.rs:20

↓ 13 callersMethodupsert

Upsert value associated with passed key. ## Return: Previous value associated with key, if it exists.

src/node/mod.rs:126

↓ 12 callersMethodadd

(&mut self, node: NodePointer<K, V>)

src/lib.rs:1607

↓ 12 callersMethodnext

(&mut self)

src/node/scanner.rs:129

↓ 12 callersMethodvalue

(&self)

src/node/mod.rs:1082

↓ 11 callersMethodis_visible

(&self)

src/node/metadata.rs:44

↓ 11 callersMethodmerge

(mut self, other: Self)

tests/history_verifier.rs:167

↓ 11 callersMethodtry_unfroze

(&self, guard: &Guard)

src/lib.rs:1702

↓ 10 callersMethodborrow

(&self)

src/node/status_word.rs:159

↓ 9 callersMethodfroze

(&self)

src/node/status_word.rs:32

↓ 9 callersMethodrun_check

(&'h self, observed_val_by_key: F)

tests/history_verifier.rs:61

↓ 8 callersMethodrun_scanner_check

(&'h self, scanner: F)

tests/history_verifier.rs:108

↓ 7 callersFunctioncreate_str_node

(max_elements: u16)

src/node/mod.rs:1204

↓ 7 callersMethodinc_version

(&self)

src/node/status_word.rs:40

↓ 7 callersMethodpop

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

src/lib.rs:430

↓ 7 callersMethodtry_froze

(&self, guard: &Guard)

src/node/mod.rs:719

↓ 7 callersMethodversion

Return "version" of this node. Each change to node increase version. When number of changes overflows `u16` type, version reset to 0. This field used

src/node/status_word.rs:89

↓ 6 callersMethodlast

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

src/lib.rs:382

↓ 5 callersMethodclear

(&mut self)

src/scanner.rs:22

↓ 5 callersMethodclone_content

Clone all KVs of this node.

src/node/mod.rs:663

↓ 5 callersMethoddelete_entry

(&self)

src/node/status_word.rs:58

↓ 5 callersMethoddelete_records

(&mut self, size: u16)

src/node/status_word.rs:135

↓ 5 callersMethodfind_leaf_for_key

Find leaf node which can contain passed key

src/lib.rs:1308

↓ 5 callersMethodfind_path_to_key

Find leaf node(with traversal path from root) which can contain passed key. If no node exists which can contain passed key, it can be created using `c

src/lib.rs:1343

↓ 5 callersMethodget_internal

( &'g self, key: &Q, status_word: &StatusWord, await_reserved_entries: bool,

src/node/mod.rs:740

↓ 5 callersMethodlast_kv

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

src/node/mod.rs:505

↓ 5 callersFunctionmax

()

src/node/mod.rs:1773

↓ 5 callersMethodshould_merge

(&self, node_size: usize)

src/lib.rs:604

↓ 5 callersMethodsplit_leaf

(&self, path_to_leaf: TraversePath<K, V>, guard: &Guard)

src/lib.rs:1029

↓ 4 callersMethodcompute

Update or delete element with passed key using conditional logic. Function `F` accepts current value of key and based on it, produces new value. If `

src/lib.rs:512

↓ 4 callersMethodend_bound

(&self)

src/scanner.rs:338

↓ 4 callersMethodget

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

src/node/mod.rs:255

↓ 4 callersMethodmerge_recursive

(&self, key: &Key<Q>, guard: &Guard)

src/lib.rs:608

↓ 4 callersMethodnext_back

(&mut self)

src/node/scanner.rs:151

↓ 4 callersMethodstart_bound

(&self)

src/scanner.rs:330

↓ 4 callersFunctiontest_insertion

(mut elements: Vec<(K, V)>, node_size: usize, use_upsert: bool)

tests/single_threaded.rs:20

↓ 3 callersMethodcmp

(&self, other: &Self)

tests/single_threaded.rs:692

↓ 3 callersMethoddefer_value_drop

(&mut self, guard: &Guard)

src/node/mod.rs:1098

↓ 3 callersMethodderef

(&self)

src/lib.rs:1531

↓ 3 callersFunctionfill

(tree: &BzTree<Key<usize>, String>, size: usize)

tests/single_threaded.rs:47

↓ 3 callersMethodis_deleted

(&self)

src/node/metadata.rs:49

↓ 3 callersMethodnext_back

(&mut self)

src/scanner.rs:250

↓ 3 callersMethodreserve_entry

(&self)

src/node/status_word.rs:46

↓ 3 callersMethodsplit_leaf

(&self, guard: &Guard)

src/node/mod.rs:514

↓ 3 callersMethodto_interim_node

(&self)

src/lib.rs:1667

↓ 3 callersMethodtry_froze

(&self, guard: &Guard)

src/lib.rs:1694

↓ 3 callersMethodtry_reserve_entry

Method try to reserved space for new KV entry.

src/node/mod.rs:962

↓ 2 callersMethodborrow

(&self)

src/lib.rs:2634

↓ 2 callersMethodcapacity

(&self)

src/node/mod.rs:687

↓ 2 callersMethodclear_reserved_entry

Mark metadata entry as unused(will be skipped by search operations)

src/node/mod.rs:995

↓ 2 callersMethodclosest

Get value which key is equal or greater that to passed key. Warning**: this method can be called only for **read-only** nodes, it ignores any updates

src/node/mod.rs:293

↓ 2 callersMethodconditional_delete

Remove value associated with passed key if node wasn't changed(status word is same). ## Return: Value associated with removed key

src/node/mod.rs:210

↓ 2 callersMethodconditional_edge_kv

Find KV which placed on some of node's edge(e.g. min KV or max KV) at some point of time (represented by status word).

src/node/mod.rs:403

↓ 2 callersMethodconditional_upsert

Upsert value associated with passed key if node wasn't changed(status word is same). ## Return: Previous value associated with key, if it exists.

src/node/mod.rs:143

↓ 2 callersFunctioncreate_wrapped_u16_node

(max_elements: u16)

src/node/mod.rs:1208

↓ 2 callersMethoddeleted_records

How many KVs was removed

src/node/status_word.rs:81

↓ 2 callersMethoddrop_manual

(self, guard: &Guard)

src/lib.rs:1518

↓ 2 callersMethodedge_kv

Find KV which placed on some of node's edge(e.g. min KV or max KV).

src/node/mod.rs:393

↓ 2 callersMethodfrozen

(&mut self)

src/node/status_word.rs:113

↓ 2 callersMethodinsert_phase_one

( &self, key: K, value: V, is_upsert: bool, cur_status: &StatusWord,

src/node/mod.rs:809

↓ 2 callersMethodinsert_phase_two

( &'g self, mut new_entry: ReservedEntry<K, V>, is_upsert: bool, guard: &'g Gu

src/node/mod.rs:857

↓ 2 callersMethodis_reserved

(&self)

src/node/metadata.rs:54

↓ 2 callersMethodmerge_node

( &'g self, mut path: TraversePath<'g, K, V>, guard: &'g Guard, )

src/lib.rs:640

↓ 2 callersMethodmerge_with_leaf

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

src/node/mod.rs:557

↓ 2 callersMethodpartial_cmp

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

src/lib.rs:1757

↓ 2 callersMethodpop_first

Remove and return first element of tree according to key ordering. # Examples ``` use bztree::BzTree; let tree = BzTree::new(); let guard = crossbea

src/lib.rs:404

↓ 2 callersMethodpop_last

Remove and return last element of tree according to key ordering. # Examples ``` use bztree::BzTree; let tree = BzTree::new(); let guard = crossbeam

src/lib.rs:426

↓ 2 callersFunctionrand_kv

()

src/node/mod.rs:1790

↓ 2 callersMethodsplit_interim

(&self, guard: &Guard)

src/node/mod.rs:539

↓ 2 callersMethodvalue_mut

(&mut self)

src/node/mod.rs:1090

↓ 1 callersFunctioncheck_scanners

( tree: &BzTree<Key<u64>, String>, last_state: &Ops<Key<u64>, String>, greatest_key: Key<u64>, )

tests/single_threaded.rs:596

↓ 1 callersMethodclone_with_filter

Clone KVs of this node which pass the filter.

src/node/mod.rs:674

next →1–100 of 249, ranked by callers