nb_tree::tree::entry

Enum Entry

Source 
pub enum Entry<R, N, B, const BOUND: bool>
where
    R: Deref<Target = Tree<N, B>>,
{
    Node(Node<R, N, B, BOUND>),
    Detached(DetachedEntry<R, N, B, BOUND>),
}

Variants§

§

Node(Node<R, N, B, BOUND>)

§

Detached(DetachedEntry<R, N, B, BOUND>)

Implementations§

Source§

impl<R, N, B, const BOUND: bool> Entry<R, N, B, BOUND>
where R: Deref<Target = Tree<N, B>>,

Source

pub fn node(&self) -> Option<&Node<R, N, B, BOUND>>

Source

pub fn detached(&self) -> Option<&DetachedEntry<R, N, B, BOUND>>

Source

pub fn node_mut(&mut self) -> Option<&mut Node<R, N, B, BOUND>>

Source

pub fn detached_mut(&mut self) -> Option<&mut DetachedEntry<R, N, B, BOUND>>

Source

pub fn is_node(&self) -> bool

Source

pub fn is_detached(&self) -> bool

Source

pub fn branch(&self) -> Option<&B>

Source

pub fn path(&self) -> &Path<B>

Source

pub fn value(&self) -> Option<&N>

Source§

impl<R, N, B> Entry<R, N, B, TREEBOUND>
where R: Deref<Target = Tree<N, B>>, B: Eq + Hash + Clone,

Source

pub fn apply_move<T>(&mut self, node: &Traversal<T, B>) -> Result<(), usize>

Applies the movement of the given traversal node, ignoring the contained data.

No movement is made if the given node is a Start node or if the Step moves above the tree root.

Source

pub fn apply_move_deref<T, C>(&mut self, node: &Traversal<T, C>) -> bool
where C: Deref<Target = B>,

Source§

impl<R, N, B, const BOUND: bool> Entry<R, N, B, BOUND>
where R: Deref<Target = Tree<N, B>>, B: Eq + Hash,

Source

pub fn from(tree: R, root: usize, path: Path<B>) -> Self

Source§

impl<R, N, B> Entry<R, N, B, TREEBOUND>
where R: DerefMut<Target = Tree<N, B>>, B: Eq + Hash + Clone,

Source

pub fn remove_subtree(self) -> Self

Source§

impl<R, N, B, const BOUND: bool> Entry<R, N, B, BOUND>
where R: DerefMut<Target = Tree<N, B>>, B: Eq + Hash + Clone,

Source

pub fn and_modify<F>(self, f: F) -> Self
where F: FnOnce(&mut N),

Source

pub fn apply_data(&mut self, node: Traversal<N, B>) -> bool

Source§

impl<R, N, B> Entry<R, N, B, TREEBOUND>
where R: DerefMut<Target = Tree<N, B>>, B: Eq + Hash + Clone,

Source

pub fn apply(&mut self, node: Traversal<N, B>) -> bool

Source§

impl<R, N, B> Entry<R, N, B, TREEBOUND>
where R: DerefMut<Target = Tree<N, B>>, N: Clone + Default, B: Eq + Hash + Clone + Default,

Source

pub fn apply_extend(&mut self, node: Traversal<N, B>) -> bool

Source§

impl<R, N, B> Entry<R, N, B, TREEBOUND>
where R: Deref<Target = Tree<N, B>>, B: Eq + Hash + Clone,

Source

pub fn move_down(&mut self, path: Path<B>)

Source

pub fn move_down_branch(&mut self, branch: B)

Source

pub fn move_up(&mut self, up: usize) -> Option<usize>

Source

pub fn move_to_attached(&mut self)

Source§

impl<R, N, B, const BOUND: bool> Entry<R, N, B, BOUND>
where R: Deref<Target = Tree<N, B>>, B: Eq + Hash + Clone,

Source

pub fn offshoot_len(&self) -> usize

Source§

impl<R, N, B, const BOUND: bool> Entry<R, N, B, BOUND>
where R: DerefMut<Target = Tree<N, B>>, B: Eq + Hash + Clone,

Source

pub fn or_insert(&mut self, value: N) -> &mut N

Source

pub fn insert(&mut self, value: N) -> Option<&mut N>

Source§

impl<R, N, B> Entry<R, N, B, TREEBOUND>
where R: DerefMut<Target = Tree<N, B>>, N: Default, B: Default + Eq + Hash + Clone,

Source

pub fn or_insert_extend(&mut self, value: N) -> &mut N

Source

pub fn insert_extend(&mut self, value: N) -> &mut N

Trait Implementations§

Source§

impl<R, N, B, const BOUND: bool> From<DetachedEntry<R, N, B, BOUND>> for Entry<R, N, B, BOUND>
where R: Deref<Target = Tree<N, B>>,

Source§

fn from(value: DetachedEntry<R, N, B, BOUND>) -> Self

Converts to this type from the input type.
Source§

impl<R, N, B, const BOUND: bool> From<Node<R, N, B, BOUND>> for Entry<R, N, B, BOUND>
where R: Deref<Target = Tree<N, B>>,

Source§

fn from(value: Node<R, N, B, BOUND>) -> Self

Converts to this type from the input type.
Source§

impl<R, N, B, const BOUND: bool> From<Result<DetachedEntry<R, N, B, BOUND>, Node<R, N, B, BOUND>>> for Entry<R, N, B, BOUND>
where R: Deref<Target = Tree<N, B>>,

Source§

fn from( value: Result<DetachedEntry<R, N, B, BOUND>, Node<R, N, B, BOUND>>, ) -> Self

Converts to this type from the input type.
Source§

impl<R, N, B, const BOUND: bool> From<Result<Node<R, N, B, BOUND>, DetachedEntry<R, N, B, BOUND>>> for Entry<R, N, B, BOUND>
where R: Deref<Target = Tree<N, B>>,

Source§

fn from( value: Result<Node<R, N, B, BOUND>, DetachedEntry<R, N, B, BOUND>>, ) -> Self

Converts to this type from the input type.

Auto Trait Implementations§

§

impl<R, N, B, const BOUND: bool> Freeze for Entry<R, N, B, BOUND>
where R: Freeze,

§

impl<R, N, B, const BOUND: bool> RefUnwindSafe for Entry<R, N, B, BOUND>
where R: RefUnwindSafe, B: RefUnwindSafe,

§

impl<R, N, B, const BOUND: bool> Send for Entry<R, N, B, BOUND>
where R: Send, B: Send,

§

impl<R, N, B, const BOUND: bool> Sync for Entry<R, N, B, BOUND>
where R: Sync, B: Sync,

§

impl<R, N, B, const BOUND: bool> Unpin for Entry<R, N, B, BOUND>
where R: Unpin, B: Unpin,

§

impl<R, N, B, const BOUND: bool> UnwindSafe for Entry<R, N, B, BOUND>
where R: UnwindSafe, B: UnwindSafe,

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<N, B> TreeIntoIterTarget<N, B> for N

Source§

type Target = N

Source§

fn target(node: TreeNode<N, B>) -> <N as TreeIntoIterTarget<N, B>>::Target

Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more