TreeMap::insert

pub fn insert(K k, V v) -> bool

use collections::tree::{TreeMap};

Stores v under k, replacing any value already there.

Returns true when k is new and false when an existing value was replaced.

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

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::tree::{TreeMap};
use tests::assert;
let m: TreeMap<string, int> = TreeMap::new();
assert!(m.insert("a", 1));
assert!(!m.insert("a", 2));
assert!(m.get_or("a", 0) == 2);
assert!(m.size() == 1);

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::contains: Returns true when the map has an entry for k.