Enum TraversalNode 

pub enum TraversalNode<Node, Leaf> {
    Node(Node),
    Leaf(Leaf),
}

Variants

Node(Node)

Leaf(Leaf)

Trait Implementations

impl<Node: Debug, Leaf: Debug> Debug for TraversalNode<Node, Leaf>

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

Formats the value using the given formatter.

impl<Node, Leaf> Eq for TraversalNode<Node, Leaf>

where Node: NodeTraverse, Leaf: LeafTraverse,

impl<Node, Leaf> Ord for TraversalNode<Node, Leaf>

where Node: NodeTraverse, Leaf: LeafTraverse,

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<Node, Leaf> PartialEq for TraversalNode<Node, Leaf>

where Node: NodeTraverse, Leaf: LeafTraverse,

fn eq(&self, other: &Self) -> bool

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

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<Node, Leaf> PartialOrd for TraversalNode<Node, Leaf>

where Node: NodeTraverse, Leaf: LeafTraverse,

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.