Re: Question on bounded / unbounded strings

["Arie van Wingerden" <xapwing@gmail.com>]

I finished the program.
It appears to be working correctly (only in Windows, because of the path 
separator).

Any comments to improve?

Code follows:
===========

with Ada.Text_Io;
with Ada.Environment_Variables;
with Ada.Strings.Fixed;
with Ada.Strings.Maps.Constants;

procedure Fip is

    package ATIO   renames Ada.Text_IO;
    package AEV    renames Ada.Environment_Variables;
    package ASF    renames Ada.Strings.Fixed;
    package ASMC renames Ada.Strings.Maps.Constants;

    Path   : string := ASF.Translate(AEV.Value("Path"), 
ASMC.Lower_Case_Map);
    Match : string := ASF.Translate(ATIO.Get_Line, ASMC.Lower_Case_Map);

    procedure FindMatch (Match : in string; Path : in string; StartPos : in 
positive; Len : in natural) is
        EndPos : positive;
    begin
        if Len > 0 then  -- Ignore case of an unnecessary semi colon
            EndPos := StartPos + Len - 1;
            if ASF.Index(Source => Path(StartPos .. EndPos), Pattern => 
Match) > 0 then
                ATIO.Put_Line(Path(StartPos .. EndPos));
            end if;
        end if;
    end FindMatch;

    procedure Match_Path (Match : in string; Path : in string) is
        StartPos : positive := 1;
        Len   : natural  := 0;
    begin
        for I in Path'Range loop
            if Path(I) = ';' then
                FindMatch(Match, Path, StartPos, Len);
                StartPos := I + 1;
                Len   := 0;
            else
                Len := Len + 1;
            end if;
        end loop;
    end Match_Path;

begin
    Match_Path(Match, Path);
    ATIO.Flush;
end Fip;