1 ------------------------------------------------------------------------------
3 -- GNAT RUN-TIME COMPONENTS --
5 -- A D A . S T R I N G S . S U P E R B O U N D E D --
9 -- Copyright (C) 2003-2010, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. --
18 -- As a special exception under Section 7 of GPL version 3, you are granted --
19 -- additional permissions described in the GCC Runtime Library Exception, --
20 -- version 3.1, as published by the Free Software Foundation. --
22 -- You should have received a copy of the GNU General Public License and --
23 -- a copy of the GCC Runtime Library Exception along with this program; --
24 -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
25 -- <http://www.gnu.org/licenses/>. --
27 -- GNAT was originally developed by the GNAT team at New York University. --
28 -- Extensive contributions were provided by Ada Core Technologies Inc. --
30 ------------------------------------------------------------------------------
32 with Ada.Strings.Maps; use Ada.Strings.Maps;
33 with Ada.Strings.Search;
35 package body Ada.Strings.Superbounded is
43 Right : Super_String) return Super_String
45 Result : Super_String (Left.Max_Length);
46 Llen : constant Natural := Left.Current_Length;
47 Rlen : constant Natural := Right.Current_Length;
48 Nlen : constant Natural := Llen + Rlen;
51 if Nlen > Left.Max_Length then
52 raise Ada.Strings.Length_Error;
54 Result.Current_Length := Nlen;
55 Result.Data (1 .. Llen) := Left.Data (1 .. Llen);
56 Result.Data (Llen + 1 .. Nlen) := Right.Data (1 .. Rlen);
64 Right : String) return Super_String
66 Result : Super_String (Left.Max_Length);
67 Llen : constant Natural := Left.Current_Length;
69 Nlen : constant Natural := Llen + Right'Length;
72 if Nlen > Left.Max_Length then
73 raise Ada.Strings.Length_Error;
75 Result.Current_Length := Nlen;
76 Result.Data (1 .. Llen) := Left.Data (1 .. Llen);
77 Result.Data (Llen + 1 .. Nlen) := Right;
84 Right : Super_String) return Super_String
86 Result : Super_String (Right.Max_Length);
87 Llen : constant Natural := Left'Length;
88 Rlen : constant Natural := Right.Current_Length;
89 Nlen : constant Natural := Llen + Rlen;
92 if Nlen > Right.Max_Length then
93 raise Ada.Strings.Length_Error;
95 Result.Current_Length := Nlen;
96 Result.Data (1 .. Llen) := Left;
97 Result.Data (Llen + 1 .. Nlen) := Right.Data (1 .. Rlen);
104 (Left : Super_String;
105 Right : Character) return Super_String
107 Result : Super_String (Left.Max_Length);
108 Llen : constant Natural := Left.Current_Length;
111 if Llen = Left.Max_Length then
112 raise Ada.Strings.Length_Error;
114 Result.Current_Length := Llen + 1;
115 Result.Data (1 .. Llen) := Left.Data (1 .. Llen);
116 Result.Data (Result.Current_Length) := Right;
124 Right : Super_String) return Super_String
126 Result : Super_String (Right.Max_Length);
127 Rlen : constant Natural := Right.Current_Length;
130 if Rlen = Right.Max_Length then
131 raise Ada.Strings.Length_Error;
133 Result.Current_Length := Rlen + 1;
134 Result.Data (1) := Left;
135 Result.Data (2 .. Result.Current_Length) := Right.Data (1 .. Rlen);
146 (Left : Super_String;
147 Right : Super_String) return Boolean
150 return Left.Current_Length = Right.Current_Length
151 and then Left.Data (1 .. Left.Current_Length) =
152 Right.Data (1 .. Right.Current_Length);
156 (Left : Super_String;
157 Right : String) return Boolean
160 return Left.Current_Length = Right'Length
161 and then Left.Data (1 .. Left.Current_Length) = Right;
166 Right : Super_String) return Boolean
169 return Left'Length = Right.Current_Length
170 and then Left = Right.Data (1 .. Right.Current_Length);
178 (Left : Super_String;
179 Right : Super_String) return Boolean
182 return Left.Data (1 .. Left.Current_Length) >
183 Right.Data (1 .. Right.Current_Length);
187 (Left : Super_String;
188 Right : String) return Boolean
191 return Left.Data (1 .. Left.Current_Length) > Right;
196 Right : Super_String) return Boolean
199 return Left > Right.Data (1 .. Right.Current_Length);
202 ----------------------
203 -- Greater_Or_Equal --
204 ----------------------
206 function Greater_Or_Equal
207 (Left : Super_String;
208 Right : Super_String) return Boolean
211 return Left.Data (1 .. Left.Current_Length) >=
212 Right.Data (1 .. Right.Current_Length);
213 end Greater_Or_Equal;
215 function Greater_Or_Equal
216 (Left : Super_String;
217 Right : String) return Boolean
220 return Left.Data (1 .. Left.Current_Length) >= Right;
221 end Greater_Or_Equal;
223 function Greater_Or_Equal
225 Right : Super_String) return Boolean
228 return Left >= Right.Data (1 .. Right.Current_Length);
229 end Greater_Or_Equal;
236 (Left : Super_String;
237 Right : Super_String) return Boolean
240 return Left.Data (1 .. Left.Current_Length) <
241 Right.Data (1 .. Right.Current_Length);
245 (Left : Super_String;
246 Right : String) return Boolean
249 return Left.Data (1 .. Left.Current_Length) < Right;
254 Right : Super_String) return Boolean
257 return Left < Right.Data (1 .. Right.Current_Length);
264 function Less_Or_Equal
265 (Left : Super_String;
266 Right : Super_String) return Boolean
269 return Left.Data (1 .. Left.Current_Length) <=
270 Right.Data (1 .. Right.Current_Length);
273 function Less_Or_Equal
274 (Left : Super_String;
275 Right : String) return Boolean
278 return Left.Data (1 .. Left.Current_Length) <= Right;
281 function Less_Or_Equal
283 Right : Super_String) return Boolean
286 return Left <= Right.Data (1 .. Right.Current_Length);
289 ----------------------
290 -- Set_Super_String --
291 ----------------------
293 procedure Set_Super_String
294 (Target : out Super_String;
296 Drop : Truncation := Error)
298 Slen : constant Natural := Source'Length;
299 Max_Length : constant Positive := Target.Max_Length;
302 if Slen <= Max_Length then
303 Target.Current_Length := Slen;
304 Target.Data (1 .. Slen) := Source;
308 when Strings.Right =>
309 Target.Current_Length := Max_Length;
310 Target.Data (1 .. Max_Length) :=
311 Source (Source'First .. Source'First - 1 + Max_Length);
314 Target.Current_Length := Max_Length;
315 Target.Data (1 .. Max_Length) :=
316 Source (Source'Last - (Max_Length - 1) .. Source'Last);
318 when Strings.Error =>
319 raise Ada.Strings.Length_Error;
322 end Set_Super_String;
328 -- Case of Super_String and Super_String
330 function Super_Append
331 (Left : Super_String;
332 Right : Super_String;
333 Drop : Truncation := Error) return Super_String
335 Max_Length : constant Positive := Left.Max_Length;
336 Result : Super_String (Max_Length);
337 Llen : constant Natural := Left.Current_Length;
338 Rlen : constant Natural := Right.Current_Length;
339 Nlen : constant Natural := Llen + Rlen;
342 if Nlen <= Max_Length then
343 Result.Current_Length := Nlen;
344 Result.Data (1 .. Llen) := Left.Data (1 .. Llen);
345 Result.Data (Llen + 1 .. Nlen) := Right.Data (1 .. Rlen);
348 Result.Current_Length := Max_Length;
351 when Strings.Right =>
352 if Llen >= Max_Length then -- only case is Llen = Max_Length
353 Result.Data := Left.Data;
356 Result.Data (1 .. Llen) := Left.Data (1 .. Llen);
357 Result.Data (Llen + 1 .. Max_Length) :=
358 Right.Data (1 .. Max_Length - Llen);
362 if Rlen >= Max_Length then -- only case is Rlen = Max_Length
363 Result.Data := Right.Data;
366 Result.Data (1 .. Max_Length - Rlen) :=
367 Left.Data (Llen - (Max_Length - Rlen - 1) .. Llen);
368 Result.Data (Max_Length - Rlen + 1 .. Max_Length) :=
369 Right.Data (1 .. Rlen);
372 when Strings.Error =>
373 raise Ada.Strings.Length_Error;
380 procedure Super_Append
381 (Source : in out Super_String;
382 New_Item : Super_String;
383 Drop : Truncation := Error)
385 Max_Length : constant Positive := Source.Max_Length;
386 Llen : constant Natural := Source.Current_Length;
387 Rlen : constant Natural := New_Item.Current_Length;
388 Nlen : constant Natural := Llen + Rlen;
391 if Nlen <= Max_Length then
392 Source.Current_Length := Nlen;
393 Source.Data (Llen + 1 .. Nlen) := New_Item.Data (1 .. Rlen);
396 Source.Current_Length := Max_Length;
399 when Strings.Right =>
400 if Llen < Max_Length then
401 Source.Data (Llen + 1 .. Max_Length) :=
402 New_Item.Data (1 .. Max_Length - Llen);
406 if Rlen >= Max_Length then -- only case is Rlen = Max_Length
407 Source.Data := New_Item.Data;
410 Source.Data (1 .. Max_Length - Rlen) :=
411 Source.Data (Llen - (Max_Length - Rlen - 1) .. Llen);
412 Source.Data (Max_Length - Rlen + 1 .. Max_Length) :=
413 New_Item.Data (1 .. Rlen);
416 when Strings.Error =>
417 raise Ada.Strings.Length_Error;
423 -- Case of Super_String and String
425 function Super_Append
426 (Left : Super_String;
428 Drop : Strings.Truncation := Strings.Error) return Super_String
430 Max_Length : constant Positive := Left.Max_Length;
431 Result : Super_String (Max_Length);
432 Llen : constant Natural := Left.Current_Length;
433 Rlen : constant Natural := Right'Length;
434 Nlen : constant Natural := Llen + Rlen;
437 if Nlen <= Max_Length then
438 Result.Current_Length := Nlen;
439 Result.Data (1 .. Llen) := Left.Data (1 .. Llen);
440 Result.Data (Llen + 1 .. Nlen) := Right;
443 Result.Current_Length := Max_Length;
446 when Strings.Right =>
447 if Llen >= Max_Length then -- only case is Llen = Max_Length
448 Result.Data := Left.Data;
451 Result.Data (1 .. Llen) := Left.Data (1 .. Llen);
452 Result.Data (Llen + 1 .. Max_Length) :=
453 Right (Right'First .. Right'First - 1 +
459 if Rlen >= Max_Length then
460 Result.Data (1 .. Max_Length) :=
461 Right (Right'Last - (Max_Length - 1) .. Right'Last);
464 Result.Data (1 .. Max_Length - Rlen) :=
465 Left.Data (Llen - (Max_Length - Rlen - 1) .. Llen);
466 Result.Data (Max_Length - Rlen + 1 .. Max_Length) :=
470 when Strings.Error =>
471 raise Ada.Strings.Length_Error;
478 procedure Super_Append
479 (Source : in out Super_String;
481 Drop : Truncation := Error)
483 Max_Length : constant Positive := Source.Max_Length;
484 Llen : constant Natural := Source.Current_Length;
485 Rlen : constant Natural := New_Item'Length;
486 Nlen : constant Natural := Llen + Rlen;
489 if Nlen <= Max_Length then
490 Source.Current_Length := Nlen;
491 Source.Data (Llen + 1 .. Nlen) := New_Item;
494 Source.Current_Length := Max_Length;
497 when Strings.Right =>
498 if Llen < Max_Length then
499 Source.Data (Llen + 1 .. Max_Length) :=
500 New_Item (New_Item'First ..
501 New_Item'First - 1 + Max_Length - Llen);
505 if Rlen >= Max_Length then
506 Source.Data (1 .. Max_Length) :=
507 New_Item (New_Item'Last - (Max_Length - 1) ..
511 Source.Data (1 .. Max_Length - Rlen) :=
512 Source.Data (Llen - (Max_Length - Rlen - 1) .. Llen);
513 Source.Data (Max_Length - Rlen + 1 .. Max_Length) :=
517 when Strings.Error =>
518 raise Ada.Strings.Length_Error;
524 -- Case of String and Super_String
526 function Super_Append
528 Right : Super_String;
529 Drop : Strings.Truncation := Strings.Error) return Super_String
531 Max_Length : constant Positive := Right.Max_Length;
532 Result : Super_String (Max_Length);
533 Llen : constant Natural := Left'Length;
534 Rlen : constant Natural := Right.Current_Length;
535 Nlen : constant Natural := Llen + Rlen;
538 if Nlen <= Max_Length then
539 Result.Current_Length := Nlen;
540 Result.Data (1 .. Llen) := Left;
541 Result.Data (Llen + 1 .. Llen + Rlen) := Right.Data (1 .. Rlen);
544 Result.Current_Length := Max_Length;
547 when Strings.Right =>
548 if Llen >= Max_Length then
549 Result.Data (1 .. Max_Length) :=
550 Left (Left'First .. Left'First + (Max_Length - 1));
553 Result.Data (1 .. Llen) := Left;
554 Result.Data (Llen + 1 .. Max_Length) :=
555 Right.Data (1 .. Max_Length - Llen);
559 if Rlen >= Max_Length then
560 Result.Data (1 .. Max_Length) :=
561 Right.Data (Rlen - (Max_Length - 1) .. Rlen);
564 Result.Data (1 .. Max_Length - Rlen) :=
565 Left (Left'Last - (Max_Length - Rlen - 1) .. Left'Last);
566 Result.Data (Max_Length - Rlen + 1 .. Max_Length) :=
567 Right.Data (1 .. Rlen);
570 when Strings.Error =>
571 raise Ada.Strings.Length_Error;
578 -- Case of Super_String and Character
580 function Super_Append
581 (Left : Super_String;
583 Drop : Strings.Truncation := Strings.Error) return Super_String
585 Max_Length : constant Positive := Left.Max_Length;
586 Result : Super_String (Max_Length);
587 Llen : constant Natural := Left.Current_Length;
590 if Llen < Max_Length then
591 Result.Current_Length := Llen + 1;
592 Result.Data (1 .. Llen) := Left.Data (1 .. Llen);
593 Result.Data (Llen + 1) := Right;
598 when Strings.Right =>
602 Result.Current_Length := Max_Length;
603 Result.Data (1 .. Max_Length - 1) :=
604 Left.Data (2 .. Max_Length);
605 Result.Data (Max_Length) := Right;
608 when Strings.Error =>
609 raise Ada.Strings.Length_Error;
614 procedure Super_Append
615 (Source : in out Super_String;
616 New_Item : Character;
617 Drop : Truncation := Error)
619 Max_Length : constant Positive := Source.Max_Length;
620 Llen : constant Natural := Source.Current_Length;
623 if Llen < Max_Length then
624 Source.Current_Length := Llen + 1;
625 Source.Data (Llen + 1) := New_Item;
628 Source.Current_Length := Max_Length;
631 when Strings.Right =>
635 Source.Data (1 .. Max_Length - 1) :=
636 Source.Data (2 .. Max_Length);
637 Source.Data (Max_Length) := New_Item;
639 when Strings.Error =>
640 raise Ada.Strings.Length_Error;
646 -- Case of Character and Super_String
648 function Super_Append
650 Right : Super_String;
651 Drop : Strings.Truncation := Strings.Error) return Super_String
653 Max_Length : constant Positive := Right.Max_Length;
654 Result : Super_String (Max_Length);
655 Rlen : constant Natural := Right.Current_Length;
658 if Rlen < Max_Length then
659 Result.Current_Length := Rlen + 1;
660 Result.Data (1) := Left;
661 Result.Data (2 .. Rlen + 1) := Right.Data (1 .. Rlen);
666 when Strings.Right =>
667 Result.Current_Length := Max_Length;
668 Result.Data (1) := Left;
669 Result.Data (2 .. Max_Length) :=
670 Right.Data (1 .. Max_Length - 1);
676 when Strings.Error =>
677 raise Ada.Strings.Length_Error;
687 (Source : Super_String;
689 Mapping : Maps.Character_Mapping := Maps.Identity) return Natural
694 (Source.Data (1 .. Source.Current_Length), Pattern, Mapping);
698 (Source : Super_String;
700 Mapping : Maps.Character_Mapping_Function) return Natural
705 (Source.Data (1 .. Source.Current_Length), Pattern, Mapping);
709 (Source : Super_String;
710 Set : Maps.Character_Set) return Natural
713 return Search.Count (Source.Data (1 .. Source.Current_Length), Set);
720 function Super_Delete
721 (Source : Super_String;
723 Through : Natural) return Super_String
725 Result : Super_String (Source.Max_Length);
726 Slen : constant Natural := Source.Current_Length;
727 Num_Delete : constant Integer := Through - From + 1;
730 if Num_Delete <= 0 then
733 elsif From > Slen + 1 then
734 raise Ada.Strings.Index_Error;
736 elsif Through >= Slen then
737 Result.Current_Length := From - 1;
738 Result.Data (1 .. From - 1) := Source.Data (1 .. From - 1);
742 Result.Current_Length := Slen - Num_Delete;
743 Result.Data (1 .. From - 1) := Source.Data (1 .. From - 1);
744 Result.Data (From .. Result.Current_Length) :=
745 Source.Data (Through + 1 .. Slen);
750 procedure Super_Delete
751 (Source : in out Super_String;
755 Slen : constant Natural := Source.Current_Length;
756 Num_Delete : constant Integer := Through - From + 1;
759 if Num_Delete <= 0 then
762 elsif From > Slen + 1 then
763 raise Ada.Strings.Index_Error;
765 elsif Through >= Slen then
766 Source.Current_Length := From - 1;
769 Source.Current_Length := Slen - Num_Delete;
770 Source.Data (From .. Source.Current_Length) :=
771 Source.Data (Through + 1 .. Slen);
779 function Super_Element
780 (Source : Super_String;
781 Index : Positive) return Character
784 if Index <= Source.Current_Length then
785 return Source.Data (Index);
787 raise Strings.Index_Error;
791 ----------------------
792 -- Super_Find_Token --
793 ----------------------
795 procedure Super_Find_Token
796 (Source : Super_String;
797 Set : Maps.Character_Set;
799 Test : Strings.Membership;
800 First : out Positive;
805 (Source.Data (From .. Source.Current_Length), Set, Test, First, Last);
806 end Super_Find_Token;
808 procedure Super_Find_Token
809 (Source : Super_String;
810 Set : Maps.Character_Set;
811 Test : Strings.Membership;
812 First : out Positive;
817 (Source.Data (1 .. Source.Current_Length), Set, Test, First, Last);
818 end Super_Find_Token;
825 (Source : Super_String;
827 Pad : Character := Space;
828 Drop : Strings.Truncation := Strings.Error) return Super_String
830 Max_Length : constant Positive := Source.Max_Length;
831 Result : Super_String (Max_Length);
832 Slen : constant Natural := Source.Current_Length;
833 Npad : constant Integer := Count - Slen;
837 Result.Current_Length := Count;
838 Result.Data (1 .. Count) := Source.Data (1 .. Count);
840 elsif Count <= Max_Length then
841 Result.Current_Length := Count;
842 Result.Data (1 .. Slen) := Source.Data (1 .. Slen);
843 Result.Data (Slen + 1 .. Count) := (others => Pad);
846 Result.Current_Length := Max_Length;
849 when Strings.Right =>
850 Result.Data (1 .. Slen) := Source.Data (1 .. Slen);
851 Result.Data (Slen + 1 .. Max_Length) := (others => Pad);
854 if Npad >= Max_Length then
855 Result.Data := (others => Pad);
858 Result.Data (1 .. Max_Length - Npad) :=
859 Source.Data (Count - Max_Length + 1 .. Slen);
860 Result.Data (Max_Length - Npad + 1 .. Max_Length) :=
864 when Strings.Error =>
865 raise Ada.Strings.Length_Error;
873 (Source : in out Super_String;
875 Pad : Character := Space;
876 Drop : Truncation := Error)
878 Max_Length : constant Positive := Source.Max_Length;
879 Slen : constant Natural := Source.Current_Length;
880 Npad : constant Integer := Count - Slen;
881 Temp : String (1 .. Max_Length);
885 Source.Current_Length := Count;
887 elsif Count <= Max_Length then
888 Source.Current_Length := Count;
889 Source.Data (Slen + 1 .. Count) := (others => Pad);
892 Source.Current_Length := Max_Length;
895 when Strings.Right =>
896 Source.Data (Slen + 1 .. Max_Length) := (others => Pad);
899 if Npad > Max_Length then
900 Source.Data := (others => Pad);
904 Source.Data (1 .. Max_Length - Npad) :=
905 Temp (Count - Max_Length + 1 .. Slen);
907 for J in Max_Length - Npad + 1 .. Max_Length loop
908 Source.Data (J) := Pad;
912 when Strings.Error =>
913 raise Ada.Strings.Length_Error;
923 (Source : Super_String;
925 Going : Strings.Direction := Strings.Forward;
926 Mapping : Maps.Character_Mapping := Maps.Identity) return Natural
930 (Source.Data (1 .. Source.Current_Length), Pattern, Going, Mapping);
934 (Source : Super_String;
936 Going : Direction := Forward;
937 Mapping : Maps.Character_Mapping_Function) return Natural
941 (Source.Data (1 .. Source.Current_Length), Pattern, Going, Mapping);
945 (Source : Super_String;
946 Set : Maps.Character_Set;
947 Test : Strings.Membership := Strings.Inside;
948 Going : Strings.Direction := Strings.Forward) return Natural
952 (Source.Data (1 .. Source.Current_Length), Set, Test, Going);
956 (Source : Super_String;
959 Going : Direction := Forward;
960 Mapping : Maps.Character_Mapping := Maps.Identity) return Natural
964 (Source.Data (1 .. Source.Current_Length),
965 Pattern, From, Going, Mapping);
969 (Source : Super_String;
972 Going : Direction := Forward;
973 Mapping : Maps.Character_Mapping_Function) return Natural
977 (Source.Data (1 .. Source.Current_Length),
978 Pattern, From, Going, Mapping);
982 (Source : Super_String;
983 Set : Maps.Character_Set;
985 Test : Membership := Inside;
986 Going : Direction := Forward) return Natural
990 (Source.Data (1 .. Source.Current_Length), Set, From, Test, Going);
993 ---------------------------
994 -- Super_Index_Non_Blank --
995 ---------------------------
997 function Super_Index_Non_Blank
998 (Source : Super_String;
999 Going : Strings.Direction := Strings.Forward) return Natural
1003 Search.Index_Non_Blank
1004 (Source.Data (1 .. Source.Current_Length), Going);
1005 end Super_Index_Non_Blank;
1007 function Super_Index_Non_Blank
1008 (Source : Super_String;
1010 Going : Direction := Forward) return Natural
1014 Search.Index_Non_Blank
1015 (Source.Data (1 .. Source.Current_Length), From, Going);
1016 end Super_Index_Non_Blank;
1022 function Super_Insert
1023 (Source : Super_String;
1026 Drop : Strings.Truncation := Strings.Error) return Super_String
1028 Max_Length : constant Positive := Source.Max_Length;
1029 Result : Super_String (Max_Length);
1030 Slen : constant Natural := Source.Current_Length;
1031 Nlen : constant Natural := New_Item'Length;
1032 Tlen : constant Natural := Slen + Nlen;
1033 Blen : constant Natural := Before - 1;
1034 Alen : constant Integer := Slen - Blen;
1035 Droplen : constant Integer := Tlen - Max_Length;
1037 -- Tlen is the length of the total string before possible truncation.
1038 -- Blen, Alen are the lengths of the before and after pieces of the
1043 raise Ada.Strings.Index_Error;
1045 elsif Droplen <= 0 then
1046 Result.Current_Length := Tlen;
1047 Result.Data (1 .. Blen) := Source.Data (1 .. Blen);
1048 Result.Data (Before .. Before + Nlen - 1) := New_Item;
1049 Result.Data (Before + Nlen .. Tlen) :=
1050 Source.Data (Before .. Slen);
1053 Result.Current_Length := Max_Length;
1056 when Strings.Right =>
1057 Result.Data (1 .. Blen) := Source.Data (1 .. Blen);
1059 if Droplen > Alen then
1060 Result.Data (Before .. Max_Length) :=
1061 New_Item (New_Item'First
1062 .. New_Item'First + Max_Length - Before);
1064 Result.Data (Before .. Before + Nlen - 1) := New_Item;
1065 Result.Data (Before + Nlen .. Max_Length) :=
1066 Source.Data (Before .. Slen - Droplen);
1069 when Strings.Left =>
1070 Result.Data (Max_Length - (Alen - 1) .. Max_Length) :=
1071 Source.Data (Before .. Slen);
1073 if Droplen >= Blen then
1074 Result.Data (1 .. Max_Length - Alen) :=
1075 New_Item (New_Item'Last - (Max_Length - Alen) + 1
1079 (Blen - Droplen + 1 .. Max_Length - Alen) :=
1081 Result.Data (1 .. Blen - Droplen) :=
1082 Source.Data (Droplen + 1 .. Blen);
1085 when Strings.Error =>
1086 raise Ada.Strings.Length_Error;
1093 procedure Super_Insert
1094 (Source : in out Super_String;
1097 Drop : Strings.Truncation := Strings.Error)
1100 -- We do a double copy here because this is one of the situations
1101 -- in which we move data to the right, and at least at the moment,
1102 -- GNAT is not handling such cases correctly ???
1104 Source := Super_Insert (Source, Before, New_Item, Drop);
1111 function Super_Length (Source : Super_String) return Natural is
1113 return Source.Current_Length;
1116 ---------------------
1117 -- Super_Overwrite --
1118 ---------------------
1120 function Super_Overwrite
1121 (Source : Super_String;
1122 Position : Positive;
1124 Drop : Strings.Truncation := Strings.Error) return Super_String
1126 Max_Length : constant Positive := Source.Max_Length;
1127 Result : Super_String (Max_Length);
1128 Endpos : constant Natural := Position + New_Item'Length - 1;
1129 Slen : constant Natural := Source.Current_Length;
1133 if Position > Slen + 1 then
1134 raise Ada.Strings.Index_Error;
1136 elsif New_Item'Length = 0 then
1139 elsif Endpos <= Slen then
1140 Result.Current_Length := Source.Current_Length;
1141 Result.Data (1 .. Slen) := Source.Data (1 .. Slen);
1142 Result.Data (Position .. Endpos) := New_Item;
1145 elsif Endpos <= Max_Length then
1146 Result.Current_Length := Endpos;
1147 Result.Data (1 .. Position - 1) := Source.Data (1 .. Position - 1);
1148 Result.Data (Position .. Endpos) := New_Item;
1152 Result.Current_Length := Max_Length;
1153 Droplen := Endpos - Max_Length;
1156 when Strings.Right =>
1157 Result.Data (1 .. Position - 1) :=
1158 Source.Data (1 .. Position - 1);
1160 Result.Data (Position .. Max_Length) :=
1161 New_Item (New_Item'First .. New_Item'Last - Droplen);
1164 when Strings.Left =>
1165 if New_Item'Length >= Max_Length then
1166 Result.Data (1 .. Max_Length) :=
1167 New_Item (New_Item'Last - Max_Length + 1 ..
1172 Result.Data (1 .. Max_Length - New_Item'Length) :=
1173 Source.Data (Droplen + 1 .. Position - 1);
1175 (Max_Length - New_Item'Length + 1 .. Max_Length) :=
1180 when Strings.Error =>
1181 raise Ada.Strings.Length_Error;
1184 end Super_Overwrite;
1186 procedure Super_Overwrite
1187 (Source : in out Super_String;
1188 Position : Positive;
1190 Drop : Strings.Truncation := Strings.Error)
1192 Max_Length : constant Positive := Source.Max_Length;
1193 Endpos : constant Positive := Position + New_Item'Length - 1;
1194 Slen : constant Natural := Source.Current_Length;
1198 if Position > Slen + 1 then
1199 raise Ada.Strings.Index_Error;
1201 elsif Endpos <= Slen then
1202 Source.Data (Position .. Endpos) := New_Item;
1204 elsif Endpos <= Max_Length then
1205 Source.Data (Position .. Endpos) := New_Item;
1206 Source.Current_Length := Endpos;
1209 Source.Current_Length := Max_Length;
1210 Droplen := Endpos - Max_Length;
1213 when Strings.Right =>
1214 Source.Data (Position .. Max_Length) :=
1215 New_Item (New_Item'First .. New_Item'Last - Droplen);
1217 when Strings.Left =>
1218 if New_Item'Length > Max_Length then
1219 Source.Data (1 .. Max_Length) :=
1220 New_Item (New_Item'Last - Max_Length + 1 ..
1224 Source.Data (1 .. Max_Length - New_Item'Length) :=
1225 Source.Data (Droplen + 1 .. Position - 1);
1228 (Max_Length - New_Item'Length + 1 .. Max_Length) :=
1232 when Strings.Error =>
1233 raise Ada.Strings.Length_Error;
1236 end Super_Overwrite;
1238 ---------------------------
1239 -- Super_Replace_Element --
1240 ---------------------------
1242 procedure Super_Replace_Element
1243 (Source : in out Super_String;
1248 if Index <= Source.Current_Length then
1249 Source.Data (Index) := By;
1251 raise Ada.Strings.Index_Error;
1253 end Super_Replace_Element;
1255 -------------------------
1256 -- Super_Replace_Slice --
1257 -------------------------
1259 function Super_Replace_Slice
1260 (Source : Super_String;
1264 Drop : Strings.Truncation := Strings.Error) return Super_String
1266 Max_Length : constant Positive := Source.Max_Length;
1267 Slen : constant Natural := Source.Current_Length;
1270 if Low > Slen + 1 then
1271 raise Strings.Index_Error;
1273 elsif High < Low then
1274 return Super_Insert (Source, Low, By, Drop);
1278 Blen : constant Natural := Natural'Max (0, Low - 1);
1279 Alen : constant Natural := Natural'Max (0, Slen - High);
1280 Tlen : constant Natural := Blen + By'Length + Alen;
1281 Droplen : constant Integer := Tlen - Max_Length;
1282 Result : Super_String (Max_Length);
1284 -- Tlen is the total length of the result string before any
1285 -- truncation. Blen and Alen are the lengths of the pieces
1286 -- of the original string that end up in the result string
1287 -- before and after the replaced slice.
1290 if Droplen <= 0 then
1291 Result.Current_Length := Tlen;
1292 Result.Data (1 .. Blen) := Source.Data (1 .. Blen);
1293 Result.Data (Low .. Low + By'Length - 1) := By;
1294 Result.Data (Low + By'Length .. Tlen) :=
1295 Source.Data (High + 1 .. Slen);
1298 Result.Current_Length := Max_Length;
1301 when Strings.Right =>
1302 Result.Data (1 .. Blen) := Source.Data (1 .. Blen);
1304 if Droplen > Alen then
1305 Result.Data (Low .. Max_Length) :=
1306 By (By'First .. By'First + Max_Length - Low);
1308 Result.Data (Low .. Low + By'Length - 1) := By;
1309 Result.Data (Low + By'Length .. Max_Length) :=
1310 Source.Data (High + 1 .. Slen - Droplen);
1313 when Strings.Left =>
1314 Result.Data (Max_Length - (Alen - 1) .. Max_Length) :=
1315 Source.Data (High + 1 .. Slen);
1317 if Droplen >= Blen then
1318 Result.Data (1 .. Max_Length - Alen) :=
1319 By (By'Last - (Max_Length - Alen) + 1 .. By'Last);
1322 (Blen - Droplen + 1 .. Max_Length - Alen) := By;
1323 Result.Data (1 .. Blen - Droplen) :=
1324 Source.Data (Droplen + 1 .. Blen);
1327 when Strings.Error =>
1328 raise Ada.Strings.Length_Error;
1335 end Super_Replace_Slice;
1337 procedure Super_Replace_Slice
1338 (Source : in out Super_String;
1342 Drop : Strings.Truncation := Strings.Error)
1345 -- We do a double copy here because this is one of the situations
1346 -- in which we move data to the right, and at least at the moment,
1347 -- GNAT is not handling such cases correctly ???
1349 Source := Super_Replace_Slice (Source, Low, High, By, Drop);
1350 end Super_Replace_Slice;
1352 ---------------------
1353 -- Super_Replicate --
1354 ---------------------
1356 function Super_Replicate
1359 Drop : Truncation := Error;
1360 Max_Length : Positive) return Super_String
1362 Result : Super_String (Max_Length);
1365 if Count <= Max_Length then
1366 Result.Current_Length := Count;
1368 elsif Drop = Strings.Error then
1369 raise Ada.Strings.Length_Error;
1372 Result.Current_Length := Max_Length;
1375 Result.Data (1 .. Result.Current_Length) := (others => Item);
1377 end Super_Replicate;
1379 function Super_Replicate
1382 Drop : Truncation := Error;
1383 Max_Length : Positive) return Super_String
1385 Length : constant Integer := Count * Item'Length;
1386 Result : Super_String (Max_Length);
1390 if Length <= Max_Length then
1391 Result.Current_Length := Length;
1396 for J in 1 .. Count loop
1397 Result.Data (Indx .. Indx + Item'Length - 1) := Item;
1398 Indx := Indx + Item'Length;
1403 Result.Current_Length := Max_Length;
1406 when Strings.Right =>
1409 while Indx + Item'Length <= Max_Length + 1 loop
1410 Result.Data (Indx .. Indx + Item'Length - 1) := Item;
1411 Indx := Indx + Item'Length;
1414 Result.Data (Indx .. Max_Length) :=
1415 Item (Item'First .. Item'First + Max_Length - Indx);
1417 when Strings.Left =>
1420 while Indx - Item'Length >= 1 loop
1421 Result.Data (Indx - (Item'Length - 1) .. Indx) := Item;
1422 Indx := Indx - Item'Length;
1425 Result.Data (1 .. Indx) :=
1426 Item (Item'Last - Indx + 1 .. Item'Last);
1428 when Strings.Error =>
1429 raise Ada.Strings.Length_Error;
1434 end Super_Replicate;
1436 function Super_Replicate
1438 Item : Super_String;
1439 Drop : Strings.Truncation := Strings.Error) return Super_String
1445 Item.Data (1 .. Item.Current_Length),
1448 end Super_Replicate;
1454 function Super_Slice
1455 (Source : Super_String;
1457 High : Natural) return String
1460 -- Note: test of High > Length is in accordance with AI95-00128
1462 if Low > Source.Current_Length + 1
1463 or else High > Source.Current_Length
1467 return Source.Data (Low .. High);
1471 function Super_Slice
1472 (Source : Super_String;
1474 High : Natural) return Super_String
1476 Result : Super_String (Source.Max_Length);
1479 if Low > Source.Current_Length + 1
1480 or else High > Source.Current_Length
1484 Result.Current_Length := High - Low + 1;
1485 Result.Data (1 .. Result.Current_Length) := Source.Data (Low .. High);
1491 procedure Super_Slice
1492 (Source : Super_String;
1493 Target : out Super_String;
1498 if Low > Source.Current_Length + 1
1499 or else High > Source.Current_Length
1503 Target.Current_Length := High - Low + 1;
1504 Target.Data (1 .. Target.Current_Length) := Source.Data (Low .. High);
1513 (Source : Super_String;
1515 Pad : Character := Space;
1516 Drop : Strings.Truncation := Strings.Error) return Super_String
1518 Max_Length : constant Positive := Source.Max_Length;
1519 Result : Super_String (Max_Length);
1520 Slen : constant Natural := Source.Current_Length;
1521 Npad : constant Integer := Count - Slen;
1525 Result.Current_Length := Count;
1526 Result.Data (1 .. Count) :=
1527 Source.Data (Slen - (Count - 1) .. Slen);
1529 elsif Count <= Max_Length then
1530 Result.Current_Length := Count;
1531 Result.Data (1 .. Npad) := (others => Pad);
1532 Result.Data (Npad + 1 .. Count) := Source.Data (1 .. Slen);
1535 Result.Current_Length := Max_Length;
1538 when Strings.Right =>
1539 if Npad >= Max_Length then
1540 Result.Data := (others => Pad);
1543 Result.Data (1 .. Npad) := (others => Pad);
1544 Result.Data (Npad + 1 .. Max_Length) :=
1545 Source.Data (1 .. Max_Length - Npad);
1548 when Strings.Left =>
1549 Result.Data (1 .. Max_Length - Slen) := (others => Pad);
1550 Result.Data (Max_Length - Slen + 1 .. Max_Length) :=
1551 Source.Data (1 .. Slen);
1553 when Strings.Error =>
1554 raise Ada.Strings.Length_Error;
1561 procedure Super_Tail
1562 (Source : in out Super_String;
1564 Pad : Character := Space;
1565 Drop : Truncation := Error)
1567 Max_Length : constant Positive := Source.Max_Length;
1568 Slen : constant Natural := Source.Current_Length;
1569 Npad : constant Integer := Count - Slen;
1571 Temp : constant String (1 .. Max_Length) := Source.Data;
1575 Source.Current_Length := Count;
1576 Source.Data (1 .. Count) :=
1577 Temp (Slen - (Count - 1) .. Slen);
1579 elsif Count <= Max_Length then
1580 Source.Current_Length := Count;
1581 Source.Data (1 .. Npad) := (others => Pad);
1582 Source.Data (Npad + 1 .. Count) := Temp (1 .. Slen);
1585 Source.Current_Length := Max_Length;
1588 when Strings.Right =>
1589 if Npad >= Max_Length then
1590 Source.Data := (others => Pad);
1593 Source.Data (1 .. Npad) := (others => Pad);
1594 Source.Data (Npad + 1 .. Max_Length) :=
1595 Temp (1 .. Max_Length - Npad);
1598 when Strings.Left =>
1599 for J in 1 .. Max_Length - Slen loop
1600 Source.Data (J) := Pad;
1603 Source.Data (Max_Length - Slen + 1 .. Max_Length) :=
1606 when Strings.Error =>
1607 raise Ada.Strings.Length_Error;
1612 ---------------------
1613 -- Super_To_String --
1614 ---------------------
1616 function Super_To_String (Source : Super_String) return String is
1618 return Source.Data (1 .. Source.Current_Length);
1619 end Super_To_String;
1621 ---------------------
1622 -- Super_Translate --
1623 ---------------------
1625 function Super_Translate
1626 (Source : Super_String;
1627 Mapping : Maps.Character_Mapping) return Super_String
1629 Result : Super_String (Source.Max_Length);
1632 Result.Current_Length := Source.Current_Length;
1634 for J in 1 .. Source.Current_Length loop
1635 Result.Data (J) := Value (Mapping, Source.Data (J));
1639 end Super_Translate;
1641 procedure Super_Translate
1642 (Source : in out Super_String;
1643 Mapping : Maps.Character_Mapping)
1646 for J in 1 .. Source.Current_Length loop
1647 Source.Data (J) := Value (Mapping, Source.Data (J));
1649 end Super_Translate;
1651 function Super_Translate
1652 (Source : Super_String;
1653 Mapping : Maps.Character_Mapping_Function) return Super_String
1655 Result : Super_String (Source.Max_Length);
1658 Result.Current_Length := Source.Current_Length;
1660 for J in 1 .. Source.Current_Length loop
1661 Result.Data (J) := Mapping.all (Source.Data (J));
1665 end Super_Translate;
1667 procedure Super_Translate
1668 (Source : in out Super_String;
1669 Mapping : Maps.Character_Mapping_Function)
1672 for J in 1 .. Source.Current_Length loop
1673 Source.Data (J) := Mapping.all (Source.Data (J));
1675 end Super_Translate;
1682 (Source : Super_String;
1683 Side : Trim_End) return Super_String
1685 Result : Super_String (Source.Max_Length);
1686 Last : Natural := Source.Current_Length;
1687 First : Positive := 1;
1690 if Side = Left or else Side = Both then
1691 while First <= Last and then Source.Data (First) = ' ' loop
1696 if Side = Right or else Side = Both then
1697 while Last >= First and then Source.Data (Last) = ' ' loop
1702 Result.Current_Length := Last - First + 1;
1703 Result.Data (1 .. Result.Current_Length) := Source.Data (First .. Last);
1707 procedure Super_Trim
1708 (Source : in out Super_String;
1711 Max_Length : constant Positive := Source.Max_Length;
1712 Last : Natural := Source.Current_Length;
1713 First : Positive := 1;
1714 Temp : String (1 .. Max_Length);
1717 Temp (1 .. Last) := Source.Data (1 .. Last);
1719 if Side = Left or else Side = Both then
1720 while First <= Last and then Temp (First) = ' ' loop
1725 if Side = Right or else Side = Both then
1726 while Last >= First and then Temp (Last) = ' ' loop
1731 Source.Data := (others => ASCII.NUL);
1732 Source.Current_Length := Last - First + 1;
1733 Source.Data (1 .. Source.Current_Length) := Temp (First .. Last);
1737 (Source : Super_String;
1738 Left : Maps.Character_Set;
1739 Right : Maps.Character_Set) return Super_String
1741 Result : Super_String (Source.Max_Length);
1744 for First in 1 .. Source.Current_Length loop
1745 if not Is_In (Source.Data (First), Left) then
1746 for Last in reverse First .. Source.Current_Length loop
1747 if not Is_In (Source.Data (Last), Right) then
1748 Result.Current_Length := Last - First + 1;
1749 Result.Data (1 .. Result.Current_Length) :=
1750 Source.Data (First .. Last);
1757 Result.Current_Length := 0;
1761 procedure Super_Trim
1762 (Source : in out Super_String;
1763 Left : Maps.Character_Set;
1764 Right : Maps.Character_Set)
1767 for First in 1 .. Source.Current_Length loop
1768 if not Is_In (Source.Data (First), Left) then
1769 for Last in reverse First .. Source.Current_Length loop
1770 if not Is_In (Source.Data (Last), Right) then
1772 Source.Current_Length := Last;
1775 Source.Current_Length := Last - First + 1;
1776 Source.Data (1 .. Source.Current_Length) :=
1777 Source.Data (First .. Last);
1779 for J in Source.Current_Length + 1 ..
1782 Source.Data (J) := ASCII.NUL;
1790 Source.Current_Length := 0;
1795 Source.Current_Length := 0;
1805 Max_Length : Positive) return Super_String
1807 Result : Super_String (Max_Length);
1810 if Left > Max_Length then
1811 raise Ada.Strings.Length_Error;
1814 Result.Current_Length := Left;
1816 for J in 1 .. Left loop
1817 Result.Data (J) := Right;
1827 Max_Length : Positive) return Super_String
1829 Result : Super_String (Max_Length);
1830 Pos : Positive := 1;
1831 Rlen : constant Natural := Right'Length;
1832 Nlen : constant Natural := Left * Rlen;
1835 if Nlen > Max_Length then
1836 raise Ada.Strings.Index_Error;
1839 Result.Current_Length := Nlen;
1842 for J in 1 .. Left loop
1843 Result.Data (Pos .. Pos + Rlen - 1) := Right;
1854 Right : Super_String) return Super_String
1856 Result : Super_String (Right.Max_Length);
1857 Pos : Positive := 1;
1858 Rlen : constant Natural := Right.Current_Length;
1859 Nlen : constant Natural := Left * Rlen;
1862 if Nlen > Right.Max_Length then
1863 raise Ada.Strings.Length_Error;
1866 Result.Current_Length := Nlen;
1869 for J in 1 .. Left loop
1870 Result.Data (Pos .. Pos + Rlen - 1) :=
1871 Right.Data (1 .. Rlen);
1880 ---------------------
1881 -- To_Super_String --
1882 ---------------------
1884 function To_Super_String
1886 Max_Length : Natural;
1887 Drop : Truncation := Error) return Super_String
1889 Result : Super_String (Max_Length);
1890 Slen : constant Natural := Source'Length;
1893 if Slen <= Max_Length then
1894 Result.Current_Length := Slen;
1895 Result.Data (1 .. Slen) := Source;
1899 when Strings.Right =>
1900 Result.Current_Length := Max_Length;
1901 Result.Data (1 .. Max_Length) :=
1902 Source (Source'First .. Source'First - 1 + Max_Length);
1904 when Strings.Left =>
1905 Result.Current_Length := Max_Length;
1906 Result.Data (1 .. Max_Length) :=
1907 Source (Source'Last - (Max_Length - 1) .. Source'Last);
1909 when Strings.Error =>
1910 raise Ada.Strings.Length_Error;
1915 end To_Super_String;
1917 end Ada.Strings.Superbounded;