| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/dicnode/ |
| dic_node.cpp | 17 #include "suggest/core/dicnode/dic_node.h"
21 DicNode::DicNode(const DicNode &dicNode)
24 mProfiler(dicNode.mProfiler),
26 mDicNodeProperties(dicNode.mDicNodeProperties), mDicNodeState(dicNode.mDicNodeState),
27 mIsCachedForNextSuggestion(dicNode.mIsCachedForNextSuggestion), mIsUsed(dicNode.mIsUsed)
[all...] |
| dic_nodes_cache.cpp | 20 #include "suggest/core/dicnode/dic_node_priority_queue.h"
21 #include "suggest/core/dicnode/dic_node_utils.h"
22 #include "suggest/core/dicnode/dic_nodes_cache.h"
35 DicNode *DicNodesCache::setCommitPoint(int commitPoint) {
36 std::list<DicNode> dicNodesList;
38 DicNode dicNode;
39 mCachedDicNodesForContinuousSuggestion->copyPop(&dicNode);
40 dicNodesList.push_front(dicNode);
43 // Get the starting words of the top scoring dicNode (last dicNode popped from priority queue
[all...] |
| dic_node_release_listener.h | 24 class DicNode;
30 virtual void onReleased(DicNode *dicNode) = 0;
|
| dic_node_priority_queue.h | 24 #include "suggest/core/dicnode/dic_node.h"
25 #include "suggest/core/dicnode/dic_node_release_listener.h"
78 AK_FORCE_INLINE DicNode *copyPush(DicNode *dicNode) {
79 return copyPush(dicNode, mMaxSize);
82 AK_FORCE_INLINE void copyPop(DicNode *dest) {
87 DicNode *node = mDicNodesQueue.top();
95 void onReleased(DicNode *dicNode) {
[all...] |
| dic_node_vector.h | 23 #include "suggest/core/dicnode/dic_node.h"
59 void pushPassingChild(DicNode *dicNode) {
62 mDicNodes.back().initAsPassingChild(dicNode);
65 void pushLeavingChild(const DicNode *const dicNode, const int pos, const int childrenPos,
71 mDicNodes.back().initAsChild(dicNode, pos, childrenPos, probability, isTerminal,
76 DicNode *operator[](const int id) {
81 DicNode *front() {
88 std::vector<DicNode> mDicNodes
[all...] |
| dic_node.h | 21 #include "suggest/core/dicnode/dic_node_profiler.h"
22 #include "suggest/core/dicnode/dic_node_release_listener.h"
23 #include "suggest/core/dicnode/internal/dic_node_state.h"
24 #include "suggest/core/dicnode/internal/dic_node_properties.h"
69 class DicNode {
70 // Caveat: We define Weighting as a friend class of DicNode to let Weighting change
71 // the distance of DicNode.
73 // This is an exception to explicitly hide DicNode::addCost() from all classes but Weighting.
83 AK_FORCE_INLINE static void managedDelete(DicNode *node) {
89 AK_FORCE_INLINE DicNode()
[all...] |
| dic_nodes_cache.h | 23 #include "suggest/core/dicnode/dic_node_priority_queue.h"
27 class DicNode;
30 * Class for controlling dicNode search priority queue and lexicon trie traversal.
78 DicNode *setCommitPoint(int commitPoint);
91 AK_FORCE_INLINE void copyPushTerminal(DicNode *dicNode) {
92 mTerminalDicNodes->copyPush(dicNode);
95 AK_FORCE_INLINE void copyPushActive(DicNode *dicNode) {
96 mActiveDicNodes->copyPush(dicNode);
[all...] |
| dic_node_utils.cpp | 17 #include "suggest/core/dicnode/dic_node_utils.h"
21 #include "suggest/core/dicnode/dic_node.h"
22 #include "suggest/core/dicnode/dic_node_vector.h"
35 const int prevWordNodePos, DicNode *const newRootNode) {
41 DicNode *const prevWordLastNode, DicNode *const newRootNode) {
46 /* static */ void DicNodeUtils::initByCopy(DicNode *srcNode, DicNode *destNode) {
53 /* static */ void DicNodeUtils::getAllChildDicNodes(DicNode *dicNode,
[all...] |
| dic_node_utils.h | 26 class DicNode;
37 const int prevWordNodePos, DicNode *newRootNode);
40 DicNode *prevWordLastNode, DicNode *newRootNode);
41 static void initByCopy(DicNode *srcNode, DicNode *destNode);
42 static void getAllChildDicNodes(DicNode *dicNode,
47 const DicNode *const node, MultiBigramMap *const multiBigramMap);
56 const DicNode *const node, MultiBigramMap *multiBigramMap)
[all...] |
| /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...] |
| weighting.cpp | 20 #include "suggest/core/dicnode/dic_node.h"
21 #include "suggest/core/dicnode/dic_node_profiler.h"
22 #include "suggest/core/dicnode/dic_node_utils.h"
29 static inline void profile(const CorrectionType correctionType, DicNode *const node) {
76 const DicNode *const parentDicNode, DicNode *const dicNode,
82 traverseSession, parentDicNode, dicNode, &inputStateG);
84 traverseSession, parentDicNode, dicNode, multiBigramMap);
86 parentDicNode, dicNode);
[all...] |
| dictionary_structure_with_buffer_policy.h | 24 class DicNode;
40 virtual void createAndGetAllChildNodes(const DicNode *const dicNode,
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/typing/ |
| typing_traversal.h | 23 #include "suggest/core/dicnode/dic_node.h"
24 #include "suggest/core/dicnode/dic_node_vector.h"
41 AK_FORCE_INLINE bool allowsErrorCorrections(const DicNode *const dicNode) const {
42 return dicNode->getNormalizedSpatialDistance()
47 const DicNode *const dicNode, const DicNode *const childDicNode,
60 if (dicNode->isCompletion(inputSize)) {
63 if (dicNode->canBeIntentionalOmission())
[all...] |
| typing_weighting.h | 21 #include "suggest/core/dicnode/dic_node_utils.h"
30 class DicNode;
40 const DicNode *const dicNode) const {
42 if (dicNode->hasMultipleWords()) {
45 if (dicNode->getProximityCorrectionCount() > 0) {
48 if (dicNode->getEditCorrectionCount() > 0) {
54 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)) {
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/ |
| suggest.h | 35 class DicNode;
56 void createNextWordDicNode(DicTraverseSession *traverseSession, DicNode *dicNode,
61 int computeFirstWordConfidence(const DicNode *const terminalDicNode) const;
64 void processTerminalDicNode(DicTraverseSession *traverseSession, DicNode *dicNode) const;
65 void processExpandedDicNode(DicTraverseSession *traverseSession, DicNode *dicNode) const;
66 void weightChildNode(DicTraverseSession *traverseSession, DicNode *dicNode) const
[all...] |
| suggest.cpp | 19 #include "suggest/core/dicnode/dic_node.h"
20 #include "suggest/core/dicnode/dic_node_priority_queue.h"
21 #include "suggest/core/dicnode/dic_node_vector.h"
99 DicNode *topDicNode =
110 DicNode rootNode;
129 DicNode terminals[MAX_RESULTS]; // Avoiding non-POD variable length array
178 DicNode *terminalDicNode = &terminals[terminalIndex];
252 DicNode::managedDelete(terminalDicNode);
262 int Suggest::computeFirstWordConfidence(const DicNode *const terminalDicNode) const {
320 DicNode correctionDicNode
[all...] |
| /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/ |
| patricia_trie_policy.h | 31 class DicNode;
50 void createAndGetAllChildNodes(const DicNode *const dicNode,
134 int createAndGetLeavingChildNode(const DicNode *const dicNode, const int ptNodePos,
|
| patricia_trie_policy.cpp | 21 #include "suggest/core/dicnode/dic_node.h"
22 #include "suggest/core/dicnode/dic_node_vector.h"
28 void PatriciaTriePolicy::createAndGetAllChildNodes(const DicNode *const dicNode,
30 if (!dicNode->hasChildren()) {
33 int nextPos = dicNode->getChildrenPos();
49 nextPos = createAndGetLeavingChildNode(dicNode, nextPos, childDicNodes);
399 int PatriciaTriePolicy::createAndGetLeavingChildNode(const DicNode *const dicNode,
424 childDicNodes->pushLeavingChild(dicNode, ptNodePos, childrenPos, probability
[all...] |
| dynamic_patricia_trie_policy.h | 30 class DicNode;
53 void createAndGetAllChildNodes(const DicNode *const dicNode,
|
| dynamic_patricia_trie_policy.cpp | 24 #include "suggest/core/dicnode/dic_node.h"
25 #include "suggest/core/dicnode/dic_node_vector.h"
48 void DynamicPatriciaTriePolicy::createAndGetAllChildNodes(const DicNode *const dicNode,
50 if (!dicNode->hasChildren()) {
55 readingHelper.initWithPtNodeArrayPos(dicNode->getChildrenPos());
60 // A DecayingDict may have a terminal PtNode that has a terminal DicNode whose
62 // valid terminal DicNode.
66 childDicNodes->pushLeavingChild(dicNode, nodeReader->getHeadPos(),
|
