Struct PermutationAttr 

pub struct PermutationAttr<A = i32> {
    pub num_moved: Range<A>,
    pub representation: Option<String>,
}

A permutation is inherently total and bijective by definition, so unlike partition or function, its only attribute is a size constraint on numMoved, the number of moved points (i.e. the points not fixed by the permutation) – confirmed against real Conjure’s own numMoved/minNumMoved/maxNumMoved keywords (real Conjure does not accept size/minSize/maxSize here, unlike set/relation/etc).

Fields

num_moved: Range<A>

representation: Option<String>

Optional user-facing representation preference (short name), e.g. "packed".

Written in Essence as permutation (representation packed, …). When present, representation selection heuristics default to this representation if it is applicable.

Implementations

impl<A> PermutationAttr<A>

pub fn with_representation(self, name: impl Into<String>) -> PermutationAttr<A>

Set the representation preference (Essence short name), returning the updated attributes.

impl PermutationAttr<IntVal>

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

Trait Implementations

impl<A> Clone for PermutationAttr<A>

where A: Clone,

fn clone(&self) -> PermutationAttr<A>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<A> Debug for PermutationAttr<A>

where A: Debug,

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

Formats the value using the given formatter.

impl<A> Default for PermutationAttr<A>

fn default() -> PermutationAttr<A>

Returns the “default value” for a type.

impl<'de, A> Deserialize<'de> for PermutationAttr<A>

where A: Deserialize<'de>,

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<A> Display for PermutationAttr<A>

where A: Display,

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

Formats the value using the given formatter.

impl<A> Eq for PermutationAttr<A>

where A: Eq,

impl From<PermutationAttr> for PermutationAttr<IntVal>

fn from(val: PermutationAttr) -> PermutationAttr<IntVal>

Converts to this type from the input type.

impl<B, C> FuncMap<B, C> for PermutationAttr<B>

where Range<B>: FuncMap<B, C, Output = Range<C>>, Option<String>: Sized,

type Output = PermutationAttr<C>

The output type of the functorial mapping

fn func_map<F>(self, f: F) -> <PermutationAttr<B> as FuncMap<B, C>>::Output

where F: FnMut(B) -> C,

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<A> Hash for PermutationAttr<A>

where A: 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<A> PartialEq for PermutationAttr<A>

where A: PartialEq,

fn eq(&self, other: &PermutationAttr<A>) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<A> Quine for PermutationAttr<A>

where A: Quine,

fn ctor_tokens(&self) -> TokenStream

impl<A> Serialize for PermutationAttr<A>

where A: 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<A> StructuralPartialEq for PermutationAttr<A>

where A: PartialEq,

impl TryFrom<PermutationAttr<IntVal>> for PermutationAttr

type Error = DomainOpError

The type returned in the event of a conversion error.

fn try_from( val: PermutationAttr<IntVal>, ) -> Result<PermutationAttr, <PermutationAttr as TryFrom<PermutationAttr<IntVal>>>::Error>

Performs the conversion.

impl<B, C> TryFuncMap<B, C> for PermutationAttr<B>

where Range<B>: TryFuncMap<B, C, Output = Range<C>>, Option<String>: Sized,

type Output = PermutationAttr<C>

The output type of the functorial mapping

fn try_func_map<E, F>( self, f: F, ) -> Result<<PermutationAttr<B> as TryFuncMap<B, C>>::Output, E>

where F: FnMut(B) -> Result<C, 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

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.