paweld/lazarus
1
0
Fork 0
mirror of https://gitlab.com/freepascal.org/lazarus/lazarus.git synced 2025-06-04 23:38:15 +02:00
Code Issues Packages Projects Releases Wiki Activity

tab completion is now case sensitive

Browse Source 
git-svn-id: trunk@5039 -
This commit is contained in:
mattias 2004-01-10 01:31:13 +00:00
parent e6a056de16
commit 2926828c97
2 changed files with 6 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
ide/uniteditor.pp
View File

@ -2340,7 +2340,7 @@ begin
ctWordCompletion:
begin
aWordCompletion.CompletePrefix(OldPrefix,NewPrefix,false);
aWordCompletion.CompletePrefix(OldPrefix,NewPrefix);
end;
end;

16
ide/wordcompletion.pp
View File

@ -47,8 +47,7 @@ type
read GetWordBufferCapacity write SetWordBufferCapacity;
procedure GetWordList(AWordList:TStrings; const Prefix:String;
CaseSensitive:boolean; MaxResults:integer);
procedure CompletePrefix(const Prefix: string; var CompletedPrefix: string;
CaseSensitive:boolean);
procedure CompletePrefix(const Prefix: string; var CompletedPrefix: string);
public
property OnGetSource:TWordCompletionGetSource
read FOnGetSource write FOnGetSource;
@ -198,7 +197,7 @@ begin
end;
procedure TWordCompletion.CompletePrefix(const Prefix: string;
var CompletedPrefix: string; CaseSensitive: boolean);
var CompletedPrefix: string);
var
WordList: TStringList;
s: string;
@ -210,7 +209,7 @@ begin
WordList:=TStringList.Create;
try
// fetch all words with Prefix
GetWordList(WordList,Prefix,CaseSensitive,10000);
GetWordList(WordList,Prefix,true,10000);
if WordList.Count=0 then exit;
// find the biggest prefix of all available words
CompletedPrefix:=WordList[0];
@ -224,13 +223,8 @@ begin
MaxPos:=length(s);
if MaxPos>length(CompletedPrefix) then MaxPos:=length(CompletedPrefix);
while (SamePos<MaxPos) do begin
if CaseSensitive then begin
if s[SamePos+1]<>CompletedPrefix[SamePos+1] then
break;
end else begin
if upcase(s[SamePos+1])<>upcase(CompletedPrefix[SamePos+1]) then
break;
end;
if s[SamePos+1]<>CompletedPrefix[SamePos+1] then
break;
inc(SamePos);
end;
if SamePos<length(Prefix) then continue;