Lines Matching refs:entry
20 entry: [u8; MAX_PATH], field
30 entry: [0; MAX_PATH], in default()
69 self.entry[level] = i as u8; in find()
76 self.entry[level] = i as u8; in find()
80 self.entry[level] = i as u8; in find()
97 self.entry[level] = 0; in first()
111 Some((node, entry)) => { in next()
113 if entry + 1 < keys.len() { in next()
114 self.entry[self.size - 1] += 1; in next()
115 return Some((keys[entry + 1], vals[entry + 1])); in next()
137 let (node, entry) = self.leaf_pos().unwrap(); in prev()
139 return Some((keys[entry], vals[entry])); in prev()
144 Some((node, entry)) => { in prev()
145 if entry > 0 { in prev()
146 self.entry[self.size - 1] -= 1; in prev()
148 return Some((keys[entry - 1], vals[entry - 1])); in prev()
174 self.entry[bl] += 1; in next_node()
175 let mut node = bnodes[usize::from(self.entry[bl])]; in next_node()
179 self.entry[l] = 0; in next_node()
184 self.entry[level] = 0; in next_node()
197 let entry = self.entry[bl] - 1; in prev_leaf() localVariable
198 self.entry[bl] = entry; in prev_leaf()
200 self.goto_subtree_last(bl + 1, bnodes[usize::from(entry)], pool) in prev_leaf()
211 self.entry[l] = size; in goto_subtree_last()
215 self.entry[l] = size - 1; in goto_subtree_last()
229 self.entry[0] = 0; in set_root_node()
235 self.node.get(i).map(|&n| (n, self.entry[i].into())) in leaf_pos()
245 self.entry[self.size - 1].into() in leaf_entry()
251 self.entry[0..self.size].iter().all(|&i| i == 0) in at_first_entry()
306 let mut entry = self.entry[level].into(); in split_and_insert() localVariable
307 split = pool[node].split(entry); in split_and_insert()
317 if entry > split.lhs_entries in split_and_insert()
318 || (entry == split.lhs_entries in split_and_insert()
322 entry -= split.lhs_entries; in split_and_insert()
324 self.entry[level] = entry as u8; in split_and_insert()
330 let inserted = pool[node].try_leaf_insert(entry, key, value); in split_and_insert()
334 if entry == 0 && node == rhs_node { in split_and_insert()
339 let inserted = pool[node].try_inner_insert(entry, key, n); in split_and_insert()
344 self.entry[level] += 1; in split_and_insert()
355 let pentry = self.entry[level - 1].into(); in split_and_insert()
359 self.entry[level - 1] += 1; in split_and_insert()
369 let entry = if self.node[0] == rhs_node { 1 } else { 0 }; in split_and_insert() localVariable
372 slice_insert(&mut self.entry[0..self.size], 0, entry); in split_and_insert()
403 keys[usize::from(self.entry[bl]) - 1] in current_crit_key()
414 let crit_kidx = self.entry[crit_level] - 1; in update_crit_key()
469 slice_shift(&mut self.entry, ns); in balance_nodes()
494 usize::from(self.entry[level]), in heal_level()
547 debug_assert!(usize::from(self.entry[level]) < pool[self.node[level]].entries()); in underflowed_node()
548 } else if usize::from(self.entry[level]) >= pool[self.node[level]].entries() { in underflowed_node()
575 let pe = self.entry[pl].into(); in empty_node()
599 NodeData::Inner { size, .. } => self.entry[l] < size, in right_sibling_branch_level()
606 self.entry[0..level].iter().rposition(|&e| e != 0) in left_sibling_branch_level()
616 let be = usize::from(self.entry[bl]); in right_sibling()
641 keys[usize::from(self.entry[bl])] = crit_key; in update_right_crit_key()
650 if let Some((leaf, entry)) = self.leaf_pos() { in normalize()
651 if entry >= pool[leaf].entries() { in normalize()
668 self.entry[level] <= size, in verify()
670 self.entry[level], in verify()
676 tree[usize::from(self.entry[level])], in verify()
683 self.entry[level] <= size, in verify()
685 self.entry[level], in verify()
703 write!(f, "{}[{}]", self.node[0], self.entry[0])?; in fmt()
705 write!(f, "--{}[{}]", self.node[i], self.entry[i])?; in fmt()
756 assert_eq!(p.entry[0], 0); in search_single_leaf()
762 assert_eq!(p.entry[0], 0); in search_single_leaf()
768 assert_eq!(p.entry[0], 1); in search_single_leaf()
788 assert_eq!(p.entry[0], 1); in search_single_leaf()
794 assert_eq!(p.entry[0], 2); in search_single_leaf()
813 assert_eq!(p.entry[0], 0); in search_single_inner()
815 assert_eq!(p.entry[1], 0); in search_single_inner()
820 assert_eq!(p.entry[0], 0); in search_single_inner()
822 assert_eq!(p.entry[1], 0); in search_single_inner()
828 assert_eq!(p.entry[0], 0); in search_single_inner()
830 assert_eq!(p.entry[1], 1); in search_single_inner()
835 assert_eq!(p.entry[0], 1); in search_single_inner()
837 assert_eq!(p.entry[1], 0); in search_single_inner()
842 assert_eq!(p.entry[0], 1); in search_single_inner()
844 assert_eq!(p.entry[1], 1); in search_single_inner()