Enum NodeModule 

pub enum NodeModule {
    Toplevel,
    Unnamed,
    Symbols,
}

Where a node type is located.

We have three modules to organize things and remove some name conflicts. Specifically, we have unnamed and symbols are separate from the top-level so node named-ness is apparent and we may have nodes like _if (becomes If) and "if", and unnamed is separate from symbols so unnamed nodes derived from symbols are apparent and because we may have nodes like "+" and "add".

Variants

Toplevel

Unnamed

Symbols

Trait Implementations

impl Clone for NodeModule

fn clone(&self) -> NodeModule

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for NodeModule

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

Formats the value using the given formatter.

impl Enum for NodeModule

type Array<__EnumMapInternalV> = [__EnumMapInternalV; 3]

Representation of an enum.

fn from_usize(value: usize) -> Self

Takes an usize, and returns an element matching into_usize function.

fn into_usize(self) -> usize

Returns an unique identifier for a value within range of 0..Array::LENGTH.

impl Hash for NodeModule

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 Ord for NodeModule

fn cmp(&self, other: &NodeModule) -> 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 PartialEq for NodeModule

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

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

impl Eq for NodeModule

impl StructuralPartialEq for NodeModule