* arm.c (arm_compute_initial_elimination_offset): If optimizing for
[official-gcc.git] / gcc / ada / a-strsea.ads
blobf3521f9a57b12d3dab3d40858d51d729563f0eca
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 -- --
10 -- Copyright (C) 1992-1997 Free Software Foundation, Inc. --
11 -- --
12 -- --
13 -- GNAT is free software; you can redistribute it and/or modify it under --
14 -- terms of the GNU General Public License as published by the Free Soft- --
15 -- ware Foundation; either version 2, or (at your option) any later ver- --
16 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
17 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
18 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
19 -- for more details. You should have received a copy of the GNU General --
20 -- Public License distributed with GNAT; see file COPYING. If not, write --
21 -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
22 -- MA 02111-1307, USA. --
23 -- --
24 -- As a special exception, if other files instantiate generics from this --
25 -- unit, or you link this unit with other files to produce an executable, --
26 -- this unit does not by itself cause the resulting executable to be --
27 -- covered by the GNU General Public License. This exception does not --
28 -- however invalidate any other reasons why the executable file might be --
29 -- covered by the GNU Public License. --
30 -- --
31 -- GNAT was originally developed by the GNAT team at New York University. --
32 -- Extensive contributions were provided by Ada Core Technologies Inc. --
33 -- --
34 ------------------------------------------------------------------------------
36 -- This package contains the search functions from Ada.Strings.Fixed. They
37 -- are separated out because they are shared by Ada.Strings.Bounded and
38 -- Ada.Strings.Unbounded, and we don't want to drag other irrelevant stuff
39 -- from Ada.Strings.Fixed when using the other two packages. We make this
40 -- a private package, since user programs should access these subprograms
41 -- via one of the standard string packages.
43 with Ada.Strings.Maps;
45 private package Ada.Strings.Search is
46 pragma Preelaborate (Search);
48 function Index
49 (Source : in String;
50 Pattern : in String;
51 Going : in Direction := Forward;
52 Mapping : in Maps.Character_Mapping := Maps.Identity)
53 return Natural;
55 function Index
56 (Source : in String;
57 Pattern : in String;
58 Going : in Direction := Forward;
59 Mapping : in Maps.Character_Mapping_Function)
60 return Natural;
62 function Index
63 (Source : in String;
64 Set : in Maps.Character_Set;
65 Test : in Membership := Inside;
66 Going : in Direction := Forward)
67 return Natural;
69 function Index_Non_Blank
70 (Source : in String;
71 Going : in Direction := Forward)
72 return Natural;
74 function Count
75 (Source : in String;
76 Pattern : in String;
77 Mapping : in Maps.Character_Mapping := Maps.Identity)
78 return Natural;
80 function Count
81 (Source : in String;
82 Pattern : in String;
83 Mapping : in Maps.Character_Mapping_Function)
84 return Natural;
86 function Count
87 (Source : in String;
88 Set : in Maps.Character_Set)
89 return Natural;
92 procedure Find_Token
93 (Source : in String;
94 Set : in Maps.Character_Set;
95 Test : in Membership;
96 First : out Positive;
97 Last : out Natural);
99 end Ada.Strings.Search;