1 ------------------------------------------------------------------------------
3 -- GNAT RUN-TIME COMPONENTS --
5 -- A D A . S T R I N G S . W I D E _ U N B O U N D E D --
9 -- Copyright (C) 1992-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.Wide_Fixed;
33 with Ada.Strings.Wide_Search;
34 with Ada.Unchecked_Deallocation;
36 package body Ada.Strings.Wide_Unbounded is
45 (Left : Unbounded_Wide_String;
46 Right : Unbounded_Wide_String) return Unbounded_Wide_String
48 L_Length : constant Natural := Left.Last;
49 R_Length : constant Natural := Right.Last;
50 Result : Unbounded_Wide_String;
53 Result.Last := L_Length + R_Length;
55 Result.Reference := new Wide_String (1 .. Result.Last);
57 Result.Reference (1 .. L_Length) :=
58 Left.Reference (1 .. Left.Last);
59 Result.Reference (L_Length + 1 .. Result.Last) :=
60 Right.Reference (1 .. Right.Last);
66 (Left : Unbounded_Wide_String;
67 Right : Wide_String) return Unbounded_Wide_String
69 L_Length : constant Natural := Left.Last;
70 Result : Unbounded_Wide_String;
73 Result.Last := L_Length + Right'Length;
75 Result.Reference := new Wide_String (1 .. Result.Last);
77 Result.Reference (1 .. L_Length) := Left.Reference (1 .. Left.Last);
78 Result.Reference (L_Length + 1 .. Result.Last) := Right;
85 Right : Unbounded_Wide_String) return Unbounded_Wide_String
87 R_Length : constant Natural := Right.Last;
88 Result : Unbounded_Wide_String;
91 Result.Last := Left'Length + R_Length;
93 Result.Reference := new Wide_String (1 .. Result.Last);
95 Result.Reference (1 .. Left'Length) := Left;
96 Result.Reference (Left'Length + 1 .. Result.Last) :=
97 Right.Reference (1 .. Right.Last);
103 (Left : Unbounded_Wide_String;
104 Right : Wide_Character) return Unbounded_Wide_String
106 Result : Unbounded_Wide_String;
109 Result.Last := Left.Last + 1;
111 Result.Reference := new Wide_String (1 .. Result.Last);
113 Result.Reference (1 .. Result.Last - 1) :=
114 Left.Reference (1 .. Left.Last);
115 Result.Reference (Result.Last) := Right;
121 (Left : Wide_Character;
122 Right : Unbounded_Wide_String) return Unbounded_Wide_String
124 Result : Unbounded_Wide_String;
127 Result.Last := Right.Last + 1;
129 Result.Reference := new Wide_String (1 .. Result.Last);
130 Result.Reference (1) := Left;
131 Result.Reference (2 .. Result.Last) :=
132 Right.Reference (1 .. Right.Last);
142 Right : Wide_Character) return Unbounded_Wide_String
144 Result : Unbounded_Wide_String;
149 Result.Reference := new Wide_String (1 .. Left);
150 for J in Result.Reference'Range loop
151 Result.Reference (J) := Right;
159 Right : Wide_String) return Unbounded_Wide_String
161 Len : constant Natural := Right'Length;
163 Result : Unbounded_Wide_String;
166 Result.Last := Left * Len;
168 Result.Reference := new Wide_String (1 .. Result.Last);
171 for J in 1 .. Left loop
172 Result.Reference (K .. K + Len - 1) := Right;
181 Right : Unbounded_Wide_String) return Unbounded_Wide_String
183 Len : constant Natural := Right.Last;
185 Result : Unbounded_Wide_String;
188 Result.Last := Left * Len;
190 Result.Reference := new Wide_String (1 .. Result.Last);
193 for J in 1 .. Left loop
194 Result.Reference (K .. K + Len - 1) :=
195 Right.Reference (1 .. Right.Last);
207 (Left : Unbounded_Wide_String;
208 Right : Unbounded_Wide_String) return Boolean
212 Left.Reference (1 .. Left.Last) < Right.Reference (1 .. Right.Last);
216 (Left : Unbounded_Wide_String;
217 Right : Wide_String) return Boolean
220 return Left.Reference (1 .. Left.Last) < Right;
225 Right : Unbounded_Wide_String) return Boolean
228 return Left < Right.Reference (1 .. Right.Last);
236 (Left : Unbounded_Wide_String;
237 Right : Unbounded_Wide_String) return Boolean
241 Left.Reference (1 .. Left.Last) <= Right.Reference (1 .. Right.Last);
245 (Left : Unbounded_Wide_String;
246 Right : Wide_String) return Boolean
249 return Left.Reference (1 .. Left.Last) <= Right;
254 Right : Unbounded_Wide_String) return Boolean
257 return Left <= Right.Reference (1 .. Right.Last);
265 (Left : Unbounded_Wide_String;
266 Right : Unbounded_Wide_String) return Boolean
270 Left.Reference (1 .. Left.Last) = Right.Reference (1 .. Right.Last);
274 (Left : Unbounded_Wide_String;
275 Right : Wide_String) return Boolean
278 return Left.Reference (1 .. Left.Last) = Right;
283 Right : Unbounded_Wide_String) return Boolean
286 return Left = Right.Reference (1 .. Right.Last);
294 (Left : Unbounded_Wide_String;
295 Right : Unbounded_Wide_String) return Boolean
299 Left.Reference (1 .. Left.Last) > Right.Reference (1 .. Right.Last);
303 (Left : Unbounded_Wide_String;
304 Right : Wide_String) return Boolean
307 return Left.Reference (1 .. Left.Last) > Right;
312 Right : Unbounded_Wide_String) return Boolean
315 return Left > Right.Reference (1 .. Right.Last);
323 (Left : Unbounded_Wide_String;
324 Right : Unbounded_Wide_String) return Boolean
328 Left.Reference (1 .. Left.Last) >= Right.Reference (1 .. Right.Last);
332 (Left : Unbounded_Wide_String;
333 Right : Wide_String) return Boolean
336 return Left.Reference (1 .. Left.Last) >= Right;
341 Right : Unbounded_Wide_String) return Boolean
344 return Left >= Right.Reference (1 .. Right.Last);
351 procedure Adjust (Object : in out Unbounded_Wide_String) is
353 -- Copy string, except we do not copy the statically allocated null
354 -- string, since it can never be deallocated. Note that we do not copy
355 -- extra string room here to avoid dragging unused allocated memory.
357 if Object.Reference /= Null_Wide_String'Access then
359 new Wide_String'(Object.Reference (1 .. Object.Last));
368 (Source : in out Unbounded_Wide_String;
369 New_Item : Unbounded_Wide_String)
372 Realloc_For_Chunk (Source, New_Item.Last);
373 Source.Reference (Source.Last + 1 .. Source.Last + New_Item.Last) :=
374 New_Item.Reference (1 .. New_Item.Last);
375 Source.Last := Source.Last + New_Item.Last;
379 (Source : in out Unbounded_Wide_String;
380 New_Item : Wide_String)
383 Realloc_For_Chunk (Source, New_Item'Length);
384 Source.Reference (Source.Last + 1 .. Source.Last + New_Item'Length) :=
386 Source.Last := Source.Last + New_Item'Length;
390 (Source : in out Unbounded_Wide_String;
391 New_Item : Wide_Character)
394 Realloc_For_Chunk (Source, 1);
395 Source.Reference (Source.Last + 1) := New_Item;
396 Source.Last := Source.Last + 1;
404 (Source : Unbounded_Wide_String;
405 Pattern : Wide_String;
406 Mapping : Wide_Maps.Wide_Character_Mapping := Wide_Maps.Identity)
412 (Source.Reference (1 .. Source.Last), Pattern, Mapping);
416 (Source : Unbounded_Wide_String;
417 Pattern : Wide_String;
418 Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Natural
423 (Source.Reference (1 .. Source.Last), Pattern, Mapping);
427 (Source : Unbounded_Wide_String;
428 Set : Wide_Maps.Wide_Character_Set) return Natural
433 (Source.Reference (1 .. Source.Last), Set);
441 (Source : Unbounded_Wide_String;
443 Through : Natural) return Unbounded_Wide_String
447 To_Unbounded_Wide_String
449 (Source.Reference (1 .. Source.Last), From, Through));
453 (Source : in out Unbounded_Wide_String;
458 if From > Through then
461 elsif From < Source.Reference'First or else Through > Source.Last then
466 Len : constant Natural := Through - From + 1;
469 Source.Reference (From .. Source.Last - Len) :=
470 Source.Reference (Through + 1 .. Source.Last);
471 Source.Last := Source.Last - Len;
481 (Source : Unbounded_Wide_String;
482 Index : Positive) return Wide_Character
485 if Index <= Source.Last then
486 return Source.Reference (Index);
488 raise Strings.Index_Error;
496 procedure Finalize (Object : in out Unbounded_Wide_String) is
497 procedure Deallocate is
498 new Ada.Unchecked_Deallocation (Wide_String, Wide_String_Access);
501 -- Note: Don't try to free statically allocated null string
503 if Object.Reference /= Null_Wide_String'Access then
504 Deallocate (Object.Reference);
505 Object.Reference := Null_Unbounded_Wide_String.Reference;
515 (Source : Unbounded_Wide_String;
516 Set : Wide_Maps.Wide_Character_Set;
518 Test : Strings.Membership;
519 First : out Positive;
523 Wide_Search.Find_Token
524 (Source.Reference (From .. Source.Last), Set, Test, First, Last);
528 (Source : Unbounded_Wide_String;
529 Set : Wide_Maps.Wide_Character_Set;
530 Test : Strings.Membership;
531 First : out Positive;
535 Wide_Search.Find_Token
536 (Source.Reference (1 .. Source.Last), Set, Test, First, Last);
543 procedure Free (X : in out Wide_String_Access) is
544 procedure Deallocate is
545 new Ada.Unchecked_Deallocation (Wide_String, Wide_String_Access);
548 -- Note: Do not try to free statically allocated null string
550 if X /= Null_Unbounded_Wide_String.Reference then
560 (Source : Unbounded_Wide_String;
562 Pad : Wide_Character := Wide_Space) return Unbounded_Wide_String
565 return To_Unbounded_Wide_String
566 (Wide_Fixed.Head (Source.Reference (1 .. Source.Last), Count, Pad));
570 (Source : in out Unbounded_Wide_String;
572 Pad : Wide_Character := Wide_Space)
574 Old : Wide_String_Access := Source.Reference;
578 (Wide_Fixed.Head (Source.Reference (1 .. Source.Last), Count, Pad));
579 Source.Last := Source.Reference'Length;
588 (Source : Unbounded_Wide_String;
589 Pattern : Wide_String;
590 Going : Strings.Direction := Strings.Forward;
591 Mapping : Wide_Maps.Wide_Character_Mapping := Wide_Maps.Identity)
597 (Source.Reference (1 .. Source.Last), Pattern, Going, Mapping);
601 (Source : Unbounded_Wide_String;
602 Pattern : Wide_String;
603 Going : Direction := Forward;
604 Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Natural
609 (Source.Reference (1 .. Source.Last), Pattern, Going, Mapping);
613 (Source : Unbounded_Wide_String;
614 Set : Wide_Maps.Wide_Character_Set;
615 Test : Strings.Membership := Strings.Inside;
616 Going : Strings.Direction := Strings.Forward) return Natural
619 return Wide_Search.Index
620 (Source.Reference (1 .. Source.Last), Set, Test, Going);
624 (Source : Unbounded_Wide_String;
625 Pattern : Wide_String;
627 Going : Direction := Forward;
628 Mapping : Wide_Maps.Wide_Character_Mapping := Wide_Maps.Identity)
634 (Source.Reference (1 .. Source.Last), Pattern, From, Going, Mapping);
638 (Source : Unbounded_Wide_String;
639 Pattern : Wide_String;
641 Going : Direction := Forward;
642 Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Natural
647 (Source.Reference (1 .. Source.Last), Pattern, From, Going, Mapping);
651 (Source : Unbounded_Wide_String;
652 Set : Wide_Maps.Wide_Character_Set;
654 Test : Membership := Inside;
655 Going : Direction := Forward) return Natural
660 (Source.Reference (1 .. Source.Last), Set, From, Test, Going);
663 function Index_Non_Blank
664 (Source : Unbounded_Wide_String;
665 Going : Strings.Direction := Strings.Forward) return Natural
669 Wide_Search.Index_Non_Blank
670 (Source.Reference (1 .. Source.Last), Going);
673 function Index_Non_Blank
674 (Source : Unbounded_Wide_String;
676 Going : Direction := Forward) return Natural
680 Wide_Search.Index_Non_Blank
681 (Source.Reference (1 .. Source.Last), From, Going);
688 procedure Initialize (Object : in out Unbounded_Wide_String) is
690 Object.Reference := Null_Unbounded_Wide_String.Reference;
699 (Source : Unbounded_Wide_String;
701 New_Item : Wide_String) return Unbounded_Wide_String
705 To_Unbounded_Wide_String
707 (Source.Reference (1 .. Source.Last), Before, New_Item));
711 (Source : in out Unbounded_Wide_String;
713 New_Item : Wide_String)
716 if Before not in Source.Reference'First .. Source.Last + 1 then
720 Realloc_For_Chunk (Source, New_Item'Length);
723 (Before + New_Item'Length .. Source.Last + New_Item'Length) :=
724 Source.Reference (Before .. Source.Last);
726 Source.Reference (Before .. Before + New_Item'Length - 1) := New_Item;
727 Source.Last := Source.Last + New_Item'Length;
734 function Length (Source : Unbounded_Wide_String) return Natural is
744 (Source : Unbounded_Wide_String;
746 New_Item : Wide_String) return Unbounded_Wide_String
750 To_Unbounded_Wide_String
751 (Wide_Fixed.Overwrite
752 (Source.Reference (1 .. Source.Last), Position, New_Item));
756 (Source : in out Unbounded_Wide_String;
758 New_Item : Wide_String)
760 NL : constant Natural := New_Item'Length;
762 if Position <= Source.Last - NL + 1 then
763 Source.Reference (Position .. Position + NL - 1) := New_Item;
766 Old : Wide_String_Access := Source.Reference;
768 Source.Reference := new Wide_String'
769 (Wide_Fixed.Overwrite
770 (Source.Reference (1 .. Source.Last), Position, New_Item));
771 Source.Last := Source.Reference'Length;
777 -----------------------
778 -- Realloc_For_Chunk --
779 -----------------------
781 procedure Realloc_For_Chunk
782 (Source : in out Unbounded_Wide_String;
783 Chunk_Size : Natural)
785 Growth_Factor : constant := 32;
786 -- The growth factor controls how much extra space is allocated when
787 -- we have to increase the size of an allocated unbounded string. By
788 -- allocating extra space, we avoid the need to reallocate on every
789 -- append, particularly important when a string is built up by repeated
790 -- append operations of small pieces. This is expressed as a factor so
791 -- 32 means add 1/32 of the length of the string as growth space.
793 Min_Mul_Alloc : constant := Standard'Maximum_Alignment;
794 -- Allocation will be done by a multiple of Min_Mul_Alloc This causes
795 -- no memory loss as most (all?) malloc implementations are obliged to
796 -- align the returned memory on the maximum alignment as malloc does not
797 -- know the target alignment.
799 S_Length : constant Natural := Source.Reference'Length;
802 if Chunk_Size > S_Length - Source.Last then
804 New_Size : constant Positive :=
805 S_Length + Chunk_Size + (S_Length / Growth_Factor);
807 New_Rounded_Up_Size : constant Positive :=
808 ((New_Size - 1) / Min_Mul_Alloc + 1) *
811 Tmp : constant Wide_String_Access :=
812 new Wide_String (1 .. New_Rounded_Up_Size);
815 Tmp (1 .. Source.Last) := Source.Reference (1 .. Source.Last);
816 Free (Source.Reference);
817 Source.Reference := Tmp;
820 end Realloc_For_Chunk;
822 ---------------------
823 -- Replace_Element --
824 ---------------------
826 procedure Replace_Element
827 (Source : in out Unbounded_Wide_String;
832 if Index <= Source.Last then
833 Source.Reference (Index) := By;
835 raise Strings.Index_Error;
843 function Replace_Slice
844 (Source : Unbounded_Wide_String;
847 By : Wide_String) return Unbounded_Wide_String
850 return To_Unbounded_Wide_String
851 (Wide_Fixed.Replace_Slice
852 (Source.Reference (1 .. Source.Last), Low, High, By));
855 procedure Replace_Slice
856 (Source : in out Unbounded_Wide_String;
861 Old : Wide_String_Access := Source.Reference;
863 Source.Reference := new Wide_String'
864 (Wide_Fixed.Replace_Slice
865 (Source.Reference (1 .. Source.Last), Low, High, By));
866 Source.Last := Source.Reference'Length;
870 -------------------------------
871 -- Set_Unbounded_Wide_String --
872 -------------------------------
874 procedure Set_Unbounded_Wide_String
875 (Target : out Unbounded_Wide_String;
876 Source : Wide_String)
879 Target.Last := Source'Length;
880 Target.Reference := new Wide_String (1 .. Source'Length);
881 Target.Reference.all := Source;
882 end Set_Unbounded_Wide_String;
889 (Source : Unbounded_Wide_String;
891 High : Natural) return Wide_String
894 -- Note: test of High > Length is in accordance with AI95-00128
896 if Low > Source.Last + 1 or else High > Source.Last then
899 return Source.Reference (Low .. High);
908 (Source : Unbounded_Wide_String;
910 Pad : Wide_Character := Wide_Space) return Unbounded_Wide_String is
912 return To_Unbounded_Wide_String
913 (Wide_Fixed.Tail (Source.Reference (1 .. Source.Last), Count, Pad));
917 (Source : in out Unbounded_Wide_String;
919 Pad : Wide_Character := Wide_Space)
921 Old : Wide_String_Access := Source.Reference;
923 Source.Reference := new Wide_String'
924 (Wide_Fixed.Tail (Source.Reference (1 .. Source.Last), Count, Pad));
925 Source.Last := Source.Reference'Length;
929 ------------------------------
930 -- To_Unbounded_Wide_String --
931 ------------------------------
933 function To_Unbounded_Wide_String
934 (Source : Wide_String)
935 return Unbounded_Wide_String
937 Result : Unbounded_Wide_String;
939 Result.Last := Source'Length;
940 Result.Reference := new Wide_String (1 .. Source'Length);
941 Result.Reference.all := Source;
943 end To_Unbounded_Wide_String;
945 function To_Unbounded_Wide_String
946 (Length : Natural) return Unbounded_Wide_String
948 Result : Unbounded_Wide_String;
950 Result.Last := Length;
951 Result.Reference := new Wide_String (1 .. Length);
953 end To_Unbounded_Wide_String;
959 function To_Wide_String
960 (Source : Unbounded_Wide_String)
964 return Source.Reference (1 .. Source.Last);
972 (Source : Unbounded_Wide_String;
973 Mapping : Wide_Maps.Wide_Character_Mapping)
974 return Unbounded_Wide_String
978 To_Unbounded_Wide_String
979 (Wide_Fixed.Translate
980 (Source.Reference (1 .. Source.Last), Mapping));
984 (Source : in out Unbounded_Wide_String;
985 Mapping : Wide_Maps.Wide_Character_Mapping)
988 Wide_Fixed.Translate (Source.Reference (1 .. Source.Last), Mapping);
992 (Source : Unbounded_Wide_String;
993 Mapping : Wide_Maps.Wide_Character_Mapping_Function)
994 return Unbounded_Wide_String
998 To_Unbounded_Wide_String
999 (Wide_Fixed.Translate
1000 (Source.Reference (1 .. Source.Last), Mapping));
1004 (Source : in out Unbounded_Wide_String;
1005 Mapping : Wide_Maps.Wide_Character_Mapping_Function)
1008 Wide_Fixed.Translate (Source.Reference (1 .. Source.Last), Mapping);
1016 (Source : Unbounded_Wide_String;
1017 Side : Trim_End) return Unbounded_Wide_String
1021 To_Unbounded_Wide_String
1022 (Wide_Fixed.Trim (Source.Reference (1 .. Source.Last), Side));
1026 (Source : in out Unbounded_Wide_String;
1029 Old : Wide_String_Access := Source.Reference;
1033 (Wide_Fixed.Trim (Source.Reference (1 .. Source.Last), Side));
1034 Source.Last := Source.Reference'Length;
1039 (Source : Unbounded_Wide_String;
1040 Left : Wide_Maps.Wide_Character_Set;
1041 Right : Wide_Maps.Wide_Character_Set)
1042 return Unbounded_Wide_String
1046 To_Unbounded_Wide_String
1048 (Source.Reference (1 .. Source.Last), Left, Right));
1052 (Source : in out Unbounded_Wide_String;
1053 Left : Wide_Maps.Wide_Character_Set;
1054 Right : Wide_Maps.Wide_Character_Set)
1056 Old : Wide_String_Access := Source.Reference;
1061 (Source.Reference (1 .. Source.Last), Left, Right));
1062 Source.Last := Source.Reference'Length;
1066 ---------------------
1067 -- Unbounded_Slice --
1068 ---------------------
1070 function Unbounded_Slice
1071 (Source : Unbounded_Wide_String;
1073 High : Natural) return Unbounded_Wide_String
1076 if Low > Source.Last + 1 or else High > Source.Last then
1079 return To_Unbounded_Wide_String (Source.Reference.all (Low .. High));
1081 end Unbounded_Slice;
1083 procedure Unbounded_Slice
1084 (Source : Unbounded_Wide_String;
1085 Target : out Unbounded_Wide_String;
1090 if Low > Source.Last + 1 or else High > Source.Last then
1094 To_Unbounded_Wide_String (Source.Reference.all (Low .. High));
1096 end Unbounded_Slice;
1098 end Ada.Strings.Wide_Unbounded;