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
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591 | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011, 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: 2353 $ $Date: 2011-12-18 01:42:11 +0400 (Вс, 18 дек 2011) $
------------------------------------------------------------------------------
with Ada.Containers.Generic_Array_Sort;
with Ada.Unchecked_Deallocation;
with League.Characters.Internals;
with Matreshka.Internals.Unicode;
with Matreshka.Internals.Unicode.Ucd.Core;
package body Matreshka.Internals.Code_Point_Sets is
function Max_Result_Last (Left, Right : Shared_Code_Point_Set)
return Second_Stage_Array_Index;
pragma Inline (Max_Result_Last);
generic
with function Operator
(Left, Right : Boolean_Second_Stage) return Boolean_Second_Stage;
function Apply_Binary_Operator
(Left, Right : Shared_Code_Point_Set)
return Shared_Code_Point_Set;
---------------------------
-- Apply_Binary_Operator --
---------------------------
function Apply_Binary_Operator
(Left, Right : Shared_Code_Point_Set)
return Shared_Code_Point_Set
is
use type First_Stage_Index;
Last : Second_Stage_Array_Index := 0;
First_Stage : First_Stage_Map;
Has_All_On : Boolean := False;
Has_All_Off : Boolean := False;
All_On_Index : Second_Stage_Array_Index;
All_Off_Index : Second_Stage_Array_Index;
Is_All_On : Boolean;
Is_All_Off : Boolean;
Second_Stages : Second_Stage_Array
(0 .. Max_Result_Last (Left, Right));
Set : array (Left.Second_Stages'Range, Right.Second_Stages'Range)
of Boolean := (others => (others => False));
Map : array (Left.Second_Stages'Range, Right.Second_Stages'Range)
of Second_Stage_Array_Index;
begin
for J in First_Stage'Range loop
if not Set (Left.First_Stage (J), Right.First_Stage (J)) then
Set (Left.First_Stage (J), Right.First_Stage (J)) := True;
Second_Stages (Last) := Operator
(Left.Second_Stages (Left.First_Stage (J)),
Right.Second_Stages (Right.First_Stage (J)));
Is_All_On := Second_Stages (Last) = All_On;
Is_All_Off := Second_Stages (Last) = All_Off;
if Is_All_On then
if not Has_All_On then
Has_All_On := True;
All_On_Index := Last;
Last := Last + 1;
end if;
Map (Left.First_Stage (J), Right.First_Stage (J)) :=
All_On_Index;
elsif Is_All_Off then
if not Has_All_Off then
Has_All_Off := True;
All_Off_Index := Last;
Last := Last + 1;
end if;
Map (Left.First_Stage (J), Right.First_Stage (J)) :=
All_Off_Index;
else
Map (Left.First_Stage (J), Right.First_Stage (J)) := Last;
Last := Last + 1;
end if;
end if;
First_Stage (J) := Map (Left.First_Stage (J), Right.First_Stage (J));
end loop;
Last := Last - 1;
return
(Last => Last,
Counter => <>,
First_Stage => First_Stage,
Second_Stages => Second_Stages (0 .. Last));
end Apply_Binary_Operator;
function Apply_And is new Apply_Binary_Operator ("and");
function Apply_Or is new Apply_Binary_Operator ("or");
function Apply_Xor is new Apply_Binary_Operator ("xor");
function Minus
(Left, Right : Boolean_Second_Stage)
return Boolean_Second_Stage;
function Apply_Minus is new Apply_Binary_Operator (Minus);
---------
-- "+" --
---------
function "+"
(Right : Shared_Code_Point_Set)
return Shared_Code_Point_Set is
begin
return (Last => Right.Last,
Counter => <>,
First_Stage => Right.First_Stage,
Second_Stages => Right.Second_Stages);
end "+";
---------
-- "-" --
---------
function "-"
(Left, Right : Shared_Code_Point_Set)
return Shared_Code_Point_Set renames Apply_Minus;
---------
-- "=" --
---------
function "=" (Left, Right : Shared_Code_Point_Set) return Boolean is
SF : constant First_Stage_Index := First_Stage_Index
(Internals.Unicode.Surrogate_First / Second_Stage_Index'Modulus);
SL : constant First_Stage_Index := First_Stage_Index
(Internals.Unicode.Surrogate_Last / Second_Stage_Index'Modulus);
begin
for J in Left.First_Stage'Range loop
if Left.Second_Stages (Left.First_Stage (J)) /=
Right.Second_Stages (Right.First_Stage (J))
and then J not in SF .. SL
then
return False;
end if;
end loop;
return True;
end "=";
-----------
-- "and" --
-----------
function "and"
(Left, Right : Shared_Code_Point_Set)
return Shared_Code_Point_Set renames Apply_And;
-----------
-- "not" --
-----------
function "not"
(Right : Shared_Code_Point_Set)
return Shared_Code_Point_Set is
begin
return Result : Shared_Code_Point_Set :=
(Last => Right.Last,
Counter => <>,
First_Stage => Right.First_Stage,
Second_Stages => <>)
do
for J in Right.Second_Stages'Range loop
Result.Second_Stages (J) := not Right.Second_Stages (J);
end loop;
end return;
end "not";
----------
-- "or" --
----------
function "or"
(Left, Right : Shared_Code_Point_Set)
return Shared_Code_Point_Set renames Apply_Or;
-----------
-- "xor" --
-----------
function "xor"
(Left, Right : Shared_Code_Point_Set)
return Shared_Code_Point_Set renames Apply_Xor;
-----------------
-- Dereference --
-----------------
procedure Dereference (Self : in out Shared_Code_Point_Set_Access) is
procedure Free is
new Ada.Unchecked_Deallocation
(Shared_Code_Point_Set, Shared_Code_Point_Set_Access);
pragma Assert (Self /= null);
pragma Suppress (Access_Check);
begin
if Self /= Shared_Empty'Access
and then Matreshka.Atomics.Counters.Decrement (Self.Counter)
then
Free (Self);
end if;
Self := null;
end Dereference;
---------
-- Has --
---------
function Has
(Set : Shared_Code_Point_Set;
Element : League.Characters.Universal_Character)
return Boolean
is
use Matreshka.Internals.Unicode;
First : First_Stage_Index;
Second : Second_Stage_Index;
Code : constant Code_Unit_32 :=
League.Characters.Internals.Internal (Element);
begin
if Is_Valid (Code) then
First := First_Stage_Index (Code / Second_Stage_Index'Modulus);
Second := Second_Stage_Index (Code mod Second_Stage_Index'Modulus);
return Set.Second_Stages (Set.First_Stage (First)) (Second);
else
return False;
end if;
end Has;
--------------
-- Is_Empty --
--------------
function Is_Empty (Set : Shared_Code_Point_Set) return Boolean is
begin
for J in Set.Second_Stages'Range loop
if Set.Second_Stages (J) /= All_Off then
return False;
end if;
end loop;
return True;
end Is_Empty;
---------------
-- Is_Subset --
---------------
function Is_Subset
(Elements : Shared_Code_Point_Set;
Set : Shared_Code_Point_Set)
return Boolean is
begin
return Is_Empty (Elements - Set);
end Is_Subset;
function Match
(Descriptor : Code_Point_Set_Descriptor;
Value : Matreshka.Internals.Unicode.Ucd.Core_Values)
return Boolean
is
use type Matreshka.Internals.Unicode.Ucd.General_Category;
begin
case Descriptor.Kind is
when General_Category =>
return Descriptor.GC_Flags (Value.GC);
when Binary =>
return Value.B (Descriptor.Property);
end case;
end Match;
---------------------
-- Max_Result_Last --
---------------------
function Max_Result_Last
(Left, Right : Shared_Code_Point_Set)
return Second_Stage_Array_Index
is
Left_Size : constant Positive := Natural (Left.Last) + 1;
Right_Size : constant Positive := Natural (Right.Last) + 1;
Max_Size : constant Positive :=
Positive'Min (Left_Size * Right_Size, First_Stage_Index'Modulus);
begin
return Second_Stage_Array_Index (Max_Size - 1);
end Max_Result_Last;
-----------
-- Minus --
-----------
function Minus
(Left, Right : Boolean_Second_Stage)
return Boolean_Second_Stage is
begin
return Left and not Right;
end Minus;
---------------
-- Reference --
---------------
procedure Reference (Self : Shared_Code_Point_Set_Access) is
begin
if Self /= Shared_Empty'Access then
Matreshka.Atomics.Counters.Increment (Self.Counter);
end if;
end Reference;
------------
-- To_Set --
------------
function To_Set
(Sequence : Wide_Wide_String)
return Shared_Code_Point_Set
is
use type First_Stage_Index;
use type Matreshka.Internals.Unicode.Code_Unit_32;
function To_First_Index
(X : Wide_Wide_Character)
return First_Stage_Index;
procedure Sort is new Ada.Containers.Generic_Array_Sort
(Index_Type => Positive,
Element_Type => Wide_Wide_Character,
Array_Type => Wide_Wide_String);
--------------------
-- To_First_Index --
--------------------
function To_First_Index
(X : Wide_Wide_Character)
return First_Stage_Index
is
Pos : constant Natural := Wide_Wide_Character'Pos (X);
begin
return First_Stage_Index (Pos / Second_Stage_Index'Modulus);
end To_First_Index;
Invalid : constant First_Stage_Index := First_Stage_Index
(Internals.Unicode.Surrogate_First / Second_Stage_Index'Modulus);
Last : Second_Stage_Array_Index := 0;
First : First_Stage_Index;
Second : Second_Stage_Index;
Counted : First_Stage_Index := Invalid;
-- Set Counted to something invalid
Code : Matreshka.Internals.Unicode.Code_Unit_32;
Ordered : Wide_Wide_String := Sequence;
begin
Sort (Ordered);
for J in Ordered'Range loop
Code := Wide_Wide_Character'Pos (Ordered (J));
if Matreshka.Internals.Unicode.Is_Valid (Code) then
First := To_First_Index (Ordered (J));
if Counted /= First then
Counted := First;
Last := Last + 1;
end if;
end if;
end loop;
return Result : Shared_Code_Point_Set :=
(Last => Last,
Counter => <>,
First_Stage => (others => 0),
Second_Stages => (others => All_Off))
do
Counted := Invalid;
Last := 0;
for J in Ordered'Range loop
Code := Wide_Wide_Character'Pos (Ordered (J));
if Matreshka.Internals.Unicode.Is_Valid (Code) then
First := To_First_Index (Ordered (J));
if Counted /= First then
Counted := First;
Last := Last + 1;
Result.First_Stage (Counted) := Last;
end if;
Second := Second_Stage_Index
(Code mod Second_Stage_Index'Modulus);
Result.Second_Stages (Last) (Second) := True;
end if;
end loop;
end return;
end To_Set;
------------
-- To_Set --
------------
function To_Set
(Low : Matreshka.Internals.Unicode.Code_Point;
High : Matreshka.Internals.Unicode.Code_Point)
return Shared_Code_Point_Set
is
use Matreshka.Internals.Unicode;
use type Second_Stage_Index;
use type Second_Stage_Array_Index;
Before_Surrogate : constant First_Stage_Index :=
First_Stage_Index (Surrogate_First / 256 - 1);
After_Surrogate : constant First_Stage_Index :=
First_Stage_Index (Surrogate_Last / 256 + 1);
H : Code_Point := High;
HF : First_Stage_Index := First_Stage_Index (H / 256);
HS : Second_Stage_Index := Second_Stage_Index (H mod 256);
L : Code_Point := Low;
LF : First_Stage_Index := First_Stage_Index (L / 256);
LS : Second_Stage_Index := Second_Stage_Index (L mod 256);
Last : Second_Stage_Array_Index := 0;
Has_All_On : Boolean := False;
Has_L : Boolean := False;
Has_H : Boolean := False;
begin
if L in Surrogate_First .. Surrogate_Last then
L := Surrogate_Last + 1;
LF := First_Stage_Index (L / 256);
LS := Second_Stage_Index (L mod 256);
end if;
if H in Surrogate_First .. Surrogate_Last then
H := Surrogate_First - 1;
HF := First_Stage_Index (H / 256);
HS := Second_Stage_Index (H mod 256);
end if;
if L > H then
Last := 0;
elsif LF = HF then
Last := 1;
else
if Surrogate_First in L .. H then
Has_All_On := LF < Before_Surrogate or HF > After_Surrogate;
else
Has_All_On := HF - LF > 1;
end if;
if LS = 0 then
Has_All_On := True;
else
Has_L := True;
end if;
if H mod 256 = 255 then
Has_All_On := True;
else
Has_H := True;
end if;
Last := Boolean'Pos (Has_L)
+ Boolean'Pos (Has_H)
+ Boolean'Pos (Has_All_On);
end if;
return Result : Shared_Code_Point_Set :=
(Last => Last,
Counter => <>,
First_Stage => (others => 0),
Second_Stages => (others => All_Off))
do
if L > H then
null;
elsif (LF) = (HF) then
Result.First_Stage (LF) := 1;
Result.Second_Stages (1) (LS .. HS) := (LS .. HS => True);
else
if Has_All_On then
Result.Second_Stages (Last) := All_On;
end if;
if Surrogate_First in L .. H then
Result.First_Stage (LF .. Before_Surrogate) := (others => Last);
Result.First_Stage (After_Surrogate .. HF) := (others => Last);
else
Result.First_Stage (LF .. HF) := (others => Last);
end if;
if LS /= 0 then
Result.First_Stage (LF) := 1;
Result.Second_Stages (1) (LS .. 255) := (LS .. 255 => True);
end if;
if H mod 256 /= 255 then
if Has_L then
Result.First_Stage (HF) := 2;
Result.Second_Stages (2) (0 .. HS) := (0 .. HS => True);
else
Result.First_Stage (HF) := 1;
Result.Second_Stages (1) (0 .. HS) := (0 .. HS => True);
end if;
end if;
end if;
end return;
end To_Set;
------------
-- To_Set --
------------
function To_Set
(Descriptor : Code_Point_Set_Descriptor)
return Core_Shared_Code_Point_Set
is
use Matreshka.Internals.Unicode.Ucd;
P : constant Core_First_Stage_Access := Core.Property'Access;
begin
return Result : Core_Shared_Code_Point_Set do
Result.First_Stage := First_Stage_Map (Indexes.Group_Index);
Result.Second_Stages := (others => All_Off);
for J in Result.Second_Stages'Range loop
for K in Code_Point_Sets.Second_Stage_Index loop
if Match (Descriptor, P (Indexes.Base (J)) (K)) then
Result.Second_Stages (J) (K) := True;
end if;
end loop;
end loop;
end return;
end To_Set;
end Matreshka.Internals.Code_Point_Sets;
|