Struct std::collections::tree_map::EntriesExperimental
[-]
[+]
[src]
pub struct Entries<'a, K: 'a, V: 'a> {
// some fields omitted
}Lazy forward iterator over a map
Trait Implementations
impl<'a, K, V> Iterator<(&'a K, &'a V)> for Entries<'a, K, V>
fn next(&mut self) -> Option<(&'a K, &'a V)>
/// Advances the iterator to the next node (in order) and return a
/// tuple with a reference to the key and value. If there are no
/// more nodes, return None.