Enum puffin::algebra::term::Term

pub enum Term<PT: ProtocolTypes> {
    Variable(Variable<PT>),
    Application(Function<PT>, Vec<Term<PT>>),
}

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

Variants

Variable(Variable<PT>)

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

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

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<PT: ProtocolTypes> Term<PT>

pub fn resistant_id(&self) -> u32

pub fn size(&self) -> usize

pub fn is_leaf(&self) -> bool

pub fn get_type_shape(&self) -> &TypeShape<PT>

pub fn name(&self) -> &str

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

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

pub fn evaluate<PB>( &self, context: &TraceContext<PB>, ) -> Result<Box<dyn EvaluatedTerm<PT>>, Error>

where PB: ProtocolBehavior<ProtocolTypes = PT>,

impl<PT: ProtocolTypes> Term<PT>

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<PT>, 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<PT: ProtocolTypes> Term<PT>

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

Trait Implementations

impl<PT: Clone + ProtocolTypes> Clone for Term<PT>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<PT: Debug + ProtocolTypes> Debug for Term<PT>

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

Formats the value using the given formatter.

impl<'de, PT> Deserialize<'de> for Term<PT>

where PT: ProtocolTypes,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<PT: ProtocolTypes> Display for Term<PT>

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

Formats the value using the given formatter.

impl<PT: Hash + ProtocolTypes> Hash for Term<PT>

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

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 IntoIter = IntoIter<&'a Term<PT>>

Which kind of iterator are we turning this into?

type Item = &'a Term<PT>

The type of the elements being iterated over.

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<PT: PartialEq + ProtocolTypes> PartialEq for Term<PT>

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

where PT: ProtocolTypes,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<PT: Eq + ProtocolTypes> Eq for Term<PT>

impl<PT: ProtocolTypes> StructuralPartialEq for Term<PT>