diff options
author | 2011-06-20 23:42:45 +0900 | |
---|---|---|
committer | 2011-06-21 17:02:38 +0900 | |
commit | acd1a1c7a82e8d5ad2cd62bd84dc9e99b24aa17a (patch) | |
tree | e5439397dd16a4071f4fedcb8dc50012bc87f0b1 /java/src/com/android/inputmethod/latin/spellcheck/SpellChecker.java | |
parent | 416534d03293f9a79145a2f2561f79f0ee0705f8 (diff) | |
download | latinime-acd1a1c7a82e8d5ad2cd62bd84dc9e99b24aa17a.tar.gz latinime-acd1a1c7a82e8d5ad2cd62bd84dc9e99b24aa17a.tar.xz latinime-acd1a1c7a82e8d5ad2cd62bd84dc9e99b24aa17a.zip |
Add ArraysCompatUtils.binarySearch
Until API version 9, java.util.Arrays.binarySearch(int[], int, int,
int) doesn't exist.
Change-Id: Ife0ed4fbac642eda069e7b6f6b8dd30e0cd5fdee
Diffstat (limited to 'java/src/com/android/inputmethod/latin/spellcheck/SpellChecker.java')
-rw-r--r-- | java/src/com/android/inputmethod/latin/spellcheck/SpellChecker.java | 5 |
1 files changed, 3 insertions, 2 deletions
diff --git a/java/src/com/android/inputmethod/latin/spellcheck/SpellChecker.java b/java/src/com/android/inputmethod/latin/spellcheck/SpellChecker.java index e3407a269..63c6d69d7 100644 --- a/java/src/com/android/inputmethod/latin/spellcheck/SpellChecker.java +++ b/java/src/com/android/inputmethod/latin/spellcheck/SpellChecker.java @@ -19,6 +19,7 @@ package com.android.inputmethod.latin.spellcheck; import android.content.Context; import android.content.res.Resources; +import com.android.inputmethod.compat.ArraysCompatUtils; import com.android.inputmethod.latin.Dictionary; import com.android.inputmethod.latin.Dictionary.DataType; import com.android.inputmethod.latin.Dictionary.WordCallback; @@ -26,7 +27,6 @@ import com.android.inputmethod.latin.DictionaryFactory; import com.android.inputmethod.latin.Utils; import com.android.inputmethod.latin.WordComposer; -import java.util.Arrays; import java.util.LinkedList; import java.util.List; import java.util.Locale; @@ -64,13 +64,14 @@ public class SpellChecker { private int[] mScores = new int[DEFAULT_SUGGESTION_LENGTH]; private int mLength = 0; + @Override synchronized public boolean addWord(char[] word, int wordOffset, int wordLength, int score, int dicTypeId, DataType dataType) { if (mLength >= mScores.length) { final int newLength = mScores.length * 2; mScores = new int[newLength]; } - final int positionIndex = Arrays.binarySearch(mScores, 0, mLength, score); + final int positionIndex = ArraysCompatUtils.binarySearch(mScores, 0, mLength, score); // binarySearch returns the index if the element exists, and -<insertion index> - 1 // if it doesn't. See documentation for binarySearch. final int insertionIndex = positionIndex >= 0 ? positionIndex : -positionIndex - 1; |