Enum SimpleNodeKindExt 

pub enum SimpleNodeKindExt {
    Leaf,
    App,
    Lam,
    Pi,
    Let,
    Sort,
    Match,
    Def,
    Theorem,
    Ann,
    Proj,
    Level,
}

A simple AST node kind for generic traversal.

Variants

Leaf

A leaf node (variable, literal)

App

An application node

Lam

A lambda abstraction

Pi

A pi-type / forall

Let

A let binding

Sort

A sort (Type/Prop)

Match

A match expression

Def

A definition head

Theorem

A theorem head

Ann

An annotation

Proj

A projection

Level

A universe level

Trait Implementations

impl Clone for SimpleNodeKindExt

fn clone(&self) -> SimpleNodeKindExt

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SimpleNodeKindExt

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

Formats the value using the given formatter.

impl Hash for SimpleNodeKindExt

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 PartialEq for SimpleNodeKindExt

fn eq(&self, other: &SimpleNodeKindExt) -> 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 Eq for SimpleNodeKindExt

impl StructuralPartialEq for SimpleNodeKindExt