123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526 |
- {
- *********************************************************************
- $Id$
- Copyright (C) 1997, 1998 Gertjan Schouten
- This program is free software; you can redistribute it and/or modify
- it under the terms of the GNU General Public License as published by
- the Free Software Foundation; either version 2 of the License, or
- (at your option) any later version.
- This program 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 General Public License for more details.
- You should have received a copy of the GNU General Public License
- along with this program; if not, write to the Free Software
- Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
- *********************************************************************
- System Utilities For Free Pascal
- }
- { NewStr creates a new PString and assigns S to it
- if length(s) = 0 NewStr returns Nil }
- function NewStr(const S: string): PString;
- begin
- result := Nil;
- {
- if Length(S) <> 0 then begin
- result := New(PString);
- result^ := S;
- end ;
- }
- end ;
- { DisposeStr frees the memory occupied by S }
- procedure DisposeStr(S: PString);
- begin
- {
- if S <> Nil then begin
- Dispose(S);
- S := Nil;
- end ;
- }
- end ;
- { AssignStr assigns S to P^ }
- procedure AssignStr(var P: PString; const S: string);
- begin
- P^ := s;
- end ;
- { AppendStr appends S to Dest }
- procedure AppendStr(var Dest: PString; const S: string);
- begin
- Dest^ := Dest^ + S;
- end ;
- { UpperCase returns a copy of S where all lowercase characters ( from a to z )
- have been converted to uppercase }
- function UpperCase(const S: string): string;
- var i: integer;
- begin
- result := S;
- i := Length(S);
- while i <> 0 do begin
- if (result[i] in ['a'..'z']) then result[i] := char(byte(result[i]) - 32);
- Dec(i);
- end;
- end;
- { LowerCase returns a copy of S where all uppercase characters ( from A to Z )
- have been converted to lowercase }
- function LowerCase(const S: string): string;
- var i: integer;
- begin
- result := S;
- i := Length(result);
- while i <> 0 do begin
- if (result[i] in ['A'..'Z']) then result[i] := char(byte(result[i]) + 32);
- dec(i);
- end;
- end;
- { CompareStr compares S1 and S2, the result is the based on
- substraction of the ascii values of the characters in S1 and S2
- case result
- S1 < S2 < 0
- S1 > S2 > 0
- S1 = S2 = 0 }
- function CompareStr(const S1, S2: string): Integer;
- var i, count, count1, count2: integer;
- begin
- result := 0;
- Count1 := Length(S1);
- Count2 := Length(S2);
- if Count1 > Count2 then Count := Count2
- else Count := Count1;
- result := CompareMem(@S1[1], @S2[1], Count);
- if (result = 0) and (Count1 <> Count2) then begin
- if Count1 > Count2 then result := ord(s1[Count1 + 1])
- else result := -ord(s2[Count2 + 1]);
- end ;
- end ;
- { CompareMem returns the result of comparison of Length bytes at P1 and P2
- case result
- P1 < P2 < 0
- P1 > P2 > 0
- P1 = P2 = 0 }
- function CompareMem(P1, P2: Pointer; Length: cardinal): integer;
- var i: integer;
- begin
- i := 0;
- result := 0;
- while (result = 0) and (i < length) do begin
- result := byte(P1^) - byte(P2^);
- P1 := P1 + 1;
- P2 := P2 + 1;
- i := i + 1;
- end ;
- end ;
- { CompareText compares S1 and S2, the result is the based on
- substraction of the ascii values of characters in S1 and S2
- comparison is case-insensitive
- case result
- S1 < S2 < 0
- S1 > S2 > 0
- S1 = S2 = 0 }
- function CompareText(const S1, S2: string): integer;
- var i, count, count1, count2: integer; Chr1, Chr2: byte;
- begin
- result := 0;
- Count1 := Length(S1);
- Count2 := Length(S2);
- if Count1 > Count2 then Count := Count2
- else Count := Count1;
- i := 0;
- while (result = 0) and (i < count) do begin
- i := i + 1;
- Chr1 := byte(s1[i]);
- Chr2 := byte(s2[i]);
- if Chr1 in [97..122] then Chr1 := Chr1 - 32;
- if Chr2 in [97..122] then Chr2 := Chr2 - 32;
- result := Chr1 - Chr2;
- end ;
- if (result = 0) and (Count1 <> Count2) then begin
- if Count1 > Count2 then result := byte(UpCase(s1[Count1 + 1]))
- else result := -byte(UpCase(s2[Count2 + 1]));
- end ;
- end ;
- {==============================================================================}
- { Ansi string functions }
- { these functions rely on the character set loaded by the OS }
- {==============================================================================}
- type
- TCaseTranslationTable = array[0..255] of char;
- var
- UpperCaseTable: TCaseTranslationTable;
- LowerCaseTable: TCaseTranslationTable;
- function AnsiUpperCase(const s: string): string;
- begin
- end ;
- function AnsiLowerCase(const s: string): string;
- begin
- end ;
- function AnsiCompareStr(const S1, S2: string): integer;
- begin
- end ;
- function AnsiCompareText(const S1, S2: string): integer;
- begin
- end ;
- function AnsiStrComp(S1, S2: PChar): integer;
- begin
- end ;
- function AnsiStrIComp(S1, S2: PChar): integer;
- begin
- end ;
- function AnsiStrLComp(S1, S2: PChar; MaxLen: cardinal): integer;
- begin
- end ;
- function AnsiStrLIComp(S1, S2: PChar; MaxLen: cardinal): integer;
- begin
- end ;
- function AnsiStrLower(Str: PChar): PChar;
- begin
- end ;
- function AnsiStrUpper(Str: PChar): PChar;
- begin
- end ;
- function AnsiLastChar(const S: string): PChar;
- begin
- end ;
- function AnsiStrLastChar(Str: PChar): PChar;
- begin
- end ;
- {==============================================================================}
- { End of Ansi functions }
- {==============================================================================}
- { Trim returns a copy of S with blanks characters on the left and right stripped off }
- function Trim(const S: string): string;
- var Ofs, Len: integer;
- begin
- len := Length(S);
- while (S[Len] = ' ') and (Len > 0) do
- dec(Len);
- Ofs := 1;
- while (S[Ofs] = ' ') and (Ofs <= Len) do
- Inc(Ofs);
- result := Copy(S, Ofs, 1 + Len - Ofs);
- end ;
- { TrimLeft returns a copy of S with all blank characters on the left stripped off }
- function TrimLeft(const S: string): string;
- var i,l:integer;
- begin
- l := length(s);
- i := 1;
- while (s[i] = ' ') and (i <= l) do inc(i);
- Result := copy(s, i, l);
- end ;
- { TrimRight returns a copy of S with all blank characters on the right stripped off }
- function TrimRight(const S: string): string;
- var l:integer;
- begin
- l := length(s);
- while (s[l] = ' ') and (l > 0) do dec(l);
- result := copy(s,1,l);
- end ;
- { QuotedStr returns S quoted left and right and every single quote in S
- replaced by two quotes }
- function QuotedStr(const S: string): string;
- begin
- result := AnsiQuotedStr(s, '''');
- end ;
- { AnsiQuotedStr returns S quoted left and right by Quote,
- and every single occurance of Quote replaced by two }
- function AnsiQuotedStr(const S: string; Quote: char): string;
- var i, j, count: integer;
- begin
- result := '' + Quote;
- count := length(s);
- i := 0;
- j := 0;
- while i < count do begin
- i := i + 1;
- if S[i] = Quote then begin
- result := result + copy(S, 1 + j, i - j) + Quote;
- j := i;
- end ;
- end ;
- if i <> j then
- result := result + copy(S, 1 + j, i - j);
- result := result + Quote;
- end ;
- { AnsiExtractQuotedStr returns a copy of Src with quote characters
- deleted to the left and right and double occurances
- of Quote replaced by a single Quote }
- function AnsiExtractQuotedStr(var Src: PChar; Quote: Char): string;
- var i: integer; P, Q: PChar;
- begin
- P := Src;
- if Src^ = Quote then P := P + 1;
- Q := StrEnd(P);
- if PChar(Q - 1)^ = Quote then Q := Q - 1;
- SetLength(result, Q - P);
- i := 0;
- while P <> Q do begin
- i := i + 1;
- result[i] := P^;
- if (P^ = Quote) and (PChar(P + 1)^ = Quote) then
- P := P + 1;
- P := P + 1;
- end ;
- SetLength(result, i);
- end ;
- { AdjustLineBreaks returns S with all CR characters not followed by LF
- replaced with CR/LF }
- // under Linux all CR characters or CR/LF combinations should be replaced with LF
- function AdjustLineBreaks(const S: string): string;
- var i, j, count: integer;
- begin
- result := '';
- i := 0;
- j := 0;
- count := Length(S);
- while i < count do begin
- i := i + 1;
- if (S[i] = #13) and ((i = count) or (S[i + 1] <> #10)) then begin
- result := result + Copy(S, 1 + j, i - j) + #10;
- j := i;
- end ;
- end ;
- if j <> i then
- result := result + copy(S, 1 + j, i - j);
- end ;
- { IsValidIdent returns true if the first character of Ident is in:
- 'A' to 'Z', 'a' to 'z' or '_' and the following characters are
- on of: 'A' to 'Z', 'a' to 'z', '0'..'9' or '_' }
- function IsValidIdent(const Ident: string): boolean;
- var i, len: integer;
- begin
- result := false;
- len := length(Ident);
- if len <> 0 then begin
- result := Ident[1] in ['A'..'Z', 'a'..'z', '_'];
- i := 1;
- while (result) and (i < len) do begin
- i := i + 1;
- result := result and (Ident[i] in ['A'..'Z', 'a'..'z', '0'..'9', '_']);
- end ;
- end ;
- end ;
- { IntToStr returns a string representing the value of Value }
- function IntToStr(Value: integer): string;
- begin
- System.Str(Value, result);
- end ;
- { IntToHex returns a string representing the hexadecimal value of Value }
- const
- HexDigits: array[0..15] of char = '0123456789ABCDEF';
- function IntToHex(Value: integer; Digits: integer): string;
- var i: integer;
- begin
- SetLength(result, digits);
- for i := 0 to digits - 1 do begin
- result[digits - i] := HexDigits[value and 15];
- value := value shr 4;
- end ;
- end ;
- { StrToInt converts the string S to an integer value,
- if S does not represent a valid integer value EConvertError is raised }
- function StrToInt(const S: string): integer;
- var Error: word;
- begin
- Val(S, result, Error);
- // if Error <> 0 then raise EConvertError.create(s + ' is not a valid integer');
- end ;
- { StrToIntDef converts the string S to an integer value,
- Default is returned in case S does not represent a valid integer value }
- function StrToIntDef(const S: string; Default: integer): integer;
- var Error: word;
- begin
- Val(S, result, Error);
- if Error <> 0 then result := Default;
- end ;
- { LoadStr returns the string resource Ident. }
- function LoadStr(Ident: integer): string;
- begin
- end ;
- { FmtLoadStr returns the string resource Ident and formats it accordingly }
- {
- function FmtLoadStr(Ident: integer; const Args: array of const): string;
- begin
- end ;
- }
- {==============================================================================}
- { extra functions }
- {==============================================================================}
- { SetLength sets the length of S to NewLength }
- // SetLength should be in the system unit
- // which lacks the ShortString version of SetLength
- function SetLength(var S: string; NewLength: integer): integer;
- begin
- if (NewLength > 255) then
- NewLength := 255;
- S[0] := char(NewLength);
- Result := Ord(S[0]);
- end ;
- { LeftStr returns Count left-most characters from S }
- function LeftStr(const S: string; Count: integer): string;
- begin
- result := Copy(S, 1, Count);
- end ;
- { RightStr returns Count right-most characters from S }
- function RightStr(const S: string; Count: integer): string;
- begin
- result := Copy(S, 1 + Length(S) - Count, Count);
- end ;
- { BCDToInt converts the BCD value Value to an integer }
- function BCDToInt(Value: integer): integer;
- var i, j: integer;
- begin
- result := 0;
- j := 1;
- for i := 0 to SizeOf(Value) shr 1 - 1 do begin
- result := result + j * (Value and 15);
- j := j * 10;
- Value := Value shr 4;
- end ;
- end ;
- {$IFDEF GO32V2}
- { Codepage constants }
- const
- CP_US = 437;
- CP_MultiLingual = 850;
- CP_SlavicLatin2 = 852;
- CP_Turkish = 857;
- CP_Portugal = 860;
- CP_IceLand = 861;
- CP_Canada = 863;
- CP_NorwayDenmark = 865;
- { CountryInfo }
- {$PACKRECORDS 1}
- type
- TCountryInfo = record
- InfoId: byte;
- case integer of
- 1: ( Size: word;
- CountryId: word;
- CodePage: word;
- CountryInfo: array[0..33] of byte );
- 2: ( UpperCaseTable: longint );
- 4: ( FilenameUpperCaseTable: longint );
- 5: ( FilecharacterTable: longint );
- 6: ( CollatingTable: longint );
- 7: ( DBCSLeadByteTable: longint );
- end ;
- {$PACKRECORDS NORMAL}
- procedure GetExtendedCountryInfo(InfoId: integer; CodePage, CountryId: word; var CountryInfo: TCountryInfo);
- var Regs: Registers;
- begin
- Regs.AH := $65;
- Regs.AL := InfoId;
- Regs.BX := CodePage;
- Regs.DX := CountryId;
- Regs.ES := transfer_buffer shr 16;
- Regs.DI := transfer_buffer and 65535;
- Regs.CX := SizeOf(TCountryInfo);
- RealIntr($21, Regs);
- DosMemGet(transfer_buffer shr 16, transfer_buffer and 65535, CountryInfo, Regs.CX );
- end ;
- procedure InitAnsi;
- var CountryInfo: TCountryInfo;
- begin
- GetExtendedCountryInfo(2, $FFFF, $FFFF, CountryInfo);
- DosMemGet(CountryInfo.UpperCaseTable shr 16, 2 + CountryInfo.UpperCaseTable and 65535, UpperCaseTable[128], 128);
- end ;
- {$ENDIF}
- {
- $Log$
- Revision 1.2 1998-09-16 08:28:42 michael
- Update from gertjan Schouten, plus small fix for linux
- Revision 1.1 1998/04/10 15:17:46 michael
- + Initial implementation; Donated by Gertjan Schouten
- His file was split into several files, to keep it a little bit structured.
- 27 April 1998:
- Function: BCDToInt added
- }
|