/packages/inputmethods/LatinIME/native/jni/src/suggest/core/dicnode/ |
H A D | dic_node.cpp | 21 DicNode::DicNode(const DicNode &dicNode) argument 24 mProfiler(dicNode.mProfiler), 26 mDicNodeProperties(dicNode.mDicNodeProperties), mDicNodeState(dicNode.mDicNodeState), 27 mIsCachedForNextSuggestion(dicNode.mIsCachedForNextSuggestion) { 31 DicNode &DicNode::operator=(const DicNode &dicNode) { argument 33 mProfiler = dicNode.mProfiler; 35 mDicNodeProperties = dicNode.mDicNodeProperties; 36 mDicNodeState = dicNode.mDicNodeState; 37 mIsCachedForNextSuggestion = dicNode [all...] |
H A D | dic_node_pool.h | 44 for (auto &dicNode : mDicNodes) { 45 mPooledDicNodes.emplace_back(&dicNode); 54 DicNode *const dicNode = mPooledDicNodes.back(); local 56 return dicNode; 61 void placeBackInstance(DicNode *dicNode) { argument 62 mPooledDicNodes.emplace_back(dicNode); 68 for (const auto &dicNode : mDicNodes) { 69 usedDicNodes.insert(&dicNode);
|
H A D | dic_node_utils.cpp | 50 /* static */ void DicNodeUtils::getAllChildDicNodes(const DicNode *dicNode, argument 53 if (dicNode->isTotalInputSizeExceedingLimit()) { 56 if (!dicNode->isLeavingNode()) { 57 childDicNodes->pushPassingChild(dicNode); 59 dictionaryStructurePolicy->createAndGetAllChildDicNodes(dicNode, childDicNodes); 67 * Computes the combined bigram / unigram cost for the given dicNode. 71 const DicNode *const dicNode, MultiBigramMap *const multiBigramMap) { 72 if (dicNode->hasMultipleWords() && !dicNode->isValidMultipleWordSuggestion()) { 76 dicNode 69 getBigramNodeImprobability( const DictionaryStructureWithBufferPolicy *const dictionaryStructurePolicy, const DicNode *const dicNode, MultiBigramMap *const multiBigramMap) argument [all...] |
H A D | dic_node_vector.h | 56 void pushPassingChild(const DicNode *dicNode) { argument 59 mDicNodes.back().initAsPassingChild(dicNode); 62 void pushLeavingChild(const DicNode *const dicNode, const int childrenPtNodeArrayPos, argument 66 mDicNodes.back().initAsChild(dicNode, childrenPtNodeArrayPos, wordId, mergedCodePoints);
|
H A D | dic_node_priority_queue.h | 64 AK_FORCE_INLINE void copyPush(const DicNode *const dicNode) { argument 65 DicNode *const pooledDicNode = newDicNode(dicNode); 118 AK_FORCE_INLINE bool betterThanWorstDicNode(const DicNode *const dicNode) const { 123 return compareDicNode(dicNode, worstNode); 126 AK_FORCE_INLINE DicNode *newDicNode(const DicNode *const dicNode) { argument 129 DicNodeUtils::initByCopy(dicNode, newNode);
|
H A D | dic_nodes_cache.h | 30 * Class for controlling dicNode search priority queue and lexicon trie traversal. 88 AK_FORCE_INLINE void copyPushTerminal(DicNode *dicNode) { argument 89 mTerminalDicNodes->copyPush(dicNode); 92 AK_FORCE_INLINE void copyPushActive(DicNode *dicNode) { argument 93 mActiveDicNodes->copyPush(dicNode); 96 AK_FORCE_INLINE void copyPushContinue(DicNode *dicNode) { argument 97 mCachedDicNodesForContinuousSuggestion->copyPush(dicNode); 100 AK_FORCE_INLINE void copyPushNextActive(DicNode *dicNode) { argument 101 mNextActiveDicNodes->copyPush(dicNode);
|
H A D | dic_node.h | 95 DicNode(const DicNode &dicNode); 96 DicNode &operator=(const DicNode &dicNode); 100 void initByCopy(const DicNode *const dicNode) { argument 101 mIsCachedForNextSuggestion = dicNode->mIsCachedForNextSuggestion; 102 mDicNodeProperties.initByCopy(&dicNode->mDicNodeProperties); 103 mDicNodeState.initByCopy(&dicNode->mDicNodeState); 104 PROF_NODE_COPY(&dicNode->mProfiler, mProfiler); 116 void initAsRootWithPreviousWord(const DicNode *const dicNode, const int rootPtNodeArrayPos) { argument 117 mIsCachedForNextSuggestion = dicNode->mIsCachedForNextSuggestion; 119 newPrevWordIds[0] = dicNode 138 initAsChild(const DicNode *const dicNode, const int childrenPtNodeArrayPos, const int wordId, const CodePointArrayView mergedCodePoints) argument [all...] |
/packages/inputmethods/LatinIME/native/jni/tests/suggest/core/dicnode/ |
H A D | dic_node_pool_test.cpp | 38 DicNode *const dicNode = dicNodePool.getInstance(); local 39 EXPECT_NE(nullptr, dicNode); 41 dicNodePool.placeBackInstance(dicNode); 42 EXPECT_EQ(dicNode, dicNodePool.getInstance());
|
/packages/inputmethods/LatinIME/native/jni/src/suggest/core/policy/ |
H A D | weighting.cpp | 77 const DicNode *const parentDicNode, DicNode *const dicNode, 83 traverseSession, parentDicNode, dicNode, &inputStateG); 85 traverseSession, parentDicNode, dicNode, multiBigramMap); 87 traverseSession, parentDicNode, dicNode); 88 profile(correctionType, dicNode); 90 dicNode->updateInputIndexG(&inputStateG); 92 dicNode->forwardInputIndex(0, getForwardInputCount(correctionType), 95 dicNode->addCost(spatialCost, languageCost, weighting->needsToNormalizeCompoundDistance(), 100 dicNode->saveNormalizedCompoundDistanceAfterFirstWordIfNoneYet(); 106 const DicNode *const parentDicNode, const DicNode *const dicNode, 75 addCostAndForwardInputIndex(const Weighting *const weighting, const CorrectionType correctionType, const DicTraverseSession *const traverseSession, const DicNode *const parentDicNode, DicNode *const dicNode, MultiBigramMap *const multiBigramMap) argument 104 getSpatialCost(const Weighting *const weighting, const CorrectionType correctionType, const DicTraverseSession *const traverseSession, const DicNode *const parentDicNode, const DicNode *const dicNode, DicNode_InputStateG *const inputStateG) argument 142 getLanguageCost(const Weighting *const weighting, const CorrectionType correctionType, const DicTraverseSession *const traverseSession, const DicNode *const parentDicNode, const DicNode *const dicNode, MultiBigramMap *const multiBigramMap) argument [all...] |
/packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/typing/ |
H A D | typing_traversal.h | 42 AK_FORCE_INLINE bool allowsErrorCorrections(const DicNode *const dicNode) const { 43 return dicNode->getNormalizedSpatialDistance() 48 const DicNode *const dicNode, const DicNode *const childDicNode, 61 if (dicNode->isCompletion(inputSize)) { 64 if (dicNode->canBeIntentionalOmission()) { 67 const int point0Index = dicNode->getInputIndex(0); 77 const DicTraverseSession *const traverseSession, const DicNode *const dicNode) const { 88 if (!canDoLookAheadCorrection(traverseSession, dicNode)) { 91 const int point0Index = dicNode->getInputIndex(0); 92 return dicNode 47 isOmission(const DicTraverseSession *const traverseSession, const DicNode *const dicNode, const DicNode *const childDicNode, const bool allowsErrorCorrections) const argument 139 getProximityType( const DicTraverseSession *const traverseSession, const DicNode *const dicNode, const DicNode *const childDicNode) const argument 184 isGoodToTraverseNextWord(const DicNode *const dicNode, const int probability) const argument [all...] |
H A D | typing_weighting.h | 41 const DicNode *const dicNode) const { 43 if (dicNode->hasMultipleWords()) { 46 if (dicNode->getProximityCorrectionCount() > 0) { 49 if (dicNode->getEditCorrectionCount() > 0) { 55 float getOmissionCost(const DicNode *const parentDicNode, const DicNode *const dicNode) const { 58 const bool sameCodePoint = dicNode->isSameNodeCodePoint(parentDicNode); 59 // If the traversal omitted the first letter then the dicNode should now be on the second. 60 const bool isFirstLetterOmission = dicNode->getNodeCodePointCount() == 2; 76 const DicNode *const dicNode, DicNode_InputStateG *inputStateG) const { 77 const int pointIndex = dicNode 75 getMatchedCost(const DicTraverseSession *const traverseSession, const DicNode *const dicNode, DicNode_InputStateG *inputStateG) const argument 153 getSpaceOmissionCost(const DicTraverseSession *const traverseSession, const DicNode *const dicNode, DicNode_InputStateG *inputStateG) const argument 159 getNewWordBigramLanguageCost(const DicTraverseSession *const traverseSession, const DicNode *const dicNode, MultiBigramMap *const multiBigramMap) const argument 178 getTerminalLanguageCost(const DicTraverseSession *const traverseSession, const DicNode *const dicNode, const float dicNodeLanguageImprobability) const argument [all...] |
/packages/inputmethods/LatinIME/native/jni/src/suggest/core/session/ |
H A D | dic_traverse_session.h | 109 ProximityType getProximityTypeG(const DicNode *const dicNode, const int childCodePoint) const { argument 115 const int pointerId = dicNode->getInputIndex(i);
|
/packages/inputmethods/LatinIME/native/jni/src/suggest/core/ |
H A D | suggest.cpp | 122 DicNode dicNode; local 123 traverseSession->getDicTraverseCache()->popActive(&dicNode); 124 if (dicNode.isTotalInputSizeExceedingLimit()) { 128 const int point0Index = dicNode.getInputIndex(0); 130 TRAVERSAL->canDoLookAheadCorrection(traverseSession, &dicNode); 134 const bool isCompletion = dicNode.isCompletion(inputSize); 137 TRAVERSAL->shouldNodeLevelCache(traverseSession, &dicNode); 140 dicNode.dump("PUSH_CACHE"); 142 traverseSession->getDicTraverseCache()->copyPushContinue(&dicNode); 143 dicNode 280 processDicNodeAsAdditionalProximityChar(DicTraverseSession *traverseSession, DicNode *dicNode, DicNode *childDicNode) const argument 289 processDicNodeAsSubstitution(DicTraverseSession *traverseSession, DicNode *dicNode, DicNode *childDicNode) const argument 413 createNextWordDicNode(DicTraverseSession *traverseSession, DicNode *dicNode, const bool spaceSubstitution) const argument [all...] |
/packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/v2/ |
H A D | patricia_trie_policy.cpp | 33 void PatriciaTriePolicy::createAndGetAllChildDicNodes(const DicNode *const dicNode, argument 35 if (!dicNode->hasChildren()) { 38 int nextPos = dicNode->getChildrenPtNodeArrayPos(); 56 nextPos = createAndGetLeavingChildNode(dicNode, nextPos, childDicNodes); 402 int PatriciaTriePolicy::createAndGetLeavingChildNode(const DicNode *const dicNode, argument 420 childDicNodes->pushLeavingChild(dicNode, childrenPos, wordId,
|
/packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/v4/ |
H A D | ver4_patricia_trie_policy.cpp | 48 void Ver4PatriciaTriePolicy::createAndGetAllChildDicNodes(const DicNode *const dicNode, argument 50 if (!dicNode->hasChildren()) { 54 readingHelper.initWithPtNodeArrayPos(dicNode->getChildrenPtNodeArrayPos()); 62 childDicNodes->pushLeavingChild(dicNode, ptNodeParams.getChildrenPos(),
|
/packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/backward/v402/ |
H A D | ver4_patricia_trie_policy.cpp | 57 void Ver4PatriciaTriePolicy::createAndGetAllChildDicNodes(const DicNode *const dicNode, argument 59 if (!dicNode->hasChildren()) { 63 readingHelper.initWithPtNodeArrayPos(dicNode->getChildrenPtNodeArrayPos()); 82 childDicNodes->pushLeavingChild(dicNode, ptNodeParams.getChildrenPos(),
|