| /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/ |
| dynamic_patricia_trie_node_reader.cpp | 62 mProbabilityFieldPos = NOT_A_DICT_POS;
71 if (usesAdditionalBuffer && mChildrenPos != NOT_A_DICT_POS) {
74 if (mSiblingPos == NOT_A_DICT_POS) {
78 mBigramLinkedNodePos = NOT_A_DICT_POS;
88 mShortcutPos = NOT_A_DICT_POS;
94 mBigramPos = NOT_A_DICT_POS;
97 if (mSiblingPos == NOT_A_DICT_POS) {
110 mHeadPos = NOT_A_DICT_POS;
112 mParentPos = NOT_A_DICT_POS;
114 mProbabilityFieldPos = NOT_A_DICT_POS;
[all...] |
| dynamic_patricia_trie_node_reader.h | 42 mShortcutsPolicy(shortcutsPolicy), mHeadPos(NOT_A_DICT_POS), mFlags(0),
43 mParentPos(NOT_A_DICT_POS), mCodePointCount(0), mProbabilityFieldPos(NOT_A_DICT_POS),
44 mProbability(NOT_A_PROBABILITY), mChildrenPosFieldPos(NOT_A_DICT_POS),
45 mChildrenPos(NOT_A_DICT_POS), mBigramLinkedNodePos(NOT_A_DICT_POS),
46 mShortcutPos(NOT_A_DICT_POS), mBigramPos(NOT_A_DICT_POS),
47 mSiblingPos(NOT_A_DICT_POS) {}
59 mSiblingPos = NOT_A_DICT_POS;
[all...] |
| dynamic_patricia_trie_reading_helper.h | 77 return mReadingState.mPos == NOT_A_DICT_POS;
82 if (ptNodeArrayPos == NOT_A_DICT_POS) {
83 mReadingState.mPos = NOT_A_DICT_POS;
90 mReadingState.mPosOfLastForwardLinkField = NOT_A_DICT_POS;
101 if (ptNodePos == NOT_A_DICT_POS) {
102 mReadingState.mPos = NOT_A_DICT_POS;
110 mReadingState.mPosOfLastForwardLinkField = NOT_A_DICT_POS;
111 mReadingState.mPosOfLastPtNodeArrayHead = NOT_A_DICT_POS;
172 mReadingState.mPosOfLastForwardLinkField = NOT_A_DICT_POS;
179 mReadingState.mPos = NOT_A_DICT_POS;
[all...] |
| dynamic_patricia_trie_reading_utils.cpp | 50 return NOT_A_DICT_POS;
64 return NOT_A_DICT_POS;
|
| dynamic_patricia_trie_gc_event_listeners.cpp | 51 mBuffer, NOT_A_DICT_POS /* childrenPosition */, &writingPos)) {
74 if (pos != NOT_A_DICT_POS) {
107 mBufferToWrite, NOT_A_DICT_POS /* forwardLinkPos */, &writingPos)) {
126 node->getHeadPos(), NOT_A_DICT_POS));
145 if (parentPos != NOT_A_DICT_POS) {
161 if (childrenPos != NOT_A_DICT_POS) {
176 if (bigramsPos != NOT_A_DICT_POS) {
|
| dynamic_patricia_trie_policy.cpp | 143 return NOT_A_DICT_POS;
152 return NOT_A_DICT_POS;
159 return NOT_A_DICT_POS;
179 if (ptNodePos == NOT_A_DICT_POS) {
192 if (ptNodePos == NOT_A_DICT_POS) {
193 return NOT_A_DICT_POS;
199 return NOT_A_DICT_POS;
205 if (ptNodePos == NOT_A_DICT_POS) {
206 return NOT_A_DICT_POS;
212 return NOT_A_DICT_POS;
[all...] |
| patricia_trie_policy.cpp | 234 // dictionary. If no match is found, it returns NOT_A_DICT_POS.
243 if (wordPos >= length) return NOT_A_DICT_POS;
251 if (0 >= ptNodeCount) return NOT_A_DICT_POS;
260 // no match and we can return NOT_A_DICT_POS. So we will check all the
271 if (wordPos >= length) return NOT_A_DICT_POS;
272 if (inWord[wordPos] != character) return NOT_A_DICT_POS;
289 return NOT_A_DICT_POS;
335 if (ptNodePos == NOT_A_DICT_POS) {
357 if (ptNodePos == NOT_A_DICT_POS) {
358 return NOT_A_DICT_POS;
[all...] |
| dynamic_patricia_trie_writing_helper.cpp | 42 int parentPos = NOT_A_DICT_POS;
115 if (nodeReader.getBigramsPos() != NOT_A_DICT_POS) {
131 nodeReader.getShortcutPos() != NOT_A_DICT_POS, true /* hasBigrams */,
144 if (nodeReader.getBigramsPos() == NOT_A_DICT_POS) {
293 if (originalShortcutListPos != NOT_A_DICT_POS) {
302 if (originalBigramListPos != NOT_A_DICT_POS) {
312 originalShortcutListPos != NOT_A_DICT_POS /* hasShortcutTargets */,
329 NOT_A_DICT_POS /* childrenPos */, NOT_A_DICT_POS /* originalBigramsPos */,
330 NOT_A_DICT_POS /* originalShortcutPos */, writingPos)
[all...] |
| dynamic_patricia_trie_reading_helper.cpp | 170 mReadingState.mPos = NOT_A_DICT_POS;
198 mReadingState.mPos = NOT_A_DICT_POS;
215 mReadingState.mPos = NOT_A_DICT_POS;
235 mReadingState.mPos = NOT_A_DICT_POS;
|
| dynamic_patricia_trie_writing_utils.cpp | 45 return writeForwardLinkPositionAndAdvancePosition(buffer, NOT_A_DICT_POS /* forwardLinkPos */,
128 if (targetPos == NOT_A_DICT_POS) {
|
| dynamic_patricia_trie_gc_event_listeners.h | 128 mPtNodeArraySizeFieldPos(NOT_A_DICT_POS) {};
|
| patricia_trie_reading_utils.cpp | 128 return NOT_A_DICT_POS;
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/dictionary/ |
| bigram_dictionary.cpp | 104 if (NOT_A_DICT_POS == pos) {
110 if (NOT_A_DICT_POS == pos) return 0;
119 if (bigramsIt.getBigramPos() == NOT_A_DICT_POS) {
143 // If the word is not found or has no bigrams, this function returns NOT_A_DICT_POS.
146 if (0 >= prevWordLength) return NOT_A_DICT_POS;
149 if (NOT_A_DICT_POS == pos) return NOT_A_DICT_POS;
157 if (NOT_A_DICT_POS == pos) return NOT_A_PROBABILITY;
160 if (NOT_A_DICT_POS == nextWordPos) return NOT_A_PROBABILITY;
|
| binary_dictionary_bigrams_iterator.h | 30 mBigramPos(NOT_A_DICT_POS), mProbability(NOT_A_PROBABILITY),
31 mHasNext(pos != NOT_A_DICT_POS) {}
|
| binary_dictionary_shortcut_iterator.h | 32 mHasNextShortcutTarget(shortcutPos != NOT_A_DICT_POS) {}
|
| multi_bigram_map.h | 76 if (bigramsIt.getBigramPos() == NOT_A_DICT_POS) {
|
| dictionary.cpp | 93 if (NOT_A_DICT_POS == pos) {
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/bigram/ |
| dynamic_bigram_list_policy.cpp | 41 if (usesAdditionalBuffer && originalBigramPos != NOT_A_DICT_POS) {
48 *outBigramPos = NOT_A_DICT_POS;
78 int lastWrittenEntryPos = NOT_A_DICT_POS;
91 if (originalBigramPos == NOT_A_DICT_POS) {
99 if (bigramPos == NOT_A_DICT_POS) {
112 if (lastWrittenEntryPos != NOT_A_DICT_POS) {
151 if (originalBigramPos == NOT_A_DICT_POS) {
162 || bigramTargetNodePos == NOT_A_DICT_POS) {
165 NOT_A_DICT_POS /* targetPtNodePos */, &bigramEntryPos)) {
208 if (bigramTargetPtNodePos == NOT_A_DICT_POS) {
[all...] |
| bigram_list_read_write_utils.cpp | 83 return NOT_A_DICT_POS;
170 if (targetPtNodePos == NOT_A_DICT_POS) {
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/shortcut/ |
| shortcut_list_policy.h | 36 if (pos == NOT_A_DICT_POS) {
37 return NOT_A_DICT_POS;
|
| dynamic_shortcut_list_policy.h | 40 if (pos == NOT_A_DICT_POS) {
41 return NOT_A_DICT_POS;
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/session/ |
| dic_traverse_session.cpp | 38 mPrevWordPos = NOT_A_DICT_POS;
44 if (mPrevWordPos == NOT_A_DICT_POS) {
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/dicnode/ |
| dic_node_utils.cpp | 92 if (NOT_A_DICT_POS == wordPos || NOT_A_DICT_POS == prevWordPos) {
|
| dic_node.h | 115 NOT_A_DICT_POS /* pos */, rootGroupPos, NOT_A_CODE_POINT /* nodeCodePoint */,
128 NOT_A_DICT_POS /* pos */, rootGroupPos, NOT_A_CODE_POINT /* nodeCodePoint */,
237 return mDicNodeState.mDicNodeStatePrevWord.getPrevWordNodePos() == NOT_A_DICT_POS;
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/dicnode/internal/ |
| dic_node_state_prevword.h | 33 mPrevWordNodePos(NOT_A_DICT_POS), mSecondWordFirstInputIndex(NOT_AN_INDEX) {
44 mPrevWordNodePos = NOT_A_DICT_POS;
|
