Enum linked_syntax_tree::Predecessor

pub enum Predecessor<T> {
    Parent(T),
    Previous(T),
}

A statement in an AST may have:

• A previous statement
• A next statement
• A child statement
• A parent statement

Consider the example:

x = -10
loop
    x = x + 1
    if x
        break
x = 2

this can be represented as:

┌──────────┐
│x = -10   │
└──────────┘
│
┌──────────┐
│loop      │
└──────────┘
│           ╲
┌──────────┐ ┌─────────┐
│x = 2     │ │x = x + 1│
└──────────┘ └─────────┘
             │
             ┌─────────┐
             │if x     │
             └─────────┘
                        ╲
                         ┌─────────┐
                         │break    │
                         └─────────┘

this is a simplified tree structure.

Variants

Parent(T)

A parent element.

Previous(T)

A previous element.

Implementations

impl<T> Predecessor<T>

pub fn parent(self) -> Option<T>

Unwrap to a parent.

pub fn previous(self) -> Option<T>

Unwraps to a previous.

pub fn unwrap(self) -> T

Unwraps.

pub fn as_ref(&self) -> Predecessor<&T>

Returns Predecessor<&T>.

pub fn as_mut(&mut self) -> Predecessor<&mut T>

Returns Predecessor<&mut T>.

pub fn map<P>(self, f: impl Fn(T) -> P) -> Predecessor<P>

Maps to Predecessor<P>.

Trait Implementations

impl<T: Clone> Clone for Predecessor<T>

fn clone(&self) -> Predecessor<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for Predecessor<T>

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

Formats the value using the given formatter.

impl<T: PartialEq> PartialEq<Predecessor<T>> for Predecessor<T>

fn eq(&self, other: &Predecessor<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

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

impl<T: Copy> Copy for Predecessor<T>

impl<T: Eq> Eq for Predecessor<T>

impl<T> StructuralEq for Predecessor<T>

impl<T> StructuralPartialEq for Predecessor<T>