/packages/inputmethods/LatinIME/native/jni/src/suggest/core/policy/ |
D | weighting.h | 25 class DicNode; variable 35 const DicNode *const parentDicNode, DicNode *const dicNode, 40 const DicNode *const dicNode) const = 0; 43 const DicNode *const parentDicNode, const DicNode *const dicNode) const = 0; 46 const DicTraverseSession *const traverseSession, const DicNode *const dicNode, 50 const DicNode *const dicNode) const = 0; 53 const DicTraverseSession *const traverseSession, const DicNode *const parentDicNode, 54 const DicNode *const dicNode) const = 0; 58 const DicNode *const parentDicNode, const DicNode *const dicNode) const = 0; 61 const DicNode *const dicNode, DicNode_InputStateG *const inputStateG) const = 0; [all …]
|
D | traversal.h | 29 virtual bool allowsErrorCorrections(const DicNode *const dicNode) const = 0; 31 const DicNode *const dicNode, const DicNode *const childDicNode, 34 const DicNode *const dicNode) const = 0; 36 const DicNode *const dicNode) const = 0; 39 const DicNode *const dicNode) const = 0; 41 const DicNode *const dicNode) const = 0; 43 const DicNode *const dicNode, const DicNode *const childDicNode) const = 0; 50 const DicNode *const parentDicNode, const DicNode *const dicNode) const = 0; 51 virtual bool isGoodToTraverseNextWord(const DicNode *const dicNode,
|
D | weighting.cpp | 30 static inline void profile(const CorrectionType correctionType, DicNode *const node) { in profile() 77 const DicNode *const parentDicNode, DicNode *const dicNode, in addCostAndForwardInputIndex() 106 const DicNode *const parentDicNode, const DicNode *const dicNode, in getSpatialCost() 144 const DicNode *const parentDicNode, const DicNode *const dicNode, in getLanguageCost()
|
D | scoring.h | 24 class DicNode; variable 38 DicTraverseSession *const traverseSession, DicNode *const terminals, 41 const DicNode *const terminalDicNode) const = 0; 44 const DicNode *const dicNode) const = 0;
|
/packages/inputmethods/LatinIME/native/jni/src/suggest/core/dicnode/ |
D | dic_node_priority_queue.h | 64 AK_FORCE_INLINE void copyPush(const DicNode *const dicNode) { in copyPush() 65 DicNode *const pooledDicNode = newDicNode(dicNode); in copyPush() 82 AK_FORCE_INLINE void copyPop(DicNode *const dest) { in copyPop() 87 DicNode *node = mDicNodesQueue.top(); in copyPop() 102 AK_FORCE_INLINE static bool compareDicNode(const DicNode *const left, in compareDicNode() 103 const DicNode *const right) { in compareDicNode() 108 bool operator ()(const DicNode *left, const DicNode *right) const { in operator() 113 typedef std::priority_queue<DicNode *, std::vector<DicNode *>, DicNodeComparator> DicNodesQueue; 118 AK_FORCE_INLINE bool betterThanWorstDicNode(const DicNode *const dicNode) const { in betterThanWorstDicNode() 119 DicNode *worstNode = mDicNodesQueue.top(); in betterThanWorstDicNode() [all …]
|
D | dic_node_utils.h | 25 class DicNode; variable 34 const WordIdArrayView prevWordIds, DicNode *const newRootDicNode); 37 const DicNode *const prevWordLastDicNode, DicNode *const newRootDicNode); 38 static void initByCopy(const DicNode *const srcDicNode, DicNode *const destDicNode); 39 static void getAllChildDicNodes(const DicNode *dicNode, 44 const DicNode *const dicNode, MultiBigramMap *const multiBigramMap);
|
D | dic_node.h | 76 class DicNode { 88 AK_FORCE_INLINE DicNode() in DicNode() function 95 DicNode(const DicNode &dicNode); 96 DicNode &operator=(const DicNode &dicNode); 97 ~DicNode() {} in ~DicNode() 100 void initByCopy(const DicNode *const dicNode) { in initByCopy() 116 void initAsRootWithPreviousWord(const DicNode *const dicNode, const int rootPtNodeArrayPos) { in initAsRootWithPreviousWord() 128 void initAsPassingChild(const DicNode *parentDicNode) { in initAsPassingChild() 138 void initAsChild(const DicNode *const dicNode, const int childrenPtNodeArrayPos, in initAsChild() 347 AK_FORCE_INLINE bool isSameNodeCodePoint(const DicNode *const dicNode) const { in isSameNodeCodePoint() [all …]
|
D | dic_node_utils.cpp | 31 const WordIdArrayView prevWordIds, DicNode *const newRootDicNode) { in initAsRoot() 37 const DicNode *const prevWordLastDicNode, DicNode *const newRootDicNode) { in initAsRootWithPreviousWord() 42 /* static */ void DicNodeUtils::initByCopy(const DicNode *const srcDicNode, in initByCopy() 43 DicNode *const destDicNode) { in initByCopy() 50 /* static */ void DicNodeUtils::getAllChildDicNodes(const DicNode *dicNode, in getAllChildDicNodes() 71 const DicNode *const dicNode, MultiBigramMap *const multiBigramMap) { in getBigramNodeImprobability()
|
D | dic_node.cpp | 21 DicNode::DicNode(const DicNode &dicNode) in DicNode() function in latinime::DicNode 31 DicNode &DicNode::operator=(const DicNode &dicNode) { in operator =()
|
D | dic_node_pool.h | 50 DicNode *getInstance() { in getInstance() 54 DicNode *const dicNode = mPooledDicNodes.back(); in getInstance() 61 void placeBackInstance(DicNode *dicNode) { in placeBackInstance() 67 std::unordered_set<const DicNode*> usedDicNodes; in dump() 83 std::vector<DicNode> mDicNodes; 84 std::deque<DicNode*> mPooledDicNodes;
|
D | dic_nodes_cache.h | 27 class DicNode; variable 88 AK_FORCE_INLINE void copyPushTerminal(DicNode *dicNode) { in copyPushTerminal() 92 AK_FORCE_INLINE void copyPushActive(DicNode *dicNode) { in copyPushActive() 96 AK_FORCE_INLINE void copyPushContinue(DicNode *dicNode) { in copyPushContinue() 100 AK_FORCE_INLINE void copyPushNextActive(DicNode *dicNode) { in copyPushNextActive() 104 void popTerminal(DicNode *dest) { in popTerminal() 108 void popActive(DicNode *dest) { in popActive()
|
D | dic_node_vector.h | 56 void pushPassingChild(const DicNode *dicNode) { in pushPassingChild() 62 void pushLeavingChild(const DicNode *const dicNode, const int childrenPtNodeArrayPos, in pushLeavingChild() 69 DicNode *operator[](const int id) { 74 DicNode *front() { in front() 81 std::vector<DicNode> mDicNodes;
|
/packages/inputmethods/LatinIME/native/jni/src/suggest/core/ |
D | suggest.h | 35 class DicNode; variable 57 void createNextWordDicNode(DicTraverseSession *traverseSession, DicNode *dicNode, 61 void processTerminalDicNode(DicTraverseSession *traverseSession, DicNode *dicNode) const; 62 void processExpandedDicNode(DicTraverseSession *traverseSession, DicNode *dicNode) const; 63 void weightChildNode(DicTraverseSession *traverseSession, DicNode *dicNode) const; 64 void processDicNodeAsOmission(DicTraverseSession *traverseSession, DicNode *dicNode) const; 65 void processDicNodeAsDigraph(DicTraverseSession *traverseSession, DicNode *dicNode) const; 67 DicNode *dicNode) const; 68 void processDicNodeAsInsertion(DicTraverseSession *traverseSession, DicNode *dicNode) const; 70 DicNode *dicNode, DicNode *childDicNode) const; [all …]
|
D | suggest.cpp | 96 DicNode rootNode; in initializeSearch() 110 DicNode correctionDicNode; in expandCurrentDicNodes() 122 DicNode dicNode; in expandCurrentDicNodes() 172 DicNode *const childDicNode = childDicNodes[i]; in expandCurrentDicNodes() 230 DicTraverseSession *traverseSession, DicNode *dicNode) const { in processTerminalDicNode() 244 DicNode terminalDicNode(*dicNode); in processTerminalDicNode() 260 DicTraverseSession *traverseSession, DicNode *dicNode) const { in processExpandedDicNode() 275 DicNode *childDicNode) const { in processDicNodeAsMatch() 281 DicNode *dicNode, DicNode *childDicNode) const { in processDicNodeAsAdditionalProximityChar() 290 DicNode *dicNode, DicNode *childDicNode) const { in processDicNodeAsSubstitution() [all …]
|
/packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/typing/ |
D | typing_weighting.h | 31 class DicNode; variable 41 const DicNode *const dicNode) const { in getTerminalSpatialCost() 55 float getOmissionCost(const DicNode *const parentDicNode, const DicNode *const dicNode) const { in getOmissionCost() 76 const DicNode *const dicNode, DicNode_InputStateG *inputStateG) const { in getMatchedCost() 106 const DicNode *const dicNode) const { in isProximityDicNode() 115 const DicNode *const parentDicNode, const DicNode *const dicNode) const { in getTranspositionCost() 130 const DicNode *const parentDicNode, const DicNode *const dicNode) const { in getInsertionCost() 154 const DicNode *const dicNode, DicNode_InputStateG *inputStateG) const { in getSpaceOmissionCost() 160 const DicNode *const dicNode, in getNewWordBigramLanguageCost() 168 const DicNode *const dicNode) const { in getCompletionCost() [all …]
|
D | typing_traversal.h | 42 AK_FORCE_INLINE bool allowsErrorCorrections(const DicNode *const dicNode) const { in allowsErrorCorrections() 48 const DicNode *const dicNode, const DicNode *const childDicNode, in isOmission() 77 const DicTraverseSession *const traverseSession, const DicNode *const dicNode) const { in isSpaceSubstitutionTerminal() 98 const DicTraverseSession *const traverseSession, const DicNode *const dicNode) const { in isSpaceOmissionTerminal() 129 const DicTraverseSession *const traverseSession, const DicNode *const dicNode) const { in shouldNodeLevelCache() 134 const DicTraverseSession *const traverseSession, const DicNode *const dicNode) const { in canDoLookAheadCorrection() 140 const DicTraverseSession *const traverseSession, const DicNode *const dicNode, in getProximityType() 141 const DicNode *const childDicNode) const { in getProximityType() 174 const DicTraverseSession *const traverseSession, const DicNode *const parentDicNode, in isPossibleOmissionChildNode() 175 const DicNode *const dicNode) const { in isPossibleOmissionChildNode() [all …]
|
D | typing_scoring.h | 28 class DicNode; variable 40 DicTraverseSession *const traverseSession, DicNode *const terminals, in getAdjustedWeightOfLangModelVsSpatialModel() 97 const DicNode *const terminalDicNode) const { in getDoubleLetterDemotionDistanceCost() 106 const DicNode *const dicNode) const { in sameAsTyped()
|
D | typing_weighting.cpp | 28 const DicTraverseSession *const traverseSession, const DicNode *const parentDicNode, in getErrorType() 29 const DicNode *const dicNode) const { in getErrorType()
|
/packages/inputmethods/LatinIME/native/jni/src/suggest/core/dictionary/ |
D | dictionary_utils.cpp | 33 std::vector<DicNode> current; in getMaxProbabilityOfExactMatches() 34 std::vector<DicNode> next; in getMaxProbabilityOfExactMatches() 46 for (const DicNode &dicNode : current) { in getMaxProbabilityOfExactMatches() 59 for (const DicNode &dicNode : current) { in getMaxProbabilityOfExactMatches() 74 const int inputCodePoint, const DicNode *const parentDicNode, in processChildDicNodes() 75 std::vector<DicNode> *const outDicNodes) { in processChildDicNodes() 79 DicNode *const childDicNode = childDicNodes[childIndex]; in processChildDicNodes()
|
D | dictionary_utils.h | 28 class DicNode; variable 41 const int inputCodePoint, const DicNode *const parentDicNode, 42 std::vector<DicNode> *const outDicNodes);
|
/packages/inputmethods/LatinIME/native/jni/src/suggest/core/result/ |
D | suggestions_output_utils.h | 26 class DicNode; variable 39 const DicNode *const terminalDicNode, const WordAttributes wordAttributes, 55 DicTraverseSession *traverseSession, const DicNode *const terminalDicNode, 62 static int computeFirstWordConfidence(const DicNode *const terminalDicNode);
|
D | suggestions_output_utils.cpp | 44 std::vector<DicNode> terminals(terminalSize); in outputSuggestions() 80 const SuggestOptions *const suggestOptions, const DicNode *const terminalDicNode, in shouldBlockWord() 127 const DicNode *const terminalDicNode, const float weightOfLangModelVsSpatialModel, in outputSuggestionsOfDicNode() 199 const DicNode *const terminalDicNode) { in computeFirstWordConfidence()
|
/packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/v2/ |
D | patricia_trie_policy.h | 37 class DicNode; variable 59 void createAndGetAllChildDicNodes(const DicNode *const dicNode, 171 int createAndGetLeavingChildNode(const DicNode *const dicNode, const int ptNodePos,
|
/packages/inputmethods/LatinIME/native/jni/src/dictionary/interface/ |
D | dictionary_structure_with_buffer_policy.h | 31 class DicNode; variable 51 virtual void createAndGetAllChildDicNodes(const DicNode *const dicNode,
|
/packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/v4/ |
D | ver4_patricia_trie_policy.h | 38 class DicNode; variable 61 void createAndGetAllChildDicNodes(const DicNode *const dicNode,
|