indexed_priority_queue 0.3.0

An indexed priority queue with index-based removals, restores and value updates.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45

use crate::indexed::Indexed;
use std::collections::HashMap;
use std::hash::Hash;

#[derive(Default, Debug)]
pub struct IndexedHashMap<K, V>(HashMap<K, V>);

impl<K: Eq + Hash, V> Indexed for IndexedHashMap<K, V> {
    type Index = K;
    type Output = V;

    fn get(&self, index: Self::Index) -> Option<&Self::Output> {
        self.0.get(&index)
    }

    fn get_mut(&mut self, index: Self::Index) -> Option<&mut Self::Output> {
        self.0.get_mut(&index)
    }

    fn insert(&mut self, index: Self::Index, value: Self::Output) -> Option<Self::Output> {
        self.0.insert(index, value)
    }

    fn remove(&mut self, index: Self::Index) -> Option<Self::Output> {
        self.0.remove(&index)
    }

    fn clear(&mut self) {
        self.0.clear()
    }

    fn iter(&mut self) -> impl Iterator<Item = &Self::Output> {
        self.0.values()
    }

    fn iter_mut(&mut self) -> impl Iterator<Item = &mut Self::Output> {
        self.0.values_mut()
    }
}

impl<K, V> From<HashMap<K, V>> for IndexedHashMap<K, V> {
    fn from(value: HashMap<K, V>) -> Self {
        Self(value)
    }
}