Struct lattices::set_union::SetUnion

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

Set-union lattice.

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

Tuple Fields

0: Set

Implementations

impl<Set> SetUnion<Set>

pub fn new(val: Set) -> Self

Create a new SetUnion from a Set.

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

Create a new SetUnion from an Into<Set>.

pub fn as_reveal_ref(&self) -> &Set

Reveal the inner value as a shared reference.

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

Reveal the inner value as an exclusive reference.

pub fn into_reveal(self) -> Set

Gets the inner by value, consuming self.

Trait Implementations

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.

fn atomize(self) -> Self::AtomIter

Atomize self: convert into an iter of atoms.

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

impl<Set> DeepReveal for SetUnion<Set>

type Revealed = Set

The underlying type when revealed.

fn deep_reveal(self) -> Self::Revealed

Reveals the underlying lattice types recursively.

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

fn default() -> SetUnion<Set>

Returns the “default value” for a type.

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

where Set: Deserialize<'de>,

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<Set> IsBot for SetUnion<Set>

where Set: Len,

fn is_bot(&self) -> bool

Returns if self is lattice bottom (⊥).

impl<Set> IsTop for SetUnion<Set>

fn is_top(&self) -> bool

Returns if self is lattice top (⊤).

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.

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

Executes the function.

impl<SetSelf, SetOther, Item> LatticeFrom<SetUnion<SetOther>> for SetUnion<SetSelf>

where SetSelf: FromIterator<Item>, SetOther: IntoIterator<Item = Item>,

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

Convert from the Other lattice into Self.

impl<SetSelf, SetOther, Item> Merge<SetUnion<SetOther>> for SetUnion<SetSelf>

where SetSelf: Extend<Item> + Len, SetOther: IntoIterator<Item = Item>,

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

Merge other into the self lattice.

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

where Self: Sized,

Merge this and delta together, returning the new value.

impl<SetSelf, SetOther, Item> PartialEq<SetUnion<SetOther>> for SetUnion<SetSelf>

where SetSelf: Set<Item, Item = Item> + Iter, SetOther: Set<Item, Item = Item> + Iter,

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<SetSelf, SetOther, Item> PartialOrd<SetUnion<SetOther>> for SetUnion<SetSelf>

where SetSelf: Set<Item, Item = Item> + Iter, SetOther: Set<Item, Item = Item> + Iter,

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

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<Set> Serialize for SetUnion<Set>

where Set: Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

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

impl<SetSelf> Eq for SetUnion<SetSelf>

where Self: PartialEq,

impl<SetSelf, SetOther> LatticeOrd<SetUnion<SetOther>> for SetUnion<SetSelf>

where Self: PartialOrd<SetUnion<SetOther>>,