mirror of
https://gitlab.com/freepascal.org/lazarus/lazarus.git
synced 2025-04-30 23:23:39 +02:00
297 lines
9.5 KiB
ObjectPascal
297 lines
9.5 KiB
ObjectPascal
unit TestSearch;
|
|
|
|
{$mode objfpc}{$H+}
|
|
|
|
interface
|
|
|
|
uses
|
|
Classes, SysUtils, testregistry, TestBase,
|
|
SynEdit, SynEditSearch, SynHighlighterPas;
|
|
|
|
type
|
|
|
|
{ TTestSynSearch }
|
|
|
|
TTestSynSearch = class(TTestBase)
|
|
private
|
|
protected
|
|
fTSearch: TSynEditSearch;
|
|
//procedure ReCreateEdit; reintroduce;
|
|
procedure ReCreateEditWithLinesSimple;
|
|
procedure TestFindNext(AName, ASearchTxt: String;
|
|
AStartX, AStartY, AEndX, AEndY: Integer;
|
|
ExpFound: Boolean; ExpStartX, ExpStartY, ExpEndX, ExpEndY: Integer);
|
|
published
|
|
procedure TestSearchSimple;
|
|
procedure TestSearchSimpleUtf8;
|
|
procedure TestSearchSimpleRegEx;
|
|
procedure FindMatchingBracket;
|
|
procedure TestSearchMultiLine; // not regex
|
|
end;
|
|
|
|
implementation
|
|
|
|
{ TTestSynSearch }
|
|
|
|
procedure TTestSynSearch.ReCreateEditWithLinesSimple;
|
|
begin
|
|
ReCreateEdit;
|
|
SetLines
|
|
([ 'Some text to search Text',
|
|
'Text and more Text, texting',
|
|
'text and more text, texting',
|
|
'Text',
|
|
'',
|
|
'utf8: äöü äää äöü ÄÖÜ ÄÄÄ ÄÖÜ äÖü ÄäÄ äääää äöüäöüä ä Ä',
|
|
'',
|
|
'',
|
|
'',
|
|
'Test or Dest or Destination. Test.',
|
|
'test or dest or destination. test.',
|
|
''
|
|
]);
|
|
|
|
end;
|
|
|
|
procedure TTestSynSearch.TestFindNext(AName, ASearchTxt: String; AStartX, AStartY, AEndX,
|
|
AEndY: Integer; ExpFound: Boolean; ExpStartX, ExpStartY, ExpEndX, ExpEndY: Integer);
|
|
var
|
|
ptStart, ptEnd, ptFoundStart, ptFoundEnd: TPoint;
|
|
r: Boolean;
|
|
begin
|
|
AName := Format('%s FindNext: "%s" from (%d,%d) to (%d,%d): ', [AName, ASearchTxt, AStartX, AStartY, AEndX, AEndY]);
|
|
ptStart := Point(AStartX, AStartY);
|
|
ptEnd := Point(AEndX, AEndY);
|
|
fTSearch.Pattern := ASearchTxt;
|
|
r := fTSearch.FindNextOne(SynEdit.ViewedTextBuffer, ptStart, ptEnd, ptFoundStart, ptFoundEnd);
|
|
|
|
AssertEquals(AName + 'Result', ExpFound, r);
|
|
if ExpFound then begin
|
|
AssertEquals(AName + 'StartX', ExpStartX, ptFoundStart.X);
|
|
AssertEquals(AName + 'StartY', ExpStarty, ptFoundStart.Y);
|
|
AssertEquals(AName + 'EndX', ExpEndX, ptFoundEnd.X);
|
|
AssertEquals(AName + 'EndY', ExpEndY, ptFoundEnd.Y);
|
|
end;
|
|
end;
|
|
|
|
procedure TTestSynSearch.TestSearchSimple;
|
|
begin
|
|
ReCreateEditWithLinesSimple;
|
|
|
|
fTSearch := TSynEditSearch.Create;
|
|
fTSearch.Sensitive := False;
|
|
fTSearch.Whole := False;
|
|
fTSearch.Backwards := False;
|
|
fTSearch.RegularExpressions := False;
|
|
fTSearch.RegExprMultiLine := False;
|
|
fTSearch.Replacement := '';
|
|
|
|
TestFindNext('Simple', 'text', 1,1, 1,7, true, 6,1, 10,1);
|
|
TestFindNext('Simple again', 'text', 1,1, 1,7, true, 6,1, 10,1);
|
|
TestFindNext('Simple Start:-1', 'text', 5,1, 1,7, true, 6,1, 10,1);
|
|
TestFindNext('Simple Start: 0', 'text', 6,1, 1,7, true, 6,1, 10,1);
|
|
TestFindNext('Simple Start:+1', 'text', 7,1, 1,7, true, 21,1, 25,1);
|
|
TestFindNext('Simple Start:+1 end', 'text', 7,1, 12,1, false, 0,0, 0,0);
|
|
TestFindNext('Simple End: -1', 'text', 1,1, 9,1, false, 0,0, 0,0);
|
|
TestFindNext('Simple End: 0', 'text', 1,1, 10,1, true, 6,1, 10,1);
|
|
TestFindNext('Simple End: +1', 'text', 1,1, 11,1, true, 6,1, 10,1);
|
|
|
|
TestFindNext('Simple Next', 'text', 10,1, 1,7, true, 21,1, 25,1);
|
|
TestFindNext('Simple Next line', 'text', 22,1, 1,7, true, 1,2, 5,2);
|
|
TestFindNext('Simple at start line', 'text', 1,2, 1,7, true, 1,2, 5,2);
|
|
|
|
fTSearch.Sensitive := True;
|
|
TestFindNext('Simple casesense', 'text', 10,1, 1,7, true, 21,2, 25,2); // skip lower
|
|
TestFindNext('Simple casesense', 'Text', 10,1, 1,7, true, 21,1, 25,1);
|
|
|
|
fTSearch.Sensitive := False;
|
|
TestFindNext('Simple part word', 'text', 17,2, 1,7, true, 21,2, 25,2);
|
|
TestFindNext('Simple part word', 'Text', 17,2, 1,7, true, 21,2, 25,2);
|
|
|
|
fTSearch.Sensitive := True;
|
|
TestFindNext('Simple part word case', 'text', 17,2, 1,7, true, 21,2, 25,2);
|
|
TestFindNext('Simple part word case', 'Text', 17,2, 1,7, true, 1,4, 5,4); // skip lower
|
|
|
|
fTSearch.Sensitive := False;
|
|
fTSearch.Whole := True;
|
|
TestFindNext('Simple whole word', 'text', 17,2, 1,7, true, 1,3, 5,3); // skip part word
|
|
TestFindNext('Simple whole word comma','text', 10,2, 1,7, true, 15,2, 19,2); // find with comma at end
|
|
|
|
|
|
// backward
|
|
fTSearch.Backwards := True;
|
|
fTSearch.Sensitive := False;
|
|
fTSearch.Whole := False;
|
|
TestFindNext('Back', 'text', 1,1, 12,1, true, 6,1, 10,1);
|
|
TestFindNext('Back prev line part', 'text', 1,1, 1,3, true, 21,2, 25,2);
|
|
fTSearch.Sensitive := True;
|
|
TestFindNext('Back case', 'text', 1,1, 12,1, true, 6,1, 10,1);
|
|
TestFindNext('Back case', 'Text', 1,1, 12,1, false, 0,0, 0,0);
|
|
|
|
fTSearch.Sensitive := False;
|
|
fTSearch.Whole := true;
|
|
TestFindNext('Back whole', 'text', 1,1, 1,3, true, 15,2, 19,2);
|
|
|
|
fTSearch.Free;
|
|
end;
|
|
|
|
procedure TTestSynSearch.TestSearchSimpleUtf8;
|
|
begin
|
|
ReCreateEditWithLinesSimple;
|
|
|
|
fTSearch := TSynEditSearch.Create;
|
|
fTSearch.Sensitive := False;
|
|
fTSearch.Whole := False;
|
|
fTSearch.Backwards := False;
|
|
fTSearch.RegularExpressions := False;
|
|
fTSearch.RegExprMultiLine := False;
|
|
fTSearch.Replacement := '';
|
|
|
|
fTSearch.Sensitive := True;
|
|
TestFindNext('Case', 'äöü', 1,1, 1,8, true, 7,6, 13,6);
|
|
TestFindNext('Case', 'ÄÖÜ', 1,1, 1,8, true, 28,6, 34,6); // in BYTES
|
|
TestFindNext('Case', 'äää', 1,1, 1,8, true, 14,6, 20,6);
|
|
TestFindNext('Case', 'ÄÄÄ', 1,1, 1,8, true, 35,6, 41,6);
|
|
|
|
//fTSearch.Sensitive := False;
|
|
//TestFindNext('none Case', 'ÄÖÜ', 1,1, 1,8, true, 7,6, 13,6); // in BYTES
|
|
//TestFindNext('none Case', 'ÄÄÄ', 1,1, 1,8, true, 14,6, 20,6);
|
|
|
|
fTSearch.Free;
|
|
end;
|
|
|
|
procedure TTestSynSearch.TestSearchSimpleRegEx;
|
|
begin
|
|
ReCreateEditWithLinesSimple;
|
|
|
|
fTSearch := TSynEditSearch.Create;
|
|
fTSearch.Sensitive := False;
|
|
fTSearch.Whole := False;
|
|
fTSearch.Backwards := False;
|
|
fTSearch.RegularExpressions := True;
|
|
fTSearch.RegExprMultiLine := False;
|
|
fTSearch.Replacement := 'a${1}B';
|
|
|
|
TestFindNext('RegEx', '(t...),', 1,2, 25,3, true, 15,2, 20,2);
|
|
AssertEquals('RegexRepl', 'aTextB', fTSearch.RegExprReplace);
|
|
|
|
fTSearch.Sensitive := True;
|
|
TestFindNext('RegEx Case', '(t...),', 1,2, 25,3, true, 15,3, 20,3);
|
|
AssertEquals('RegexRepl Case', 'atextB', fTSearch.RegExprReplace);
|
|
|
|
end;
|
|
|
|
procedure TTestSynSearch.FindMatchingBracket;
|
|
var
|
|
p: TPoint;
|
|
y,a : Integer;
|
|
hl: TSynPasSyn;
|
|
begin
|
|
ReCreateEdit;
|
|
SetLines(['program a; begin',
|
|
' if (A or (B> 0)) and (C > length(L)) then ;',
|
|
'a:=''(A or (B> 0)) and (C > length(L)) then '';',
|
|
' a := ('')'');',
|
|
'end.',
|
|
'']);
|
|
|
|
hl := TSynPasSyn.Create(nil);
|
|
|
|
for a := 0 to 1 do begin
|
|
if a = 1 then
|
|
SynEdit.Highlighter := hl;
|
|
|
|
for y := 2 to 3 do begin
|
|
// if |(A or (B> 0)) and (C > length(L)) then ;
|
|
p := SynEdit.FindMatchingBracket(point(5, y), False, False, False, False);
|
|
AssertEquals('', y, p.y);
|
|
AssertEquals('',17, p.x);
|
|
|
|
p := SynEdit.FindMatchingBracket(point(6, y), True, False, False, False);
|
|
AssertEquals('', y, p.y);
|
|
AssertEquals('',17, p.x);
|
|
|
|
p := SynEdit.FindMatchingBracket(point(6, y), False, False, False, False);
|
|
AssertEquals('',-1, p.y);
|
|
AssertEquals('',-1, p.x);
|
|
|
|
// if (A or |(B> 0)) and (C > length(L)) then ;
|
|
p := SynEdit.FindMatchingBracket(point(11, y), False, False, False, False);
|
|
AssertEquals('', y, p.y);
|
|
AssertEquals('',16, p.x);
|
|
|
|
p := SynEdit.FindMatchingBracket(point(12, y), True, False, False, False);
|
|
AssertEquals('', y, p.y);
|
|
AssertEquals('',16, p.x);
|
|
|
|
// if (A or (B> 0|)) and (C > length(L)) then ;
|
|
p := SynEdit.FindMatchingBracket(point(16, y), False, False, False, False);
|
|
AssertEquals('', y, p.y);
|
|
AssertEquals('',11, p.x);
|
|
|
|
p := SynEdit.FindMatchingBracket(point(17, y), True, False, False, False);
|
|
AssertEquals('', y, p.y);
|
|
AssertEquals('', 5, p.x);
|
|
|
|
// if (A or (B> 0))| and (C > length(L)) then ;
|
|
p := SynEdit.FindMatchingBracket(point(18, y), True, False, False, False);
|
|
AssertEquals('', y, p.y);
|
|
AssertEquals('', 5, p.x);
|
|
end;
|
|
|
|
if a = 1 then begin
|
|
// a := |('')'');
|
|
p := SynEdit.FindMatchingBracket(point(8, 4), False, False, False, False);
|
|
AssertEquals('', 4, p.y);
|
|
AssertEquals('',12, p.x);
|
|
end;
|
|
|
|
SynEdit.Highlighter := nil;
|
|
end;
|
|
|
|
hl.Free;
|
|
end;
|
|
|
|
procedure TTestSynSearch.TestSearchMultiLine;
|
|
begin
|
|
ReCreateEdit;
|
|
SetLines(['', // 1
|
|
'a',
|
|
'',
|
|
'b',
|
|
'', // 5
|
|
'a',
|
|
'x',
|
|
'b',
|
|
'',
|
|
'a', // 10
|
|
'x2',
|
|
'b',
|
|
'']);
|
|
|
|
fTSearch := TSynEditSearch.Create;
|
|
fTSearch.Sensitive := False;
|
|
fTSearch.Whole := False;
|
|
fTSearch.Backwards := False;
|
|
fTSearch.RegularExpressions := False;
|
|
fTSearch.RegExprMultiLine := False;
|
|
fTSearch.Replacement := '';
|
|
|
|
TestFindNext('3 lines middle empty', 'a'+LineEnding+LineEnding+'b', 1,1, 1,9, true, 1,2, 2,4);
|
|
TestFindNext('3 lines middle empty - no match', 'a'+LineEnding+LineEnding+'b', 1,5, 1,9, False, 1,2, 2,4);
|
|
|
|
end;
|
|
|
|
//more ftsearch:
|
|
//function FindAll(const NewText: string): integer;
|
|
//function FindFirstUTF8(const NewText: string): Integer;
|
|
//procedure FixResults(First, Delta: integer);
|
|
//function Next: Integer;
|
|
|
|
initialization
|
|
|
|
RegisterTest(TTestSynSearch);
|
|
|
|
end.
|
|
|