1 |
12 |
jlechner |
------------------------------------------------------------------------------
|
2 |
|
|
-- --
|
3 |
|
|
-- GNAT RUN-TIME COMPONENTS --
|
4 |
|
|
-- --
|
5 |
|
|
-- A D A . S T R I N G S . B O U N D E D --
|
6 |
|
|
-- --
|
7 |
|
|
-- B o d y --
|
8 |
|
|
-- --
|
9 |
|
|
-- Copyright (C) 1992-2005, 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 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. --
|
21 |
|
|
-- --
|
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. --
|
28 |
|
|
-- --
|
29 |
|
|
-- GNAT was originally developed by the GNAT team at New York University. --
|
30 |
|
|
-- Extensive contributions were provided by Ada Core Technologies Inc. --
|
31 |
|
|
-- --
|
32 |
|
|
------------------------------------------------------------------------------
|
33 |
|
|
|
34 |
|
|
package body Ada.Strings.Bounded is
|
35 |
|
|
|
36 |
|
|
package body Generic_Bounded_Length is
|
37 |
|
|
|
38 |
|
|
-- The subprograms in this body are those for which there is no
|
39 |
|
|
-- Bounded_String input, and hence no implicit information on the
|
40 |
|
|
-- maximum size. This means that the maximum size has to be passed
|
41 |
|
|
-- explicitly to the routine in Superbounded.
|
42 |
|
|
|
43 |
|
|
---------
|
44 |
|
|
-- "*" --
|
45 |
|
|
---------
|
46 |
|
|
|
47 |
|
|
function "*"
|
48 |
|
|
(Left : Natural;
|
49 |
|
|
Right : Character) return Bounded_String
|
50 |
|
|
is
|
51 |
|
|
begin
|
52 |
|
|
return Times (Left, Right, Max_Length);
|
53 |
|
|
end "*";
|
54 |
|
|
|
55 |
|
|
function "*"
|
56 |
|
|
(Left : Natural;
|
57 |
|
|
Right : String) return Bounded_String
|
58 |
|
|
is
|
59 |
|
|
begin
|
60 |
|
|
return Times (Left, Right, Max_Length);
|
61 |
|
|
end "*";
|
62 |
|
|
|
63 |
|
|
---------------
|
64 |
|
|
-- Replicate --
|
65 |
|
|
---------------
|
66 |
|
|
|
67 |
|
|
function Replicate
|
68 |
|
|
(Count : Natural;
|
69 |
|
|
Item : Character;
|
70 |
|
|
Drop : Strings.Truncation := Strings.Error) return Bounded_String
|
71 |
|
|
is
|
72 |
|
|
begin
|
73 |
|
|
return Super_Replicate (Count, Item, Drop, Max_Length);
|
74 |
|
|
end Replicate;
|
75 |
|
|
|
76 |
|
|
function Replicate
|
77 |
|
|
(Count : Natural;
|
78 |
|
|
Item : String;
|
79 |
|
|
Drop : Strings.Truncation := Strings.Error) return Bounded_String
|
80 |
|
|
is
|
81 |
|
|
begin
|
82 |
|
|
return Super_Replicate (Count, Item, Drop, Max_Length);
|
83 |
|
|
end Replicate;
|
84 |
|
|
|
85 |
|
|
-----------------------
|
86 |
|
|
-- To_Bounded_String --
|
87 |
|
|
-----------------------
|
88 |
|
|
|
89 |
|
|
function To_Bounded_String
|
90 |
|
|
(Source : String;
|
91 |
|
|
Drop : Strings.Truncation := Strings.Error) return Bounded_String
|
92 |
|
|
is
|
93 |
|
|
begin
|
94 |
|
|
return To_Super_String (Source, Max_Length, Drop);
|
95 |
|
|
end To_Bounded_String;
|
96 |
|
|
|
97 |
|
|
end Generic_Bounded_Length;
|
98 |
|
|
|
99 |
|
|
end Ada.Strings.Bounded;
|