|
111
|
1 ------------------------------------------------------------------------------
|
|
|
2 -- --
|
|
|
3 -- GNAT RUN-TIME COMPONENTS --
|
|
|
4 -- --
|
|
|
5 -- ADA.STRINGS.WIDE_WIDE_UNBOUNDED.WIDE_WIDE_TEXT_IO --
|
|
|
6 -- --
|
|
|
7 -- B o d y --
|
|
|
8 -- --
|
|
|
9 -- Copyright (C) 1997-2017, Free Software Foundation, Inc. --
|
|
|
10 -- --
|
|
|
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. --
|
|
|
17 -- --
|
|
|
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. --
|
|
|
21 -- --
|
|
|
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/>. --
|
|
|
26 -- --
|
|
|
27 -- GNAT was originally developed by the GNAT team at New York University. --
|
|
|
28 -- Extensive contributions were provided by Ada Core Technologies Inc. --
|
|
|
29 -- --
|
|
|
30 ------------------------------------------------------------------------------
|
|
|
31
|
|
|
32 with Ada.Wide_Wide_Text_IO; use Ada.Wide_Wide_Text_IO;
|
|
|
33
|
|
|
34 package body Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Text_IO is
|
|
|
35
|
|
|
36 --------------
|
|
|
37 -- Get_Line --
|
|
|
38 --------------
|
|
|
39
|
|
|
40 function Get_Line return Unbounded_Wide_Wide_String is
|
|
|
41 Buffer : Wide_Wide_String (1 .. 1000);
|
|
|
42 Last : Natural;
|
|
|
43 Str1 : Wide_Wide_String_Access;
|
|
|
44 Str2 : Wide_Wide_String_Access;
|
|
|
45 Result : Unbounded_Wide_Wide_String;
|
|
|
46
|
|
|
47 begin
|
|
|
48 Get_Line (Buffer, Last);
|
|
|
49 Str1 := new Wide_Wide_String'(Buffer (1 .. Last));
|
|
|
50 while Last = Buffer'Last loop
|
|
|
51 Get_Line (Buffer, Last);
|
|
|
52 Str2 := new Wide_Wide_String (1 .. Str1'Last + Last);
|
|
|
53 Str2 (Str1'Range) := Str1.all;
|
|
|
54 Str2 (Str1'Last + 1 .. Str2'Last) := Buffer (1 .. Last);
|
|
|
55 Free (Str1);
|
|
|
56 Str1 := Str2;
|
|
|
57 end loop;
|
|
|
58
|
|
|
59 Result.Reference := Str1;
|
|
|
60 Result.Last := Str1'Length;
|
|
|
61 return Result;
|
|
|
62 end Get_Line;
|
|
|
63
|
|
|
64 function Get_Line
|
|
|
65 (File : Ada.Wide_Wide_Text_IO.File_Type) return Unbounded_Wide_Wide_String
|
|
|
66 is
|
|
|
67 Buffer : Wide_Wide_String (1 .. 1000);
|
|
|
68 Last : Natural;
|
|
|
69 Str1 : Wide_Wide_String_Access;
|
|
|
70 Str2 : Wide_Wide_String_Access;
|
|
|
71 Result : Unbounded_Wide_Wide_String;
|
|
|
72
|
|
|
73 begin
|
|
|
74 Get_Line (File, Buffer, Last);
|
|
|
75 Str1 := new Wide_Wide_String'(Buffer (1 .. Last));
|
|
|
76
|
|
|
77 while Last = Buffer'Last loop
|
|
|
78 Get_Line (File, Buffer, Last);
|
|
|
79 Str2 := new Wide_Wide_String (1 .. Str1'Last + Last);
|
|
|
80 Str2 (Str1'Range) := Str1.all;
|
|
|
81 Str2 (Str1'Last + 1 .. Str2'Last) := Buffer (1 .. Last);
|
|
|
82 Free (Str1);
|
|
|
83 Str1 := Str2;
|
|
|
84 end loop;
|
|
|
85
|
|
|
86 Result.Reference := Str1;
|
|
|
87 Result.Last := Str1'Length;
|
|
|
88 return Result;
|
|
|
89 end Get_Line;
|
|
|
90
|
|
|
91 procedure Get_Line (Item : out Unbounded_Wide_Wide_String) is
|
|
|
92 begin
|
|
|
93 Get_Line (Current_Input, Item);
|
|
|
94 end Get_Line;
|
|
|
95
|
|
|
96 procedure Get_Line
|
|
|
97 (File : Ada.Wide_Wide_Text_IO.File_Type;
|
|
|
98 Item : out Unbounded_Wide_Wide_String)
|
|
|
99 is
|
|
|
100 begin
|
|
|
101 -- We are going to read into the string that is already there and
|
|
|
102 -- allocated. Hopefully it is big enough now, if not, we will extend
|
|
|
103 -- it in the usual manner using Realloc_For_Chunk.
|
|
|
104
|
|
|
105 -- Make sure we start with at least 80 characters
|
|
|
106
|
|
|
107 if Item.Reference'Last < 80 then
|
|
|
108 Realloc_For_Chunk (Item, 80);
|
|
|
109 end if;
|
|
|
110
|
|
|
111 -- Loop to read data, filling current string as far as possible.
|
|
|
112 -- Item.Last holds the number of characters read so far.
|
|
|
113
|
|
|
114 Item.Last := 0;
|
|
|
115 loop
|
|
|
116 Get_Line
|
|
|
117 (File,
|
|
|
118 Item.Reference (Item.Last + 1 .. Item.Reference'Last),
|
|
|
119 Item.Last);
|
|
|
120
|
|
|
121 -- If we hit the end of the line before the end of the buffer, then
|
|
|
122 -- we are all done, and the result length is properly set.
|
|
|
123
|
|
|
124 if Item.Last < Item.Reference'Last then
|
|
|
125 return;
|
|
|
126 end if;
|
|
|
127
|
|
|
128 -- If not enough room, double it and keep reading
|
|
|
129
|
|
|
130 Realloc_For_Chunk (Item, Item.Last);
|
|
|
131 end loop;
|
|
|
132 end Get_Line;
|
|
|
133
|
|
|
134 ---------
|
|
|
135 -- Put --
|
|
|
136 ---------
|
|
|
137
|
|
|
138 procedure Put (U : Unbounded_Wide_Wide_String) is
|
|
|
139 begin
|
|
|
140 Put (U.Reference (1 .. U.Last));
|
|
|
141 end Put;
|
|
|
142
|
|
|
143 procedure Put (File : File_Type; U : Unbounded_Wide_Wide_String) is
|
|
|
144 begin
|
|
|
145 Put (File, U.Reference (1 .. U.Last));
|
|
|
146 end Put;
|
|
|
147
|
|
|
148 --------------
|
|
|
149 -- Put_Line --
|
|
|
150 --------------
|
|
|
151
|
|
|
152 procedure Put_Line (U : Unbounded_Wide_Wide_String) is
|
|
|
153 begin
|
|
|
154 Put_Line (U.Reference (1 .. U.Last));
|
|
|
155 end Put_Line;
|
|
|
156
|
|
|
157 procedure Put_Line (File : File_Type; U : Unbounded_Wide_Wide_String) is
|
|
|
158 begin
|
|
|
159 Put_Line (File, U.Reference (1 .. U.Last));
|
|
|
160 end Put_Line;
|
|
|
161
|
|
|
162 end Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Text_IO;
|
