Geek Gadgets 1

home *** CD-ROM | disk | FTP | other *** search

/ Geek Gadgets 1 / ADE-1.bin / ade-bin / lib / gcc-lib / m68k-amigaos / 2.7.2.1 / adainclude / a-strfix.adb < prev next >

Wrap

Text File | 1995-10-17 | 17.1 KB | 659 lines

------------------------------------------------------------------------------ -- -- -- GNAT RUNTIME COMPONENTS -- -- -- -- A D A . S T R I N G S . F I X E D -- -- -- -- B o d y -- -- -- -- $Revision: 1.10 $ -- -- -- -- Copyright (c) 1992,1993,1994 NYU, All Rights Reserved -- -- -- -- The GNAT library is free software; you can redistribute it and/or modify -- -- it under terms of the GNU Library General Public License as published by -- -- the Free Software Foundation; either version 2, or (at your option) any -- -- later version. The GNAT library is distributed in the hope that it will -- -- be useful, but WITHOUT ANY WARRANTY; without even the implied warranty -- -- of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -- -- Library General Public License for more details. You should have -- -- received a copy of the GNU Library General Public License along with -- -- the GNAT library; see the file COPYING.LIB. If not, write to the Free -- -- Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. -- -- -- ------------------------------------------------------------------------------ -- Note: This code is derived from the ADAR.CSH public domain Ada 83 -- versions of the Appendix C string handling packages. One change is -- to avoid the use of Is_In, so that we are not dependent on inlining. -- Note that the search function implementations are to be found in the -- auxiliary package Ada.Strings.Search. Also the Move procedure is -- directly incorporated (ADAR used a subunit for this procedure) with Ada.Strings.Maps; use Ada.Strings.Maps; with Ada.Strings.Search; package body Ada.Strings.Fixed is ------------------------ -- Search Subprograms -- ------------------------ function Index (Source : in String; Pattern : in String; Going : in Direction := Forward; Mapping : in Maps.Character_Mapping := Maps.Identity) return Natural renames Ada.Strings.Search.Index; function Index (Source : in String; Pattern : in String; Going : in Direction := Forward; Mapping : in Maps.Character_Mapping_Function) return Natural renames Ada.Strings.Search.Index; function Index (Source : in String; Set : in Maps.Character_Set; Test : in Membership := Inside; Going : in Direction := Forward) return Natural renames Ada.Strings.Search.Index; function Index_Non_Blank (Source : in String; Going : in Direction := Forward) return Natural renames Ada.Strings.Search.Index_Non_Blank; function Count (Source : in String; Pattern : in String; Mapping : in Maps.Character_Mapping := Maps.Identity) return Natural renames Ada.Strings.Search.Count; function Count (Source : in String; Pattern : in String; Mapping : in Maps.Character_Mapping_Function) return Natural renames Ada.Strings.Search.Count; function Count (Source : in String; Set : in Maps.Character_Set) return Natural renames Ada.Strings.Search.Count; procedure Find_Token (Source : in String; Set : in Maps.Character_Set; Test : in Membership; First : out Positive; Last : out Natural) renames Ada.Strings.Search.Find_Token; --------- -- "*" -- --------- function "*" (Left : in Natural; Right : in Character) return String is Result : String (1 .. Left); begin for J in Result'Range loop Result (J) := Right; end loop; return Result; end "*"; function "*" (Left : in Natural; Right : in String) return String is Result : String (1 .. Left * Right'Length); Ptr : Integer := 1; begin for J in 1 .. Left loop Result (Ptr .. Ptr + Right'Length - 1) := Right; Ptr := Ptr + Right'Length; end loop; return Result; end "*"; ------------ -- Delete -- ------------ function Delete (Source : in String; From : in Positive; Through : in Natural) return String is Result : String (1 .. Source'Length - Integer'Max (Through - From + 1, 0)); begin if From not in Source'Range or else Through > Source'Last then raise Index_Error; end if; Result := Source (Source'First .. From - 1) & Source (Through + 1 .. Source'Last); return Result; end Delete; procedure Delete (Source : in out String; From : in Positive; Through : in Natural; Justify : in Alignment := Left; Pad : in Character := Space) is begin Move (Source => Delete (Source, From, Through), Target => Source, Justify => Justify, Pad => Pad); end Delete; ---------- -- Head -- ---------- function Head (Source : in String; Count : in Natural; Pad : in Character := Space) return String is Result : String (1 .. Count); begin if Count < Source'Length then Result := Source (Source'First .. Source'First + Count - 1); else Result (1 .. Source'Length) := Source; for J in Source'Length + 1 .. Count loop Result (J) := Pad; end loop; end if; return Result; end Head; procedure Head (Source : in out String; Count : in Natural; Justify : in Alignment := Left; Pad : in Character := Space) is begin if Count < Source'Length then Source := Source (Source'First .. Source'First + Count - 1); else for J in Source'Length + 1 .. Count loop Source (J) := Pad; end loop; end if; end Head; ------------ -- Insert -- ------------ function Insert (Source : in String; Before : in Positive; New_Item : in String) return String is Result : String (1 .. Source'Length + New_Item'Length); begin if Before < Source'First or else Before > Source'Last + 1 then raise Index_Error; end if; Result := Source (Source'First .. Before - 1) & New_Item & Source (Before .. Source'Last); return Result; end Insert; procedure Insert (Source : in out String; Before : in Positive; New_Item : in String; Drop : in Truncation := Error) is begin Move (Source => Insert (Source, Before, New_Item), Target => Source, Drop => Drop); end Insert; ---------- -- Move -- ---------- procedure Move (Source : in String; Target : out String; Drop : in Truncation := Error; Justify : in Alignment := Left; Pad : in Character := Space) is Sfirst : constant Integer := Source'First; Slast : constant Integer := Source'Last; Slength : constant Integer := Source'Length; Tfirst : constant Integer := Target'First; Tlast : constant Integer := Target'Last; Tlength : constant Integer := Target'Length; function Is_Padding (Item : String) return Boolean; -- Check if Item is all Pad characters, return True if so, False if not function Is_Padding (Item : String) return Boolean is begin for J in Item'Range loop if Item (J) /= Pad then return False; end if; end loop; return True; end Is_Padding; -- Start of processing for Move begin if Slength = Tlength then Target := Source; elsif Slength > Tlength then case Drop is when Left => Target := Source (Slast - Tlength + 1 .. Slast); when Right => Target := Source (Sfirst .. Sfirst + Tlength - 1); when Error => case Justify is when Left => if Is_Padding (Source (Sfirst + Tlength .. Slast)) then Target := Source (Sfirst .. Sfirst + Target'Length - 1); else raise Length_Error; end if; when Right => if Is_Padding (Source (Sfirst .. Slast - Tlength)) then Target := Source (Slast - Tlength + 1 .. Slast); else raise Length_Error; end if; when Center => raise Length_Error; end case; end case; else -- Source'Length < Target'Length case Justify is when Left => Target (Tfirst .. Tfirst + Slength - 1) := Source; for I in Tfirst + Slength .. Tlast loop Target (I) := Pad; end loop; when Right => for I in Tfirst .. Tlast - Slength loop Target (I) := Pad; end loop; Target (Tlast - Slength + 1 .. Tlast) := Source; when Center => declare Front_Pad : constant Integer := (Tlength - Slength) / 2; Tfirst_Fpad : constant Integer := Tfirst + Front_Pad; begin for I in Tfirst .. Tfirst_Fpad - 1 loop Target (I) := Pad; end loop; Target (Tfirst_Fpad .. Tfirst_Fpad + Slength - 1) := Source; for I in Tfirst_Fpad + Slength .. Tlast loop Target (I) := Pad; end loop; end; end case; end if; end Move; --------------- -- Overwrite -- --------------- function Overwrite (Source : in String; Position : in Positive; New_Item : in String) return String is begin if Position not in Source'First .. Source'Last + 1 then raise Index_Error; end if; declare Result_Length : Natural := Integer'Max (Source'Length, Position - Source'First + New_Item'Length); Result : String (1 .. Result_Length); begin Result := Source (Source'First .. Position - 1) & New_Item & Source (Position + New_Item'Length .. Source'Last); return Result; end; end Overwrite; procedure Overwrite (Source : in out String; Position : in Positive; New_Item : in String; Drop : in Truncation := Right) is begin Move (Source => Overwrite (Source, Position, New_Item), Target => Source, Drop => Drop); end Overwrite; ------------------- -- Replace_Slice -- ------------------- function Replace_Slice (Source : in String; Low : in Positive; High : in Natural; By : in String) return String is Result_Length : Natural; begin if Low > Source'Last + 1 or High < Source'First - 1 then raise Index_Error; end if; Result_Length := Source'Length - Integer'Max (High - Low + 1, 0) + By'Length; declare Result : String (1 .. Result_Length); begin if High >= Low then Result := Source (Source'First .. Low - 1) & By & Source (High + 1 .. Source'Last); else Result := Source (Source'First .. Low - 1) & By & Source (Low .. Source'Last); end if; return Result; end; end Replace_Slice; procedure Replace_Slice (Source : in out String; Low : in Positive; High : in Natural; By : in String; Drop : in Truncation := Error; Justify : in Alignment := Left; Pad : in Character := Space) is begin Move (Replace_Slice (Source, Low, High, By), Source, Drop, Justify, Pad); end Replace_Slice; ---------- -- Tail -- ---------- function Tail (Source : in String; Count : in Natural; Pad : in Character := Space) return String is Result : String (1 .. Count); begin if Count < Source'Length then Result := Source (Source'Last - Count + 1 .. Source'Last); -- Pad on left else for J in 1 .. Count - Source'Length loop Result (J) := Pad; end loop; Result (Count - Source'Length + 1 .. Count) := Source; end if; return Result; end Tail; procedure Tail (Source : in out String; Count : in Natural; Justify : in Alignment := Left; Pad : in Character := Space) is Temp : String (1 .. Source'Length); begin -- raise Program_Error; Temp (1 .. Source'Length) := Source; if Count < Source'Length then Source := Temp (Temp'Last - Count + 1 .. Temp'Last); -- Pad on left else for J in 1 .. Count - Temp'Length loop Source (J) := Pad; end loop; Source (Count - Temp'Length + 1 .. Count) := Temp; end if; end Tail; --------------- -- Translate -- --------------- function Translate (Source : in String; Mapping : in Maps.Character_Mapping) return String is Result : String (1 .. Source'Length); begin for J in Source'Range loop Result (J - (Source'First - 1)) := Value (Mapping, Source (J)); end loop; return Result; end Translate; procedure Translate (Source : in out String; Mapping : in Maps.Character_Mapping) is begin for J in Source'Range loop Source (J) := Value (Mapping, Source (J)); end loop; end Translate; function Translate (Source : in String; Mapping : in Maps.Character_Mapping_Function) return String is Result : String (1 .. Source'Length); begin for J in Source'Range loop Result (J - (Source'First - 1)) := Mapping.all (Source (J)); end loop; return Result; end Translate; procedure Translate (Source : in out String; Mapping : in Maps.Character_Mapping_Function) is begin for J in Source'Range loop Source (J) := Mapping.all (Source (J)); end loop; end Translate; ---------- -- Trim -- ---------- function Trim (Source : in String; Side : in Trim_End) return String is Low, High : Integer; begin Low := Index_Non_Blank (Source, Forward); -- All blanks case if Low = 0 then return ""; -- At least one non-blank else High := Index_Non_Blank (Source, Backward); case Side is when Strings.Left => return Source (Low .. Source'Last); when Strings.Right => return Source (Source'First .. High); when Strings.Both => return Source (Low .. High); end case; end if; end Trim; procedure Trim (Source : in out String; Side : in Trim_End; Justify : in Alignment := Left; Pad : in Character := Space) is begin Move (Trim (Source, Side), Source, Justify => Justify, Pad => Space); end Trim; function Trim (Source : in String; Left : in Maps.Character_Set; Right : in Maps.Character_Set) return String is High, Low : Integer; begin Low := Index (Source, Set => Left, Test => Outside, Going => Forward); -- Case where source comprises only characters in Left if Low = 0 then return ""; end if; High := Index (Source, Set => Right, Test => Outside, Going => Backward); -- Case where source comprises only characters in Right if High = 0 then return ""; end if; declare Result : String (1 .. High - Low + 1); begin Result := Source (Low .. High); return Result; end; end Trim; procedure Trim (Source : in out String; Left : in Maps.Character_Set; Right : in Maps.Character_Set; Justify : in Alignment := Strings.Left; Pad : in Character := Space) is begin Move (Source => Trim (Source, Left, Right), Target => Source, Justify => Justify, Pad => Pad); end Trim; end Ada.Strings.Fixed;