Enum NodeShape 

pub enum NodeShape {
    Sort,
    Var,
    Global,
    Const,
    Pi,
    Lambda,
    App,
    Match,
    Fix,
    MutualFix,
    Let,
    Lit,
    Hole,
    Bound,
}

Which Node kind a subterm is — one per Node variant, and wildcard-free everywhere it is matched for the same reason Node is.

This exists so a caller can ask “does this subterm contain a Match anywhere?” in O(1) instead of walking it. The bit lives in Info and is ORed up from the children exactly once, at interning time.

Variants

Sort

Node::Sort.

Var

Node::Var.

Global

Node::Global.

Const

Node::Const.

Pi

Node::Pi.

Lambda

Node::Lambda.

App

Node::App.

Match

Node::Match.

Fix

Node::Fix.

MutualFix

Node::MutualFix.

Let

Node::Let.

Lit

Node::Lit.

Hole

Node::Hole.

Bound

Node::Bound — a de Bruijn level, which only an α-canonical form carries.

Trait Implementations

impl Clone for NodeShape

fn clone(&self) -> NodeShape

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for NodeShape

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

Formats the value using the given formatter.

impl Hash for NodeShape

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 NodeShape

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

impl Eq for NodeShape

impl StructuralPartialEq for NodeShape