Struct FlatApp 

pub struct FlatApp {
    pub fn_idx: TermIdx,
    pub arg_idx: TermIdx,
    pub result_idx: Option<TermIdx>,
}

A flat application: (fn_idx, arg_idx) → result_idx.

Fields

fn_idx: TermIdx

Index of the function term.

arg_idx: TermIdx

Index of the argument term.

result_idx: Option<TermIdx>

Index of the result term (the node representing the application). None if not tracked (result congruence propagation is skipped).

Trait Implementations

impl Clone for FlatApp

fn clone(&self) -> FlatApp

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for FlatApp

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

Formats the value using the given formatter.

impl Hash for FlatApp

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 FlatApp

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

impl Eq for FlatApp

impl StructuralPartialEq for FlatApp