layer-rs 0.1.1

Effect-TS like type level DI container in Rust, with O(log n) get and insert
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
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

use super::*;

/// This requires that the target requirement does not already exist in the tree.
pub trait Insert<NewReq, MinDepth, Queries, Next>
where
    MinDepth: IsNumber,
    Self::MinDepth: IsNumber,
{
    /// Inserts a new requirement into the tree.
    /// If you want to replace an existing requirement, `remove` it beforehand.
    fn insert(self, new_req: NewReq) -> Next;
    type MinDepth;
    type Queries;
}

// insert: insert into leaf node
impl<Req, NewReq> Insert<NewReq, Succ<Zero>, Left<Here>, Node<Req, Node<NewReq, (), ()>, ()>>
    for Node<Req, (), ()>
{
    fn insert(self, new_req: NewReq) -> Node<Req, Node<NewReq, (), ()>, ()> {
        Node {
            requirement: self.requirement,
            prev_left: Node {
                requirement: new_req,
                prev_left: (),
                prev_right: (),
            },
            prev_right: (),
        }
    }

    type MinDepth = Succ<Zero>;
    type Queries = Left<Here>;
}

// insert: insert into left-null tree
impl<Req, ReqR, NewReq>
    Insert<
        NewReq,
        Succ<Succ<Zero>>,
        Left<Right<Here>>,
        Node<Req, Node<NewReq, (), ()>, Node<ReqR, (), ()>>,
    > for Node<Req, (), Node<ReqR, (), ()>>
{
    fn insert(self, new_req: NewReq) -> Node<Req, Node<NewReq, (), ()>, Node<ReqR, (), ()>> {
        Node {
            requirement: self.requirement,
            prev_left: Node {
                requirement: new_req,
                prev_left: (),
                prev_right: (),
            },
            prev_right: self.prev_right,
        }
    }

    type MinDepth = Succ<Succ<Zero>>;
    type Queries = Left<Here>;
}

// insert: insert into right-null tree
impl<Req, ReqL, NewReq>
    Insert<
        NewReq,
        Succ<Succ<Zero>>,
        Right<Left<Here>>,
        Node<Req, Node<ReqL, (), ()>, Node<NewReq, (), ()>>,
    > for Node<Req, Node<ReqL, (), ()>, ()>
{
    fn insert(self, new_req: NewReq) -> Node<Req, Node<ReqL, (), ()>, Node<NewReq, (), ()>> {
        Node {
            requirement: self.requirement,
            prev_left: self.prev_left,
            prev_right: Node {
                requirement: new_req,
                prev_left: (),
                prev_right: (),
            },
        }
    }

    type MinDepth = Succ<Succ<Zero>>;
    type Queries = Right<Here>;
}

// insert: recurse into left subtree twice
impl<
    Req,
    ReqL,
    SubtreeLL,
    SubtreeLR,
    ReqR,
    SubtreeRL,
    SubtreeRR,
    NewReq,
    NextSubtreeL,
    PrevQueriesL,
>
    Insert<
        NewReq,
        <Node<Req, NextSubtreeL, Node<ReqR, SubtreeRL, SubtreeRR>> as MinDepth>::Output,
        Left<PrevQueriesL>,
        Node<Req, NextSubtreeL, Node<ReqR, SubtreeRL, SubtreeRR>>,
    > for Node<Req, Node<ReqL, SubtreeLL, SubtreeLR>, Node<ReqR, SubtreeRL, SubtreeRR>>
where
    Node<ReqL, SubtreeLL, SubtreeLR>: MinDepth,
    Node<ReqR, SubtreeRL, SubtreeRR>: MinDepth,
    Node<Req, NextSubtreeL, Node<ReqR, SubtreeRL, SubtreeRR>>: MinDepth,
    NextSubtreeL: MinDepth,
    Node<ReqL, SubtreeLL, SubtreeLR>:
        Insert<NewReq, <NextSubtreeL as MinDepth>::Output, PrevQueriesL, NextSubtreeL>,
    (): LessThan<
            <Node<ReqL, SubtreeLL, SubtreeLR> as MinDepth>::Output,
            <Node<ReqR, SubtreeRL, SubtreeRR> as MinDepth>::Output,
        >,
{
    fn insert(self, new_req: NewReq) -> Node<Req, NextSubtreeL, Node<ReqR, SubtreeRL, SubtreeRR>> {
        Node {
            requirement: self.requirement,
            prev_left: self.prev_left.insert(new_req),
            prev_right: self.prev_right,
        }
    }

    type MinDepth =
        Succ<<Node<Req, NextSubtreeL, Node<ReqR, SubtreeRL, SubtreeRR>> as MinDepth>::Output>;
    type Queries = Left<PrevQueriesL>;
}

// insert: recurse into left subtree twice
impl<
    Req,
    ReqL,
    SubtreeLL,
    SubtreeLR,
    ReqR,
    SubtreeRL,
    SubtreeRR,
    NewReq,
    NextSubtreeR,
    PrevQueriesR,
>
    Insert<
        NewReq,
        <Node<Req, Node<ReqL, SubtreeLL, SubtreeLR>, NextSubtreeR> as MinDepth>::Output,
        Right<PrevQueriesR>,
        Node<Req, Node<ReqL, SubtreeLL, SubtreeLR>, NextSubtreeR>,
    > for Node<Req, Node<ReqL, SubtreeLL, SubtreeLR>, Node<ReqR, SubtreeRL, SubtreeRR>>
where
    Node<ReqL, SubtreeLL, SubtreeLR>: MinDepth,
    Node<ReqR, SubtreeRL, SubtreeRR>: MinDepth,
    Node<Req, Node<ReqL, SubtreeLL, SubtreeLR>, NextSubtreeR>: MinDepth,
    NextSubtreeR: MinDepth,
    Node<ReqR, SubtreeRL, SubtreeRR>:
        Insert<NewReq, <NextSubtreeR as MinDepth>::Output, PrevQueriesR, NextSubtreeR>,
    (): GreaterThanOrEqual<
            <Node<ReqL, SubtreeLL, SubtreeLR> as MinDepth>::Output,
            <Node<ReqR, SubtreeRL, SubtreeRR> as MinDepth>::Output,
        >,
{
    fn insert(self, new_req: NewReq) -> Node<Req, Node<ReqL, SubtreeLL, SubtreeLR>, NextSubtreeR> {
        Node {
            requirement: self.requirement,
            prev_left: self.prev_left,
            prev_right: self.prev_right.insert(new_req),
        }
    }

    type MinDepth =
        Succ<<Node<Req, Node<ReqL, SubtreeLL, SubtreeLR>, NextSubtreeR> as MinDepth>::Output>;
    type Queries = Right<PrevQueriesR>;
}