Struct Moo 

pub struct Moo<T> { /* private fields */ }

A clone-on-write, reference counted pointer to an AST type.

Cloning values of this type will not clone the underlying value until it is modified, e.g., with Moo::make_mut.

Unlike Rc and Arc, trait implementations on this type do not need to preserve shared ownership - that is, two pointers that used to point to the same value may not do so after calling a trait method on them. In particular, calling Uniplate methods may cause a clone-on-write to occur.

Note: like BoxandRc, methods on Mooare all associated functions, which means you have to call them as, e.g.Moo::make_mut(&value)instead ofvalue.make_mut(). This is so that there are no conflicts with the inner type T`, which this type dereferences to.

Implementations

impl Moo<Domain>

pub fn resolve(&self) -> Result<Moo<GroundDomain>, DomainOpError>

pub fn union(&self, other: &DomainPtr) -> Result<DomainPtr, DomainOpError>

Convenience method to take Domain::union of the Domains behind two DomainPtrs and wrap the result in a new DomainPtr.

pub fn intersect(&self, other: &DomainPtr) -> Result<DomainPtr, DomainOpError>

Convenience method to take Domain::intersect of the Domains behind two DomainPtrs and wrap the result in a new DomainPtr.

impl<T> Moo<T>

pub fn new(value: T) -> Moo<T>

Constructs a new Moo<T>.

impl<T: Clone> Moo<T>

pub fn make_mut(this: &mut Moo<T>) -> &mut T

Makes a mutable reference into the given Moo.

If there are other Moo pointers to the same allocation, then make_mut will clone the inner value to a new allocation to ensure unique ownership. This is also referred to as clone-on-write.

pub fn unwrap_or_clone(this: Moo<T>) -> T

If we have the only reference to T then unwrap it. Otherwise, clone T and return the clone.

Assuming moo_t is of type Moo<T>, this function is functionally equivalent to (*moo_t).clone(), but will avoid cloning the inner value where possible.

Trait Implementations

impl<T> AsRef<T> for Moo<T>

fn as_ref(&self) -> &T

Converts this type into a shared reference of the (usually inferred) input type.

impl Biplate<Moo<Domain>> for Domain

fn biplate(&self) -> (Tree<DomainPtr>, Box<dyn Fn(Tree<DomainPtr>) -> Domain>)

Definition of a Biplate.

fn with_children_bi(&self, children: VecDeque<To>) -> Self

Reconstructs the node with the given children.

fn descend_bi(&self, op: &impl Fn(To) -> To) -> Self

Biplate variant of [Uniplate::descend]

fn universe_bi(&self) -> VecDeque<To>

Gets all children of a node, including itself and all children.

fn children_bi(&self) -> VecDeque<To>

Returns the children of a type. If to == from then it returns the original element (in contrast to children).

fn children_bi_count(&self) -> usize

Number of children that would be returned by children_bi.

fn try_replace_child_at_bi(&mut self, index: usize, child: To) -> bool

Replaces the indexth child of type To within self.

fn transform_bi(&self, op: &impl Fn(To) -> To) -> Self

Applies the given function to all nodes bottom up.

fn holes_bi(&self) -> impl Iterator<Item = (To, impl Fn(To))>

Returns an iterator over all direct children of the input, paired with a function that “fills the hole” where the child was with a new value.

fn contexts_bi(&self) -> impl Iterator<Item = (To, impl Fn(To))>

Returns an iterator over the universe of the input, paired with a function that “fills the hole” where the child was with a new value.

impl Biplate<Moo<Domain>> for UnresolvedDomain

fn biplate( &self, ) -> (Tree<DomainPtr>, Box<dyn Fn(Tree<DomainPtr>) -> UnresolvedDomain>)

Definition of a Biplate.

fn with_children_bi(&self, children: VecDeque<To>) -> Self

Reconstructs the node with the given children.

fn descend_bi(&self, op: &impl Fn(To) -> To) -> Self

Biplate variant of [Uniplate::descend]

fn universe_bi(&self) -> VecDeque<To>

Gets all children of a node, including itself and all children.

fn children_bi(&self) -> VecDeque<To>

Returns the children of a type. If to == from then it returns the original element (in contrast to children).

fn children_bi_count(&self) -> usize

Number of children that would be returned by children_bi.

fn try_replace_child_at_bi(&mut self, index: usize, child: To) -> bool

Replaces the indexth child of type To within self.

fn transform_bi(&self, op: &impl Fn(To) -> To) -> Self

Applies the given function to all nodes bottom up.

fn holes_bi(&self) -> impl Iterator<Item = (To, impl Fn(To))>

Returns an iterator over all direct children of the input, paired with a function that “fills the hole” where the child was with a new value.

fn contexts_bi(&self) -> impl Iterator<Item = (To, impl Fn(To))>

Returns an iterator over the universe of the input, paired with a function that “fills the hole” where the child was with a new value.

impl Biplate<Moo<Domain>> for Expression

fn biplate( &self, ) -> (Tree<DomainPtr>, Box<dyn Fn(Tree<DomainPtr>) -> Expression>)

Definition of a Biplate.

fn with_children_bi(&self, children: VecDeque<To>) -> Self

Reconstructs the node with the given children.

fn descend_bi(&self, op: &impl Fn(To) -> To) -> Self

Biplate variant of [Uniplate::descend]

fn universe_bi(&self) -> VecDeque<To>

Gets all children of a node, including itself and all children.

fn children_bi(&self) -> VecDeque<To>

Returns the children of a type. If to == from then it returns the original element (in contrast to children).

fn children_bi_count(&self) -> usize

Number of children that would be returned by children_bi.

fn try_replace_child_at_bi(&mut self, index: usize, child: To) -> bool

Replaces the indexth child of type To within self.

fn transform_bi(&self, op: &impl Fn(To) -> To) -> Self

Applies the given function to all nodes bottom up.

fn holes_bi(&self) -> impl Iterator<Item = (To, impl Fn(To))>

Returns an iterator over all direct children of the input, paired with a function that “fills the hole” where the child was with a new value.

fn contexts_bi(&self) -> impl Iterator<Item = (To, impl Fn(To))>

Returns an iterator over the universe of the input, paired with a function that “fills the hole” where the child was with a new value.

impl<To, U> Biplate<To> for Moo<U>

where To: Uniplate, U: Uniplate + Biplate<To>,

fn children_bi_count(&self) -> usize

Counts children through the pointer, without cloning the pointee.

The default implementation materialises children_bi, which goes via [Biplate::biplate] and therefore clones the whole inner value. Payload syncs call this once per tree level, so the default turns a single rewrite under a wide node (e.g. or over a large matrix) into O(n) work, and a full rewrite pass into O(n^2).

fn try_replace_child_at_bi(&mut self, index: usize, child: To) -> bool

Replaces a child through the pointer, cloning the pointee only when it is shared.

Mirrors [Biplate::children_bi_count] above: the default implementation clones the inner value twice (once to list children, once to rebuild) and structurally compares the old and new trees.

fn biplate(&self) -> (Tree<To>, Box<dyn Fn(Tree<To>) -> Self>)

Definition of a Biplate.

fn with_children_bi(&self, children: VecDeque<To>) -> Self

Reconstructs the node with the given children.

fn descend_bi(&self, op: &impl Fn(To) -> To) -> Self

Biplate variant of [Uniplate::descend]

fn universe_bi(&self) -> VecDeque<To>

Gets all children of a node, including itself and all children.

fn children_bi(&self) -> VecDeque<To>

Returns the children of a type. If to == from then it returns the original element (in contrast to children).

fn transform_bi(&self, op: &impl Fn(To) -> To) -> Self

Applies the given function to all nodes bottom up.

fn holes_bi(&self) -> impl Iterator<Item = (To, impl Fn(To))>

Returns an iterator over all direct children of the input, paired with a function that “fills the hole” where the child was with a new value.

fn contexts_bi(&self) -> impl Iterator<Item = (To, impl Fn(To))>

Returns an iterator over the universe of the input, paired with a function that “fills the hole” where the child was with a new value.

impl<T: Clone> Clone for Moo<T>

fn clone(&self) -> Moo<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for Moo<T>

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

Formats the value using the given formatter.

impl<T> Deref for Moo<T>

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<T: Clone> DerefMut for Moo<T>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<'de, T: Deserialize<'de>> Deserialize<'de> for Moo<T>

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'de, T, As> DeserializeAs<'de, Moo<T>> for Moo<As>

where As: DeserializeAs<'de, T>,

fn deserialize_as<D>(deserializer: D) -> Result<Moo<T>, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T: Display> Display for Moo<T>

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

Formats the value using the given formatter.

impl<T: Eq> Eq for Moo<T>

impl From<&Moo<GroundDomain>> for DomainPtr

fn from(value: &Moo<GroundDomain>) -> Self

Converts to this type from the input type.

impl From<&Moo<UnresolvedDomain>> for DomainPtr

fn from(value: &Moo<UnresolvedDomain>) -> Self

Converts to this type from the input type.

impl From<Moo<Expression>> for Expression

fn from(val: Moo<Expression>) -> Self

Converts to this type from the input type.

impl From<Moo<GroundDomain>> for DomainPtr

fn from(value: Moo<GroundDomain>) -> Self

Converts to this type from the input type.

impl From<Moo<UnresolvedDomain>> for DomainPtr

fn from(value: Moo<UnresolvedDomain>) -> Self

Converts to this type from the input type.

impl From<Reference> for Moo<Expression>

fn from(value: Reference) -> Self

Converts to this type from the input type.

impl<T> From<T> for Moo<T>

fn from(value: T) -> Self

Converts to this type from the input type.

impl<A, B> FuncMap<A, B> for Moo<A>

where A: Clone,

type Output = Moo<B>

The output type of the functorial mapping

fn func_map<F>(self, f: F) -> Self::Output

where F: FnMut(A) -> B,

Applies the closure f to self in a functorial way

fn func_map_over<Q, F>(self, f: F) -> Self::Output

where F: FnMut(A) -> B, Q: FuncMarker<P>,

Applies the closure f to self in a functorial way, allowing explicit specification of the marker type P

impl<T: Hash> Hash for Moo<T>

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<T: PartialEq> PartialEq for Moo<T>

fn eq(&self, other: &Moo<T>) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<T: Quine> Quine for Moo<T>

fn ctor_tokens(&self) -> TokenStream

impl<T: Serialize> Serialize for Moo<T>

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<T, As> SerializeAs<Moo<T>> for Moo<As>

where As: SerializeAs<T>,

fn serialize_as<S>(source: &Moo<T>, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<T: PartialEq> StructuralPartialEq for Moo<T>

impl<'a> TryFrom<&'a Moo<Expression>> for &'a Atom

type Error = &'static str

The type returned in the event of a conversion error.

fn try_from(value: &'a Moo<Expression>) -> Result<Self, Self::Error>

Performs the conversion.

impl TryFrom<&Moo<Atom>> for i32

type Error = &'static str

The type returned in the event of a conversion error.

fn try_from(value: &Moo<Atom>) -> Result<Self, Self::Error>

Performs the conversion.

impl TryFrom<&Moo<Literal>> for i32

type Error = &'static str

The type returned in the event of a conversion error.

fn try_from(value: &Moo<Literal>) -> Result<Self, Self::Error>

Performs the conversion.

impl TryFrom<Domain> for Moo<GroundDomain>

type Error = DomainOpError

The type returned in the event of a conversion error.

fn try_from(value: Domain) -> Result<Self, Self::Error>

Performs the conversion.

impl TryFrom<IntVal> for Moo<Expression>

type Error = DomainOpError

The type returned in the event of a conversion error.

fn try_from(value: IntVal) -> Result<Self, Self::Error>

Performs the conversion.

impl TryFrom<Moo<Atom>> for i32

type Error = &'static str

The type returned in the event of a conversion error.

fn try_from(value: Moo<Atom>) -> Result<Self, Self::Error>

Performs the conversion.

impl TryFrom<Moo<Domain>> for Moo<GroundDomain>

type Error = DomainOpError

The type returned in the event of a conversion error.

fn try_from(value: DomainPtr) -> Result<Self, Self::Error>

Performs the conversion.

impl TryFrom<Moo<Domain>> for GroundDomain

type Error = DomainOpError

The type returned in the event of a conversion error.

fn try_from(value: DomainPtr) -> Result<Self, Self::Error>

Performs the conversion.

impl TryFrom<Moo<Expression>> for Atom

type Error = &'static str

The type returned in the event of a conversion error.

fn try_from(value: Moo<Expression>) -> Result<Self, Self::Error>

Performs the conversion.

impl<A, B> TryFuncMap<A, B> for Moo<A>

where A: Clone,

type Output = Moo<B>

The output type of the functorial mapping

fn try_func_map<E, F>(self, f: F) -> Result<Self::Output, E>

where F: FnMut(A) -> Result<B, E>,

Tries to apply the closure f to self in a functorial way

fn try_func_map_over<Q, E, F>(self, f: F) -> Result<Self::Output, E>

where F: FnMut(A) -> Result<B, E>, Q: FuncMarker<P>,

Tries to apply the closure f to self in a functorial way, allowing explicit specification of the marker type P

impl<T> Uniplate for Moo<T>

where T: Uniplate,

fn uniplate(&self) -> (Tree<Self>, Box<dyn Fn(Tree<Self>) -> Self>)

Definition of a Uniplate.

fn descend(&self, op: &impl Fn(Self) -> Self) -> Self

Applies a function to all direct children of this

fn universe(&self) -> VecDeque<Self>

Gets all children of a node, including itself and all children.

fn children(&self) -> VecDeque<Self>

Gets the direct children (maximal substructures) of a node.

fn with_children(&self, children: VecDeque<Self>) -> Self

Reconstructs the node with the given children.

fn try_replace_child_at(&mut self, index: usize, child: Self) -> bool

Replaces the indexth direct child of self.

fn transform(&self, f: &impl Fn(Self) -> Self) -> Self

Applies the given function to all nodes bottom up.

fn rewrite(&self, f: &impl Fn(Self) -> Option<Self>) -> Self

Rewrites by applying a rule everywhere it can.

fn cata<T>(&self, op: &impl Fn(Self, VecDeque<T>) -> T) -> T

Performs a fold-like computation on each value.

fn holes(&self) -> impl Iterator<Item = (Self, impl Fn(Self))>

Returns an iterator over all direct children of the input, paired with a function that “fills the hole” where the child was with a new value.

fn contexts(&self) -> impl Iterator<Item = (Self, impl Fn(Self))>

Returns an iterator over the universe of the input, paired with a function that “fills the hole” where the child was with a new value.

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 8 bytes