Lines Matching refs:CAPACITY
29226 if cur_node.len() < node::CAPACITY {
29236 if parent.len() < node::CAPACITY {
35579 const NODE_CAPACITY: usize = node::CAPACITY;
35697 // adapt that value to match a change in node::CAPACITY or the choices made
37964 pub const CAPACITY: usize = 2 * B - 1;
37985 keys: [MaybeUninit<K>; CAPACITY],
37986 vals: [MaybeUninit<V>; CAPACITY],
38365 /// `index` is in bounds of 0..CAPACITY
38379 /// `index` is in bounds of 0..CAPACITY
38395 /// `index` is in bounds of 0..CAPACITY + 1
38538 assert!(idx < CAPACITY);
38555 assert!(idx < CAPACITY);
38741 debug_assert!(edge_idx <= CAPACITY);
38758 debug_assert!(self.node.len() < CAPACITY);
38777 if self.node.len() < CAPACITY {
38816 debug_assert!(self.node.len() < CAPACITY);
38841 if self.node.len() < CAPACITY {
39134 self.left_child.len() + 1 + self.right_child.len() <= CAPACITY
39158 assert!(new_left_len <= CAPACITY);
39274 assert!(old_right_len + count <= CAPACITY);
39337 assert!(old_left_len + count <= CAPACITY);
39675 for idx in 0..=CAPACITY {
39680 let mut right_len = CAPACITY - middle_kv_idx - 1;
39693 assert!(left_len + right_len == CAPACITY);
39727 assert_eq!(core::mem::size_of::<LeafNode<i64, i64>>(), 16 + CAPACITY * 2 * 8);
39728 assert_eq!(core::mem::size_of::<InternalNode<(), ()>>(), 16 + (CAPACITY + 1) * 8);
39729 assert_eq!(core::mem::size_of::<InternalNode<i64, i64>>(), 16 + (CAPACITY * 3 + 1) * 8);