moogle 0.4.4

data structures for relational code
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
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318

// stock trait implementations
// trait list taken from https://doc.rust-lang.org/std/collections/struct.BTreeMap.html
// not implementing Index, it requires a Ref-based interface
// not implementing IntoIterator here as it has complicated lifetime issues

use std::{iter::FromIterator};
use std::hash::Hash;

use crate::methods::*;
use crate::IdLike;
use super::{RawOneToMany, VFwd, MFwd, VBwd, MBwd};

type Me<A, B> = RawOneToMany<A, B>;

impl<A: IdLike, B: IdLike> Default for Me<A, B> {
    fn default() -> Self { Me::new() }
}

// TODO: Reexport trait methods for base type

// == base type ==
impl<'a, A: IdLike, B: IdLike> Extend<(&'a A, &'a B)> for Me<A, B> {
    fn extend<T: IntoIterator<Item = (&'a A, &'a B)>>(&mut self, iter: T) {
        self.mut_fwd().extend(iter)
    }
}

impl<A: IdLike, B: IdLike> Extend<(A, B)> for Me<A, B> {
    fn extend<T: IntoIterator<Item = (A, B)>>(&mut self, iter: T) {
        self.mut_fwd().extend(iter)
    }
}

impl<'a, A: IdLike, B: IdLike> FromIterator<(&'a A, &'a B)> for Me<A, B> {
    fn from_iter<T: IntoIterator<Item = (&'a A, &'a B)>>(iter: T) -> Self {
        let mut xs = Me::new();
        xs.extend(iter);
        xs
    }
}

impl<A: IdLike, B: IdLike> FromIterator<(A, B)> for Me<A, B> {
    fn from_iter<T: IntoIterator<Item = (A, B)>>(iter: T) -> Self {
        let mut xs = Me::new();
        xs.extend(iter);
        xs
    }
}

impl<A: IdLike, B: IdLike> Hash for Me<A, B> {
    fn hash<H: std::hash::Hasher>(&self, state: &mut H) {
        self.fwd().hash(state);
    }
}

impl<A: IdLike, B: IdLike> IntoIterator for Me<A, B> {
    type Item = (A, B);

    type IntoIter = impl DoubleEndedIterator<Item=(A, B)>;

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

// don't provide IntoIterator for & and &mut -- 
// we only provide it so it is _possible_ to consume into an iterator
// and you should really use the fwd() and bwd() accessors for that

impl<A: IdLike, B: IdLike> Ord for Me<A, B> {
    fn cmp(&self, other: &Self) -> std::cmp::Ordering {
        self.fwd().iter().cmp(other.fwd().iter())
    }
}

impl<A: IdLike, B: IdLike> PartialEq<Me<A, B>> for Me<A, B> {
    fn eq(&self, other: &Me<A, B>) -> bool {
        self.fwd == other.fwd 
    }
}

impl<A: IdLike, B: IdLike> PartialOrd<Me<A, B>> for Me<A, B> {
    fn partial_cmp(&self, other: &Me<A, B>) -> Option<std::cmp::Ordering> {
        Some(self.cmp(other))
    }
}

impl<A: IdLike, B: IdLike> Eq for Me<A, B> {

}

// == forward (mut) == 
impl<'a, 'b, A: IdLike, B: IdLike> Extend<(&'b A, &'b B)> for MFwd<'a, A, B> {
    fn extend<T: IntoIterator<Item = (&'b A, &'b B)>>(&mut self, iter: T) {
        for (a, b) in iter {
            self.insert(*a, *b);
        }
    }
}

impl<'a, A: IdLike, B: IdLike> Extend<(A, B)> for MFwd<'a, A, B> {
    fn extend<T: IntoIterator<Item = (A, B)>>(&mut self, iter: T) {
        for (a, b) in iter {
            self.insert(a, b);
        }
    }
}

impl<'a, A: IdLike, B: IdLike> Hash for MFwd<'a, A, B> {
    fn hash<H: std::hash::Hasher>(&self, state: &mut H) {
        for i in self.iter() { i.hash(state) }
    }
}

impl<'a, A: IdLike, B: IdLike> Ord for MFwd<'a, A, B> {
    fn cmp(&self, other: &Self) -> std::cmp::Ordering {
        self.0.fwd.cmp(&other.0.fwd)
    }
}

impl<'a, A: IdLike, B: IdLike> PartialEq<MFwd<'a, A, B>> for MFwd<'a, A, B> {
    fn eq(&self, other: &MFwd<'a, A, B>) -> bool {
        self.0.fwd == other.0.fwd
    }
}

impl<'a, A: IdLike, B: IdLike> PartialOrd<MFwd<'a, A, B>> for MFwd<'a, A, B> {
    fn partial_cmp(&self, other: &MFwd<'a, A, B>) -> Option<std::cmp::Ordering> {
        Some(self.cmp(other))
    }
}

impl<'a, A: IdLike, B: IdLike> Eq for MFwd<'a, A, B> {

}

impl<'a, A: IdLike, B: IdLike> IntoIterator for MFwd<'a, A, B> {
    type Item = (A, B);

    type IntoIter = impl DoubleEndedIterator<Item=(A, B)>;

    fn into_iter(self) -> Self::IntoIter {
        self.0.fwd.iter()
    }
}

impl<'a, A: IdLike, B: IdLike> IntoIterator for &'a MFwd<'a, A, B> {
    type Item = (A, B);

    type IntoIter = impl DoubleEndedIterator<Item=(A, B)>;

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

// == forward (immut) == 
impl<'a, A: IdLike, B: IdLike> Hash for VFwd<'a, A, B> {
    fn hash<H: std::hash::Hasher>(&self, state: &mut H) {
        for i in self.iter() { i.hash(state) }
    }
}

impl<'a, A: IdLike, B: IdLike> Ord for VFwd<'a, A, B> {
    fn cmp(&self, other: &Self) -> std::cmp::Ordering {
        self.0.fwd.cmp(&other.0.fwd)
    }
}

impl<'a, A: IdLike, B: IdLike> PartialEq<VFwd<'a, A, B>> for VFwd<'a, A, B> {
    fn eq(&self, other: &VFwd<'a, A, B>) -> bool {
        self.0.fwd == other.0.fwd
    }
}

impl<'a, A: IdLike, B: IdLike> PartialOrd<VFwd<'a, A, B>> for VFwd<'a, A, B> {
    fn partial_cmp(&self, other: &VFwd<'a, A, B>) -> Option<std::cmp::Ordering> {
        Some(self.cmp(other))
    }
}

impl<'a, A: IdLike, B: IdLike> Eq for VFwd<'a, A, B> {

}

impl<'a, A: IdLike, B: IdLike> IntoIterator for VFwd<'a, A, B> {
    type Item = (A, B);

    type IntoIter = impl DoubleEndedIterator<Item=(A, B)>;

    fn into_iter(self) -> Self::IntoIter {
        self.0.fwd.iter()
    }
}

impl<'a, A: IdLike, B: IdLike> IntoIterator for &'a VFwd<'a, A, B> {
    type Item = (A, B);

    type IntoIter = impl DoubleEndedIterator<Item=(A, B)>;

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

// == backward (mut) == 
impl<'a, 'b, A: IdLike, B: IdLike> Extend<(&'b B, &'b A)> for MBwd<'a, A, B> {
    fn extend<T: IntoIterator<Item = (&'b B, &'b A)>>(&mut self, iter: T) {
        for (b, a) in iter {
            self.insert(*b, *a);
        }
    }
}

impl<'a, A: IdLike, B: IdLike> Extend<(B, A)> for MBwd<'a, A, B> {
    fn extend<T: IntoIterator<Item = (B, A)>>(&mut self, iter: T) {
        for (b, a) in iter {
            self.insert(b, a);
        }
    }
}

impl<'a, A: IdLike, B: IdLike> Hash for MBwd<'a, A, B> {
    fn hash<H: std::hash::Hasher>(&self, state: &mut H) {
        for i in self.iter() { i.hash(state) }
    }
}

impl<'a, A: IdLike, B: IdLike> Ord for MBwd<'a, A, B> {
    fn cmp(&self, other: &Self) -> std::cmp::Ordering {
        self.0.bwd.cmp(&other.0.bwd)
    }
}

impl<'a, A: IdLike, B: IdLike> PartialEq<MBwd<'a, A, B>> for MBwd<'a, A, B> {
    fn eq(&self, other: &MBwd<'a, A, B>) -> bool {
        self.0.bwd == other.0.bwd
    }
}

impl<'a, A: IdLike, B: IdLike> PartialOrd<MBwd<'a, A, B>> for MBwd<'a, A, B> {
    fn partial_cmp(&self, other: &MBwd<'a, A, B>) -> Option<std::cmp::Ordering> {
        Some(self.cmp(other))
    }
}

impl<'a, A: IdLike, B: IdLike> Eq for MBwd<'a, A, B> {

}

impl<'a, A: IdLike, B: IdLike> IntoIterator for MBwd<'a, A, B> {
    type Item = (B, A);

    type IntoIter = impl DoubleEndedIterator<Item=(B, A)>;

    fn into_iter(self) -> Self::IntoIter {
        self.0.bwd.iter()
    }
}

impl<'a, A: IdLike, B: IdLike> IntoIterator for &'a MBwd<'a, A, B> {
    type Item = (B, A);

    type IntoIter = impl DoubleEndedIterator<Item=(B, A)>;

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

// == backward (immut) == 
impl<'a, A: IdLike, B: IdLike> Hash for VBwd<'a, A, B> {
    fn hash<H: std::hash::Hasher>(&self, state: &mut H) {
        for i in self.iter() { i.hash(state) }
    }
}

impl<'a, A: IdLike, B: IdLike> Ord for VBwd<'a, A, B> {
    fn cmp(&self, other: &Self) -> std::cmp::Ordering {
        self.0.bwd.cmp(&other.0.bwd)
    }
}

impl<'a, A: IdLike, B: IdLike> PartialEq<VBwd<'a, A, B>> for VBwd<'a, A, B> {
    fn eq(&self, other: &VBwd<'a, A, B>) -> bool {
        self.0.bwd == other.0.bwd
    }
}

impl<'a, A: IdLike, B: IdLike> PartialOrd<VBwd<'a, A, B>> for VBwd<'a, A, B> {
    fn partial_cmp(&self, other: &VBwd<'a, A, B>) -> Option<std::cmp::Ordering> {
        Some(self.cmp(other))
    }
}

impl<'a, A: IdLike, B: IdLike> Eq for VBwd<'a, A, B> {

}

impl<'a, A: IdLike, B: IdLike> IntoIterator for VBwd<'a, A, B> {
    type Item = (B, A);

    type IntoIter = impl DoubleEndedIterator<Item=(B, A)>;

    fn into_iter(self) -> Self::IntoIter {
        self.0.bwd.iter()
    }
}

impl<'a, A: IdLike, B: IdLike> IntoIterator for &'a VBwd<'a, A, B> {
    type Item = (B, A);

    type IntoIter = impl DoubleEndedIterator<Item=(B, A)>;

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