Struct Entries 

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

A Map’s entries, in ascending key order.

Opaque so that the key-ordered storage behind it stays the runtime’s business; what it promises is the order, which is the order a Cove program iterating the same map sees.

Implementations

impl<'a> Entries<'a>

pub fn len(self) -> usize

How many entries the map holds.

pub fn is_empty(self) -> bool

Whether the map holds none.

pub fn get(self, key: &MapKey) -> Option<&'a Value>

What key maps to, if anything.

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

The entries, in ascending key order.

Trait Implementations

impl<'a> Clone for Entries<'a>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Copy for Entries<'a>

impl<'a> Debug for Entries<'a>

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

Formats the value using the given formatter.

impl<'a> IntoIterator for Entries<'a>

type Item = (&'a MapKey, &'a Value)

The type of the elements being iterated over.

type IntoIter = Iter<'a, MapKey, Value>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.