Struct Members 

pub struct Members<'a>(/* private fields */);

A Set’s elements, in ascending key order.

MapKeys and not Values, for the reason Value::set gives on the way in: the restriction is real, and showing it is better than pretending a set holds anything.

Implementations

impl<'a> Members<'a>

pub fn len(self) -> usize

How many elements the set holds.

pub fn is_empty(self) -> bool

Whether the set holds none.

pub fn contains(self, member: &MapKey) -> bool

Whether member is one of them.

pub fn iter(self) -> impl Iterator<Item = &'a MapKey>

The elements, in ascending key order.

Trait Implementations

impl<'a> Clone for Members<'a>

fn clone(&self) -> Members<'a>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Copy for Members<'a>

impl<'a> Debug for Members<'a>

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

Formats the value using the given formatter.

impl<'a> IntoIterator for Members<'a>

type Item = &'a MapKey

The type of the elements being iterated over.

type IntoIter = Iter<'a, MapKey>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.