| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/policy/ |
| 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
[all...] |
| weighting.h | 24 class DicNode;
34 const DicNode *const parentDicNode, DicNode *const dicNode,
39 const DicNode *const dicNode) const = 0;
42 const DicNode *const parentDicNode, const DicNode *const dicNode) const = 0;
45 const DicTraverseSession *const traverseSession, const DicNode *const dicNode
[all...] |
| scoring.h | 24 class DicNode;
38 virtual void searchWordWithDoubleLetter(DicNode *terminals, const int terminalSize,
41 DicNode *const terminals, const int size) const = 0;
|
| weighting.cpp | 21 #include "suggest/core/dicnode/dic_node.h"
22 #include "suggest/core/dicnode/dic_node_profiler.h"
23 #include "suggest/core/dicnode/dic_node_utils.h"
30 static inline void profile(const CorrectionType correctionType, DicNode *const node) {
74 const DicNode *const parentDicNode, DicNode *const dicNode,
80 traverseSession, parentDicNode, dicNode, &inputStateG);
82 traverseSession, parentDicNode, dicNode, multiBigramMap);
84 parentDicNode, dicNode);
[all...] |
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/dicnode/ |
| dic_node.cpp | 21 DicNode::DicNode(const DicNode &dicNode)
24 mProfiler(dicNode.mProfiler),
26 mDicNodeProperties(dicNode.mDicNodeProperties), mDicNodeState(dicNode.mDicNodeState),
27 mIsCachedForNextSuggestion(dicNode.mIsCachedForNextSuggestion), mIsUsed(dicNode.mIsUsed),
32 DicNode &DicNode::operator=(const DicNode &dicNode)
[all...] |
| dic_nodes_cache.cpp | 30 DicNode *DicNodesCache::setCommitPoint(int commitPoint) {
31 std::list<DicNode> dicNodesList;
33 DicNode dicNode;
34 mCachedDicNodesForContinuousSuggestion->copyPop(&dicNode);
35 dicNodesList.push_front(dicNode);
38 // Get the starting words of the top scoring dicNode (last dicNode popped from priority queue)
40 DicNode *topDicNode = &dicNodesList.front();
41 DicNode topDicNodeCopy
[all...] |
| dic_node_utils.h | 27 class DicNode;
38 const int prevWordNodePos, DicNode *newRootNode);
40 DicNode *prevWordLastNode, DicNode *newRootNode);
41 static void initByCopy(DicNode *srcNode, DicNode *destNode);
42 static void getAllChildDicNodes(DicNode *dicNode, const uint8_t *const dicRoot,
45 const DicNode *const node, MultiBigramMap *const multiBigramMap);
49 static void getProximityChildDicNodes(DicNode *dicNode, const uint8_t *const dicRoot
[all...] |
| dic_node_priority_queue.h | 78 AK_FORCE_INLINE DicNode *newDicNode(DicNode *dicNode) {
79 DicNode *newNode = searchEmptyDicNode();
81 DicNodeUtils::initByCopy(dicNode, newNode);
88 AK_FORCE_INLINE DicNode *copyPush(DicNode *dicNode) {
89 return copyPush(dicNode, mMaxSize);
92 AK_FORCE_INLINE void copyPop(DicNode *dest)
[all...] |
| dic_node_release_listener.h | 28 virtual void onReleased(DicNode *dicNode) = 0;
|
| dic_node_vector.h | 59 void pushPassingChild(DicNode *dicNode) {
62 mDicNodes.back().initAsPassingChild(dicNode);
65 void pushLeavingChild(DicNode *dicNode, const int pos, const uint8_t flags,
73 mDicNodes.back().initAsChild(dicNode, pos, flags, childrenPos, attributesPos, siblingPos,
78 DicNode *operator[](const int id) {
83 DicNode *front() {
90 std::vector<DicNode> mDicNodes;
92 DicNode mEmptyNode
[all...] |
| dic_nodes_cache.h | 33 class DicNode;
36 * Class for controlling dicNode search priority queue and lexicon trie traversal.
76 DicNode *setCommitPoint(int commitPoint);
89 AK_FORCE_INLINE void copyPushTerminal(DicNode *dicNode) {
90 mTerminalDicNodes->copyPush(dicNode);
93 AK_FORCE_INLINE void copyPushActive(DicNode *dicNode) {
94 mActiveDicNodes->copyPush(dicNode);
97 AK_FORCE_INLINE bool copyPushContinue(DicNode *dicNode)
[all...] |
| dic_node_utils.cpp | 35 const int prevWordNodePos, DicNode *newRootNode) {
44 const uint8_t *const dicRoot, DicNode *prevWordLastNode, DicNode *newRootNode) {
52 /* static */ void DicNodeUtils::initByCopy(DicNode *srcNode, DicNode *destNode) {
60 /* static */ void DicNodeUtils::createAndGetPassingChildNode(DicNode *dicNode,
64 const int codePoint = dicNode->getNodeTypedCodePoint();
68 childDicNodes->pushPassingChild(dicNode);
72 /* static */ int DicNodeUtils::createAndGetLeavingChildNode(DicNode *dicNode, int pos
[all...] |
| dic_node.h | 63 class DicNode {
64 // Caveat: We define Weighting as a friend class of DicNode to let Weighting change
65 // the distance of DicNode.
67 // This is an exception to explicitly hide DicNode::addCost() from all classes but Weighting.
77 AK_FORCE_INLINE static void managedDelete(DicNode *node) {
83 AK_FORCE_INLINE DicNode()
91 DicNode(const DicNode &dicNode);
92 DicNode &operator=(const DicNode &dicNode)
[all...] |
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/ |
| suggest.h | 35 class DicNode;
55 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 float getAutocorrectScore(DicTraverseSession *traverseSession, DicNode *dicNode) const
[all...] |
| suggest.cpp | 23 #include "suggest/core/dicnode/dic_node.h"
24 #include "suggest/core/dicnode/dic_node_priority_queue.h"
25 #include "suggest/core/dicnode/dic_node_vector.h"
98 DicNode *topDicNode =
108 DicNode rootNode;
126 DicNode terminals[MAX_RESULTS]; // Avoiding non-POD variable length array
154 DicNode *terminalDicNode = &terminals[terminalIndex];
212 DicNode::managedDelete(terminalDicNode);
229 DicNode correctionDicNode;
241 DicNode dicNode
[all...] |
| /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/typing/ |
| typing_traversal.h | 25 #include "suggest/core/dicnode/dic_node.h"
26 #include "suggest/core/dicnode/dic_node_vector.h"
40 AK_FORCE_INLINE bool allowsErrorCorrections(const DicNode *const dicNode) const {
41 return dicNode->getNormalizedSpatialDistance()
46 const DicNode *const dicNode, const DicNode *const childDicNode,
59 if (dicNode->isCompletion(inputSize)) {
62 if (dicNode->canBeIntentionalOmission())
[all...] |
| typing_weighting.h | 22 #include "suggest/core/dicnode/dic_node_utils.h"
29 class DicNode;
39 const DicNode *const dicNode) const {
41 if (dicNode->hasMultipleWords()) {
44 if (dicNode->getProximityCorrectionCount() > 0) {
47 if (dicNode->getEditCorrectionCount() > 0) {
53 float getOmissionCost(const DicNode *const parentDicNode, const DicNode *const dicNode) const
[all...] |
| typing_weighting.cpp | 19 #include "suggest/core/dicnode/dic_node.h"
27 const DicTraverseSession *const traverseSession, const DicNode *const parentDicNode,
28 const DicNode *const dicNode) const {
31 if (isProximityDicNode(traverseSession, dicNode)) {
|
| typing_scoring.h | 26 class DicNode;
44 AK_FORCE_INLINE void searchWordWithDoubleLetter(DicNode *terminals,
50 DicNode *const terminals, const int size) const {
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/session/ |
| dic_traverse_session.h | 27 #include "suggest/core/dicnode/dic_nodes_cache.h"
95 void getSearchKeys(const DicNode *node, std::vector<int> *const outputSearchKeyVector) const {
108 ProximityType getProximityTypeG(const DicNode *const node, const int childCodePoint) const {
|
