Trait JoinSemiLattice 

pub trait JoinSemiLattice: Eq {
    // Required method
    fn join(&mut self, other: &Self) -> bool;
}

A partially ordered set that has a least upper bound for any pair of elements in the set.

Required Methods

fn join(&mut self, other: &Self) -> bool

Computes the least upper bound of two elements, storing the result in self and returning true if self has changed.

The lattice join operator is abbreviated as ∨.

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementations on Foreign Types

impl<T: Idx> JoinSemiLattice for MixedBitSet<T>

fn join(&mut self, other: &Self) -> bool

impl<T: Idx> JoinSemiLattice for DenseBitSet<T>

A DenseBitSet represents the lattice formed by the powerset of all possible values of the index type T ordered by inclusion. Equivalently, it is a tuple of “two-point” lattices, one for each possible value of T.

fn join(&mut self, other: &Self) -> bool

Implementors

impl<T: Clone + Eq> JoinSemiLattice for FlatSet<T>

impl<T: JoinSemiLattice + Clone> JoinSemiLattice for MaybeReachable<T>

impl<V: JoinSemiLattice + Clone> JoinSemiLattice for State<V>

impl<V: JoinSemiLattice + Clone> JoinSemiLattice for StateData<V>