| 1 |
281 |
jeremybenn |
------------------------------------------------------------------------------
|
| 2 |
|
|
-- --
|
| 3 |
|
|
-- GNAT RUN-TIME COMPONENTS --
|
| 4 |
|
|
-- --
|
| 5 |
|
|
-- A D A . S T R I N G S . U N B O U N D E D . A U X --
|
| 6 |
|
|
-- --
|
| 7 |
|
|
-- B o d y --
|
| 8 |
|
|
-- --
|
| 9 |
|
|
-- Copyright (C) 1992-2009, 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 |
|
|
package body Ada.Strings.Unbounded.Aux is
|
| 33 |
|
|
|
| 34 |
|
|
----------------
|
| 35 |
|
|
-- Get_String --
|
| 36 |
|
|
----------------
|
| 37 |
|
|
|
| 38 |
|
|
procedure Get_String
|
| 39 |
|
|
(U : Unbounded_String;
|
| 40 |
|
|
S : out String_Access;
|
| 41 |
|
|
L : out Natural)
|
| 42 |
|
|
is
|
| 43 |
|
|
begin
|
| 44 |
|
|
S := U.Reference;
|
| 45 |
|
|
L := U.Last;
|
| 46 |
|
|
end Get_String;
|
| 47 |
|
|
|
| 48 |
|
|
----------------
|
| 49 |
|
|
-- Set_String --
|
| 50 |
|
|
----------------
|
| 51 |
|
|
|
| 52 |
|
|
procedure Set_String (UP : in out Unbounded_String; S : String) is
|
| 53 |
|
|
begin
|
| 54 |
|
|
if S'Length > UP.Last then
|
| 55 |
|
|
Finalize (UP);
|
| 56 |
|
|
UP.Reference := new String (1 .. S'Length);
|
| 57 |
|
|
end if;
|
| 58 |
|
|
|
| 59 |
|
|
UP.Reference (1 .. S'Length) := S;
|
| 60 |
|
|
UP.Last := S'Length;
|
| 61 |
|
|
end Set_String;
|
| 62 |
|
|
|
| 63 |
|
|
procedure Set_String (UP : in out Unbounded_String; S : String_Access) is
|
| 64 |
|
|
begin
|
| 65 |
|
|
Finalize (UP);
|
| 66 |
|
|
UP.Reference := S;
|
| 67 |
|
|
UP.Last := UP.Reference'Length;
|
| 68 |
|
|
end Set_String;
|
| 69 |
|
|
|
| 70 |
|
|
end Ada.Strings.Unbounded.Aux;
|
