forks
/
dexed
mirror of https://gitlab.com/basile.b/dexed.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

fix #89 - improve algo complexity of computing "text" completions

This commit is contained in:
Basile Burg 2021-09-17 18:36:18 +02:00
parent 3df1a3b720
commit 31080c18f7
1 changed files with 15 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
src/u_synmemo.pas
View File

@ -2884,7 +2884,9 @@ var
i: integer;
o: TObject;
s: string;
w: string;
r: TStringRange = (ptr:nil; pos:0; len: 0);
h: TStringHashSet;
const
c: TSysCharSet = ['A'..'Z', 'a'..'z', '_'];
begin
@ -2910,13 +2912,21 @@ begin
if fTextCompletion then
begin
r := TStringRange.create(lines.Text);
while not r.empty do
h := TStringHashSet.create();
for i := 0 to lines.Count-1 do
begin
s := r.popUntil(c)^.takeWhile(c).yield;
if (s.length > fTextCompletionMinLength) and fCompletion.ItemList.IndexOfName(s).equals(-1) then
fCompletion.ItemList.AddObject(s, TObject(PtrUint(dckText)));
r := TStringRange.create(lines[i]);
while not r.empty do
begin
w := r.popUntil(c)^.takeWhile(c).yield;
if (w.length > fTextCompletionMinLength) and not h.contains(w) then
begin
h.insert(w);
fCompletion.ItemList.AddObject(w, TObject(PtrUint(dckText)));
end;
end;
end;
h.Free;
end;
end;