1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497
|
{ UnicodeSet implementation.
Copyright (c) 2013-2015 by Inoussa OUEDRAOGO
The source code is distributed under the Library GNU
General Public License with the following modification:
- object files and libraries linked into an application may be
distributed without source code.
If you didn't receive a copy of the file COPYING, contact:
Free Software Foundation
675 Mass Ave
Cambridge, MA 02139
USA
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.
}
unit unicodeset;
{$mode delphi}{$H+}
{$scopedenums on}
interface
uses
SysUtils,
grbtree, helper;
type
EUnicodeSetException = class(Exception)
end;
TUnicodeSet = class;
{ TPatternParser }
TPatternParser = class
private
FBufferStr : UnicodeString;
FBuffer : PUnicodeChar;
FBufferLength : Integer;
FSet : TUnicodeSet;
FPosition : Integer;
FSpecialChar: Boolean;
private
procedure Error(const AMsg : string; const AArgs : array of const);overload;inline;
procedure Error(const AMsg : string);overload;inline;
procedure SetBuffer(const APattern : PUnicodeChar; const ALength : Integer);
procedure CheckEOF();inline;overload;
procedure CheckEOF(ALength : Integer);overload;inline;
procedure UnexpectedEOF();inline;
function IsThis(AItem : UnicodeString; const APosition : Integer) : Boolean;overload;
function IsThis(AItem : UnicodeString) : Boolean;overload;inline;
procedure Expect(AItem : UnicodeString; const APosition : Integer);overload;inline;
procedure Expect(AItem : UnicodeString);overload;inline;
procedure SkipSpaces();inline;
function NextChar() : TUnicodeCodePoint;
procedure ParseItem();
procedure DoParse();
property SpecialChar : Boolean read FSpecialChar;
public
procedure Parse(const APattern : PUnicodeChar; const ALength : Integer);overload;
procedure Parse(const APattern : UnicodeString);overload;inline;
property CurrentSet : TUnicodeSet read FSet write FSet;
end;
TUnicodeCodePointArrayComparator = class
public
// Return
// * if A>B then 1
// * if A=B then 0
// * if A<B then -1
class function Compare(const A, B : TUnicodeCodePointArray) : Integer;static;inline;
end;
{ TUnicodeSet }
TUnicodeSet = class
private type
TItem = TUnicodeCodePointArray;
TTree = TRBTree<TItem,TUnicodeCodePointArrayComparator>;
public type
TIterator = TTree.TIterator;
private
FTree : TTree;
FParser : TPatternParser;
private
procedure CreateParser();inline;
function InternalContains(const AString : UnicodeString) : Boolean;overload;
public
constructor Create();
destructor Destroy;override;
procedure Add(AChar : TUnicodeCodePoint);inline;overload;
procedure Add(AString : TUnicodeCodePointArray);inline;overload;
procedure AddRange(const AStart, AEnd : TUnicodeCodePoint);inline;
procedure AddPattern(const APattern : UnicodeString);inline;overload;
procedure AddPattern(const APattern : RawByteString);inline;overload;
function CreateIterator() : TIterator;
function Contains(const AString : array of TUnicodeCodePoint) : Boolean;overload;
function Contains(const AChar : TUnicodeCodePoint) : Boolean;inline;overload;
function Contains(const AChar : UnicodeChar) : Boolean;inline;overload;
function Contains(const AChar : AnsiChar) : Boolean;inline;overload;
function Contains(const AString : UnicodeString) : Boolean;overload;
function Contains(const AString : RawByteString) : Boolean;overload;
end;
resourcestring
SInvalidLength = 'Invalid length value : "%d".';
SInvalidPosition = 'Invalid position : "%d".';
SInvalidRangeLimits = 'Invalid range limits : ["%x" , "%x"].';
SExpectedBut = 'Expects "%s" but got "%s..." .';
SUnexpectedEOF = 'Unexpected end of file.';
implementation
uses
unicodedata;
function ToArray(const AItem : TUnicodeCodePoint) : TUnicodeCodePointArray;inline;
begin
SetLength(Result,1);
Result[Low(Result)] := AItem;
end;
function CompareItem(const Item1, Item2 : TUnicodeCodePointArray): Integer;
var
a, b : ^TUnicodeCodePoint;
i, ha, hb : Integer;
begin
if (Pointer(Item1) = Pointer(Item2)) then
exit(0);
if (Item1 = nil) then
exit(-1);
if (Item2 = nil) then
exit(1);
a := @Item1[0];
b := @Item2[0];
Result := 1;
ha := Length(Item1) - 1;
hb := Length(Item2) - 1;
for i := 0 to ha do begin
if (i > hb) then
exit;
if (a^ < b^) then
exit(-1);
if (a^ > b^) then
exit(1);
Inc(a);
Inc(b);
end;
if (ha = hb) then
exit(0);
exit(-1);
end;
{ TUnicodeCodePointArrayComparator }
class function TUnicodeCodePointArrayComparator.Compare(const A, B : TUnicodeCodePointArray): Integer;
begin
Result := CompareItem(A,B);
end;
{ TPatternParser }
procedure TPatternParser.Error(const AMsg: string; const AArgs: array of const);
begin
raise EUnicodeSetException.CreateFmt(AMsg,AArgs);
end;
procedure TPatternParser.Error(const AMsg: string);
begin
raise EUnicodeSetException.Create(AMsg);
end;
procedure TPatternParser.SetBuffer(
const APattern : PUnicodeChar;
const ALength : Integer
);
begin
FPosition := 0;
if (ALength <= 1) then begin
FBufferStr := '';
FBuffer := nil;
FBufferLength := 0;
exit;
end;
FBufferLength := ALength;
SetLength(FBufferStr,FBufferLength);
FBuffer := @FBufferStr[1];
Move(APattern^,FBuffer^,(FBufferLength*SizeOf(FBuffer^)));
end;
procedure TPatternParser.CheckEOF();
begin
CheckEOF(0);
end;
procedure TPatternParser.CheckEOF(ALength : Integer);
begin
if (ALength < 0) then
Error(SInvalidLength,[ALength]);
if ((FPosition+ALength) >= FBufferLength) then
UnexpectedEOF();
end;
procedure TPatternParser.UnexpectedEOF();
begin
Error(SUnexpectedEOF);
end;
function TPatternParser.IsThis(AItem: UnicodeString; const APosition: Integer): Boolean;
var
i, k, c : Integer;
begin
if (APosition < 0) then
Error(SInvalidPosition,[APosition]);
Result := False;
c := Length(AItem);
if (c = 0) then
exit;
i := APosition;
k := i + c;
if (k >= FBufferLength) then
exit;
if CompareMem(@AItem[1], @FBuffer[APosition],c) then
Result := True;
end;
function TPatternParser.IsThis(AItem : UnicodeString) : Boolean;
begin
Result := IsThis(AItem,FPosition);
end;
procedure TPatternParser.Expect(AItem: UnicodeString; const APosition: Integer);
begin
if not IsThis(AItem,APosition) then
Error(SExpectedBut,[AItem,Copy(FBuffer,APosition,Length(AItem))]);
end;
procedure TPatternParser.Expect(AItem: UnicodeString);
begin
Expect(AItem,FPosition);
end;
procedure TPatternParser.SkipSpaces();
begin
while (FPosition < FBufferLength) do begin
if (FBuffer[FPosition] <> ' ') then
Break;
Inc(FPosition);
end;
end;
function TPatternParser.NextChar(): TUnicodeCodePoint;
var
i : Integer;
c : UnicodeChar;
cp : TUnicodeCodePoint;
s : UnicodeString;
begin
SkipSpaces();
CheckEOF();
c := FBuffer[FPosition];
cp := Ord(c);
Inc(FPosition);
if (c = '\') and (FPosition < FBufferLength) then begin
if IsThis('\') then begin
Inc(FPosition);
CheckEOF();
cp := Ord(FBuffer[FPosition]);
Inc(FPosition);
end else if IsThis('u') then begin
Inc(FPosition);
CheckEOF(4);
s := Copy(FBufferStr,(FPosition+1),4);
Inc(FPosition,4);
if not TryStrToInt(string('$'+s),i) then
Error(SExpectedBut,['\uXXXX',s]);
cp := i;
end;
end;
if (cp <= MAX_WORD) and UnicodeIsLowSurrogate(UnicodeChar(Word(cp))) then begin
SkipSpaces();
CheckEOF();
c := UnicodeChar(Word(cp));
if UnicodeIsSurrogatePair(c,FBuffer[FPosition]) then begin
cp := ToUCS4(c,FBuffer[FPosition]);
Inc(FPosition);
end;
end;
FSpecialChar := (cp = Ord('{')) or (cp = Ord('}'));
Result := cp;
end;
function CompareTo(const A : TUnicodeCodePoint; const B : UnicodeChar) : Boolean;inline;
begin
Result := (A = Ord(B));
end;
procedure TPatternParser.ParseItem();
var
cp, lastCp : TUnicodeCodePoint;
charCount, k : Integer;
cpa : TUnicodeCodePointArray;
begin
SkipSpaces();
Expect('[');
charCount := 0;
Inc(FPosition);
cp:=0;
while (FPosition < FBufferLength) do begin
lastCp := cp;
cp := NextChar();
if CompareTo(cp,']') then
Break;
if SpecialChar and (cp = Ord('{')) then begin
SetLength(cpa,12);
k := 0;
while True do begin
cp := NextChar();
if SpecialChar and (cp = Ord('}')) then
break;
if (k >= Length(cpa)) then
SetLength(cpa,(2*k));
cpa[k] := cp;
k := k+1;
end;
if (k > 0) then begin
SetLength(cpa,k);
FSet.Add(cpa);
end;
end else begin
if CompareTo(cp,'-') then begin
if (charCount = 0) then
Error(SExpectedBut,['<char>','-']);
cp := NextChar();
FSet.AddRange(lastCp,cp);
end else begin
FSet.Add(cp);
end;
end;
Inc(charCount);
end;
end;
procedure TPatternParser.DoParse();
begin
SkipSpaces();
while (FPosition < FBufferLength) do begin
ParseItem();
SkipSpaces();
end;
end;
procedure TPatternParser.Parse(const APattern: PUnicodeChar; const ALength: Integer);
begin
if (ALength < 2) then
exit;
SetBuffer(APattern,ALength);
DoParse();
end;
procedure TPatternParser.Parse(const APattern : UnicodeString);
begin
Parse(@APattern[1],Length(APattern));
end;
{ TUnicodeSet }
procedure TUnicodeSet.CreateParser();
begin
if (FParser = nil) then begin
FParser := TPatternParser.Create();
FParser.CurrentSet := Self;
end;
end;
function TUnicodeSet.InternalContains(const AString: UnicodeString): Boolean;
var
u4 : UCS4String;
c, i : Integer;
cpa : TUnicodeCodePointArray;
begin
u4 := UnicodeStringToUCS4String(AString);
c := Length(u4)-1;
if (c = 1) then
exit(Contains(u4[0]));
SetLength(cpa,c);
for i := 0 to c-1 do
cpa[i] := u4[i];
Result := Contains(cpa);
end;
constructor TUnicodeSet.Create;
begin
FTree := TTree.Create();
end;
destructor TUnicodeSet.Destroy;
begin
FParser.Free();
FTree.Free();
inherited Destroy;
end;
procedure TUnicodeSet.Add(AChar: TUnicodeCodePoint);
begin
FTree.Insert(ToArray(AChar));
end;
procedure TUnicodeSet.Add(AString: TUnicodeCodePointArray);
begin
if (AString <> nil) then
FTree.Insert(AString);
end;
procedure TUnicodeSet.AddRange(const AStart, AEnd : TUnicodeCodePoint);
var
i : Integer;
begin
if (AStart > AEnd) then
raise EUnicodeSetException.CreateFmt(SInvalidRangeLimits,[AStart,AEnd]);
for i := AStart to AEnd do
Add(i);
end;
procedure TUnicodeSet.AddPattern(const APattern : UnicodeString);
begin
CreateParser();
FParser.Parse(APattern);
end;
procedure TUnicodeSet.AddPattern(const APattern: RawByteString);
var
us : UnicodeString;
begin
us := UnicodeString(APattern);
AddPattern(us);
end;
function TUnicodeSet.CreateIterator() : TIterator;
begin
Result := FTree.CreateForwardIterator();
end;
function TUnicodeSet.Contains(const AString : array of TUnicodeCodePoint) : Boolean;
var
c : Integer;
x : TUnicodeCodePointArray;
begin
Result := False;
c := Length(AString);
if (c = 0) then
exit;
SetLength(x,c);
Move(AString[Low(AString)],x[Low(x)],(c*SizeOf(x[0])));
if (FTree.FindNode(x) <> nil) then
Result := True;
end;
function TUnicodeSet.Contains(const AChar : TUnicodeCodePoint) : Boolean;
begin
Result := Contains([AChar]);
end;
function TUnicodeSet.Contains(const AChar : UnicodeChar) : Boolean;
begin
Result := Contains(TUnicodeCodePoint(Ord(AChar)));
end;
function TUnicodeSet.Contains(const AChar : AnsiChar) : Boolean;
begin
Result := Contains(TUnicodeCodePoint(Ord(AChar)));
end;
function TUnicodeSet.Contains(const AString: UnicodeString): Boolean;
begin
if (AString = '') then
exit(Contains([]));
if (Length(AString) = 1) then
exit(Contains(AString[1]));
Result := InternalContains(AString);
end;
function TUnicodeSet.Contains(const AString: RawByteString): Boolean;
var
us : UnicodeString;
begin
us := UnicodeString(AString);
Result := Contains(us);
end;
end.
|