Searched refs:NodePool (Results 1 – 5 of 5) sorted by relevance
| /wasmtime-44.0.1/cranelift/bforest/src/ |
| H A D | path.rs | 52 pool: &NodePool<F>, in find()
195 fn prev_leaf(&mut self, pool: &NodePool<F>) -> Option<Node> { in prev_leaf()
268 pool: &mut NodePool<F>, in insert()
295 pool: &mut NodePool<F>, in split_and_insert()
380 pub fn remove(&mut self, pool: &mut NodePool<F>) -> Option<Node> { in remove()
408 fn update_crit_key(&mut self, pool: &mut NodePool<F>) { in update_crit_key()
511 fn underflowed_node(&mut self, level: usize, pool: &mut NodePool<F>) { in underflowed_node()
649 pub fn normalize(&mut self, pool: &NodePool<F>) { in normalize()
662 pub fn verify(&self, pool: &NodePool<F>) { in verify()
747 let mut pool = NodePool::<TF>::new(); in search_single_leaf()
[all …]
|
| H A D | pool.rs | 13 pub(super) struct NodePool<F: Forest> { struct
18 impl<F: Forest> NodePool<F> { implementation
80 impl<F: Forest> NodePool<F> { implementation
209 impl<F: Forest> Index<Node> for NodePool<F> { implementation
217 impl<F: Forest> IndexMut<Node> for NodePool<F> { implementation
|
| H A D | map.rs | 44 nodes: NodePool<MapTypes<K, V>>,
55 nodes: NodePool::new(), in new()
343 pool: &NodePool<MapTypes<K, V>>, in prev()
369 pool: &NodePool<MapTypes<K, V>>, in goto()
385 pool: &NodePool<MapTypes<K, V>>, in goto_first()
397 pool: &mut NodePool<MapTypes<K, V>>, in insert()
408 pool: &mut NodePool<MapTypes<K, V>>, in try_insert()
457 pool: &'a NodePool<MapTypes<K, V>>,
540 pool: &'a mut NodePool<MapTypes<K, V>>,
640 pool: &'a NodePool<MapTypes<K, V>>,
[all …]
|
| H A D | set.rs | 3 use super::{Comparator, Forest, INNER_SIZE, Node, NodeData, NodePool, Path, SetValue};
38 nodes: NodePool<SetTypes<K>>,
48 nodes: NodePool::new(), in new()
210 pool: &'a mut NodePool<SetTypes<K>>,
350 pool: &'a NodePool<SetTypes<K>>,
|
| H A D | lib.rs | 40 use self::pool::NodePool;
|