[−][src]Struct pergola::BitSetWithIntersection
This lattice is a standard BitSet
-with-intersection.
As with BitSetWithUnion
, this is a lattice over BitSet
with
set-semantics rather than the lexicographical-total-order provided by the
Ord
implementation on BitSet
. And as with MinOpt
, this provides
a putative "maximal value" for the underlying type (a superset of any actual
BitSet
) as well as a join that inverts the typical order of a set-valued
lattice, taking set-intersections from the "maximal" unit upwards towards
the empty set (at the top of the lattice).
Trait Implementations
impl Clone for BitSetWithIntersection
[src]
pub fn clone(&self) -> BitSetWithIntersection
[src]
pub fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl Debug for BitSetWithIntersection
[src]
impl Default for BitSetWithIntersection
[src]
pub fn default() -> BitSetWithIntersection
[src]
impl<'de> Deserialize<'de> for BitSetWithIntersection
[src]
pub fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
[src]
__D: Deserializer<'de>,
impl Eq for BitSetWithIntersection
[src]
impl Hash for BitSetWithIntersection
[src]
pub fn hash<__H: Hasher>(&self, state: &mut __H)
[src]
pub fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
impl LatticeDef for BitSetWithIntersection
[src]
type T = Option<BitSetWrapper>
pub fn unit() -> Self::T
[src]
pub fn join(lhs: &Self::T, rhs: &Self::T) -> Self::T
[src]
pub fn partial_order(lhs: &Self::T, rhs: &Self::T) -> Option<Ordering>
[src]
impl Ord for BitSetWithIntersection
[src]
pub fn cmp(&self, other: &BitSetWithIntersection) -> Ordering
[src]
#[must_use]pub fn max(self, other: Self) -> Self
1.21.0[src]
#[must_use]pub fn min(self, other: Self) -> Self
1.21.0[src]
#[must_use]pub fn clamp(self, min: Self, max: Self) -> Self
1.50.0[src]
impl PartialEq<BitSetWithIntersection> for BitSetWithIntersection
[src]
pub fn eq(&self, other: &BitSetWithIntersection) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialOrd<BitSetWithIntersection> for BitSetWithIntersection
[src]
pub fn partial_cmp(&self, other: &BitSetWithIntersection) -> Option<Ordering>
[src]
#[must_use]pub fn lt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]pub fn le(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]pub fn gt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]pub fn ge(&self, other: &Rhs) -> bool
1.0.0[src]
impl Serialize for BitSetWithIntersection
[src]
pub fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
__S: Serializer,
[src]
__S: Serializer,
impl StructuralEq for BitSetWithIntersection
[src]
impl StructuralPartialEq for BitSetWithIntersection
[src]
Auto Trait Implementations
impl RefUnwindSafe for BitSetWithIntersection
[src]
impl Send for BitSetWithIntersection
[src]
impl Sync for BitSetWithIntersection
[src]
impl Unpin for BitSetWithIntersection
[src]
impl UnwindSafe for BitSetWithIntersection
[src]
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> DeserializeOwned for T where
T: for<'de> Deserialize<'de>,
[src]
T: for<'de> Deserialize<'de>,
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> Same<T> for T
type Output = T
Should always be Self
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,