Struct pergola::BitSetWithUnion

pub struct BitSetWithUnion;

This lattice is a standard bitset-with-union.

Note: you could use a BitSet in the MaxStd 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 Debug for BitSetWithUnion

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl LatticeDef for BitSetWithUnion

type T = BitSet

fn unit() -> Self::T

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

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