Searched refs:mBigramPolicy (Results 1 – 6 of 6) sorted by relevance
| /packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/backward/v402/ |
| D | ver4_patricia_trie_policy.h | 69 mBigramPolicy(mBuffers->getMutableBigramDictContent(), in Ver4PatriciaTriePolicy()
76 &mPtNodeArrayReader, &mBigramPolicy, &mShortcutPolicy), in Ver4PatriciaTriePolicy()
158 Ver4BigramListPolicy mBigramPolicy; variable
|
| D | ver4_patricia_trie_node_writer.cpp | 236 if (!mBigramPolicy->addNewEntry(prevWordIds[0], wordId, ngramProperty, outAddedNewEntry)) { in addNgramEntry()
258 return mBigramPolicy->removeEntry(prevWordIds[0], wordId); in removeNgramEntry()
263 return mBigramPolicy->updateAllBigramEntriesAndDeleteUselessEntries( in updateAllBigramEntriesAndDeleteUselessEntries()
302 *outBigramEntryCount = mBigramPolicy->getBigramEntryConut( in updateAllPositionFields()
|
| D | ver4_patricia_trie_node_writer.h | 66 mBigramPolicy(bigramPolicy), mShortcutPolicy(shortcutPolicy) {} in Ver4PatriciaTrieNodeWriter()
144 Ver4BigramListPolicy *const mBigramPolicy; variable
|
| D | ver4_patricia_trie_policy.cpp | 183 BinaryDictionaryBigramsIterator bigramsIt(&mBigramPolicy, bigramsPosition); in getProbabilityOfWord()
210 BinaryDictionaryBigramsIterator bigramsIt(&mBigramPolicy, bigramsPosition); in iterateNgramEntries()
|
| /packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/v2/ |
| D | ver2_patricia_trie_node_reader.h | 38 : mBuffer(buffer), mBigramPolicy(bigramPolicy), mShortcutPolicy(shortcutPolicy), in Ver2ParticiaTrieNodeReader()
47 const DictionaryBigramsStructurePolicy *const mBigramPolicy; variable
|
| D | ver2_patricia_trie_node_reader.cpp | 41 mBigramPolicy, mCodePointTable, &flags, &mergedNodeCodePointCount, mergedNodeCodePoints, in fetchPtNodeParamsInBufferFromPtNodePos()
|