Enum UnresolvedDomain 

pub enum UnresolvedDomain {
    Int(Vec<Range<IntVal>>),
    IntFromValues(Moo<Expression>),
    Tuple(Vec<DomainPtr>),
    Record(Vec<Field<DomainPtr>>),
    Variant(Vec<Field<DomainPtr>>),
    Matrix(DomainPtr, Vec<DomainPtr>),
    Sequence(SequenceAttr<IntVal>, DomainPtr),
    Set(SetAttr<IntVal>, DomainPtr),
    MSet(MSetAttr<IntVal>, DomainPtr),
    Function(FuncAttr<IntVal>, DomainPtr, DomainPtr),
    Relation(RelAttr<IntVal>, Vec<DomainPtr>),
    Partition(PartitionAttr<IntVal>, DomainPtr),
    Permutation(PermutationAttr<IntVal>, DomainPtr),
    Reference(Reference),
}

Variants use the project-wide type/domain ordering; keep broad matches in the same order.

Variants

Int(Vec<Range<IntVal>>)

IntFromValues(Moo<Expression>)

An integer domain given by the values of a collection, as in int([i | i <- nums]).

The collection may be built from given declarations, so it stays an expression until those are instantiated and it can be evaluated.

Tuple(Vec<DomainPtr>)

A tuple of N elements, each with its own domain

Record(Vec<Field<DomainPtr>>)

A record

Variant(Vec<Field<DomainPtr>>)

A variant domain with its domain options (reusing field entries)

Matrix(DomainPtr, Vec<DomainPtr>)

A n-dimensional matrix with a value domain and n-index domains

Sequence(SequenceAttr<IntVal>, DomainPtr)

Set(SetAttr<IntVal>, DomainPtr)

A set of elements drawn from the inner domain

MSet(MSetAttr<IntVal>, DomainPtr)

Function(FuncAttr<IntVal>, DomainPtr, DomainPtr)

A function with attributes, domain, and range

Relation(RelAttr<IntVal>, Vec<DomainPtr>)

A relation as a set of tuples

Partition(PartitionAttr<IntVal>, DomainPtr)

Permutation(PermutationAttr<IntVal>, DomainPtr)

Reference(Reference)

A reference to a domain letting

Implementations

impl UnresolvedDomain

pub fn has_int_from_values(&self) -> bool

Whether this domain takes its values from a collection expression anywhere inside it.

Such a domain is expensive to resolve – the collection is evaluated afresh each time – so callers ground it once rather than leaving it to be re-resolved on every query.

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

pub fn element_domain(&self) -> Option<DomainPtr>

pub fn has_representation_preference(&self) -> bool

True if any domain in this tree has a representation preference.

pub fn as_type_string(&self) -> String

Format this domain in Essence type style, omitting size attributes and integer ranges.

Trait Implementations

impl Biplate<Expression> for UnresolvedDomain

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

fn biplate( &self, ) -> (Tree<IntVal>, Box<dyn Fn(Tree<IntVal>) -> 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 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<Reference> for UnresolvedDomain

fn biplate( &self, ) -> (Tree<Reference>, Box<dyn Fn(Tree<Reference>) -> 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<UnresolvedDomain> for Domain

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

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

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: UnresolvedDomain, ) -> 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 Clone for UnresolvedDomain

fn clone(&self) -> UnresolvedDomain

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for UnresolvedDomain

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for UnresolvedDomain

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Display for UnresolvedDomain

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

Formats the value using the given formatter.

impl Eq for UnresolvedDomain

impl From<UnresolvedDomain> for Domain

fn from(ud: UnresolvedDomain) -> Self

Converts to this type from the input type.

impl From<UnresolvedDomain> for DomainPtr

fn from(value: UnresolvedDomain) -> Self

Converts to this type from the input type.

impl Hash for UnresolvedDomain

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 UnresolvedDomain

fn eq(&self, other: &UnresolvedDomain) -> bool

Equality operator ==.

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

Inequality operator !=.

impl Quine for UnresolvedDomain

fn ctor_tokens(&self) -> TokenStream

impl Serialize for UnresolvedDomain

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for UnresolvedDomain

impl Typeable for UnresolvedDomain

fn return_type(&self) -> ReturnType

impl Uniplate for UnresolvedDomain

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

Definition of a Uniplate.

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

Replaces the indexth direct child of self.

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 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: 160 bytes

Size for each variant:

• Int: 32 bytes
• IntFromValues: 16 bytes
• Tuple: 32 bytes
• Record: 32 bytes
• Variant: 32 bytes
• Matrix: 40 bytes
• Sequence: 112 bytes
• Set: 104 bytes
• MSet: 160 bytes
• Function: 96 bytes
• Relation: 120 bytes
• Partition: 152 bytes
• Permutation: 80 bytes
• Reference: 32 bytes