------------------------------------------------------------------------------
-- --
--- GNAT RUNTIME COMPONENTS --
+-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . S T R I N G S . M A P S --
-- --
-- B o d y --
-- --
--- --
--- Copyright (C) 1992-2001 Free Software Foundation, Inc. --
+-- Copyright (C) 1992-2009, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
--- ware Foundation; either version 2, or (at your option) any later ver- --
+-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
--- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
--- for more details. You should have received a copy of the GNU General --
--- Public License distributed with GNAT; see file COPYING. If not, write --
--- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
--- MA 02111-1307, USA. --
+-- or FITNESS FOR A PARTICULAR PURPOSE. --
+-- --
+-- As a special exception under Section 7 of GPL version 3, you are granted --
+-- additional permissions described in the GCC Runtime Library Exception, --
+-- version 3.1, as published by the Free Software Foundation. --
-- --
--- As a special exception, if other files instantiate generics from this --
--- unit, or you link this unit with other files to produce an executable, --
--- this unit does not by itself cause the resulting executable to be --
--- covered by the GNU General Public License. This exception does not --
--- however invalidate any other reasons why the executable file might be --
--- covered by the GNU Public License. --
+-- You should have received a copy of the GNU General Public License and --
+-- a copy of the GCC Runtime Library Exception along with this program; --
+-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
+-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
--- It is now maintained by Ada Core Technologies Inc (http://www.gnat.com). --
+-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- "=" --
---------
- function "=" (Left, Right : in Character_Set) return Boolean is
+ function "=" (Left, Right : Character_Set) return Boolean is
begin
return Character_Set_Internal (Left) = Character_Set_Internal (Right);
end "=";
-- "and" --
-----------
- function "and" (Left, Right : in Character_Set) return Character_Set is
+ function "and" (Left, Right : Character_Set) return Character_Set is
begin
return Character_Set
(Character_Set_Internal (Left) and Character_Set_Internal (Right));
-- "not" --
-----------
- function "not" (Right : in Character_Set) return Character_Set is
+ function "not" (Right : Character_Set) return Character_Set is
begin
return Character_Set (not Character_Set_Internal (Right));
end "not";
-- "or" --
----------
- function "or" (Left, Right : in Character_Set) return Character_Set is
+ function "or" (Left, Right : Character_Set) return Character_Set is
begin
return Character_Set
(Character_Set_Internal (Left) or Character_Set_Internal (Right));
-- "xor" --
-----------
- function "xor" (Left, Right : in Character_Set) return Character_Set is
+ function "xor" (Left, Right : Character_Set) return Character_Set is
begin
return Character_Set
(Character_Set_Internal (Left) xor Character_Set_Internal (Right));
function Is_In
(Element : Character;
- Set : Character_Set)
- return Boolean
+ Set : Character_Set) return Boolean
is
begin
return Set (Element);
function Is_Subset
(Elements : Character_Set;
- Set : Character_Set)
- return Boolean
+ Set : Character_Set) return Boolean
is
begin
return (Elements and Set) = Elements;
-- To_Domain --
---------------
- function To_Domain (Map : in Character_Mapping) return Character_Sequence
+ function To_Domain (Map : Character_Mapping) return Character_Sequence
is
Result : String (1 .. Map'Length);
J : Natural;
----------------
function To_Mapping
- (From, To : in Character_Sequence)
- return Character_Mapping
+ (From, To : Character_Sequence) return Character_Mapping
is
Result : Character_Mapping;
Inserted : Character_Set := Null_Set;
-- To_Range --
--------------
- function To_Range (Map : in Character_Mapping) return Character_Sequence
+ function To_Range (Map : Character_Mapping) return Character_Sequence
is
Result : String (1 .. Map'Length);
J : Natural;
-
begin
J := 0;
for C in Map'Range loop
-- To_Ranges --
---------------
- function To_Ranges (Set : in Character_Set) return Character_Ranges is
+ function To_Ranges (Set : Character_Set) return Character_Ranges is
Max_Ranges : Character_Ranges (1 .. Set'Length / 2 + 1);
Range_Num : Natural;
C : Character;
Range_Num := 0;
loop
- -- Skip gap between subsets.
+ -- Skip gap between subsets
while not Set (C) loop
exit when C = Character'Last;
Range_Num := Range_Num + 1;
Max_Ranges (Range_Num).Low := C;
- -- Span a subset.
+ -- Span a subset
loop
exit when not Set (C) or else C = Character'Last;
- C := Character' Succ (C);
+ C := Character'Succ (C);
end loop;
if Set (C) then
-- To_Sequence --
-----------------
- function To_Sequence
- (Set : Character_Set)
- return Character_Sequence
- is
+ function To_Sequence (Set : Character_Set) return Character_Sequence is
Result : String (1 .. Character'Pos (Character'Last) + 1);
Count : Natural := 0;
-
begin
for Char in Set'Range loop
if Set (Char) then
-- To_Set --
------------
- function To_Set (Ranges : in Character_Ranges) return Character_Set is
+ function To_Set (Ranges : Character_Ranges) return Character_Set is
Result : Character_Set;
-
begin
for C in Result'Range loop
Result (C) := False;
return Result;
end To_Set;
- function To_Set (Span : in Character_Range) return Character_Set is
+ function To_Set (Span : Character_Range) return Character_Set is
Result : Character_Set;
-
begin
for C in Result'Range loop
Result (C) := False;
function To_Set (Sequence : Character_Sequence) return Character_Set is
Result : Character_Set := Null_Set;
-
begin
for J in Sequence'Range loop
Result (Sequence (J)) := True;
function To_Set (Singleton : Character) return Character_Set is
Result : Character_Set := Null_Set;
-
begin
Result (Singleton) := True;
return Result;
-- Value --
-----------
- function Value (Map : in Character_Mapping; Element : in Character)
- return Character is
-
+ function Value
+ (Map : Character_Mapping;
+ Element : Character) return Character
+ is
begin
return Map (Element);
end Value;