grabapl 0.0.4

A library for graph-based programming languages, with pluggable type systems and a focus on visible intermediate states.
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
114
115
116
117

use serde::{Deserialize, Serialize};
use std::collections::HashMap;
use std::hash::Hash;

#[derive(Debug, Clone, Eq, PartialEq)]
#[cfg_attr(feature = "serde", derive(Serialize, Deserialize))]
pub struct BiMap<L: Hash + Eq, R: Hash + Eq> {
    left_to_right: HashMap<L, R>,
    right_to_left: HashMap<R, L>,
}

impl<L: Eq + Hash + Clone, R: Eq + Hash + Clone> BiMap<L, R> {
    pub fn new() -> Self {
        BiMap {
            left_to_right: HashMap::new(),
            right_to_left: HashMap::new(),
        }
    }

    pub fn from<const N: usize>(pairs: [(L, R); N]) -> Self {
        let mut this = BiMap::new();
        for (left, right) in pairs {
            this.insert(left, right);
        }
        this
    }

    pub fn len(&self) -> usize {
        self.left_to_right.len()
    }

    pub fn into_inner(self) -> (HashMap<L, R>, HashMap<R, L>) {
        (self.left_to_right, self.right_to_left)
    }

    pub fn into_reversed(self) -> BiMap<R, L> {
        BiMap {
            left_to_right: self.right_to_left,
            right_to_left: self.left_to_right,
        }
    }

    pub fn into_left_map(self) -> HashMap<L, R> {
        self.left_to_right
    }

    pub fn into_right_map(self) -> HashMap<R, L> {
        self.right_to_left
    }

    pub fn insert(&mut self, left: L, right: R) {
        // Ensure no existing mapping for left or right
        if self.left_to_right.contains_key(&left) || self.right_to_left.contains_key(&right) {
            panic!("Cannot insert: left or right already exists in the map");
        }
        self.left_to_right.insert(left.clone(), right.clone());
        self.right_to_left.insert(right, left);
    }

    pub fn get_left(&self, left: &L) -> Option<&R> {
        self.left_to_right.get(left)
    }

    pub fn get_right(&self, right: &R) -> Option<&L> {
        self.right_to_left.get(right)
    }

    pub fn contains_left(&self, left: &L) -> bool {
        self.left_to_right.contains_key(left)
    }

    pub fn contains_right(&self, right: &R) -> bool {
        self.right_to_left.contains_key(right)
    }

    pub fn remove_left(&mut self, left: &L) -> Option<R> {
        if let Some(right) = self.left_to_right.remove(left) {
            self.right_to_left.remove(&right);
            Some(right)
        } else {
            None
        }
    }

    pub fn remove_right(&mut self, right: &R) -> Option<L> {
        if let Some(left) = self.right_to_left.remove(right) {
            self.left_to_right.remove(&left);
            Some(left)
        } else {
            None
        }
    }

    pub fn right_values(&self) -> impl Iterator<Item = &R> {
        self.left_to_right.values()
    }

    pub fn left_values(&self) -> impl Iterator<Item = &L> {
        self.right_to_left.values()
    }

    pub fn iter(&self) -> impl Iterator<Item = (&L, &R)> {
        self.left_to_right.iter()
    }
}

// implement IntoIterator for BiMap
impl<L: Eq + std::hash::Hash + Clone, R: Eq + std::hash::Hash + Clone> IntoIterator
    for BiMap<L, R>
{
    type Item = (L, R);
    type IntoIter = std::collections::hash_map::IntoIter<L, R>;

    fn into_iter(self) -> Self::IntoIter {
        self.left_to_right.into_iter()
    }
}