HashMap::remove

pub fn remove(K k) -> bool

use collections::map::{HashMap};

Removes the entry for k.

Returns true when there was one.

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

Parameters#

Returns#

bool

Contracts#

Checked according to --contracts (see Contracts).

ensures !result || self.len == old(self.len) - 1
ensures result || self.len == old(self.len)

Examples#

use collections::map::{HashMap};
use tests::assert;
let m: HashMap<string, int> = HashMap::new();
m.insert("a", 1);
assert!(m.remove("a"));
assert!(!m.remove("a"));
assert!(m.is_empty());

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::keys: Returns the keys, in insertion order.