pub enum ModalOb {
Generator(QualifiedName),
App(Box<Self>, QualifiedName),
List(List, Vec<Self>),
}Expand description
Object in a model of a modal double theory.
Variants§
Generator(QualifiedName)
Generating object.
App(Box<Self>, QualifiedName)
Application of a generating object operation.
List(List, Vec<Self>)
List of objects in a list modality.
Implementations§
Source§impl ModalOb
impl ModalOb
Sourcepub fn generator(self) -> Option<QualifiedName>
pub fn generator(self) -> Option<QualifiedName>
Extracts an object generator or nothing.
Sourcepub fn unwrap_generator(self) -> QualifiedName
pub fn unwrap_generator(self) -> QualifiedName
Unwraps an object generator, or panics.
Sourcepub fn collect_product(self, op_id: Option<QualifiedName>) -> Option<Vec<Self>>
pub fn collect_product(self, op_id: Option<QualifiedName>) -> Option<Vec<Self>>
Collects application of a product operation into a list of objects.
The intended operation has domain equal to the list modality applied to its codomain, which usually signifies a product of some kind.
Trait Implementations§
Source§impl From<QualifiedName> for ModalOb
impl From<QualifiedName> for ModalOb
Source§fn from(value: QualifiedName) -> Self
fn from(value: QualifiedName) -> Self
Converts to this type from the input type.
impl Eq for ModalOb
impl StructuralPartialEq for ModalOb
Auto Trait Implementations§
impl Freeze for ModalOb
impl RefUnwindSafe for ModalOb
impl Send for ModalOb
impl Sync for ModalOb
impl Unpin for ModalOb
impl UnwindSafe for ModalOb
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.