Struct Dictionary 

pub struct Dictionary<K, V>
where
    K: Hash + Eq,
{ /* private fields */ }

Implementations

impl<K, V> Dictionary<K, V>

where K: Clone + Hash + PartialEq + Copy + Eq, V: Clone + Copy,

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

Examples found in repository

examples/insert.rs (line 4)

fn main() {
    let mut _d: Dictionary<u8, u8> = Dictionary::new();
    _d.insert(1, 2);
    _d.insert(3, 4);

    println!("{}", *_d.get(&3).unwrap());
}

pub fn with_capacity(size: usize) -> Dictionary<K, V>

pub fn clear(&mut self)

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

pub fn from_vecs(key_vec: Vec<K>, value_vec: Vec<V>) -> Dictionary<K, V>

pub fn from_tuples(tuples: Vec<(K, V)>) -> Dictionary<K, V>

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

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Examples found in repository

examples/insert.rs (line 8)

fn main() {
    let mut _d: Dictionary<u8, u8> = Dictionary::new();
    _d.insert(1, 2);
    _d.insert(3, 4);

    println!("{}", *_d.get(&3).unwrap());
}

examples/from_iter.rs (line 10)

fn main() {
    let tuples: Vec<(u8, u8)> = vec![(1, 3), (5, 7)];
    let _d: Dictionary<u8, u8> = Dictionary::from_iter(tuples.iter());
    let tuples_array: Vec<(u8, [u8; 5])> = vec![(2, [3, 4, 5, 6, 7]), (8, [9, 10, 11, 12, 13])];
    let _d_array: Dictionary<u8, [u8; 5]> = Dictionary::from_iter(tuples_array.iter());

    println!("{}", *_d.get(&5).unwrap());
    println!("{:?}", *_d_array.get(&8).unwrap());
}

pub fn get_full<Q>(&self, key: &Q) -> Option<(usize, &K, &V)>

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

pub fn get_index_of<Q>(&self, key: &Q) -> Option<usize>

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

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

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

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

Examples found in repository

examples/insert.rs (line 5)

fn main() {
    let mut _d: Dictionary<u8, u8> = Dictionary::new();
    _d.insert(1, 2);
    _d.insert(3, 4);

    println!("{}", *_d.get(&3).unwrap());
}

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

pub fn is_empty(&self) -> bool

pub fn len(&self) -> usize

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

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

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Trait Implementations

impl<K, V> Debug for Dictionary<K, V>

where K: Display + Clone + Copy + Hash + Debug + Eq, V: Display + Clone + Copy + Debug,

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

Formats the value using the given formatter.

impl<K, V> Display for Dictionary<K, V>

where K: Display + Clone + Copy + Hash + Eq, V: Display + Clone + Copy,

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

Formats the value using the given formatter.

impl<K, V, X> Equivalent<X> for Dictionary<K, V>

where Dictionary<K, V>: PartialEq<X>, K: Eq + Hash,

fn equivalent(&self, other: &X) -> bool

Compare self to key and return true if they are equal.

impl<'a, K, V> FromIterator<&'a (K, V)> for Dictionary<K, V>

where K: Clone + Copy + Hash + PartialEq + Eq + 'a, V: Clone + Copy + PartialEq + 'a,

fn from_iter<T: IntoIterator<Item = &'a (K, V)>>(iter: T) -> Self

Creates a value from an iterator.

impl<K, V> FromIterator<(K, V)> for Dictionary<K, V>

where K: Hash + Eq + Copy, V: Copy,

fn from_iter<T: IntoIterator<Item = (K, V)>>(iter: T) -> Self

Creates a value from an iterator.

impl<K, V: PartialEq> PartialEq for Dictionary<K, V>

where K: Hash + Eq + PartialEq,

fn eq(&self, other: &Dictionary<K, V>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<K, V> StructuralPartialEq for Dictionary<K, V>

where K: Hash + Eq,