Remove some compile time warnings about duplicate definitions.
[official-gcc.git] / gcc / ada / a-strsea.ads
blob9819bf4997d24b5bc1739f201138aadf852d6580
1 ------------------------------------------------------------------------------
2 -- --
3 -- GNAT RUN-TIME COMPONENTS --
4 -- --
5 -- A D A . S T R I N G S . S E A R C H --
6 -- --
7 -- S p e c --
8 -- --
9 -- $Revision: 1.10 $ --
10 -- --
11 -- Copyright (C) 1992-1997 Free Software Foundation, Inc. --
12 -- --
13 -- --
14 -- GNAT is free software; you can redistribute it and/or modify it under --
15 -- terms of the GNU General Public License as published by the Free Soft- --
16 -- ware Foundation; either version 2, or (at your option) any later ver- --
17 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
18 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
19 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
20 -- for more details. You should have received a copy of the GNU General --
21 -- Public License distributed with GNAT; see file COPYING. If not, write --
22 -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
23 -- MA 02111-1307, USA. --
24 -- --
25 -- As a special exception, if other files instantiate generics from this --
26 -- unit, or you link this unit with other files to produce an executable, --
27 -- this unit does not by itself cause the resulting executable to be --
28 -- covered by the GNU General Public License. This exception does not --
29 -- however invalidate any other reasons why the executable file might be --
30 -- covered by the GNU Public License. --
31 -- --
32 -- GNAT was originally developed by the GNAT team at New York University. --
33 -- It is now maintained by Ada Core Technologies Inc (http://www.gnat.com). --
34 -- --
35 ------------------------------------------------------------------------------
37 -- This package contains the search functions from Ada.Strings.Fixed. They
38 -- are separated out because they are shared by Ada.Strings.Bounded and
39 -- Ada.Strings.Unbounded, and we don't want to drag other irrelevant stuff
40 -- from Ada.Strings.Fixed when using the other two packages. We make this
41 -- a private package, since user programs should access these subprograms
42 -- via one of the standard string packages.
44 with Ada.Strings.Maps;
46 private package Ada.Strings.Search is
47 pragma Preelaborate (Search);
49 function Index
50 (Source : in String;
51 Pattern : in String;
52 Going : in Direction := Forward;
53 Mapping : in Maps.Character_Mapping := Maps.Identity)
54 return Natural;
56 function Index
57 (Source : in String;
58 Pattern : in String;
59 Going : in Direction := Forward;
60 Mapping : in Maps.Character_Mapping_Function)
61 return Natural;
63 function Index
64 (Source : in String;
65 Set : in Maps.Character_Set;
66 Test : in Membership := Inside;
67 Going : in Direction := Forward)
68 return Natural;
70 function Index_Non_Blank
71 (Source : in String;
72 Going : in Direction := Forward)
73 return Natural;
75 function Count
76 (Source : in String;
77 Pattern : in String;
78 Mapping : in Maps.Character_Mapping := Maps.Identity)
79 return Natural;
81 function Count
82 (Source : in String;
83 Pattern : in String;
84 Mapping : in Maps.Character_Mapping_Function)
85 return Natural;
87 function Count
88 (Source : in String;
89 Set : in Maps.Character_Set)
90 return Natural;
93 procedure Find_Token
94 (Source : in String;
95 Set : in Maps.Character_Set;
96 Test : in Membership;
97 First : out Positive;
98 Last : out Natural);
100 end Ada.Strings.Search;