-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathregistrar-protected_set.adb
342 lines (267 loc) · 11 KB
/
registrar-protected_set.adb
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
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
------------------------------------------------------------------------------
-- --
-- Ada User Repository Annex (AURA) --
-- ANNEXI-STRAYLINE Reference Implementation --
-- --
-- Core --
-- --
-- ------------------------------------------------------------------------ --
-- --
-- Copyright (C) 2020, ANNEXI-STRAYLINE Trans-Human Ltd. --
-- All rights reserved. --
-- --
-- Original Contributors: --
-- * Richard Wai (ANNEXI-STRAYLINE) --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- --
-- * Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A --
-- PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
package body Registrar.Protected_Set is
----------------------
-- Protected_Master --
----------------------
protected Protected_Master is
-------------
-- Queries --
-------------
function Extract_Subset
(Filter: not null access function (Element: Element_Type)
return Boolean)
return Sets.Set;
function Extract_Subset (Match_Set: Sets.Set) return Sets.Set;
function Extract_Set return Sets.Set;
function Contains_Element (Match: Element_Type) return Boolean;
function Extract_Element (Match: Element_Type) return Element_Type;
function Is_Subset (Query_Set: Sets.Set) return Boolean;
-------------------
-- Modifications --
-------------------
procedure Insert (New_Item: in Element_Type;
Inserted: out Boolean);
procedure Include (New_Item: in Element_Type);
procedure Include_Subset (New_Items: in Sets.Set);
procedure Replace (New_Item: in Element_Type);
procedure Union (Input_Set: in Sets.Set);
procedure Modify
(Match : in Element_Type;
Process: not null access procedure (Item: in out Element_Type));
procedure Delete (Item: in Element_Type);
private
Master: aliased Sets.Set;
end Protected_Master;
----------------------------------------------------------------------------
protected body Protected_Master is
----------------------
-- Contains_Element --
----------------------
function Contains_Element (Match: Element_Type) return Boolean is
(Master.Contains (Match));
---------------------
-- Extract_Element --
---------------------
function Extract_Element (Match: Element_Type) return Element_Type is
begin
return Master(Master.Find (Match));
end Extract_Element;
--------------------
-- Extract_Subset --
--------------------
function Extract_Subset
(Filter: not null access function (Element: Element_Type)
return Boolean)
return Sets.Set
is begin
return Selected_Set: Sets.Set do
for E of Master loop
if Filter (E) then
Selected_Set.Insert (E);
end if;
end loop;
end return;
end Extract_Subset;
--------------------------------------------------
function Extract_Subset (Match_Set: Sets.Set) return Sets.Set is
(Master.Intersection (Match_Set));
-----------------
-- Extract_Set --
-----------------
function Extract_Set return Sets.Set is (Master);
---------------
-- Is_Subset --
---------------
function Is_Subset (Query_Set: Sets.Set) return Boolean is
(Query_Set.Is_Subset (Master));
------------
-- Insert --
------------
procedure Insert (New_Item: in Element_Type;
Inserted: out Boolean)
is
Dont_Care: Sets.Cursor;
begin
Master.Insert (New_Item => New_Item,
Position => Dont_Care,
Inserted => Inserted);
end Insert;
-------------
-- Include --
-------------
procedure Include (New_Item: in Element_Type) is
begin
Master.Include (New_Item);
end Include;
--------------------
-- Include_Subset --
--------------------
procedure Include_Subset (New_Items: in Sets.Set) is
begin
Master.Difference (New_Items);
Master.Union (New_Items);
end Include_Subset;
-------------
-- Replace --
-------------
procedure Replace (New_Item: in Element_Type) is
begin
Master.Replace (New_Item);
end Replace;
-----------
-- Union --
-----------
procedure Union (Input_Set: in Sets.Set) is
begin
Master.Union (Input_Set);
end Union;
------------
-- Modify --
------------
procedure Modify
(Match : in Element_Type;
Process: not null access procedure (Item: in out Element_Type))
is
I: constant Sets.Cursor := Master.Find (Match);
E: Element_Type := Master(I);
begin
Process (E);
Master.Replace_Element (Position => I,
New_Item => E);
end Modify;
------------
-- Delete --
------------
procedure Delete (Item: in Element_Type) is
begin
Master.Delete (Item);
end Delete;
end Protected_Master;
----------------------
-- Contains_Element --
----------------------
function Contains_Element (Match: Element_Type) return Boolean
is (Protected_Master.Contains_Element (Match));
---------------------
-- Extract_Element --
---------------------
function Extract_Element (Match: Element_Type) return Element_Type
is (Protected_Master.Extract_Element (Match));
--------------------
-- Extract_Subset --
--------------------
function Extract_Subset
(Filter: not null access function (Element: Element_Type)
return Boolean)
return Sets.Set
is (Protected_Master.Extract_Subset (Filter));
--------------------------------------------------
function Extract_Subset (Match_Set: Sets.Set) return Sets.Set is
(Protected_Master.Extract_Subset (Match_Set));
-----------------
-- Extract_Set --
-----------------
function Extract_Set return Sets.Set is (Protected_Master.Extract_Set);
---------------
-- Is_Subset --
---------------
function Is_Subset (Query_Set: Sets.Set) return Boolean is
(Protected_Master.Is_Subset (Query_Set));
------------
-- Insert --
------------
procedure Insert (New_Item: in Element_Type;
Inserted: out Boolean)
is begin
Protected_Master.Insert (New_Item => New_Item,
Inserted => Inserted);
end Insert;
-------------
-- Include --
-------------
procedure Include (New_Item: in Element_Type) is
begin
Protected_Master.Include (New_Item);
end Include;
--------------------
-- Include_Subset --
--------------------
procedure Include_Subset (New_Items: in Sets.Set) is
begin
Protected_Master.Include_Subset (New_Items);
end Include_Subset;
-------------
-- Replace --
-------------
procedure Replace (New_Item: in Element_Type) is
begin
Protected_Master.Replace (New_Item);
end Replace;
-----------
-- Union --
-----------
procedure Union (Input_Set: in Sets.Set) is
begin
Protected_Master.Union (Input_Set);
end Union;
------------
-- Modify --
------------
procedure Modify
(Match : in Element_Type;
Process: not null access procedure (Item: in out Element_Type))
is begin
Protected_Master.Modify (Match => Match,
Process => Process);
end Modify;
--------------------
-- Delete_Element --
--------------------
procedure Delete_Element (Match: in Element_Type) is
begin
Protected_Master.Delete (Match);
end Delete_Element;
end Registrar.Protected_Set;