Enum AbstractLiteral 

pub enum AbstractLiteral<T>
where
    T: AbstractLiteralValue,
{
    Set(Vec<T>),
    MSet(Vec<T>),
    Matrix(Vec<T>, <T as AbstractLiteralValue>::Dom),
    Tuple(Vec<T>),
    Record(Vec<Field<T>>),
    Sequence(Vec<T>),
    Function(Vec<(T, T)>),
    Variant(Moo<Field<T>>),
    Partition(Vec<Vec<T>>),
    Relation(Vec<Vec<T>>),
    Permutation(Vec<Vec<T>>),
}

Variants

Set(Vec<T>)

MSet(Vec<T>)

Matrix(Vec<T>, <T as AbstractLiteralValue>::Dom)

A 1 dimensional matrix slice with an index domain.

Tuple(Vec<T>)

Record(Vec<Field<T>>)

Sequence(Vec<T>)

Function(Vec<(T, T)>)

Variant(Moo<Field<T>>)

Partition(Vec<Vec<T>>)

Relation(Vec<Vec<T>>)

Permutation(Vec<Vec<T>>)

Cycle notation for a permutation: each inner vec is one cycle. Unlike Partition, this is sparse – any element of the permutation’s domain not mentioned in any cycle is an implicit fixed point (maps to itself), rather than every element needing to be covered.

Implementations

impl AbstractLiteral<Expression>

pub fn domain_of(&self) -> Option<Moo<Domain>>

impl<T> AbstractLiteral<T>

where T: AbstractLiteralValue,

pub fn matrix_implied_indices(elems: Vec<T>) -> AbstractLiteral<T>

Creates a matrix with elements elems, with domain int(1..).

This acts as a variable sized list.

pub fn unwrap_list(&self) -> Option<&Vec<T>>

If the AbstractLiteral is a list, returns its elements.

A list is any a matrix with the domain int(1..). This includes matrix literals without any explicitly specified domain.

pub fn into_list(self) -> Option<Vec<T>>

If this abstract literal is a list, consumes it and returns its elements.

impl AbstractLiteral<Expression>

pub fn into_literals(self) -> Option<AbstractLiteral<Literal>>

If all the elements are literals, returns this as an AbstractLiteral. Otherwise, returns None.

Trait Implementations

impl Biplate<AbstractLiteral<Expression>> for Expression

fn biplate( &self, ) -> (Tree<AbstractLiteral<Expression>>, Box<dyn Fn(Tree<AbstractLiteral<Expression>>) -> 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 Biplate<AbstractLiteral<Expression>> for Literal

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

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<AbstractLiteral<Literal>> for Atom

fn biplate( &self, ) -> (Tree<AbstractLiteral<Literal>>, Box<dyn Fn(Tree<AbstractLiteral<Literal>>) -> Atom>)

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<AbstractLiteral<Literal>> for Expression

fn biplate( &self, ) -> (Tree<AbstractLiteral<Literal>>, Box<dyn Fn(Tree<AbstractLiteral<Literal>>) -> 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 Biplate<AbstractLiteral<Literal>> for Literal

fn biplate( &self, ) -> (Tree<AbstractLiteral<Literal>>, Box<dyn Fn(Tree<AbstractLiteral<Literal>>) -> Literal>)

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<U, To> Biplate<To> for AbstractLiteral<U>

where To: Uniplate, U: AbstractLiteralValue + Biplate<AbstractLiteral<U>> + Biplate<To>, Field<U>: Biplate<AbstractLiteral<U>> + Biplate<To>,

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

Definition of a Biplate.

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 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 for AbstractLiteral<T>

where T: Clone + AbstractLiteralValue, <T as AbstractLiteralValue>::Dom: Clone,

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T> Debug for AbstractLiteral<T>

where T: Debug + AbstractLiteralValue, <T as AbstractLiteralValue>::Dom: Debug,

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

Formats the value using the given formatter.

impl<'de, T> Deserialize<'de> for AbstractLiteral<T>

where T: AbstractLiteralValue + Deserialize<'de>, <T as AbstractLiteralValue>::Dom: Deserialize<'de>,

fn deserialize<__D>( __deserializer: __D, ) -> Result<AbstractLiteral<T>, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T> Display for AbstractLiteral<T>

where T: AbstractLiteralValue,

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

Formats the value using the given formatter.

impl<T> Eq for AbstractLiteral<T>

where T: Eq + AbstractLiteralValue, <T as AbstractLiteralValue>::Dom: Eq,

impl From<AbstractLiteral<Expression>> for Expression

fn from(value: AbstractLiteral<Expression>) -> Expression

Converts to this type from the input type.

impl From<AbstractLiteral<Literal>> for Literal

fn from(literal: AbstractLiteral<Literal>) -> Literal

Converts to this type from the input type.

impl HasDomain for AbstractLiteral<Literal>

fn domain_of(&self) -> Moo<Domain>

Gets the Domain of self.

impl<T> Hash for AbstractLiteral<T>

where T: Hash + AbstractLiteralValue, <T as AbstractLiteralValue>::Dom: Hash,

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

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 for AbstractLiteral<T>

where T: PartialEq + AbstractLiteralValue, <T as AbstractLiteralValue>::Dom: PartialEq,

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

Equality operator ==.

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

Inequality operator !=.

impl<T> Quine for AbstractLiteral<T>

where T: AbstractLiteralValue + Quine,

fn ctor_tokens(&self) -> TokenStream

impl<T> Serialize for AbstractLiteral<T>

where T: AbstractLiteralValue + Serialize, <T as AbstractLiteralValue>::Dom: Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T> StructuralPartialEq for AbstractLiteral<T>

where T: PartialEq + AbstractLiteralValue, <T as AbstractLiteralValue>::Dom: PartialEq,

impl Typeable for AbstractLiteral<Expression>

fn return_type(&self) -> ReturnType

impl<T> Uniplate for AbstractLiteral<T>

where T: AbstractLiteralValue + Biplate<AbstractLiteral<T>>,

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

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: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.