HashMap::keys

pub fn keys() -> Vec<K>

use collections::map::{HashMap};

Returns the keys, in insertion order.

Called on a HashMap value as value.keys(…).

Returns#

Vec<K>

Contracts#

Checked according to --contracts (see Contracts).

ensures result.len() == self.len

Examples#

use collections::map::{HashMap};
use tests::assert;
let m: HashMap<string, int> = HashMap::new();
m.insert("x", 1);
m.insert("y", 2);
let ks = m.keys();
assert!(ks.len() == 2);
assert!(ks[0] == "x");

See also#

• HashMap: A hash map from keys of type K to values of type V.
• HashMap::with_capacity: Creates an empty map with room for about cap buckets before it grows.
• HashMap::new: Creates an empty map.
• HashMap::size: Returns the number of entries.
• HashMap::is_empty: Returns true when the map has no entries.
• HashMap::capacity: Returns the number of buckets.
• HashMap::clear: Removes every entry, keeping the bucket count.
• HashMap::values: Returns the values, in the insertion order of their keys.