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

use super::OneToMany;

use crate::id::IdLike;

use crate::methods::{SharedAnyToMany, SharedAnySet};
use crate::methods::{ViewAnyToMany, AnyToMany};
use crate::methods::{ViewSet, AnySet};

use crate::raw_junctions::one_to_many::RawOneToMany;

use std::collections::BTreeSet;

use crate::iterators::{ToManyKeysIterator, ToManyKeyValueIterator};

// == type ==
pub struct Fwd<'a, A: IdLike, B: IdLike> { pub(in crate::shared_junctions) me: &'a OneToMany<A, B> }
pub struct FwdSet<'a, A: IdLike, B: IdLike> { 
    pub(in crate::shared_junctions) parent: &'a OneToMany<A, B>, 
    pub(in crate::shared_junctions) key: A 
}

// == main impl ==
impl <'a, A: IdLike, B: IdLike> SharedAnyToMany<'a, A, B> for Fwd<'a, A, B> {
    type Multi = FwdSet<'a, A, B>;
    type Expunge = BTreeSet<B>;  

    type Iter = impl 'a+DoubleEndedIterator<Item=(A, B)>;
    type Keys = impl 'a+DoubleEndedIterator<Item=A>;
    type Sets = impl 'a+DoubleEndedIterator<Item=(A, Self::Multi)>;
    type Values = impl 'a+DoubleEndedIterator<Item=B>;

    fn get(&self, a: A) -> Self::Multi { FwdSet { 
        parent: self.me, 
        key: a 
    } }
    fn contains_key(&self, a: A) -> bool { self.me.raw.borrow().fwd().contains_key(a) }

    fn len(&self) -> usize { self.me.raw.borrow().fwd().len() }  
    fn keys_len(&self) -> usize { self.me.raw.borrow().fwd().keys_len() }

    fn iter(&self) -> Self::Iter {
        FwdIterator::<'a, A, B> {
            iter: ToManyKeyValueIterator::new(
                self.me.raw.create_interior_set_range(),
                None, None
            )
        }
    }
    fn keys(&self) -> Self::Keys {
        FwdKeysIterator::<'a, A, B> { 
            iter: ToManyKeysIterator::new(self.me.raw.create_interior_map_range())
        }
    }
    fn sets(&self) -> Self::Sets { 
        let me = self.me;
        self.keys().map(move |k| (k, me.fwd().get(k))) 
    }
    fn values(&self) -> Self::Values { self.iter().map(|(_, v)| v) }

    fn insert(&self, a: A, b: B) -> Option<B> { self.me.raw.borrow_mut().mut_fwd().insert(a, b) }
    fn expunge(&self, a: A) -> Self::Expunge { self.me.raw.borrow_mut().mut_fwd().expunge(a) }
}

// == Forward (sets) ==
impl <'a, A: IdLike, B: IdLike> SharedAnySet<'a, B> for FwdSet<'a, A, B> {
    type Iter = impl 'a+DoubleEndedIterator<Item=B>;

    fn contains(&self, b: B) -> bool { 
        let parent = self.parent.raw.borrow();
        let fetch = parent.fwd.get(self.key);
        fetch.contains(b) 
    }
    fn len(&self) -> usize { 
        let parent = self.parent.raw.borrow();
        let fetch = parent.fwd.get(self.key);
        fetch.len() 
    }

    fn iter(&self) -> Self::Iter {
        FwdSetIterator {
            iter: ToManyKeyValueIterator::new(
                self.parent.raw.create_interior_set_range(),
                Some((self.key, B::id_min_value())), 
                Some((self.key, B::id_max_value())),
            )
        }
    }

    fn insert(&self, b: B) -> Option<B>  { self.parent.raw.borrow_mut().mut_fwd().get_mut(self.key).insert(b) }
    fn remove(&self, b: B) -> Option<B> { self.parent.raw.borrow_mut().mut_fwd().get_mut(self.key).remove(b) }
}

// == iterators ==
struct FwdIterator<'a, A: IdLike, B: IdLike> {
    iter: ToManyKeyValueIterator<'a, RawOneToMany<A, B>, A, B>,
}

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

    fn next(&mut self) -> Option<(A, B)> {
        self.iter.next(|p| &p.fwd)
    }
}

impl <'a, A: IdLike, B: IdLike> DoubleEndedIterator for FwdIterator<'a, A, B> {
    fn next_back(&mut self) -> Option<Self::Item> { 
        self.iter.next_back(|p| &p.fwd)
    }
}

struct FwdKeysIterator<'a, A: IdLike, B: IdLike> {
    iter: ToManyKeysIterator<'a, RawOneToMany<A, B>, A>,
}

impl<'a, A: IdLike, B: IdLike> Iterator for FwdKeysIterator<'a, A, B> {
    type Item = A;

    fn next(&mut self) -> Option<A> {
        self.iter.next(|p| &p.fwd)
    }
}

impl <'a, A: IdLike, B: IdLike> DoubleEndedIterator for FwdKeysIterator<'a, A, B> {
    fn next_back(&mut self) -> Option<Self::Item> { 
        self.iter.next_back(|p| &p.fwd)
    }
}

struct FwdSetIterator<'a, A: IdLike, B: IdLike> {
    iter: ToManyKeyValueIterator<'a, RawOneToMany<A, B>, A, B>,
}

impl<'a, A: IdLike, B: IdLike> Iterator for FwdSetIterator<'a, A, B> {
    type Item = B;

    fn next(&mut self) -> Option<B> {
        self.iter.next(|p| &p.fwd).map(|(_, v)| v)
    }
}

impl <'a, A: IdLike, B: IdLike> DoubleEndedIterator for FwdSetIterator<'a, A, B> {
    fn next_back(&mut self) -> Option<Self::Item> { 
        self.iter.next_back(|p| &p.fwd).map(|(_, v)| v)
    }
}