[−][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 Debug for BitSetWithIntersection
[src]
impl LatticeDef for BitSetWithIntersection
[src]
Auto Trait Implementations
impl RefUnwindSafe for BitSetWithIntersection
impl Send for BitSetWithIntersection
impl Sync for BitSetWithIntersection
impl Unpin for BitSetWithIntersection
impl UnwindSafe for BitSetWithIntersection
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,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
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.
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>,