1 ------------------------------------------------------------------------------
3 -- GNAT RUN-TIME COMPONENTS --
5 -- A D A . S T R I N G S . U N B O U N D E D . T E X T _ I O --
9 -- Copyright (C) 1997-2007, 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 2, 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. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING. If not, write --
19 -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
20 -- Boston, MA 02110-1301, USA. --
22 -- As a special exception, if other files instantiate generics from this --
23 -- unit, or you link this unit with other files to produce an executable, --
24 -- this unit does not by itself cause the resulting executable to be --
25 -- covered by the GNU General Public License. This exception does not --
26 -- however invalidate any other reasons why the executable file might be --
27 -- covered by the GNU Public License. --
29 -- GNAT was originally developed by the GNAT team at New York University. --
30 -- Extensive contributions were provided by Ada Core Technologies Inc. --
32 ------------------------------------------------------------------------------
34 with Ada.Text_IO; use Ada.Text_IO;
36 package body Ada.Strings.Unbounded.Text_IO is
42 function Get_Line return Unbounded_String is
43 Buffer : String (1 .. 1000);
47 Result : Unbounded_String;
50 Get_Line (Buffer, Last);
51 Str1 := new String'(Buffer (1 .. Last));
52 while Last = Buffer'Last loop
53 Get_Line (Buffer, Last);
54 Str2 := new String (1 .. Str1'Last + Last);
55 Str2 (Str1'Range) := Str1.all;
56 Str2 (Str1'Last + 1 .. Str2'Last) := Buffer (1 .. Last);
61 Result.Reference := Str1;
62 Result.Last := Str1'Length;
66 function Get_Line (File : Ada.Text_IO.File_Type) return Unbounded_String is
67 Buffer : String (1 .. 1000);
71 Result : Unbounded_String;
74 Get_Line (File, Buffer, Last);
75 Str1 := new String'(Buffer (1 .. Last));
76 while Last = Buffer'Last loop
77 Get_Line (File, Buffer, Last);
78 Str2 := new 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_String) is
92 Get_Line (Current_Input, Item);
96 (File : Ada.Text_IO.File_Type;
97 Item : out Unbounded_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_String) is
139 Put (U.Reference (1 .. U.Last));
142 procedure Put (File : File_Type; U : Unbounded_String) is
144 Put (File, U.Reference (1 .. U.Last));
151 procedure Put_Line (U : Unbounded_String) is
153 Put_Line (U.Reference (1 .. U.Last));
156 procedure Put_Line (File : File_Type; U : Unbounded_String) is
158 Put_Line (File, U.Reference (1 .. U.Last));
161 end Ada.Strings.Unbounded.Text_IO;