Lines Matching defs:Leaf
29569 ) -> SearchResult<BorrowType, K, V, marker::LeafOrInternal, marker::Leaf>
29578 Leaf(leaf) => return GoDown(leaf),
29611 Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>,
29650 Leaf(common_edge) => return Err(common_edge),
29960 Leaf(leaf) => {
29966 Leaf(leaf) => leaf,
30129 front: Handle<NodeRef<marker::Dying, K, V, marker::Leaf>, marker::Edge>,
31425 cur_leaf_edge: Option<Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>>,
32148 (Leaf(_), Leaf(_)) => break,
33756 pub front: Option<Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>>,
33757 pub back: Option<Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>>,
33814 (Leaf(f), Leaf(b)) => return LeafRange { front: Some(f), back: Some(b) },
33840 (Leaf(f), Leaf(b)) => {
33916 Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>
33986 impl<K, V> Handle<NodeRef<marker::Dying, K, V, marker::Leaf>, marker::Edge> {
34057 impl<'a, K, V> Handle<NodeRef<marker::Immut<'a>, K, V, marker::Leaf>, marker::Edge> {
34085 impl<'a, K, V> Handle<NodeRef<marker::ValMut<'a>, K, V, marker::Leaf>, marker::Edge> {
34117 impl<K, V> Handle<NodeRef<marker::Dying, K, V, marker::Leaf>, marker::Edge> {
34159 pub fn first_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> {
34163 Leaf(leaf) => return leaf.first_edge(),
34172 pub fn last_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> {
34176 Leaf(leaf) => return leaf.last_edge(),
34184 Leaf(NodeRef<BorrowType, K, V, marker::Leaf>),
34198 Leaf(leaf) => visit(Position::Leaf(leaf)),
34204 Leaf(leaf) => {
34205 visit(Position::Leaf(leaf));
34228 Position::Leaf(node) => result += node.len(),
34240 pub fn next_leaf_edge(self) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> {
34242 Leaf(leaf_kv) => leaf_kv.right_edge(),
34253 ) -> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> {
34255 Leaf(leaf_kv) => leaf_kv.left_edge(),
35087 pub(super) handle: Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>,
37744 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) {
37746 Leaf(node) => node.remove_leaf_kv(handle_emptied_internal_root),
37752 impl<'a, K: 'a, V: 'a> Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::KV> {
37756 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) {
37808 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) {
38076 /// - `Type`: This can be `Leaf`, `Internal`, or `LeafOrInternal`. When this is
38077 /// `Leaf`, the `NodeRef` points to a leaf node, when this is `Internal` the
38108 /// Must be zero if `Type` is `Leaf` and non-zero if `Type` is `Internal`.
38136 impl<K, V> NodeRef<marker::Owned, K, V, marker::Leaf> {
38533 impl<'a, K: 'a, V: 'a> NodeRef<marker::Mut<'a>, K, V, marker::Leaf> {
38566 impl<BorrowType, K, V> NodeRef<BorrowType, K, V, marker::Leaf> {
38567 /// Removes any static information asserting that this node is a `Leaf` node.
38581 /// Checks whether a node is an `Internal` node or a `Leaf` node.
38585 NodeRef<BorrowType, K, V, marker::Leaf>,
38589 ForceResult::Leaf(NodeRef {
38605 /// Unsafely asserts to the compiler the static information that this node is a `Leaf`.
38606 unsafe fn cast_to_leaf_unchecked(self) -> NodeRef<marker::Mut<'a>, K, V, marker::Leaf> {
38622 /// Note that even `Leaf` nodes can have `Edge` handles. Instead of representing a pointer to
38751 impl<'a, K: 'a, V: 'a> Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge> {
38771 impl<'a, K: 'a, V: 'a> Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge> {
38776 fn insert(mut self, key: K, val: V) -> (InsertResult<'a, K, V, marker::Leaf>, *mut V) {
38863 impl<'a, K: 'a, V: 'a> Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge> {
38998 impl<'a, K: 'a, V: 'a> Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::KV> {
39006 pub fn split(mut self) -> SplitResult<'a, K, V, marker::Leaf> {
39019 ) -> ((K, V), Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, marker::Edge>) {
39321 (ForceResult::Leaf(_), ForceResult::Leaf(_)) => {}
39385 (ForceResult::Leaf(_), ForceResult::Leaf(_)) => {}
39392 impl<BorrowType, K, V> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge> {
39408 impl<BorrowType, K, V> Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::KV> {
39425 /// Checks whether the underlying node is an `Internal` node or a `Leaf` node.
39429 Handle<NodeRef<BorrowType, K, V, marker::Leaf>, Type>,
39433 ForceResult::Leaf(node) => {
39434 ForceResult::Leaf(Handle { node, idx: self.idx, _marker: PhantomData })
39444 /// Unsafely asserts to the compiler the static information that the handle's node is a `Leaf`.
39447 ) -> Handle<NodeRef<marker::Mut<'a>, K, V, marker::Leaf>, Type> {
39491 (ForceResult::Leaf(_), ForceResult::Leaf(_)) => {}
39499 pub enum ForceResult<Leaf, Internal> {
39500 Leaf(Leaf),
39514 impl<'a, K, V> SplitResult<'a, K, V, marker::Leaf> {
39534 pub enum Leaf {}
39657 navigate::Position::Leaf(leaf) => {