TreeMap::iter

pub fn iter() -> TreeMapIter<K, V>

use collections::tree::{TreeMap};

Returns an iterator over the entries in ascending key order.

for e in m does the same; each item is an Entry with key and value.

Called on a TreeMap value as value.iter(…).

Returns#

TreeMapIter<K, V>

See also#

• collections::tree::Entry
• TreeMap: An ordered map from keys of type K to values of type V.
• TreeMap::new: Creates an empty map.
• TreeMap::empty: Creates an empty map; the same as TreeMap::new.
• TreeMap::size: Returns the number of entries.
• TreeMap::is_empty: Returns true when the map has no entries.
• TreeMap::clear: Removes every entry.
• TreeMap::insert: Stores v under k, replacing any value already there.