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
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381 | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2015, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- 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 Vadim Godunko, IE 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 --
-- HOLDER 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. --
-- --
------------------------------------------------------------------------------
-- $Revision: 5259 $ $Date: 2015-05-06 17:32:50 +0300 (Ср, 06 мая 2015) $
------------------------------------------------------------------------------
with Ada.Containers.Generic_Array_Sort;
with Ada.Unchecked_Deallocation;
package body Matreshka.Internals.Graphs is
procedure Free is new Ada.Unchecked_Deallocation
(Edge_Array, Edge_Array_Access);
procedure Free is new Ada.Unchecked_Deallocation
(Node_Array, Node_Array_Access);
-----------
-- Clear --
-----------
procedure Clear (Self : in out Graph) is
begin
Free (Self.Nodes);
Free (Self.Edges);
Self.Last_Node := 0;
Self.Last_Edge := 0;
end Clear;
package body Constructor is
-----------
-- Clear --
-----------
procedure Clear (Self : in out Graph) is
begin
Free (Self.Nodes);
Free (Self.Edges);
Self.Last_Node := 0;
Self.Last_Edge := 0;
end Clear;
-----------
-- Index --
-----------
function Index (Self : Node) return Node_Index is
begin
return Self.Index;
end Index;
--------------
-- New_Node --
--------------
function New_Node (Self : Graph'Class) return Node is
procedure Resize;
procedure Resize is
begin
if Self.Nodes = null or else
Self.Nodes'Length < Self.Last_Node + 1
then
declare -- 6 15 28 48 78 123 190
Old : Node_Array_Access := Self.Nodes;
New_Length : constant Node_Index :=
(Self.Last_Node + 4) * 3 / 2;
begin
Self.Self.Nodes := new Node_Array (1 .. New_Length);
if Old /= null then
Self.Nodes.all (Old'Range) := Old.all;
Free (Old);
end if;
end;
end if;
Self.Self.Last_Node := Self.Self.Last_Node + 1;
end Resize;
begin
Resize;
Self.Nodes (Self.Last_Node) :=
(Graph => <>,
Index => Self.Last_Node,
First => 1,
Last => 0);
return (Self.Self, Self.Last_Node);
end New_Node;
--------------
-- New_Edge --
--------------
procedure New_Edge (From, To : Node) is
Ignore : constant Edge_Identifier := New_Edge (From, To);
pragma Unreferenced (Ignore);
begin
null;
end New_Edge;
--------------
-- New_Edge --
--------------
function New_Edge (From, To : Node) return Edge_Identifier is
procedure Resize;
Self : constant Graph_Access := From.Graph;
procedure Resize is
begin
if Self.Edges = null or else
Self.Edges'Length < Self.Last_Edge + 1
then
declare
Old : Edge_Array_Access := Self.Edges;
New_Length : constant Edge_Index :=
(Self.Last_Edge + 2) * 2;
begin
Self.Edges := new Edge_Array (1 .. New_Length);
if Old /= null then
Self.Edges.all (Old'Range) := Old.all;
Free (Old);
end if;
end;
end if;
Self.Last_Edge := Self.Last_Edge + 1;
end Resize;
begin
if To.Graph /= Self then
raise Constraint_Error;
end if;
Resize;
Self.Edges (Self.Last_Edge) :=
(Graph => <>,
Index => Self.Last_Edge,
Id => Edge_Identifier (Self.Last_Edge),
Source => From.Index,
Target => To.Index);
return Edge_Identifier (Self.Last_Edge);
end New_Edge;
procedure Complete
(Input : in out Graph'Class;
Output : out Graphs.Graph)
is
function Less (Left, Right : Edge) return Boolean;
function Less (Left, Right : Edge) return Boolean is
begin
return Left.Source < Right.Source or
(Left.Source = Right.Source and Left.Index < Right.Index);
end Less;
procedure Sort is new Ada.Containers.Generic_Array_Sort
(Edge_Index, Edge, Edge_Array, Less);
begin
Sort (Input.Edges (1 .. Input.Last_Edge));
for J in 1 .. Input.Last_Node loop
Input.Nodes (J).Graph := Output.Self;
Input.Nodes (J).First := 1;
Input.Nodes (J).Last := 0;
end loop;
for J in 1 .. Input.Last_Edge loop
Input.Edges (J).Graph := Output.Self;
Input.Edges (J).Index := J;
if Input.Nodes (Input.Edges (J).Source).Last = 0 then
Input.Nodes (Input.Edges (J).Source).First := J;
end if;
Input.Nodes (Input.Edges (J).Source).Last := J;
end loop;
Output.Last_Node := Input.Last_Node;
Output.Last_Edge := Input.Last_Edge;
Output.Nodes := Input.Nodes;
Output.Edges := Input.Edges;
Input.Last_Node := 0;
Input.Last_Edge := 0;
Input.Nodes := null;
Input.Edges := null;
end Complete;
end Constructor;
----------------
-- Edge_Count --
----------------
function Edge_Count (Self : Graph) return Edge_List_Length is
begin
return Self.Last_Edge;
end Edge_Count;
----------------
-- Edge_Count --
----------------
function Edge_Count (Self : Node) return Edge_List_Length is
begin
return Self.Last - Self.First + 1;
end Edge_Count;
-------------
-- Edge_Id --
-------------
function Edge_Id (Self : Edge) return Edge_Identifier is
begin
return Self.Id;
end Edge_Id;
----------------------
-- First_Edge_Index --
----------------------
function First_Edge_Index (Self : Node) return Edge_Index is
begin
return Self.First;
end First_Edge_Index;
--------------
-- Get_Edge --
--------------
function Get_Edge (Self : Graph'Class; Index : Edge_Index) return Edge is
begin
return Self.Edges (Index);
end Get_Edge;
--------------
-- Get_Edge --
--------------
function Get_Edge (Self : Node'Class; Index : Edge_Index) return Edge is
begin
return Get_Edge (Self.Graph.all, Index);
end Get_Edge;
---------------
-- Get_Edges --
---------------
function Get_Edges (Self : Graph) return Edge_Array is
begin
return Self.Edges (1 .. Self.Last_Edge);
end Get_Edges;
--------------
-- Get_Node --
--------------
function Get_Node (Self : Graph'Class; Index : Node_Index) return Node is
begin
return Self.Nodes (Index);
end Get_Node;
---------------
-- Get_Nodes --
---------------
function Get_Nodes (Self : Graph) return Node_Array is
begin
return Self.Nodes (1 .. Self.Last_Node);
end Get_Nodes;
-----------
-- Index --
-----------
function Index (Self : Node) return Node_Index is
begin
return Self.Index;
end Index;
-----------
-- Index --
-----------
function Index (Self : Edge) return Edge_Index is
begin
return Self.Index;
end Index;
---------------------
-- Last_Edge_Index --
---------------------
function Last_Edge_Index (Self : Node) return Edge_List_Length is
begin
return Self.Last;
end Last_Edge_Index;
----------------
-- Node_Count --
----------------
function Node_Count (Self : Graph) return Node_List_Length is
begin
return Self.Last_Node;
end Node_Count;
--------------------
-- Outgoing_Edges --
--------------------
function Outgoing_Edges (Self : Node) return Edge_Array is
begin
return Self.Graph.Edges (Self.First .. Self.Last);
end Outgoing_Edges;
-----------------
-- Source_Node --
-----------------
function Source_Node (Self : Edge'Class) return Node is
begin
return Self.Graph.Nodes (Self.Source);
end Source_Node;
-----------------
-- Target_Node --
-----------------
function Target_Node (Self : Edge'Class) return Node is
begin
return Self.Graph.Nodes (Self.Target);
end Target_Node;
end Matreshka.Internals.Graphs;
|