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

  /packages/inputmethods/LatinIME/native/src/
unigram_dictionary.h 70 bool isValidWord(const uint16_t* const inWord, const int length) const;
106 int getMostFrequentWordLikeInner(const uint16_t* const inWord, const int length,
unigram_dictionary.cpp 446 uint16_t inWord[inputLength];
449 inWord[i] = (uint16_t)mProximityInfo->getPrimaryCharAt(startInputIndex + i);
451 return getMostFrequentWordLikeInner(inWord, inputLength, word);
455 // and check it actually like-matches the word in inWord starting at startInputIndex,
468 const uint16_t* const inWord, const int startInputIndex,
474 const uint16_t wChar = Dictionary::toBaseLowerCase(inWord[startInputIndex]);
487 if (Dictionary::toBaseLowerCase(inWord[++inputIndex]) != baseChar) {
517 int UnigramDictionary::getMostFrequentWordLikeInner(const uint16_t * const inWord,
537 const bool isAlike = testCharGroupForContinuedLikeness(flags, root, pos, inWord,
574 bool UnigramDictionary::isValidWord(const uint16_t* const inWord, const int length) const
    [all...]
binary_format.h 51 static int getTerminalPosition(const uint8_t* const root, const uint16_t* const inWord,
227 const uint16_t* const inWord, const int length) {
236 const uint16_t wChar = inWord[wordPos];
258 if (inWord[wordPos] != character) return NOT_VALID_WORD;

Completed in 539 milliseconds