Struct SortedMap

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

Implementations

impl<K, V> SortedMap<K, V>

where K: Debug + PartialEq + Ord, V: PartialEq,

pub fn new() -> SortedMap<K, V>

Every structure needs a constructor

pub fn cap(&self) -> usize

Returns the capacity of the map

pub fn entries(&self) -> usize

Returns the number of entries in the map

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

Gets the value associated with the provided key in O(log(n)) time, if it exists in the map.

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

Inserts an entry into the map while maintaining sorted order by key in O(n) (n/2 average) time.

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

Removes and returns the entry associated with a given key in O(log(n)) time. TODO: The take() operation leaves None, which prevents O(n) shifts, but isn’t very clean.

Trait Implementations

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

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

Formats the value using the given formatter.

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

where K: Debug + PartialEq + Ord, V: PartialEq,

fn default() -> Self

Returns the “default value” for a type.