1 ------------------------------------------------------------------------------
3 -- GNAT RUN-TIME COMPONENTS --
5 -- ADA.STRINGS.WIDE_UNBOUNDED.WIDE_TEXT_IO --
9 -- Copyright (C) 1997-2009, 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
.Wide_Text_IO
; use Ada
.Wide_Text_IO
;
34 package body Ada
.Strings
.Wide_Unbounded
.Wide_Text_IO
is
40 function Get_Line
return Unbounded_Wide_String
is
41 Buffer
: Wide_String (1 .. 1000);
43 Str1
: Wide_String_Access
;
44 Str2
: Wide_String_Access
;
45 Result
: Unbounded_Wide_String
;
48 Get_Line
(Buffer
, Last
);
49 Str1
:= new Wide_String'(Buffer (1 .. Last));
50 while Last = Buffer'Last loop
51 Get_Line (Buffer, Last);
52 Str2 := new Wide_String (1 .. Str1'Last + Last);
53 Str2 (Str1'Range) := Str1.all;
54 Str2 (Str1'Last + 1 .. Str2'Last) := Buffer (1 .. Last);
59 Result.Reference := Str1;
60 Result.Last := Str1'Length;
65 (File : Ada.Wide_Text_IO.File_Type) return Unbounded_Wide_String
67 Buffer : Wide_String (1 .. 1000);
69 Str1 : Wide_String_Access;
70 Str2 : Wide_String_Access;
71 Result : Unbounded_Wide_String;
74 Get_Line (File, Buffer, Last);
75 Str1 := new Wide_String'(Buffer
(1 .. Last
));
76 while Last
= Buffer
'Last loop
77 Get_Line
(File
, Buffer
, Last
);
78 Str2
:= new Wide_String (1 .. Str1
'Last + Last
);
79 Str2
(Str1
'Range) := Str1
.all;
80 Str2
(Str1
'Last + 1 .. Str2
'Last) := Buffer
(1 .. Last
);
85 Result
.Reference
:= Str1
;
86 Result
.Last
:= Str1
'Length;
90 procedure Get_Line
(Item
: out Unbounded_Wide_String
) is
92 Get_Line
(Current_Input
, Item
);
96 (File
: Ada
.Wide_Text_IO
.File_Type
;
97 Item
: out Unbounded_Wide_String
)
100 -- We are going to read into the string that is already there and
101 -- allocated. Hopefully it is big enough now, if not, we will extend
102 -- it in the usual manner using Realloc_For_Chunk.
104 -- Make sure we start with at least 80 characters
106 if Item
.Reference
'Last < 80 then
107 Realloc_For_Chunk
(Item
, 80);
110 -- Loop to read data, filling current string as far as possible.
111 -- Item.Last holds the number of characters read so far.
117 Item
.Reference
(Item
.Last
+ 1 .. Item
.Reference
'Last),
120 -- If we hit the end of the line before the end of the buffer, then
121 -- we are all done, and the result length is properly set.
123 if Item
.Last
< Item
.Reference
'Last then
127 -- If not enough room, double it and keep reading
129 Realloc_For_Chunk
(Item
, Item
.Last
);
137 procedure Put
(U
: Unbounded_Wide_String
) is
139 Put
(U
.Reference
(1 .. U
.Last
));
142 procedure Put
(File
: File_Type
; U
: Unbounded_Wide_String
) is
144 Put
(File
, U
.Reference
(1 .. U
.Last
));
151 procedure Put_Line
(U
: Unbounded_Wide_String
) is
153 Put_Line
(U
.Reference
(1 .. U
.Last
));
156 procedure Put_Line
(File
: File_Type
; U
: Unbounded_Wide_String
) is
158 Put_Line
(File
, U
.Reference
(1 .. U
.Last
));
161 end Ada
.Strings
.Wide_Unbounded
.Wide_Text_IO
;