Struct TreeMap

pub struct TreeMap<K, V> { /* private fields */ }

See the module-level documentation for more details.

Implementations

impl<K, V> TreeMap<K, V>

where K: Default + Eq + Ord + PartialEq,

pub fn new() -> Self

Constructor

pub fn size(&self) -> usize

Returns the number of elements in the map.

pub fn contains(&self, key: K) -> bool

Returns true if the map contains an entry associated with the given key.

pub fn get(&self, key: K) -> Option<&V>

Returns the value associated with the key, if Some.

pub fn put(&mut self, key: K, value: V) -> Option<Entry<K, V>>

Inserts the entry into the map. If the key already exists, removes and returns the old entry and inserts a new one. This allows for situations where keys are == without being identical.

pub fn mut_val_or()

Mutates

pub fn remove(&mut self, key: K) -> Option<Entry<K, V>>

Removes and returns the entry associated with the key:value pair, if it exists in the map.

pub fn iter(&self) -> Iter<'_, K, V>

Returns an iterator over borrowed values. The resulting values appear in sorted order.

Example use:

use dsa_rust::associative::probing_hash_table::HashMap;
let mut count: HashMap<char, u8> = HashMap::new();
let mut v = Vec::new();
for e in count.iter() {
    v.push(*e.0);
}

Trait Implementations

impl<K: Debug, V: Debug> Debug for TreeMap<K, V>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<K, V> Default for TreeMap<K, V>

where K: Default + Eq + Ord + PartialEq,

fn default() -> Self

Returns the “default value” for a type.