#[repr(transparent)]
pub struct SetUnion<Set>(pub Set);
Expand description

Set-union lattice.

Merging set-union lattices is done by unioning the keys.

Tuple Fields§

§0: Set

Implementations§

source§

impl<Set> SetUnion<Set>

source

pub fn new(val: Set) -> Self

Create a new SetUnion from a Set.

source

pub fn new_from(val: impl Into<Set>) -> Self

Create a new SetUnion from an Into<Set>.

source

pub fn as_reveal_ref(&self) -> &Set

Reveal the inner value as a shared reference.

source

pub fn as_reveal_mut(&mut self) -> &mut Set

Reveal the inner value as an exclusive reference.

source

pub fn into_reveal(self) -> Set

Gets the inner by value, consuming self.

Trait Implementations§

source§

impl<Set, Item> Atomize for SetUnion<Set>
where Set: Len + IntoIterator<Item = Item> + Extend<Item>, Set::IntoIter: 'static, Item: 'static,

§

type Atom = SetUnion<SingletonSet<Item>>

The type of atoms for this lattice.
§

type AtomIter = Box<dyn Iterator<Item = <SetUnion<Set> as Atomize>::Atom>>

The iter type iterating the antichain atoms.
source§

fn atomize(self) -> Self::AtomIter

Atomize self: convert into an iter of atoms. Read more
source§

impl<Set: Clone> Clone for SetUnion<Set>

source§

fn clone(&self) -> SetUnion<Set>

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl<Set: Debug> Debug for SetUnion<Set>

source§

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

Formats the value using the given formatter. Read more
source§

impl<Set> DeepReveal for SetUnion<Set>

§

type Revealed = Set

The underlying type when revealed.
source§

fn deep_reveal(self) -> Self::Revealed

Reveals the underlying lattice types recursively.
source§

impl<Set: Default> Default for SetUnion<Set>

source§

fn default() -> SetUnion<Set>

Returns the “default value” for a type. Read more
source§

impl<'de, Set> Deserialize<'de> for SetUnion<Set>
where Set: Deserialize<'de>,

source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
source§

impl<Set> IsBot for SetUnion<Set>
where Set: Len,

source§

fn is_bot(&self) -> bool

Returns if self is lattice bottom (⊥). Read more
source§

impl<Set> IsTop for SetUnion<Set>

source§

fn is_top(&self) -> bool

Returns if self is lattice top (⊤). Read more
source§

impl<SetA, SetB, SetOut> LatticeBimorphism<SetUnion<SetA>, SetUnion<SetB>> for CartesianProductBimorphism<SetOut>
where SetA: IntoIterator, SetB: Iter + SimpleCollectionRef, SetA::Item: Clone, SetB::Item: Clone, SetOut: FromIterator<(SetA::Item, SetB::Item)>,

§

type Output = SetUnion<SetOut>

The output lattice type.
source§

fn call(&mut self, lat_a: SetUnion<SetA>, lat_b: SetUnion<SetB>) -> Self::Output

Executes the function.
source§

impl<SetSelf, SetOther, Item> LatticeFrom<SetUnion<SetOther>> for SetUnion<SetSelf>
where SetSelf: FromIterator<Item>, SetOther: IntoIterator<Item = Item>,

source§

fn lattice_from(other: SetUnion<SetOther>) -> Self

Convert from the Other lattice into Self.
source§

impl<SetSelf, SetOther, Item> Merge<SetUnion<SetOther>> for SetUnion<SetSelf>
where SetSelf: Extend<Item> + Len, SetOther: IntoIterator<Item = Item>,

source§

fn merge(&mut self, other: SetUnion<SetOther>) -> bool

Merge other into the self lattice. Read more
source§

fn merge_owned(this: Self, delta: Other) -> Self
where Self: Sized,

Merge this and delta together, returning the new value.
source§

impl<SetSelf, SetOther, Item> PartialEq<SetUnion<SetOther>> for SetUnion<SetSelf>
where SetSelf: Set<Item, Item = Item> + Iter, SetOther: Set<Item, Item = Item> + Iter,

source§

fn eq(&self, other: &SetUnion<SetOther>) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl<SetSelf, SetOther, Item> PartialOrd<SetUnion<SetOther>> for SetUnion<SetSelf>
where SetSelf: Set<Item, Item = Item> + Iter, SetOther: Set<Item, Item = Item> + Iter,

source§

fn partial_cmp(&self, other: &SetUnion<SetOther>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists. Read more
1.0.0 · source§

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

This method tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · source§

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

This method tests less than or equal to (for self and other) and is used by the <= operator. Read more
1.0.0 · source§

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

This method tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 · source§

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

This method tests greater than or equal to (for self and other) and is used by the >= operator. Read more
source§

impl<Set> Serialize for SetUnion<Set>
where Set: Serialize,

source§

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

Serialize this value into the given Serde serializer. Read more
source§

impl<Set: Copy> Copy for SetUnion<Set>

source§

impl<SetSelf> Eq for SetUnion<SetSelf>
where Self: PartialEq,

source§

impl<SetSelf, SetOther> LatticeOrd<SetUnion<SetOther>> for SetUnion<SetSelf>
where Self: PartialOrd<SetUnion<SetOther>>,

Auto Trait Implementations§

§

impl<Set> RefUnwindSafe for SetUnion<Set>
where Set: RefUnwindSafe,

§

impl<Set> Send for SetUnion<Set>
where Set: Send,

§

impl<Set> Sync for SetUnion<Set>
where Set: Sync,

§

impl<Set> Unpin for SetUnion<Set>
where Set: Unpin,

§

impl<Set> UnwindSafe for SetUnion<Set>
where Set: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<This, Other> NaiveLatticeOrd<Other> for This
where This: Clone + Merge<Other>, Other: Clone + Merge<This>,

source§

fn naive_cmp(&self, other: &Rhs) -> Option<Ordering>

Naive compare based on the Merge::merge method. This method can be very inefficient; use PartialOrd::partial_cmp instead. Read more
source§

impl<T> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<T> DeserializeOwned for T
where T: for<'de> Deserialize<'de>,

source§

impl<T> Lattice for T