diff options
| author |   Satoshi Kataoka <satok@google.com> | 2013-07-25 21:05:21 -0700 |
|---|---|---|
| committer |   Android Git Automerger <android-git-automerger@android.com> | 2013-07-25 21:05:21 -0700 |
| commit | d6ee1ded528aac34ede44eae7441b2de74092b97 (patch) | |
| tree | 4a57c7ea9778eb496d862ea3adf219a276e0349d /java/src/com/android/inputmethod/latin/makedict/BinaryDictIOUtils.java | |
| parent | 6360cef8dbb3d8a21d4232f157f3f696357bf2a3 (diff) | |
| parent | ffcbbaf12788a9fc9398607a548e552d7d2bf05e (diff) | |
| download | latinime-d6ee1ded528aac34ede44eae7441b2de74092b97.tar.gz latinime-d6ee1ded528aac34ede44eae7441b2de74092b97.tar.xz latinime-d6ee1ded528aac34ede44eae7441b2de74092b97.zip | |
am ffcbbaf1: Refactor on UserHistoryDictionary
* commit 'ffcbbaf12788a9fc9398607a548e552d7d2bf05e':
Refactor on UserHistoryDictionary
Diffstat (limited to 'java/src/com/android/inputmethod/latin/makedict/BinaryDictIOUtils.java')
| -rw-r--r-- | java/src/com/android/inputmethod/latin/makedict/BinaryDictIOUtils.java | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/java/src/com/android/inputmethod/latin/makedict/BinaryDictIOUtils.java b/java/src/com/android/inputmethod/latin/makedict/BinaryDictIOUtils.java index c87a9254d..000c25270 100644 --- a/java/src/com/android/inputmethod/latin/makedict/BinaryDictIOUtils.java +++ b/java/src/com/android/inputmethod/latin/makedict/BinaryDictIOUtils.java @@ -181,7 +181,7 @@ public final class BinaryDictIOUtils { final FileHeader header = BinaryDictInputOutput.readHeader(buffer); int wordPos = 0; final int wordLen = word.codePointCount(0, word.length()); - for (int depth = 0; depth < Constants.Dictionary.MAX_WORD_LENGTH; ++depth) { + for (int depth = 0; depth < Constants.DICTIONARY_MAX_WORD_LENGTH; ++depth) { if (wordPos >= wordLen) return FormatSpec.NOT_VALID_WORD; do { @@ -746,7 +746,7 @@ public final class BinaryDictIOUtils { final int[] codePoints = FusionDictionary.getCodePoints(word); final int wordLen = codePoints.length; - for (int depth = 0; depth < Constants.Dictionary.MAX_WORD_LENGTH; ++depth) { + for (int depth = 0; depth < Constants.DICTIONARY_MAX_WORD_LENGTH; ++depth) { if (wordPos >= wordLen) break; nodeOriginAddress = buffer.position(); int nodeParentAddress = -1; |