Lines Matching defs:descend
29579 Internal(internal) => internal.descend(),
29652 self = common_edge.descend();
29983 let mut out_tree = clone_subtree(internal.first_edge().descend());
29995 let subtree = clone_subtree(in_edge.descend());
32145 left_node = edge.descend();
32146 right_node = node.first_edge().descend();
33817 f.descend().find_lower_bound_edge(lower_child_bound);
33819 b.descend().find_upper_bound_edge(upper_child_bound);
33844 min_node = min_int.descend();
33845 max_node = max_int.descend();
34164 Internal(internal) => node = internal.first_edge().descend(),
34177 Internal(internal) => node = internal.last_edge().descend(),
34203 edge = match edge.descend().force() {
34245 next_internal_edge.descend().first_leaf_edge()
34258 next_internal_edge.descend().last_leaf_edge()
35690 edge.descend().assert_min_len(MIN_LEN);
37812 let left_leaf_kv = self.left_edge().descend().last_leaf_edge().left_kv();
38234 /// `edge.descend().ascend().unwrap()` and `node.ascend().unwrap().descend()` should
38806 let mut child = self.descend();
38906 /// `edge.descend().ascend().unwrap()` and `node.ascend().unwrap().descend()` should
38908 pub fn descend(self) -> NodeRef<BorrowType, K, V, marker::LeafOrInternal> {
39071 left_child: self1.left_edge().descend(),
39072 right_child: self2.right_edge().descend(),
39097 left_child: left_parent_kv.left_edge().descend(),
39104 right_child: right_parent_kv.right_edge().descend(),
39641 let child = edge.descend();