Home
last modified time | relevance | path

Searched refs:getNodeCodePointCount (Results 1 – 4 of 4) sorted by relevance

/packages/inputmethods/LatinIME/native/jni/src/suggest/core/dicnode/
Ddic_node.h35 INTS_TO_CHARS(getOutputWordBuf(), getNodeCodePointCount(), charBuf, NELEMS(charBuf)); \
44 getNodeCodePointCount() \
132 parentDicNode->getNodeCodePointCount()); in initAsPassingChild()
140 uint16_t newDepth = static_cast<uint16_t>(dicNode->getNodeCodePointCount() + 1); in initAsChild()
152 return getNodeCodePointCount() == 0; in isRoot()
160 ASSERT(getNodeCodePointCount() <= mDicNodeProperties.getLeavingDepth()); in isLeavingNode()
161 return getNodeCodePointCount() == mDicNodeProperties.getLeavingDepth(); in isLeavingNode()
165 return getNodeCodePointCount() == 1; in isFirstLetter()
183 const int currentWordLen = getNodeCodePointCount(); in isValidMultipleWordSuggestion()
216 const int currentDicNodeDepth = getNodeCodePointCount(); in isTerminalDicNode()
[all …]
/packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/typing/
Dtyping_weighting.h60 const bool isFirstLetterOmission = dicNode->getNodeCodePointCount() == 2; in getOmissionCost()
92 if (dicNode->getNodeCodePointCount() == 2) { in getMatchedCost()
141 const bool singleChar = dicNode->getNodeCodePointCount() == 1; in getInsertionCost()
Dtyping_scoring.h108 dicNode->getOutputWordBuf(), dicNode->getNodeCodePointCount()); in sameAsTyped()
Dtyping_traversal.h189 const bool shortCappedWord = dicNode->getNodeCodePointCount() in isGoodToTraverseNextWord()