Struct OrderedTable 

pub struct OrderedTable<K: Ord, V> { /* private fields */ }

A simple table that maps keys to values, sorted by a comparison function.

This is a lightweight alternative to BTreeMap using Ordering.

Implementations

impl<K: Ord, V> OrderedTable<K, V>

pub fn new() -> Self

Create an empty table.

pub fn insert(&mut self, key: K, value: V)

Insert a key-value pair.

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

Look up a key.

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

Remove a key, returning its value.

pub fn len(&self) -> usize

Number of entries.

pub fn is_empty(&self) -> bool

Whether the table is empty.

pub fn iter(&self) -> impl Iterator<Item = (&K, &V)>

Iterate over entries in sorted order.

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

Check if a key exists.

pub fn keys(&self) -> Vec<&K>

Return all keys in sorted order.

pub fn values(&self) -> Vec<&V>

Return all values in key-sorted order.

Trait Implementations

impl<K: Ord, V> Default for OrderedTable<K, V>

fn default() -> Self

Returns the “default value” for a type.