Enum UnrecognizedKeys 

enum UnrecognizedKeys {
    AllKeys,
    These(BTreeSet<DisfavouredKey>),
}

Keys we have not recognized so far

Initially AllKeys, since we haven’t recognized any.

Variants

AllKeys

No keys have yet been recognized, so everything in the config is unrecognized

These(BTreeSet<DisfavouredKey>)

The keys which remain unrecognized by any consumer

If this is empty, we do not (need to) do any further tracking.

Implementations

impl UnrecognizedKeys

fn is_empty(&self) -> bool

Does it represent the empty set

fn intersect_with(&mut self, other: BTreeSet<DisfavouredKey>)

Update in place, intersecting with other

fn clear(&mut self)

Remove every element of this set.

Trait Implementations

impl Clone for UnrecognizedKeys

fn clone(&self) -> UnrecognizedKeys

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for UnrecognizedKeys

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

Formats the value using the given formatter.

impl Hash for UnrecognizedKeys

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

Feeds this value into the given Hasher.

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

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for UnrecognizedKeys

fn cmp(&self, other: &UnrecognizedKeys) -> 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 UnrecognizedKeys

fn eq(&self, other: &UnrecognizedKeys) -> 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 UnrecognizedKeys

fn partial_cmp(&self, other: &UnrecognizedKeys) -> 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 UnrecognizedKeys

impl StructuralPartialEq for UnrecognizedKeys