mbimap 0.0.1

Pooled bijective maps in Rust
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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113

use std::collections::{HashMap, HashSet};
use std::fmt::Debug;
use std::hash::Hash;

pub struct MbiMap<K: Hash, V: Hash> {
    kvs: HashMap<K, HashSet<V>>,
    vks: HashMap<V, HashSet<K>>,
}

impl<K: Debug + Hash, V: Debug + Hash> Debug for MbiMap<K, V> {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        self.kvs.fmt(f)
    }
}

impl<K: Clone + Eq + Hash, V: Clone + Eq + Hash> MbiMap<K, V> {
    pub fn new() -> Self {
        Self {
            kvs: HashMap::new(),
            vks: HashMap::new(),
        }
    }

    pub fn insert(&mut self, k: K, v: V) {
        let (k1, v1) = (k.clone(), v.clone());
        self.kvs.entry(k1).or_insert_with(HashSet::new).insert(v1);
        self.vks.entry(v).or_insert_with(HashSet::new).insert(k);
    }

    pub fn insert_kvs(&mut self, k: K, vs: Vec<V>) {
        let (k1, vs1) = (k.clone(), vs.clone());
        self.kvs.entry(k1).or_insert_with(HashSet::new).extend(vs1);
        for v in vs {
            self.vks
                .entry(v)
                .or_insert_with(HashSet::new)
                .insert(k.clone());
        }
    }

    pub fn insert_ksv(&mut self, ks: Vec<K>, v: V) {
        let (ks1, v1) = (ks.clone(), v.clone());
        self.vks.entry(v1).or_insert_with(HashSet::new).extend(ks1);
        for k in ks {
            self.kvs
                .entry(k)
                .or_insert_with(HashSet::new)
                .insert(v.clone());
        }
    }

    pub fn get_by_left(&self, k: &K) -> Option<&HashSet<V>> {
        self.kvs.get(k)
    }

    pub fn get_mut_by_left(&mut self, k: &K) -> Option<&mut HashSet<V>> {
        self.kvs.get_mut(k)
    }

    pub fn get_mut_by_right(&mut self, v: &V) -> Option<&mut HashSet<K>> {
        self.vks.get_mut(v)
    }

    pub fn remove(&mut self, k: &K, v: &V) {
        if let Some(kk) = self.kvs.get_mut(k) {
            kk.remove(v);
        }
        if let Some(vv) = self.vks.get_mut(v) {
            vv.remove(k);
        }
    }

    pub fn remove_by_left(&mut self, k: &K, vs: &Vec<V>) {
        for v in vs {
            self.remove(k, v);
        }
    }

    pub fn remove_by_right(&mut self, ks: &Vec<K>, v: &V) {
        for k in ks {
            self.remove(k, v);
        }
    }

    pub fn remove_all_by_left(&mut self, k: &K) -> Option<HashSet<V>> {
        let oitems = self.kvs.remove(k);
        if let Some(vs) = &oitems {
            for v in vs {
                if let Some(vv) = self.vks.get_mut(v) {
                    vv.remove(k);
                }
            }
        }
        oitems
    }

    pub fn remove_all_by_right(&mut self, v: &V) -> Option<HashSet<K>> {
        let oitems = self.vks.remove(v);
        if let Some(ks) = &oitems {
            for k in ks {
                if let Some(kk) = self.kvs.get_mut(k) {
                    kk.remove(v);
                }
            }
        }
        oitems
    }

    pub fn clear(&mut self) {
        self.kvs.clear();
        self.vks.clear();
    }
}