Struct Term 

pub struct Term {
    pub kind: TermKind,
    /* private fields */
}

Wrapper around TermKind with additional metadata

Fields

kind: TermKind

The term kind

Implementations

impl Term

pub fn new(kind: TermKind) -> Self

Create a new term

pub fn hash(&self) -> u64

Get the term’s hash

pub fn is_sort(&self) -> bool

Check if this is a sort

pub fn is_var(&self) -> bool

Check if this is a variable

pub fn is_lam(&self) -> bool

Check if this is a lambda

pub fn is_pi(&self) -> bool

Check if this is a Pi type

pub fn is_app(&self) -> bool

Check if this is an application

Trait Implementations

impl Clone for Term

fn clone(&self) -> Term

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Term

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

Formats the value using the given formatter.

impl Hash for Term

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 Term

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