Struct pergola::BitSetWithUnion

pub struct BitSetWithUnion;

This lattice is a standard BitSet-with-union.

Note: you could use a BitSet in the MaxDef or MinOpt lattices (BitSet satisfies the bounds) but the "set semantics" you usually want in a set-of-sets lattice aren't achieved that way: the Ord-provided order on BitSet is a lexicographical total order on the sequence of bits, rather than set-theoretic sub/superset relation (which is only a partial order), and of course joining by max (or min) of that order will not produce a union (or intersection) as one would want.

Trait Implementations

impl Clone for BitSetWithUnion

pub fn clone(&self) -> BitSetWithUnion

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for BitSetWithUnion

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

Formats the value using the given formatter.

impl Default for BitSetWithUnion

pub fn default() -> BitSetWithUnion

Returns the "default value" for a type.

impl<'de> Deserialize<'de> for BitSetWithUnion

pub fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl Eq for BitSetWithUnion

impl Hash for BitSetWithUnion

pub fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

pub fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

impl LatticeDef for BitSetWithUnion

type T = BitSetWrapper

pub fn unit() -> Self::T

pub fn join(lhs: &Self::T, rhs: &Self::T) -> Self::T

pub fn partial_order(lhs: &Self::T, rhs: &Self::T) -> Option<Ordering>

impl Ord for BitSetWithUnion

pub fn cmp(&self, other: &BitSetWithUnion) -> Ordering

This method returns an Ordering between self and other.

#[must_use]pub fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]pub fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]pub fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

impl PartialEq<BitSetWithUnion> for BitSetWithUnion

pub fn eq(&self, other: &BitSetWithUnion) -> bool

This method tests for self and other values to be equal, and is used by ==.

#[must_use]pub fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl PartialOrd<BitSetWithUnion> for BitSetWithUnion

pub fn partial_cmp(&self, other: &BitSetWithUnion) -> Option<Ordering>

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

#[must_use]pub fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

#[must_use]pub fn le(&self, other: &Rhs) -> bool

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

#[must_use]pub fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

#[must_use]pub fn ge(&self, other: &Rhs) -> bool

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

impl Serialize for BitSetWithUnion

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

Serialize this value into the given Serde serializer.

impl StructuralEq for BitSetWithUnion

impl StructuralPartialEq for BitSetWithUnion