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 | -- --
-- package Tables.Names Copyright (c) Dmitry A. Kazakov --
-- Implementation Luebeck --
-- Spring, 2003 --
-- --
-- Last revision : 10:00 19 May 2022 --
-- --
-- This library is free software; you can redistribute it and/or --
-- modify it under the terms of the GNU General Public License as --
-- published by the Free Software Foundation; either version 2 of --
-- the License, or (at your option) any later version. This library --
-- is distributed in the hope that it will be useful, but WITHOUT --
-- ANY WARRANTY; without even the implied warranty of --
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU --
-- General Public License for more details. You should have --
-- received a copy of the GNU General Public License along with --
-- this library; if not, write to the Free Software Foundation, --
-- Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from --
-- this unit, or you link this unit with other files to produce an --
-- executable, this unit does not by itself cause the resulting --
-- executable to be covered by the GNU General Public License. This --
-- exception does not however invalidate any other reasons why the --
-- executable file might be covered by the GNU Public License. --
--____________________________________________________________________--
with Ada.Characters.Handling; use Ada.Characters.Handling;
with Ada.IO_Exceptions; use Ada.IO_Exceptions;
with Ada.Strings.Maps; use Ada.Strings.Maps;
package body Tables.Names is
type Extended_Equality is (Less, Equal, Prefix, Greater);
--
-- Compare -- String with a pattern
--
-- Source - The string
-- Pointer - The position in it
-- Item - The pattern
--
-- Pointer is advanced if the outcome is Equal or Prefix
--
-- Returns :
--
-- Comparison result
--
function Compare
( Source : String;
Pointer : access Integer;
Item : String
) return Extended_Equality is
pragma Inline (Compare);
Index1 : Integer := Pointer.all;
Index2 : Integer := Item'First;
Symbol1 : Character;
Symbol2 : Character;
begin
loop
if Index2 > Item'Last then
if Index1 > Source'Last then
Pointer.all := Index1;
return Equal;
else
Pointer.all := Index1;
return Prefix;
end if;
else
if Index1 > Source'Last then
return Less;
end if;
end if;
Symbol1 := Source (Index1);
Symbol2 := Item (Index2);
if Is_In (Symbol1, Blanks) then
if Is_In (Symbol2, Blanks) then
Index1 := Index1 + 1;
Index2 := Index2 + 1;
while Index1 <= Source'Last loop
exit when not Is_In (Source (Index1), Blanks);
Index1 := Index1 + 1;
end loop;
while Index2 <= Item'Last loop
exit when not Is_In (Item (Index2), Blanks);
Index2 := Index2 + 1;
end loop;
else
return Less;
end if;
else
if Is_In (Symbol2, Blanks) then
return Greater;
else
Symbol1 := To_Lower (Symbol1);
Symbol2 := To_Lower (Symbol2);
if Symbol1 = Symbol2 then
Index1 := Index1 + 1;
Index2 := Index2 + 1;
else
if Symbol1 > Symbol2 then
return Greater;
else
return Less;
end if;
end if;
end if;
end if;
end loop;
end Compare;
function Search
( Folder : Dictionary;
Name : String
) return Integer is
Low : Integer := 0;
High : Integer := Folder.Size + 1;
This : Integer;
Index : aliased Integer;
begin
if High = 1 then
return -1;
end if;
loop
This := (Low + High) / 2;
Index := Name'First;
case Compare (Name, Index'Access, Folder.List (This).Name) is
when Less =>
High := This;
if High - Low = 1 then
return -This;
end if;
when Equal =>
return This;
when Prefix | Greater =>
Low := This;
if High - Low = 1 then
return -(This + 1);
end if;
end case;
end loop;
end Search;
procedure Add
( Folder : in out Dictionary;
Name : String;
Data : Tag
) is
begin
Check_Spelling (Name);
declare
Index : constant Integer := Search (Folder, Name);
begin
if Index > 0 then
raise Name_Error;
else
Insert (Folder, -Index, Name, Data);
end if;
end;
end Add;
procedure Add
( Folder : in out Dictionary;
Name : String;
Data : Tag;
Offset : out Positive
) is
begin
Check_Spelling (Name);
declare
Index : Integer := Search (Folder, Name);
begin
if Index > 0 then
raise Name_Error;
else
Index := -Index;
Insert (Folder, Index, Name, Data);
Offset := Index;
end if;
end;
end Add;
procedure Delete (Folder : in out Dictionary; Name : String) is
Index : constant Integer := Search (Folder, Name);
begin
if Index > 0 then
Delete (Folder, Index);
end if;
end Delete;
function Find (Folder : Dictionary; Name : String) return Tag is
Index : constant Integer := Search (Folder, Name);
begin
if Index > 0 then
return Folder.List (Index).Data;
else
raise End_Error;
end if;
end Find;
function IsIn (Folder : Dictionary; Name : String) return Boolean is
begin
return Search (Folder, Name) > 0;
end IsIn;
procedure Get
( Source : String;
Pointer : in out Integer;
Folder : Dictionary;
Data : out Tag
) is
Index : Natural;
begin
Locate (Source, Pointer, Folder, Index);
if Index = 0 then
raise End_Error;
else
Data := Folder.List (Index).Data;
end if;
end Get;
procedure Get
( Source : String;
Pointer : in out Integer;
Folder : Dictionary;
Data : out Tag;
Got_It : out Boolean
) is
Index : Natural;
begin
Locate (Source, Pointer, Folder, Index);
if Index = 0 then
Got_It := False;
else
Got_It := True;
Data := Folder.List (Index).Data;
end if;
end Get;
function Locate (Folder : Dictionary; Name : String)
return Natural is
Index : constant Integer := Search (Folder, Name);
begin
if Index > 0 then
return Index;
else
return 0;
end if;
end Locate;
procedure Locate
( Source : String;
Pointer : in out Integer;
Folder : Dictionary;
Offset : out Natural
) is
Found : Integer := 0;
Low : Integer := 0;
High : Integer := Folder.Size + 1;
This : Integer;
Next : Integer;
Index : aliased Integer;
begin
if ( Pointer < Source'First
or else
( Pointer > Source'Last
and then
Pointer - 1 > Source'Last
) )
then
raise Layout_Error;
end if;
while High - Low /= 1 loop
This := (Low + High) / 2;
Index := Pointer;
case Compare (Source, Index'Access, Folder.List (This).Name) is
when Less =>
High := This;
when Equal | Prefix =>
Found := This;
Next := Index;
Low := This;
when Greater =>
for Lower in reverse Low + 1 .. This - 1 loop
exit when
( Found /= 0
and then
( Folder.List (Found).Name'Length
> Folder.List (Lower).Name'Length
) );
Index := Pointer;
case Compare
( Source,
Index'Access,
Folder.List (Lower).Name
) is
when Less => -- Rest items could be only
exit; -- lesser than this, exit
when Equal | Prefix =>
Found := Lower; -- Here we are. Ignore the rest
Next := Index; -- lesser, i.e. shorter, items
exit;
when Greater =>
null; -- Undecided, continue
end case;
end loop;
Low := This;
end case;
end loop;
if ( Found = 0
or else
( Next <= Source'Last
and then
not Check_Matched (Source, Next)
) )
then
Offset := 0;
else
Offset := Found;
Pointer := Next;
end if;
end Locate;
procedure Replace
( Folder : in out Dictionary;
Name : String;
Data : Tag
) is
begin
Check_Spelling (Name);
declare
Index : constant Integer := Search (Folder, Name);
begin
if Index > 0 then
Folder.List (Index).Data := Data;
else
Insert (Folder, -Index, Name, Data);
end if;
end;
end Replace;
procedure Replace
( Folder : in out Dictionary;
Name : String;
Data : Tag;
Offset : out Positive
) is
begin
Check_Spelling (Name);
declare
Index : Integer := Search (Folder, Name);
begin
if Index > 0 then
Folder.List (Index).Data := Data;
Offset := Index;
else
Index := -Index;
Insert (Folder, Index, Name, Data);
Offset := Index;
end if;
end;
end Replace;
end Tables.Names;
|