TreeMap::min_key

pub fn min_key(K fallback) -> K

use collections::tree::{TreeMap};

Returns the smallest key, or fallback when the map is empty.

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

Parameters#

Returns#

K

Examples#

use collections::tree::{TreeMap};
use tests::assert;
let m: TreeMap<int, bool> = TreeMap::new();
assert!(m.min_key(-1) == -1);
m.insert(4, true);
m.insert(2, true);
assert!(m.min_key(-1) == 2);

See also#

• 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::iter: Returns an iterator over the entries in ascending key order.
• TreeMap::insert: Stores v under k, replacing any value already there.