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

use std::iter::FromIterator;

use super::{RawSet, MFwd, VFwd};

use crate::IdLike;
use crate::methods::*;

// == Base type ==
impl<A: IdLike> Default for RawSet<A> {
    fn default() -> Self { Self::new() }
}

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

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

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

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

impl<A: IdLike> IntoIterator for RawSet<A> {
    type Item = A;

    type IntoIter = impl DoubleEndedIterator<Item=Self::Item>;

    fn into_iter(self) -> Self::IntoIter {
        self.underlying.into_iter().map(|(k, _)| k)
    }
}

impl<'a, A: IdLike> IntoIterator for &'a RawSet<A> {
    type Item = A;

    type IntoIter = impl DoubleEndedIterator<Item=Self::Item>;

    fn into_iter(self) -> Self::IntoIter {
        self.underlying.fwd.iter().map(|(k, _)| k)
    }
}

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

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

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

    type IntoIter = impl DoubleEndedIterator<Item=Self::Item>;

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

// == Forward ==
impl<'a, A: IdLike> IntoIterator for &'a VFwd<'a, A> {
    type Item = A;

    type IntoIter = impl DoubleEndedIterator<Item=Self::Item>;

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