/packages/inputmethods/LatinIME/native/jni/src/suggest/core/dicnode/ |
H A D | dic_node_utils.cpp | 32 const int *const prevWordsPtNodePos, DicNode *const newRootDicNode) { 33 newRootDicNode->initAsRoot(dictionaryStructurePolicy->getRootPosition(), prevWordsPtNodePos); 89 const int *const prevWordsPtNodePos = dicNode->getPrevWordsTerminalPtNodePos(); local 91 prevWordsPtNodePos, dicNode->getPtNodePos(), unigramProbability); 30 initAsRoot( const DictionaryStructureWithBufferPolicy *const dictionaryStructurePolicy, const int *const prevWordsPtNodePos, DicNode *const newRootDicNode) argument
|
H A D | dic_node.h | 106 // Init for root with prevWordsPtNodePos which is used for n-gram 107 void initAsRoot(const int rootPtNodeArrayPos, const int *const prevWordsPtNodePos) { argument 109 mDicNodeProperties.init(rootPtNodeArrayPos, prevWordsPtNodePos);
|
/packages/inputmethods/LatinIME/native/jni/src/suggest/core/dictionary/ |
H A D | dictionary_utils.cpp | 37 int prevWordsPtNodePos[MAX_PREV_WORD_COUNT_FOR_N_GRAM]; local 39 prevWordsPtNodePos, false /* tryLowerCaseSearch */); 41 DicNodeUtils::initAsRoot(dictionaryStructurePolicy, prevWordsPtNodePos, ¤t.front());
|
H A D | multi_bigram_map.cpp | 38 const int *const prevWordsPtNodePos, const int nextWordPosition, 40 if (!prevWordsPtNodePos || prevWordsPtNodePos[0] == NOT_A_DICT_POS) { 44 mBigramMaps.find(prevWordsPtNodePos[0]); 50 addBigramsForWordPosition(structurePolicy, prevWordsPtNodePos); 51 return mBigramMaps[prevWordsPtNodePos[0]].getBigramProbability(structurePolicy, 54 return readBigramProbabilityFromBinaryDictionary(structurePolicy, prevWordsPtNodePos, 60 const int *const prevWordsPtNodePos) { 61 structurePolicy->iterateNgramEntries(prevWordsPtNodePos, this /* listener */); 89 const int *const prevWordsPtNodePos) { 36 getBigramProbability( const DictionaryStructureWithBufferPolicy *const structurePolicy, const int *const prevWordsPtNodePos, const int nextWordPosition, const int unigramProbability) argument 58 init( const DictionaryStructureWithBufferPolicy *const structurePolicy, const int *const prevWordsPtNodePos) argument 87 addBigramsForWordPosition( const DictionaryStructureWithBufferPolicy *const structurePolicy, const int *const prevWordsPtNodePos) argument 95 readBigramProbabilityFromBinaryDictionary( const DictionaryStructureWithBufferPolicy *const structurePolicy, const int *const prevWordsPtNodePos, const int nextWordPosition, const int unigramProbability) argument [all...] |
H A D | dictionary.cpp | 95 int prevWordsPtNodePos[MAX_PREV_WORD_COUNT_FOR_N_GRAM]; local 97 mDictionaryStructureWithBufferPolicy.get(), prevWordsPtNodePos, 99 mDictionaryStructureWithBufferPolicy->iterateNgramEntries(prevWordsPtNodePos, &listener); 120 nullptr /* prevWordsPtNodePos */, nextWordPos); 122 int prevWordsPtNodePos[MAX_PREV_WORD_COUNT_FOR_N_GRAM]; local 124 mDictionaryStructureWithBufferPolicy.get(), prevWordsPtNodePos, 126 return getDictionaryStructurePolicy()->getProbabilityOfPtNode(prevWordsPtNodePos, nextWordPos);
|
/packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/pt_common/ |
H A D | dynamic_pt_updating_helper.cpp | 87 bool DynamicPtUpdatingHelper::addNgramEntry(const PtNodePosArrayView prevWordsPtNodePos, argument 90 if (prevWordsPtNodePos.empty()) { 93 ASSERT(prevWordsPtNodePos.size() <= MAX_PREV_WORD_COUNT_FOR_N_GRAM); 95 for (size_t i = 0; i < prevWordsPtNodePos.size(); ++i) { 97 prevWordsPtNodePos[i]).getTerminalId(); 99 const WordIdArrayView prevWordIds(prevWordTerminalIds, prevWordsPtNodePos.size()); 105 bool DynamicPtUpdatingHelper::removeNgramEntry(const PtNodePosArrayView prevWordsPtNodePos, argument 107 if (prevWordsPtNodePos.empty()) { 110 ASSERT(prevWordsPtNodePos.size() <= MAX_PREV_WORD_COUNT_FOR_N_GRAM); 112 for (size_t i = 0; i < prevWordsPtNodePos [all...] |
/packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/v2/ |
H A D | patricia_trie_policy.cpp | 300 int PatriciaTriePolicy::getProbabilityOfPtNode(const int *const prevWordsPtNodePos, argument 313 if (prevWordsPtNodePos) { 314 const int bigramsPosition = getBigramsPositionOfPtNode(prevWordsPtNodePos[0]); 328 void PatriciaTriePolicy::iterateNgramEntries(const int *const prevWordsPtNodePos, argument 330 if (!prevWordsPtNodePos) { 333 const int bigramsPosition = getBigramsPositionOfPtNode(prevWordsPtNodePos[0]);
|
/packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/backward/v402/ |
H A D | ver4_patricia_trie_policy.cpp | 135 int Ver4PatriciaTriePolicy::getProbabilityOfPtNode(const int *const prevWordsPtNodePos, argument 144 if (prevWordsPtNodePos) { 145 const int bigramsPosition = getBigramsPositionOfPtNode(prevWordsPtNodePos[0]); 159 void Ver4PatriciaTriePolicy::iterateNgramEntries(const int *const prevWordsPtNodePos, argument 161 if (!prevWordsPtNodePos) { 164 const int bigramsPosition = getBigramsPositionOfPtNode(prevWordsPtNodePos[0]); 281 int prevWordsPtNodePos[MAX_PREV_WORD_COUNT_FOR_N_GRAM]; local 282 prevWordsInfo->getPrevWordsTerminalPtNodePos(this, prevWordsPtNodePos, 285 if (prevWordsPtNodePos[0] == NOT_A_DICT_POS) { 299 prevWordsInfo->getPrevWordsTerminalPtNodePos(this, prevWordsPtNodePos, 341 int prevWordsPtNodePos[MAX_PREV_WORD_COUNT_FOR_N_GRAM]; local [all...] |
/packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/v4/ |
H A D | ver4_patricia_trie_policy.cpp | 125 int Ver4PatriciaTriePolicy::getProbabilityOfPtNode(const int *const prevWordsPtNodePos, argument 134 if (prevWordsPtNodePos) { 135 const int bigramsPosition = getBigramsPositionOfPtNode(prevWordsPtNodePos[0]); 149 void Ver4PatriciaTriePolicy::iterateNgramEntries(const int *const prevWordsPtNodePos, argument 151 if (!prevWordsPtNodePos) { 154 const int bigramsPosition = getBigramsPositionOfPtNode(prevWordsPtNodePos[0]); 292 int prevWordsPtNodePos[MAX_PREV_WORD_COUNT_FOR_N_GRAM]; local 293 prevWordsInfo->getPrevWordsTerminalPtNodePos(this, prevWordsPtNodePos, 295 const auto prevWordsPtNodePosView = PtNodePosArrayView::fromFixedSizeArray(prevWordsPtNodePos); 297 if (prevWordsPtNodePos[ 353 int prevWordsPtNodePos[MAX_PREV_WORD_COUNT_FOR_N_GRAM]; local [all...] |