pub struct VecUnion<Lat> { /* private fields */ }
Expand description
Vec-union compound lattice.
Contains any number of Lat
sub-lattices. Sub-lattices are indexed starting at zero, merging
combines corresponding sub-lattices and keeps any excess.
Similar to MapUnion<<usize, Lat>>
but requires the key indices
start with 0
, 1
, 2
, etc: i.e. integers starting at zero with no gaps.
Implementations§
source§impl<Lat> VecUnion<Lat>
impl<Lat> VecUnion<Lat>
sourcepub fn new_from(vec: impl Into<Vec<Lat>>) -> Self
pub fn new_from(vec: impl Into<Vec<Lat>>) -> Self
Create a new VecUnion
from an Into<Vec<Lat>>
.
sourcepub fn as_reveal_ref(&self) -> &Vec<Lat>
pub fn as_reveal_ref(&self) -> &Vec<Lat>
Reveal the inner value as a shared reference.
sourcepub fn as_reveal_mut(&mut self) -> &mut Vec<Lat>
pub fn as_reveal_mut(&mut self) -> &mut Vec<Lat>
Reveal the inner value as an exclusive reference.
sourcepub fn into_reveal(self) -> Vec<Lat>
pub fn into_reveal(self) -> Vec<Lat>
Gets the inner by value, consuming self.
Trait Implementations§
source§impl<Lat> DeepReveal for VecUnion<Lat>where
Lat: DeepReveal,
impl<Lat> DeepReveal for VecUnion<Lat>where
Lat: DeepReveal,
§type Revealed = Vec<<Lat as DeepReveal>::Revealed>
type Revealed = Vec<<Lat as DeepReveal>::Revealed>
The underlying type when revealed.
source§fn deep_reveal(self) -> Self::Revealed
fn deep_reveal(self) -> Self::Revealed
Reveals the underlying lattice types recursively.
source§impl<'de, Lat> Deserialize<'de> for VecUnion<Lat>where
Lat: Deserialize<'de>,
impl<'de, Lat> Deserialize<'de> for VecUnion<Lat>where
Lat: 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<LatSelf, LatOther> LatticeFrom<VecUnion<LatOther>> for VecUnion<LatSelf>where
LatSelf: LatticeFrom<LatOther>,
impl<LatSelf, LatOther> LatticeFrom<VecUnion<LatOther>> for VecUnion<LatSelf>where
LatSelf: LatticeFrom<LatOther>,
source§fn lattice_from(other: VecUnion<LatOther>) -> Self
fn lattice_from(other: VecUnion<LatOther>) -> Self
Convert from the
Other
lattice into Self
.source§impl<LatSelf, LatOther> Merge<VecUnion<LatOther>> for VecUnion<LatSelf>where
LatSelf: Merge<LatOther> + LatticeFrom<LatOther>,
impl<LatSelf, LatOther> Merge<VecUnion<LatOther>> for VecUnion<LatSelf>where
LatSelf: Merge<LatOther> + LatticeFrom<LatOther>,
source§impl<LatSelf, LatOther> PartialEq<VecUnion<LatOther>> for VecUnion<LatSelf>where
LatSelf: PartialEq<LatOther>,
impl<LatSelf, LatOther> PartialEq<VecUnion<LatOther>> for VecUnion<LatSelf>where
LatSelf: PartialEq<LatOther>,
source§impl<LatSelf, LatOther> PartialOrd<VecUnion<LatOther>> for VecUnion<LatSelf>where
LatSelf: PartialOrd<LatOther>,
impl<LatSelf, LatOther> PartialOrd<VecUnion<LatOther>> for VecUnion<LatSelf>where
LatSelf: PartialOrd<LatOther>,
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<Lat: Eq> Eq for VecUnion<Lat>
impl<LatSelf, LatOther> LatticeOrd<VecUnion<LatOther>> for VecUnion<LatSelf>where
Self: PartialOrd<VecUnion<LatOther>>,
Auto Trait Implementations§
impl<Lat> Freeze for VecUnion<Lat>
impl<Lat> RefUnwindSafe for VecUnion<Lat>where
Lat: RefUnwindSafe,
impl<Lat> Send for VecUnion<Lat>where
Lat: Send,
impl<Lat> Sync for VecUnion<Lat>where
Lat: Sync,
impl<Lat> Unpin for VecUnion<Lat>where
Lat: Unpin,
impl<Lat> UnwindSafe for VecUnion<Lat>where
Lat: 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