prehistoric-systems/Flow.Launcher
1
0
Fork 0
mirror of https://github.com/Flow-Launcher/Flow.Launcher.git synced 2026-03-11 08:54:32 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 2

Use Binary Search instead of Linear search to reduce time complexity.

Browse source 
Add Key Property for debugging.
This commit is contained in:
张弘韬 2020-12-26 00:29:35 +08:00
parent 2c9f4149b7
commit 75b99415eb
1 changed files with 62 additions and 16 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

78
Flow.Launcher.Infrastructure/PinyinAlphabet.cs
View file

@ -18,6 +18,13 @@ namespace Flow.Launcher.Infrastructure
private List<int> translatedIndexs = new List<int>();
private int translaedLength = 0;
public string key { get; private set; }
public void setKey(string key)
{
this.key = key;
}
public void AddNewIndex(int originalIndex, int translatedIndex, int length)
{
if (constructed)
@ -29,28 +36,64 @@ namespace Flow.Launcher.Infrastructure
translaedLength += length - 1;
}
public int? MapToOriginalIndex(int translatedIndex)
public int MapToOriginalIndex(int translatedIndex)
{
if (translatedIndex > translatedIndexs.Last())
return translatedIndex - translaedLength - 1;
for (var i = 0; i < originalIndexs.Count; i++)
{
if (translatedIndex >= translatedIndexs[i * 2] && translatedIndex < translatedIndexs[i * 2 + 1])
return originalIndexs[i];
if (translatedIndex < translatedIndexs[i * 2])
{
int indexDiff = 0;
for (int j = 0; j < i; j++)
{
indexDiff += translatedIndexs[i * 2 + 1] - translatedIndexs[i * 2] - 1;
}
return translatedIndex - indexDiff;
int lowerBound = 0;
int upperBound = originalIndexs.Count - 1;
int count = 0;
// Corner case handle
if (translatedIndex < translatedIndexs[0])
return translatedIndex;
if (translatedIndex > translatedIndexs.Last())
{
int indexDef = 0;
for (int k = 0; k < originalIndexs.Count; k++)
{
indexDef += translatedIndexs[k * 2 + 1] - translatedIndexs[k * 2];
}
return translatedIndex - indexDef - 1;
}
return translatedIndex;
// Binary Search with Range
for (int i = originalIndexs.Count / 2;; count++)
{
if (translatedIndex < translatedIndexs[i * 2])
{
// move to lower middle
upperBound = i;
i = (i + lowerBound) / 2;
}
else if (translatedIndex > translatedIndexs[i * 2 + 1] - 1)
{
lowerBound = i;
// move to upper middle
// due to floor of integer division, move one up on corner case
i = (i + upperBound + 1) / 2;
}
else
return originalIndexs[i];
if (upperBound - lowerBound <= 1 &&
translatedIndex > translatedIndexs[lowerBound * 2 + 1] &&
translatedIndex < translatedIndexs[upperBound * 2])
{
int indexDef = 0;
for (int j = 0; j < upperBound; j++)
{
indexDef += translatedIndexs[j * 2 + 1] - translatedIndexs[j * 2];
}
return translatedIndex - indexDef - 1;
}
}
}
public void endConstruct()
@ -117,7 +160,10 @@ namespace Flow.Launcher.Infrastructure
map.endConstruct();
return _pinyinCache[content] = (resultBuilder.ToString(), map);
var key = resultBuilder.ToString();
map.setKey(key);
return _pinyinCache[content] = (key, map);
}
else
{