Struct Table_ 

pub struct Table_ {
    pub sorts: Vec<Sort_>,
    pub theorems: Vec<Theorem_>,
    pub terms: Vec<Term_>,
    pub unify: Vec<Command<Unify>>,
    pub binders: Vec<Var_>,
}

Fields

sorts: Vec<Sort_>

theorems: Vec<Theorem_>

terms: Vec<Term_>

unify: Vec<Command<Unify>>

binders: Vec<Var_>

Trait Implementations

impl Clone for Table_

fn clone(&self) -> Table_

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Table_

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

Formats the value using the given formatter.

impl Default for Table_

fn default() -> Table_

Returns the “default value” for a type.

impl Hash for Table_

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 Table_

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

type Sort = Sort_

type Term = Term_

type Theorem = Theorem_

type Var = Var_

fn sort(&self, idx: u8) -> Option<&Self::Sort>

fn nr_sorts(&self) -> u8

fn term(&self, idx: u32) -> Option<&Self::Term>

fn nr_terms(&self) -> u32

fn theorem(&self, idx: u32) -> Option<&Self::Theorem>

fn nr_theorems(&self) -> u32

fn unify_commands(&self, idx: Range<usize>) -> Option<&[Command<Unify>]>

fn unify_command(&self, idx: usize) -> Option<&Command<Unify>>

fn binders(&self, idx: Range<usize>) -> Option<&[Self::Var]>

impl Eq for Table_

impl StructuralPartialEq for Table_