0ae9f22fde
2006-02-13 Robert Dewar <dewar@adacore.com> * s-gloloc-mingw.adb, a-cgaaso.ads, a-stzmap.adb, a-stzmap.adb, a-stzmap.ads, a-ztcoio.adb, a-ztedit.adb, a-ztedit.ads, a-ztenau.adb, a-ztenau.ads, a-colien.adb, a-colien.ads, a-colire.adb, a-colire.ads, a-comlin.adb, a-decima.adb, a-decima.ads, a-direio.adb, a-direio.adb, a-direio.adb, a-direio.ads, a-ngcoty.adb, a-ngcoty.ads, a-nuflra.adb, a-nuflra.ads, a-sequio.adb, a-sequio.ads, a-sequio.ads, a-storio.ads, a-stream.ads, a-ststio.adb, a-ststio.adb, a-ststio.ads, a-ststio.ads, a-stwima.adb, a-stwima.adb, a-stwima.ads, a-stwise.adb, a-teioed.adb, a-teioed.ads, a-ticoau.adb, a-ticoau.ads, a-ticoio.adb, a-tasatt.ads, a-tideau.adb, a-tideau.ads, a-tideio.adb, a-tideio.ads, a-tienau.adb, a-tienau.ads, a-tienio.adb, a-tienio.ads, a-tifiio.ads, a-tiflau.adb, a-tiflau.ads, a-tiflio.adb, a-tiflio.adb, a-tiflio.ads, a-tigeau.ads, a-tiinau.adb, a-tiinau.ads, a-tiinio.adb, a-tiinio.ads, a-timoio.adb, a-timoio.ads, a-titest.adb, a-titest.ads, a-wtcoio.adb, a-wtdeau.adb, a-wtdeau.ads, a-wtdeio.adb, a-wtdeio.ads, a-wtedit.adb, a-wtedit.adb, a-wtedit.ads, a-wtenau.adb, a-wtenau.ads, a-wtenau.ads, a-wtenio.adb, a-wtenio.ads, a-wtfiio.adb, a-wtfiio.ads, a-wtflau.adb, a-wtflau.ads, a-wtflio.adb, a-wtflio.adb, a-wtflio.ads, a-wtgeau.ads, a-wtinau.adb, a-wtinau.ads, a-wtinio.adb, a-wtinio.ads, a-wtmoau.adb, a-wtmoau.ads, a-wtmoio.adb, a-wtmoio.ads, xref_lib.adb, xref_lib.ads, xr_tabls.adb, g-boubuf.adb, g-boubuf.ads, g-cgideb.adb, g-io.adb, gnatdll.adb, g-pehage.adb, i-c.ads, g-spitbo.adb, g-spitbo.ads, mdll.adb, mlib-fil.adb, mlib-utl.adb, mlib-utl.ads, prj-env.adb, prj-tree.adb, prj-tree.ads, prj-util.adb, s-arit64.adb, s-asthan.ads, s-auxdec.adb, s-auxdec.ads, s-chepoo.ads, s-direio.adb, s-direio.ads, s-errrep.adb, s-errrep.ads, s-fileio.adb, s-fileio.ads, s-finroo.adb, s-finroo.ads, s-gloloc.adb, s-gloloc.ads, s-io.adb, s-io.ads, s-rpc.adb, s-rpc.ads, s-shasto.ads, s-sequio.adb, s-stopoo.ads, s-stratt.adb, s-stratt.ads, s-taasde.adb, s-taasde.ads, s-tadert.adb, s-sequio.ads, s-taskin.adb, s-tasque.adb, s-tasque.ads, s-wchjis.ads, makegpr.adb, a-coinve.adb, a-cidlli.adb, eval_fat.adb, exp_dist.ads, exp_smem.adb, fmap.adb, g-dyntab.ads, g-expect.adb, lib-xref.ads, osint.adb, par-load.adb, restrict.adb, sinput-c.ads, a-cdlili.adb, system-vms.ads, system-vms-zcx.ads, system-vms_64.ads: Minor reformatting. From-SVN: r111023
415 lines
12 KiB
Ada
415 lines
12 KiB
Ada
------------------------------------------------------------------------------
|
|
-- --
|
|
-- GNAT RUN-TIME COMPONENTS --
|
|
-- --
|
|
-- A D A . S T R I N G S . W I D E _ S E A R C H --
|
|
-- --
|
|
-- B o d y --
|
|
-- --
|
|
-- Copyright (C) 1992-2006, 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- --
|
|
-- 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, 51 Franklin Street, Fifth Floor, --
|
|
-- Boston, MA 02110-1301, USA. --
|
|
-- --
|
|
-- 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. --
|
|
-- --
|
|
-- GNAT was originally developed by the GNAT team at New York University. --
|
|
-- Extensive contributions were provided by Ada Core Technologies Inc. --
|
|
-- --
|
|
------------------------------------------------------------------------------
|
|
|
|
with Ada.Strings.Wide_Maps; use Ada.Strings.Wide_Maps;
|
|
|
|
package body Ada.Strings.Wide_Search is
|
|
|
|
-----------------------
|
|
-- Local Subprograms --
|
|
-----------------------
|
|
|
|
function Belongs
|
|
(Element : Wide_Character;
|
|
Set : Wide_Maps.Wide_Character_Set;
|
|
Test : Membership) return Boolean;
|
|
pragma Inline (Belongs);
|
|
-- Determines if the given element is in (Test = Inside) or not in
|
|
-- (Test = Outside) the given character set.
|
|
|
|
-------------
|
|
-- Belongs --
|
|
-------------
|
|
|
|
function Belongs
|
|
(Element : Wide_Character;
|
|
Set : Wide_Maps.Wide_Character_Set;
|
|
Test : Membership) return Boolean
|
|
is
|
|
begin
|
|
if Test = Inside then
|
|
return Is_In (Element, Set);
|
|
else
|
|
return not Is_In (Element, Set);
|
|
end if;
|
|
end Belongs;
|
|
|
|
-----------
|
|
-- Count --
|
|
-----------
|
|
|
|
function Count
|
|
(Source : Wide_String;
|
|
Pattern : Wide_String;
|
|
Mapping : Wide_Maps.Wide_Character_Mapping := Wide_Maps.Identity)
|
|
return Natural
|
|
is
|
|
N : Natural;
|
|
J : Natural;
|
|
|
|
begin
|
|
if Pattern = "" then
|
|
raise Pattern_Error;
|
|
end if;
|
|
|
|
-- Handle the case of non-identity mappings by creating a mapped
|
|
-- string and making a recursive call using the identity mapping
|
|
-- on this mapped string.
|
|
|
|
if Mapping /= Wide_Maps.Identity then
|
|
declare
|
|
Mapped_Source : Wide_String (Source'Range);
|
|
|
|
begin
|
|
for J in Source'Range loop
|
|
Mapped_Source (J) := Value (Mapping, Source (J));
|
|
end loop;
|
|
|
|
return Count (Mapped_Source, Pattern);
|
|
end;
|
|
end if;
|
|
|
|
N := 0;
|
|
J := Source'First;
|
|
|
|
while J <= Source'Last - (Pattern'Length - 1) loop
|
|
if Source (J .. J + (Pattern'Length - 1)) = Pattern then
|
|
N := N + 1;
|
|
J := J + Pattern'Length;
|
|
else
|
|
J := J + 1;
|
|
end if;
|
|
end loop;
|
|
|
|
return N;
|
|
end Count;
|
|
|
|
function Count
|
|
(Source : Wide_String;
|
|
Pattern : Wide_String;
|
|
Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Natural
|
|
is
|
|
Mapped_Source : Wide_String (Source'Range);
|
|
|
|
begin
|
|
for J in Source'Range loop
|
|
Mapped_Source (J) := Mapping (Source (J));
|
|
end loop;
|
|
|
|
return Count (Mapped_Source, Pattern);
|
|
end Count;
|
|
|
|
function Count
|
|
(Source : Wide_String;
|
|
Set : Wide_Maps.Wide_Character_Set) return Natural
|
|
is
|
|
N : Natural := 0;
|
|
|
|
begin
|
|
for J in Source'Range loop
|
|
if Is_In (Source (J), Set) then
|
|
N := N + 1;
|
|
end if;
|
|
end loop;
|
|
|
|
return N;
|
|
end Count;
|
|
|
|
----------------
|
|
-- Find_Token --
|
|
----------------
|
|
|
|
procedure Find_Token
|
|
(Source : Wide_String;
|
|
Set : Wide_Maps.Wide_Character_Set;
|
|
Test : Membership;
|
|
First : out Positive;
|
|
Last : out Natural)
|
|
is
|
|
begin
|
|
for J in Source'Range loop
|
|
if Belongs (Source (J), Set, Test) then
|
|
First := J;
|
|
|
|
for K in J + 1 .. Source'Last loop
|
|
if not Belongs (Source (K), Set, Test) then
|
|
Last := K - 1;
|
|
return;
|
|
end if;
|
|
end loop;
|
|
|
|
-- Here if J indexes 1st char of token, and all chars
|
|
-- after J are in the token
|
|
|
|
Last := Source'Last;
|
|
return;
|
|
end if;
|
|
end loop;
|
|
|
|
-- Here if no token found
|
|
|
|
First := Source'First;
|
|
Last := 0;
|
|
end Find_Token;
|
|
|
|
-----------
|
|
-- Index --
|
|
-----------
|
|
|
|
function Index
|
|
(Source : Wide_String;
|
|
Pattern : Wide_String;
|
|
Going : Direction := Forward;
|
|
Mapping : Wide_Maps.Wide_Character_Mapping := Wide_Maps.Identity)
|
|
return Natural
|
|
is
|
|
begin
|
|
if Pattern = "" then
|
|
raise Pattern_Error;
|
|
end if;
|
|
|
|
-- Handle the case of non-identity mappings by creating a mapped
|
|
-- string and making a recursive call using the identity mapping
|
|
-- on this mapped string.
|
|
|
|
if Mapping /= Identity then
|
|
declare
|
|
Mapped_Source : Wide_String (Source'Range);
|
|
|
|
begin
|
|
for J in Source'Range loop
|
|
Mapped_Source (J) := Value (Mapping, Source (J));
|
|
end loop;
|
|
|
|
return Index (Mapped_Source, Pattern, Going);
|
|
end;
|
|
end if;
|
|
|
|
if Going = Forward then
|
|
for J in Source'First .. Source'Last - Pattern'Length + 1 loop
|
|
if Pattern = Source (J .. J + Pattern'Length - 1) then
|
|
return J;
|
|
end if;
|
|
end loop;
|
|
|
|
else -- Going = Backward
|
|
for J in reverse Source'First .. Source'Last - Pattern'Length + 1 loop
|
|
if Pattern = Source (J .. J + Pattern'Length - 1) then
|
|
return J;
|
|
end if;
|
|
end loop;
|
|
end if;
|
|
|
|
-- Fall through if no match found. Note that the loops are skipped
|
|
-- completely in the case of the pattern being longer than the source.
|
|
|
|
return 0;
|
|
end Index;
|
|
|
|
function Index
|
|
(Source : Wide_String;
|
|
Pattern : Wide_String;
|
|
Going : Direction := Forward;
|
|
Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Natural
|
|
is
|
|
Mapped_Source : Wide_String (Source'Range);
|
|
|
|
begin
|
|
for J in Source'Range loop
|
|
Mapped_Source (J) := Mapping (Source (J));
|
|
end loop;
|
|
|
|
return Index (Mapped_Source, Pattern, Going);
|
|
end Index;
|
|
|
|
function Index
|
|
(Source : Wide_String;
|
|
Set : Wide_Maps.Wide_Character_Set;
|
|
Test : Membership := Inside;
|
|
Going : Direction := Forward) return Natural
|
|
is
|
|
begin
|
|
if Going = Forward then
|
|
for J in Source'Range loop
|
|
if Belongs (Source (J), Set, Test) then
|
|
return J;
|
|
end if;
|
|
end loop;
|
|
|
|
else -- Going = Backward
|
|
for J in reverse Source'Range loop
|
|
if Belongs (Source (J), Set, Test) then
|
|
return J;
|
|
end if;
|
|
end loop;
|
|
end if;
|
|
|
|
-- Fall through if no match
|
|
|
|
return 0;
|
|
end Index;
|
|
|
|
function Index
|
|
(Source : Wide_String;
|
|
Pattern : Wide_String;
|
|
From : Positive;
|
|
Going : Direction := Forward;
|
|
Mapping : Wide_Maps.Wide_Character_Mapping := Wide_Maps.Identity)
|
|
return Natural
|
|
is
|
|
begin
|
|
if Going = Forward then
|
|
if From < Source'First then
|
|
raise Index_Error;
|
|
end if;
|
|
|
|
return
|
|
Index (Source (From .. Source'Last), Pattern, Forward, Mapping);
|
|
|
|
else
|
|
if From > Source'Last then
|
|
raise Index_Error;
|
|
end if;
|
|
|
|
return
|
|
Index (Source (Source'First .. From), Pattern, Backward, Mapping);
|
|
end if;
|
|
end Index;
|
|
|
|
function Index
|
|
(Source : Wide_String;
|
|
Pattern : Wide_String;
|
|
From : Positive;
|
|
Going : Direction := Forward;
|
|
Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Natural
|
|
is
|
|
begin
|
|
if Going = Forward then
|
|
if From < Source'First then
|
|
raise Index_Error;
|
|
end if;
|
|
|
|
return Index
|
|
(Source (From .. Source'Last), Pattern, Forward, Mapping);
|
|
|
|
else
|
|
if From > Source'Last then
|
|
raise Index_Error;
|
|
end if;
|
|
|
|
return Index
|
|
(Source (Source'First .. From), Pattern, Backward, Mapping);
|
|
end if;
|
|
end Index;
|
|
|
|
function Index
|
|
(Source : Wide_String;
|
|
Set : Wide_Maps.Wide_Character_Set;
|
|
From : Positive;
|
|
Test : Membership := Inside;
|
|
Going : Direction := Forward) return Natural
|
|
is
|
|
begin
|
|
if Going = Forward then
|
|
if From < Source'First then
|
|
raise Index_Error;
|
|
end if;
|
|
|
|
return
|
|
Index (Source (From .. Source'Last), Set, Test, Forward);
|
|
|
|
else
|
|
if From > Source'Last then
|
|
raise Index_Error;
|
|
end if;
|
|
|
|
return
|
|
Index (Source (Source'First .. From), Set, Test, Backward);
|
|
end if;
|
|
end Index;
|
|
|
|
---------------------
|
|
-- Index_Non_Blank --
|
|
---------------------
|
|
|
|
function Index_Non_Blank
|
|
(Source : Wide_String;
|
|
Going : Direction := Forward) return Natural
|
|
is
|
|
begin
|
|
if Going = Forward then
|
|
for J in Source'Range loop
|
|
if Source (J) /= Wide_Space then
|
|
return J;
|
|
end if;
|
|
end loop;
|
|
|
|
else -- Going = Backward
|
|
for J in reverse Source'Range loop
|
|
if Source (J) /= Wide_Space then
|
|
return J;
|
|
end if;
|
|
end loop;
|
|
end if;
|
|
|
|
-- Fall through if no match
|
|
|
|
return 0;
|
|
end Index_Non_Blank;
|
|
|
|
function Index_Non_Blank
|
|
(Source : Wide_String;
|
|
From : Positive;
|
|
Going : Direction := Forward) return Natural
|
|
is
|
|
begin
|
|
if Going = Forward then
|
|
if From < Source'First then
|
|
raise Index_Error;
|
|
end if;
|
|
|
|
return
|
|
Index_Non_Blank (Source (From .. Source'Last), Forward);
|
|
|
|
else
|
|
if From > Source'Last then
|
|
raise Index_Error;
|
|
end if;
|
|
|
|
return
|
|
Index_Non_Blank (Source (Source'First .. From), Backward);
|
|
end if;
|
|
end Index_Non_Blank;
|
|
|
|
end Ada.Strings.Wide_Search;
|