Struct LexBitSet

pub struct LexBitSet<'a>(pub &'a FixedBitSet);

A totally ordered Bitset wrapper. Useful to implement tie break mechanisms. This wrapper orders the bitsets according to the lexical order of their underlying bits.

Note:

This implementation uses the underlying words representation of the bitsets to perform several comparisons at once. Hence, using a LexBitSet should be more efficient than trying to establish the total ordering yourself with a loop on the 1-bits of the two sets.

Example

let mut a = FixedBitSet::with_capacity(5);
let mut b = FixedBitSet::with_capacity(5);

a.set(2, true);  // bits 0..2 match for a and b
b.set(2, true);

a.set(3, false); // a and b diverge on bit 3
b.set(3, true);  // and a has a 0 bit in that pos

a.set(4, true);  // anything that remains after
b.set(4, false); // the firs lexicographical difference is ignored

assert!(LexBitSet(&a) < LexBitSet(&b));

Tuple Fields

0: &'a FixedBitSet

Trait Implementations

impl<'a> Debug for LexBitSet<'a>

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

Formats the value using the given formatter.

impl Ord for LexBitSet<'_>

The LexBitSet implements a total order on bitsets. As such, it must implement the standard trait Ord.

Note:

This implementation uses the underlying words representation of the bitsets to perform several comparisons at once. Hence, using a LexBitSet should be more efficient than trying to establish the total ordering yourself with a loop on the 1-bits of the two sets.

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

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for LexBitSet<'_>

Having LexBitSet to implement PartialEq means that it at least defines a partial equivalence relation.

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

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for LexBitSet<'_>

Because it is a total order, LexBitSet must also be a partial order. Hence, it must implement the standard trait PartialOrd.

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

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

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

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

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

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

impl Eq for LexBitSet<'_>

Because LexBitSet defines a total order, it makes sense to consider that it also defines an equivalence relation. As such, it implements the standard Eq and PartialEq traits.