| /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) {
31 DicNode &DicNode::operator=(const DicNode &dicNode)
[all...] |
| dic_node_utils.cpp | 17 #include "suggest/core/dicnode/dic_node_utils.h"
20 #include "suggest/core/dicnode/dic_node.h"
21 #include "suggest/core/dicnode/dic_node_vector.h"
31 const WordIdArrayView prevWordIds, DicNode *const newRootDicNode) {
37 const DicNode *const prevWordLastDicNode, DicNode *const newRootDicNode) {
42 /* static */ void DicNodeUtils::initByCopy(const DicNode *const srcDicNode,
43 DicNode *const destDicNode) {
50 /* static */ void DicNodeUtils::getAllChildDicNodes(const DicNode *dicNode,
[all...] |
| dic_node_pool.h | 25 #include "suggest/core/dicnode/dic_node.h"
44 for (auto &dicNode : mDicNodes) {
45 mPooledDicNodes.emplace_back(&dicNode);
49 // Get a DicNode instance from the pool. The instance has to be returned by returnInstance().
50 DicNode *getInstance() {
54 DicNode *const dicNode = mPooledDicNodes.back();
56 return dicNode;
61 void placeBackInstance(DicNode *dicNode) {
[all...] |
| dic_node_priority_queue.h | 25 #include "suggest/core/dicnode/dic_node.h"
26 #include "suggest/core/dicnode/dic_node_pool.h"
64 AK_FORCE_INLINE void copyPush(const DicNode *const dicNode) {
65 DicNode *const pooledDicNode = newDicNode(dicNode);
82 AK_FORCE_INLINE void copyPop(DicNode *const dest) {
87 DicNode *node = mDicNodesQueue.top();
102 AK_FORCE_INLINE static bool compareDicNode(const DicNode *const left,
103 const DicNode *const right)
[all...] |
| dic_node_utils.h | 25 class DicNode;
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)
[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.
51 // The size of current active DicNode queue doesn't have to be changed.
53 // nextActiveSize is used to limit the next iteration's active DicNode size.
57 // The size of cached DicNode queue doesn't have to be changed.
88 AK_FORCE_INLINE void copyPushTerminal(DicNode *dicNode) {
89 mTerminalDicNodes->copyPush(dicNode);
92 AK_FORCE_INLINE void copyPushActive(DicNode *dicNode)
[all...] |
| dic_node.h | 21 #include "suggest/core/dicnode/dic_node_profiler.h"
22 #include "suggest/core/dicnode/dic_node_utils.h"
23 #include "suggest/core/dicnode/internal/dic_node_state.h"
24 #include "suggest/core/dicnode/internal/dic_node_properties.h"
76 class DicNode {
77 // Caveat: We define Weighting as a friend class of DicNode to let Weighting change
78 // the distance of DicNode.
80 // This is an exception to explicitly hide DicNode::addCost() from all classes but Weighting.
88 AK_FORCE_INLINE DicNode()
95 DicNode(const DicNode &dicNode)
[all...] |
| dic_node_vector.h | 23 #include "suggest/core/dicnode/dic_node.h"
56 void pushPassingChild(const DicNode *dicNode) {
59 mDicNodes.back().initAsPassingChild(dicNode);
62 void pushLeavingChild(const DicNode *const dicNode, const int childrenPtNodeArrayPos,
66 mDicNodes.back().initAsChild(dicNode, childrenPtNodeArrayPos, wordId, mergedCodePoints);
69 DicNode *operator[](const int id) {
74 DicNode *front() {
81 std::vector<DicNode> mDicNodes
[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 | 25 class DicNode;
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
[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"
30 static inline void profile(const CorrectionType correctionType, DicNode *const node) {
77 const DicNode *const parentDicNode, DicNode *const dicNode,
83 traverseSession, parentDicNode, dicNode, &inputStateG);
85 traverseSession, parentDicNode, dicNode, multiBigramMap);
87 traverseSession, parentDicNode, dicNode);
[all...] |
| scoring.h | 24 class DicNode;
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/policyimpl/typing/ |
| typing_traversal.h | 23 #include "suggest/core/dicnode/dic_node.h"
24 #include "suggest/core/dicnode/dic_node_vector.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())
[all...] |
| typing_weighting.h | 21 #include "suggest/core/dicnode/dic_node_utils.h"
31 class DicNode;
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
[all...] |
| typing_weighting.cpp | 19 #include "suggest/core/dicnode/dic_node.h"
28 const DicTraverseSession *const traverseSession, const DicNode *const parentDicNode,
29 const DicNode *const dicNode) const {
32 if (isProximityDicNode(traverseSession, dicNode)) {
34 } else if (dicNode->isInDigraph()) {
41 dicNode->getInputIndex(0));
42 const int nodeCodePoint = dicNode->getNodeCodePoint();
|
| typing_scoring.h | 28 class DicNode;
40 DicTraverseSession *const traverseSession, DicNode *const terminals,
97 const DicNode *const terminalDicNode) const {
106 const DicNode *const dicNode) const {
108 dicNode->getOutputWordBuf(), dicNode->getNodeCodePointCount());
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/ |
| suggest.h | 35 class DicNode;
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
[all...] |
| suggest.cpp | 21 #include "suggest/core/dicnode/dic_node.h"
22 #include "suggest/core/dicnode/dic_node_priority_queue.h"
23 #include "suggest/core/dicnode/dic_node_vector.h"
96 DicNode rootNode;
110 DicNode correctionDicNode;
122 DicNode dicNode;
123 traverseSession->getDicTraverseCache()->popActive(&dicNode);
124 if (dicNode.isTotalInputSizeExceedingLimit()) {
128 const int point0Index = dicNode.getInputIndex(0)
[all...] |
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/dictionary/ |
| dictionary_utils.cpp | 21 #include "suggest/core/dicnode/dic_node.h"
22 #include "suggest/core/dicnode/dic_node_priority_queue.h"
23 #include "suggest/core/dicnode/dic_node_vector.h"
33 std::vector<DicNode> current;
34 std::vector<DicNode> next;
46 for (const DicNode &dicNode : current) {
47 if (dicNode.isInDigraph() && dicNode.getNodeCodePoint() == baseLowerCodePoint) {
48 next.emplace_back(dicNode);
[all...] |
| /packages/inputmethods/LatinIME/native/jni/tests/suggest/core/dicnode/ |
| dic_node_pool_test.cpp | 17 #include "suggest/core/dicnode/dic_node_pool.h"
38 DicNode *const dicNode = dicNodePool.getInstance();
39 EXPECT_NE(nullptr, dicNode);
41 dicNodePool.placeBackInstance(dicNode);
42 EXPECT_EQ(dicNode, dicNodePool.getInstance());
|
| /packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/v2/ |
| patricia_trie_policy.h | 37 class DicNode;
59 void createAndGetAllChildDicNodes(const DicNode *const dicNode,
171 int createAndGetLeavingChildNode(const DicNode *const dicNode, const int ptNodePos,
|
| patricia_trie_policy.cpp | 20 #include "suggest/core/dicnode/dic_node.h"
21 #include "suggest/core/dicnode/dic_node_vector.h"
33 void PatriciaTriePolicy::createAndGetAllChildDicNodes(const DicNode *const dicNode,
35 if (!dicNode->hasChildren()) {
38 int nextPos = dicNode->getChildrenPtNodeArrayPos();
56 nextPos = createAndGetLeavingChildNode(dicNode, nextPos, childDicNodes);
402 int PatriciaTriePolicy::createAndGetLeavingChildNode(const DicNode *const dicNode,
420 childDicNodes->pushLeavingChild(dicNode, childrenPos, wordId
[all...] |
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/session/ |
| dic_traverse_session.h | 25 #include "suggest/core/dicnode/dic_nodes_cache.h"
109 ProximityType getProximityTypeG(const DicNode *const dicNode, const int childCodePoint) const {
115 const int pointerId = dicNode->getInputIndex(i);
|
| /packages/inputmethods/LatinIME/native/jni/src/dictionary/interface/ |
| dictionary_structure_with_buffer_policy.h | 31 class DicNode;
51 virtual void createAndGetAllChildDicNodes(const DicNode *const dicNode,
|
| /packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/backward/v402/ |
| ver4_patricia_trie_policy.h | 53 class DicNode;
86 void createAndGetAllChildDicNodes(const DicNode *const dicNode,
|
