| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/dicnode/internal/ |
| dic_node_state_output.h | 44 if (mOutputtedCodePointCount < MAX_WORD_LENGTH) {
53 MAX_WORD_LENGTH - mOutputtedCodePointCount);
58 if (mOutputtedCodePointCount < MAX_WORD_LENGTH) {
70 int mCodePointsBuf[MAX_WORD_LENGTH];
|
| dic_node_state_prevword.h | 77 if (twoWordsLen >= MAX_WORD_LENGTH) {
78 twoWordsLen = MAX_WORD_LENGTH - 1;
140 int mPrevWord[MAX_WORD_LENGTH];
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/dictionary/ |
| shortcut_utils.h | 31 int shortcutTarget[MAX_WORD_LENGTH];
35 shortcutIt->nextShortcutTarget(MAX_WORD_LENGTH, shortcutTarget,
52 const int startIndex2 = outputWordIndex * MAX_WORD_LENGTH;
|
| bigram_dictionary.cpp | 57 && length < CharUtils::getCodePointCount(MAX_WORD_LENGTH,
58 bigramCodePoints + insertAt * MAX_WORD_LENGTH))) {
74 memmove(bigramCodePoints + (insertAt + 1) * MAX_WORD_LENGTH,
75 bigramCodePoints + insertAt * MAX_WORD_LENGTH,
76 (MAX_RESULTS - insertAt - 1) * sizeof(bigramCodePoints[0]) * MAX_WORD_LENGTH);
77 int *dest = bigramCodePoints + insertAt * MAX_WORD_LENGTH;
114 int bigramBuffer[MAX_WORD_LENGTH];
124 MAX_WORD_LENGTH, bigramBuffer, &unigramProbability);
|
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/ |
| WordComposer.java | 29 private static final int MAX_WORD_LENGTH = Constants.DICTIONARY_MAX_WORD_LENGTH;
41 // The array is limited to MAX_WORD_LENGTH code points, but mTypedWord extends past that
42 // and mCodePointSize can go past that. If mCodePointSize is greater than MAX_WORD_LENGTH,
43 // this just does not contain the associated code points past MAX_WORD_LENGTH.
45 private final InputPointers mInputPointers = new InputPointers(MAX_WORD_LENGTH);
49 // to MAX_WORD_LENGTH code points.
67 // This is the number of code points entered so far. This is not limited to MAX_WORD_LENGTH.
69 // MAX_WORD_LENGTH in which case mPrimaryKeyCodes only contain the first MAX_WORD_LENGTH
80 mPrimaryKeyCodes = new int[MAX_WORD_LENGTH];
[all...] |
| BinaryDictionary.java | 43 // Must be equal to MAX_WORD_LENGTH in native/jni/src/defines.h
44 private static final int MAX_WORD_LENGTH = Constants.DICTIONARY_MAX_WORD_LENGTH;
64 private final int[] mInputCodePoints = new int[MAX_WORD_LENGTH];
65 private final int[] mOutputCodePoints = new int[MAX_WORD_LENGTH * MAX_RESULTS];
187 if (composerSize > MAX_WORD_LENGTH - 1) return null;
206 final int start = j * MAX_WORD_LENGTH;
208 while (len < MAX_WORD_LENGTH && mOutputCodePoints[start + len] != 0) {
|
| ContactsBinaryDictionary.java | 211 if (wordLen < MAX_WORD_LENGTH && wordLen > 1) {
318 if (wordLen < MAX_WORD_LENGTH && wordLen > 1) {
|
| UserBinaryDictionary.java | 248 if (word.length() < MAX_WORD_LENGTH) {
252 if (null != shortcut && shortcut.length() < MAX_WORD_LENGTH) {
|
| ExpandableBinaryDictionary.java | 65 protected static final int MAX_WORD_LENGTH = Constants.DICTIONARY_MAX_WORD_LENGTH;
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/ |
| patricia_trie_policy.cpp | 66 * outCodePoints: an array to write the found word, with MAX_WORD_LENGTH size.
117 PatriciaTrieReadingUtils::skipCharacters(mDictRoot, flags, MAX_WORD_LENGTH, &pos);
300 PatriciaTrieReadingUtils::skipCharacters(mDictRoot, flags, MAX_WORD_LENGTH,
351 PatriciaTrieReadingUtils::skipCharacters(mDictRoot, flags, MAX_WORD_LENGTH, &pos);
366 PatriciaTrieReadingUtils::skipCharacters(mDictRoot, flags, MAX_WORD_LENGTH, &pos);
386 PatriciaTrieReadingUtils::skipCharacters(mDictRoot, flags, MAX_WORD_LENGTH, &pos);
404 int mergedNodeCodePoints[MAX_WORD_LENGTH];
406 mDictRoot, flags, MAX_WORD_LENGTH, mergedNodeCodePoints, &pos);
|
| dynamic_patricia_trie_reading_helper.h | 248 int mMergedNodeCodePoints[MAX_WORD_LENGTH];
257 MAX_WORD_LENGTH, mMergedNodeCodePoints);
|
| dynamic_patricia_trie_node_reader.cpp | 53 dictBuf, mFlags, MAX_WORD_LENGTH, &pos);
|
| dynamic_patricia_trie_reading_helper.cpp | 26 const size_t DynamicPatriciaTrieReadingHelper::MAX_READING_STATE_STACK_SIZE = MAX_WORD_LENGTH;
|
| dynamic_patricia_trie_writing_helper.cpp | 98 int mMergedNodeCodePoints[MAX_WORD_LENGTH];
100 nodeReader.fetchNodeInfoInBufferFromPtNodePosAndGetNodeCodePoints(word0Pos, MAX_WORD_LENGTH,
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/layout/ |
| proximity_info_state.h | 236 int mInputProximities[MAX_PROXIMITY_CHARS_SIZE * MAX_WORD_LENGTH];
238 int mPrimaryInputWord[MAX_WORD_LENGTH];
240 int mMostProbableString[MAX_WORD_LENGTH];
|
| proximity_info_state.cpp | 38 ASSERT(isGeometric || (inputSize < MAX_WORD_LENGTH));
|
| proximity_info_state_utils.cpp | 148 memset(primaryInputWord, 0, sizeof(primaryInputWord[0]) * MAX_WORD_LENGTH);
[all...] |
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/dicnode/ |
| dic_node_utils.cpp | 120 actualLength0 = min(actualLength0, MAX_WORD_LENGTH);
132 actualLength1 = min(actualLength1, MAX_WORD_LENGTH - actualLength0);
|
| dic_node.h | 286 return prevWordsLen + currentWordDepth > MAX_WORD_LENGTH - 3;
|
| /packages/inputmethods/LatinIME/native/jni/src/ |
| defines.h | 31 // Must be equal to Constants.Dictionary.MAX_WORD_LENGTH in Java
32 #define MAX_WORD_LENGTH 48
114 dumpWordInfo(&outWords[i * MAX_WORD_LENGTH], MAX_WORD_LENGTH, i, frequencies[i]);
|
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/makedict/ |
| FormatSpec.java | 217 static final int MAX_WORD_LENGTH = Constants.DICTIONARY_MAX_WORD_LENGTH;
|
| Ver4DictDecoder.java | 189 // TODO: Support words longer than FormatSpec.MAX_WORD_LENGTH.
190 private final int[] mCharacterBuffer = new int[FormatSpec.MAX_WORD_LENGTH];
208 && index < FormatSpec.MAX_WORD_LENGTH) {
|
| Ver3DictDecoder.java | 114 private final int[] mCharacterBuffer = new int[FormatSpec.MAX_WORD_LENGTH];
133 // MAX_WORD_LENGTH.
|
| /external/chromium/net/base/ |
| registry_controlled_domain_unittest.cc | 12 #undef MAX_WORD_LENGTH
|
| /external/chromium_org/net/base/registry_controlled_domains/ |
| registry_controlled_domain_unittest.cc | 13 #undef MAX_WORD_LENGTH
|
