nyancrimew
/
LatinIME
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Use binarySearch instead of a hand-written linear search 

Yay.

Change-Id: Icf686eb2d675da959f19edc856b521e6288dcea3
main
Jean Chalard 2012-06-26 20:26:05 +09:00
parent 9da0027b38
commit 56beb9e321
1 changed files with 5 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
java/src/com/android/inputmethod/latin/Suggest.java
View File

@ -411,15 +411,11 @@ public class Suggest {
final int score = wordInfo.mScore;
int pos = 0;
// Check the last one's score and bail
if (suggestions.size() >= prefMaxSuggestions
&& suggestions.get(prefMaxSuggestions - 1).mScore >= score) return true;
final int length = wordInfo.mCodePointCount;
while (pos < suggestions.size()) {
if (sSuggestedWordInfoComparator.compare(wordInfo, suggestions.get(pos)) < 0)
break;
pos++;
}
final int index =
Collections.binarySearch(suggestions, wordInfo, sSuggestedWordInfoComparator);
// binarySearch returns the index of an equal word info if found. If not found
// it returns -insertionPoint - 1. We want the insertion point, so:
pos = index >= 0 ? index : -index - 1;
if (pos >= prefMaxSuggestions) {
return true;
}