1 ------------------------------------------------------------------------------
3 -- GNAT RUNTIME COMPONENTS --
5 -- A D A . C O M M A N D _ L I N E . R E M O V E --
10 -- Copyright (C) 1999 Free Software Foundation, Inc. --
12 -- GNAT is free software; you can redistribute it and/or modify it under --
13 -- terms of the GNU General Public License as published by the Free Soft- --
14 -- ware Foundation; either version 2, or (at your option) any later ver- --
15 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
16 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
17 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
18 -- for more details. You should have received a copy of the GNU General --
19 -- Public License distributed with GNAT; see file COPYING. If not, write --
20 -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
21 -- MA 02111-1307, USA. --
23 -- As a special exception, if other files instantiate generics from this --
24 -- unit, or you link this unit with other files to produce an executable, --
25 -- this unit does not by itself cause the resulting executable to be --
26 -- covered by the GNU General Public License. This exception does not --
27 -- however invalidate any other reasons why the executable file might be --
28 -- covered by the GNU Public License. --
30 -- GNAT was originally developed by the GNAT team at New York University. --
31 -- Extensive contributions were provided by Ada Core Technologies Inc. --
33 ------------------------------------------------------------------------------
35 package body Ada.Command_Line.Remove is
37 -----------------------
38 -- Local Subprograms --
39 -----------------------
42 -- Initialize the Remove_Count and Remove_Args variables.
48 procedure Initialize is
50 if Remove_Args = null then
51 Remove_Count := Argument_Count;
52 Remove_Args := new Arg_Nums (1 .. Argument_Count);
54 for J in Remove_Args'Range loop
64 procedure Remove_Argument (Number : in Positive) is
68 if Number > Remove_Count then
69 raise Constraint_Error;
72 Remove_Count := Remove_Count - 1;
74 for J in Number .. Remove_Count loop
75 Remove_Args (J) := Remove_Args (J + 1);
79 procedure Remove_Argument (Argument : String) is
81 for J in reverse 1 .. Argument_Count loop
82 if Argument = Ada.Command_Line.Argument (J) then
88 ----------------------
89 -- Remove_Arguments --
90 ----------------------
92 procedure Remove_Arguments (From : Positive; To : Natural) is
96 if From > Remove_Count
97 or else To > Remove_Count
99 raise Constraint_Error;
103 Remove_Count := Remove_Count - (To - From + 1);
105 for J in From .. Remove_Count loop
106 Remove_Args (J) := Remove_Args (J + (To - From + 1));
109 end Remove_Arguments;
111 procedure Remove_Arguments (Argument_Prefix : String) is
113 for J in reverse 1 .. Argument_Count loop
115 Arg : constant String := Argument (J);
118 if Arg'Length >= Argument_Prefix'Length
119 and then Arg (1 .. Argument_Prefix'Length) = Argument_Prefix
125 end Remove_Arguments;
127 end Ada.Command_Line.Remove;