Enum Traversal

pub enum Traversal<N, B> {
    Start(N),
    Step {
        up: usize,
        branch: B,
        data: N,
    },
}

Describes a node’s position relatively to the previous one and contains some data.

Variants

Start(N)

Step

Fields

up: usize

How much higher the parent of the described node is compared to the previous node

branch: B

The branch leading from the parent to the described node

data: N

Node data

Implementations

impl<N, B> Traversal<N, B>

pub fn take(self) -> N

pub fn map<M>(self, op: impl Fn(N) -> M) -> Traversal<M, B>

pub fn data(&self) -> &N

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

pub fn up(&self) -> usize

pub fn is_root(&self) -> bool

Trait Implementations

impl<N: Debug, B: Debug> Debug for Traversal<N, B>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<N: PartialEq, B: PartialEq> PartialEq for Traversal<N, B>

fn eq(&self, other: &Traversal<N, B>) -> bool

Tests for self and other values to be equal, and is used by ==.

const fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<N, B> StructuralPartialEq for Traversal<N, B>