Enum Zipper

pub enum Zipper<B, U, A>
where
    B: Symbolic,
    U: Symbolic,
    A: Symbolic,
{
    Top,
    Right {
        bin: B,
        sub: Tree<B, U, A>,
        zip: Box<Zipper<B, U, A>>,
    },
    Left {
        bin: B,
        sub: Tree<B, U, A>,
        zip: Box<Zipper<B, U, A>>,
    },
    Up {
        un: U,
        zip: Box<Zipper<B, U, A>>,
    },
}

The thread or ‘zipper’ that actually tracks where you currently are in a given tree formula. The recursively nested zippers themselves contain the node values that trace out a partial walk from the head of the tree toward a leaf node, i.e. an atom. Zippers contain trees themselves if and only if they make a ‘choice’ during the walk, e.g. they traverse one of two binary subtrees, to retain the choice not made.

Variants

Top

Right

Fields

bin: B

sub: Tree<B, U, A>

zip: Box<Zipper<B, U, A>>

Left

Fields

bin: B

sub: Tree<B, U, A>

zip: Box<Zipper<B, U, A>>

Up

Fields

un: U

zip: Box<Zipper<B, U, A>>

Implementations

impl<B: Symbolic, U: Symbolic, A: Symbolic> Zipper<B, U, A>

pub fn is_left(&self) -> bool

pub fn is_right(&self) -> bool

pub fn is_up(&self) -> bool

pub fn is_top(&self) -> bool

pub fn peek_up(&self) -> &Self

For formula traversal through the zipper when the actual zipper state doesn’t need to be changed.

pub fn flip(&mut self)

Flip a right zipper to left or vice versa while retaining all the same data.

Trait Implementations

impl<B, U, A> Clone for Zipper<B, U, A>

where B: Symbolic + Clone, U: Symbolic + Clone, A: Symbolic + Clone,

fn clone(&self) -> Zipper<B, U, A>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<B, U, A> Debug for Zipper<B, U, A>

where B: Symbolic + Debug, U: Symbolic + Debug, A: Symbolic + Debug,

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

Formats the value using the given formatter.

impl<B, U, A> Default for Zipper<B, U, A>

where B: Symbolic, U: Symbolic, A: Symbolic,

fn default() -> Zipper<B, U, A>

Returns the “default value” for a type.

impl<B, U, A> Hash for Zipper<B, U, A>

where B: Symbolic + Hash, U: Symbolic + Hash, A: Symbolic + Hash,

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<B, U, A> Ord for Zipper<B, U, A>

where B: Symbolic + Ord, U: Symbolic + Ord, A: Symbolic + Ord,

fn cmp(&self, other: &Zipper<B, U, A>) -> 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<B, U, A> PartialEq for Zipper<B, U, A>

where B: Symbolic + PartialEq, U: Symbolic + PartialEq, A: Symbolic + PartialEq,

fn eq(&self, other: &Zipper<B, U, A>) -> 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<B, U, A> PartialOrd for Zipper<B, U, A>

where B: Symbolic + PartialOrd, U: Symbolic + PartialOrd, A: Symbolic + PartialOrd,

fn partial_cmp(&self, other: &Zipper<B, U, A>) -> 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.

impl<B, U, A> Eq for Zipper<B, U, A>

where B: Symbolic + Eq, U: Symbolic + Eq, A: Symbolic + Eq,

impl<B, U, A> StructuralPartialEq for Zipper<B, U, A>

where B: Symbolic, U: Symbolic, A: Symbolic,