Enum puffin::algebra::term::Term

pub enum Term<M: Matcher> {
    Variable(Variable<M>),
    Application(Function, Vec<Term<M>>),
}

A first-order term: either a Variable or an application of an Function.

Variants

Variable(Variable<M>)

A concrete but unspecified Term (e.g. x, y). See Variable for more information.

Application(Function, Vec<Term<M>>)

An Function applied to zero or more Terms (e.g. (f(x, y), g()).

A Term that is an application of an Function with arity 0 applied to 0 Terms can be considered a constant.

Implementations

impl<M: Matcher> Term<M>

pub fn resistant_id(&self) -> u32

pub fn size(&self) -> usize

pub fn is_leaf(&self) -> bool

pub fn get_type_shape(&self) -> &TypeShape

pub fn name(&self) -> &str

pub fn mutate(&mut self, other: Term<M>)

fn display_at_depth(&self, depth: usize) -> String

pub fn evaluate<PB>(
    &self,
    context: &TraceContext<PB>
) -> Result<Box<dyn Any>, Error>where
    PB: ProtocolBehavior<Matcher = M> + ProtocolBehavior,

impl<M: Matcher> Term<M>

fn unique_id(&self, tree_mode: bool, cluster_id: usize) -> String

fn node_attributes(displayable: impl Display, color: &str, shape: &str) -> String

fn collect_statements(
    term: &Term<M>,
    tree_mode: bool,
    cluster_id: usize,
    statements: &mut Vec<String>
)

pub fn dot_subgraph(
    &self,
    tree_mode: bool,
    cluster_id: usize,
    label: &str
) -> String

If tree_mode is true then each subgraph is self-contained and does not reference other clusters or nodes outside of this subgraph. Therefore, only trees are generated. If it is false, then graphs are rendered.

impl<M: Matcher> Term<M>

pub fn count_functions_by_name(&self, find_name: &'static str) -> usize

Trait Implementations

impl<M: Clone + Matcher> Clone for Term<M>

fn clone(&self) -> Term<M>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<M: Debug + Matcher> Debug for Term<M>

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

Formats the value using the given formatter.

impl<'de, M> Deserialize<'de> for Term<M>where
    M: Matcher,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
    __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<M: Matcher> Display for Term<M>

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

Formats the value using the given formatter.

impl<M: Hash + Matcher> Hash for Term<M>

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<'a, M: Matcher> IntoIterator for &'a Term<M>

Having the same mutator for &’a mut Term is not possible in Rust:

• https://stackoverflow.com/questions/49057270/is-there-a-way-to-iterate-over-a-mutable-tree-to-get-a-random-node
• https://sachanganesh.com/programming/graph-tree-traversals-in-rust/

type Item = &'a Term<M>

The type of the elements being iterated over.

type IntoIter = IntoIter<&'a Term<M>, Global>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<M: PartialEq + Matcher> PartialEq<Term<M>> for Term<M>

fn eq(&self, other: &Term<M>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<M> Serialize for Term<M>where
    M: Matcher,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>where
    __S: Serializer,

Serialize this value into the given Serde serializer.

impl<M: Eq + Matcher> Eq for Term<M>

impl<M: Matcher> StructuralEq for Term<M>

impl<M: Matcher> StructuralPartialEq for Term<M>