#[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>
impl<Set> SetUnion<Set>
sourcepub fn as_reveal_ref(&self) -> &Set
pub fn as_reveal_ref(&self) -> &Set
Reveal the inner value as a shared reference.
sourcepub fn as_reveal_mut(&mut self) -> &mut Set
pub fn as_reveal_mut(&mut self) -> &mut Set
Reveal the inner value as an exclusive reference.
sourcepub fn into_reveal(self) -> Set
pub fn into_reveal(self) -> Set
Gets the inner by value, consuming self.
Trait Implementations§
source§impl<Set> DeepReveal for SetUnion<Set>
impl<Set> DeepReveal for SetUnion<Set>
source§impl<'de, Set> Deserialize<'de> for SetUnion<Set>where
Set: Deserialize<'de>,
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>,
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<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)>,
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)>,
source§impl<SetSelf, SetOther, Item> LatticeFrom<SetUnion<SetOther>> for SetUnion<SetSelf>where
SetSelf: FromIterator<Item>,
SetOther: IntoIterator<Item = Item>,
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
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>,
impl<SetSelf, SetOther, Item> Merge<SetUnion<SetOther>> for SetUnion<SetSelf>where
SetSelf: Extend<Item> + Len,
SetOther: IntoIterator<Item = Item>,
source§impl<SetSelf, SetOther, Item> PartialEq<SetUnion<SetOther>> for SetUnion<SetSelf>where
SetSelf: Set<Item, Item = Item> + Iter,
SetOther: Set<Item, Item = Item> + Iter,
impl<SetSelf, SetOther, Item> PartialEq<SetUnion<SetOther>> for SetUnion<SetSelf>where
SetSelf: Set<Item, Item = Item> + Iter,
SetOther: Set<Item, Item = Item> + Iter,
source§impl<SetSelf, SetOther, Item> PartialOrd<SetUnion<SetOther>> for SetUnion<SetSelf>where
SetSelf: Set<Item, Item = Item> + Iter,
SetOther: Set<Item, Item = Item> + Iter,
impl<SetSelf, SetOther, Item> PartialOrd<SetUnion<SetOther>> for SetUnion<SetSelf>where
SetSelf: Set<Item, Item = Item> + Iter,
SetOther: Set<Item, Item = Item> + Iter,
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
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 moreimpl<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>>,
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> 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<This, Other> NaiveLatticeOrd<Other> for This
impl<This, Other> NaiveLatticeOrd<Other> for This
source§fn naive_cmp(&self, other: &Rhs) -> Option<Ordering>
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