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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
use std::{
collections::HashMap,
marker::PhantomData,
ops::{Index, IndexMut},
};
pub trait TableKey: Copy {
fn new(index: usize) -> Self;
fn index(self) -> usize;
}
#[macro_export]
macro_rules! impl_table_key {
($($(#[$m:meta])* struct $name:ident($ity:ty) as $display_prefix:expr;)*) => {
$(
$(#[$m])*
#[derive(Debug, Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]
pub struct $name($ity);
impl std::fmt::Display for $name {
fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {
write!(f, "{}{}", $display_prefix, self.0)
}
}
impl $crate::table::TableKey for $name {
fn new(index: usize) -> Self {
$name(index as $ity)
}
fn index(self) -> usize {
self.0 as usize
}
}
)*
};
}
#[macro_export]
macro_rules! impl_table_indexing {
($target:path, $($field:ident).+, $key:ty, $value:ty) => {
impl std::ops::Index<$key> for $target {
type Output = $value;
fn index(&self, idx: $key) -> &$value {
&self.$($field).*[idx]
}
}
impl std::ops::IndexMut<$key> for $target {
fn index_mut(&mut self, idx: $key) -> &mut $value {
&mut self.$($field).*[idx]
}
}
};
}
#[derive(Clone)]
pub struct PrimaryTable<I, V> {
next: usize,
pub(crate) storage: HashMap<usize, V>,
unused: PhantomData<I>,
}
impl<I, V> PrimaryTable<I, V> {
pub fn new() -> Self {
Self {
next: 0,
storage: Default::default(),
unused: PhantomData,
}
}
}
impl<I, V> Default for PrimaryTable<I, V> {
fn default() -> PrimaryTable<I, V> {
PrimaryTable::new()
}
}
impl<I: TableKey, V> PrimaryTable<I, V> {
pub fn add(&mut self, value: V) -> I {
let index = self.next;
self.next += 1;
self.storage.insert(index, value);
I::new(index)
}
pub fn remove(&mut self, key: I) {
self.storage.remove(&key.index()).expect("key not in table");
}
pub fn iter<'a>(&'a self) -> impl Iterator<Item = (I, &'a V)> + 'a {
self.storage.iter().map(|(&k, v)| (I::new(k), v))
}
pub fn keys<'a>(&'a self) -> impl Iterator<Item = I> + 'a {
self.storage.keys().cloned().map(I::new)
}
pub fn values<'a>(&'a self) -> impl Iterator<Item = &'a V> + 'a {
self.storage.values()
}
}
impl<I: TableKey, V> Index<I> for PrimaryTable<I, V> {
type Output = V;
fn index(&self, idx: I) -> &V {
self.storage.get(&idx.index()).expect("key not in table")
}
}
impl<I: TableKey, V> IndexMut<I> for PrimaryTable<I, V> {
fn index_mut(&mut self, idx: I) -> &mut V {
self.storage
.get_mut(&idx.index())
.expect("key not in table")
}
}
#[derive(Clone)]
pub struct SecondaryTable<I, V> {
pub(crate) storage: HashMap<usize, V>,
unused: PhantomData<I>,
}
impl<I, V> SecondaryTable<I, V> {
pub fn new() -> Self {
Self {
storage: Default::default(),
unused: PhantomData,
}
}
}
impl<I: TableKey, V> SecondaryTable<I, V> {
pub fn add(&mut self, key: I, value: V) {
if self.storage.insert(key.index(), value).is_some() {
panic!("key already in table");
}
}
pub fn remove(&mut self, key: I) -> Option<V> {
self.storage.remove(&key.index())
}
pub fn contains(&self, key: I) -> bool {
self.storage.contains_key(&key.index())
}
pub fn get(&self, key: I) -> Option<&V> {
self.storage.get(&key.index())
}
pub fn get_mut(&mut self, key: I) -> Option<&mut V> {
self.storage.get_mut(&key.index())
}
}
impl<I, V> Default for SecondaryTable<I, V> {
fn default() -> SecondaryTable<I, V> {
SecondaryTable::new()
}
}
impl<I: TableKey, V> Index<I> for SecondaryTable<I, V> {
type Output = V;
fn index(&self, idx: I) -> &V {
self.storage
.get(&idx.index())
.expect("key not in secondary table")
}
}
impl<I: TableKey, V> IndexMut<I> for SecondaryTable<I, V> {
fn index_mut(&mut self, idx: I) -> &mut V {
self.storage
.get_mut(&idx.index())
.expect("key not in secondary table")
}
}