HomeSort by relevance Sort by last modified time
    Searched refs:wordPos (Results 1 - 3 of 3) sorted by null

  /packages/inputmethods/LatinIME/native/jni/src/
binary_format.h 469 int wordPos = 0;
474 if (wordPos >= length) return NOT_VALID_WORD;
476 const int wChar = forceLowerCaseSearch ? toLowerCase(inWord[wordPos]) : inWord[wordPos];
492 ++wordPos;
497 if (wordPos >= length) return NOT_VALID_WORD;
498 if (inWord[wordPos] != character) return NOT_VALID_WORD;
506 ++wordPos;
508 if (wordPos == length) {
555 int wordPos = 0
    [all...]
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/makedict/
BinaryDictIOUtils.java 182 int wordPos = 0;
185 if (wordPos >= wordLen) return FormatSpec.NOT_VALID_WORD;
202 for (int p = 0, j = word.offsetByCodePoints(0, wordPos);
205 if (wordPos + p >= wordLen
214 if (wordPos + currentInfo.mCharacters.length == wordLen) {
222 wordPos += currentInfo.mCharacters.length;
    [all...]
  /packages/inputmethods/LatinIME/native/jni/src/suggest/core/dicnode/
dic_node_utils.cpp 209 const int wordPos = node->getPos();
211 if (NOT_VALID_WORD == wordPos || NOT_VALID_WORD == prevWordPos) {
212 // Note: Normally wordPos comes from the dictionary and should never equal NOT_VALID_WORD.
217 dicRoot, prevWordPos, wordPos, unigramProbability);
219 return BinaryFormat::getBigramProbability(dicRoot, prevWordPos, wordPos, unigramProbability);

Completed in 77 milliseconds