Home
last modified time | relevance | path

Searched refs:try_leaf_insert (Results 1 – 2 of 2) sorted by relevance

/wasmtime-44.0.1/cranelift/bforest/src/
H A Dnode.rs193 pub fn try_leaf_insert(&mut self, index: usize, key: F::Key, value: F::Value) -> bool { in try_leaf_insert() method
677 assert!(leaf.try_leaf_insert(0, 'a', SetValue())); in leaf()
679 assert!(leaf.try_leaf_insert(1, 'b', SetValue())); in leaf()
680 assert!(leaf.try_leaf_insert(2, 'c', SetValue())); in leaf()
688 assert!(!leaf.try_leaf_insert(0, 'x', SetValue())); in leaf()
689 assert!(!leaf.try_leaf_insert(8, 'x', SetValue())); in leaf()
690 assert!(!leaf.try_leaf_insert(15, 'x', SetValue())); in leaf()
701 assert!(leaf.try_leaf_insert(8, 'i', SetValue())); in leaf()
795 assert!(lhs.try_leaf_insert(0, 'x', SetValue())); in leaf_balance()
796 assert!(lhs.try_leaf_insert(1, 'y', SetValue())); in leaf_balance()
[all …]
H A Dpath.rs270 if !self.try_leaf_insert(key, value, pool) { in insert()
278 fn try_leaf_insert(&self, key: F::Key, value: F::Value, pool: &mut NodePool<F>) -> bool { in try_leaf_insert() method
286 pool[self.leaf_node()].try_leaf_insert(index, key, value) in try_leaf_insert()
330 let inserted = pool[node].try_leaf_insert(entry, key, value); in split_and_insert()