Searched defs:wordId (Results 1 - 14 of 14) sorted by relevance

/packages/inputmethods/LatinIME/native/jni/tests/dictionary/structure/v4/content/
H A Dlanguage_model_dict_content_test.cpp34 const int wordId = 100; local
36 languageModelDictContent.setProbabilityEntry(wordId, &probabilityEntry);
38 languageModelDictContent.getProbabilityEntry(wordId);
43 EXPECT_TRUE(languageModelDictContent.removeProbabilityEntry(wordId));
44 EXPECT_FALSE(languageModelDictContent.getProbabilityEntry(wordId).isValid());
45 EXPECT_FALSE(languageModelDictContent.removeProbabilityEntry(wordId));
46 EXPECT_TRUE(languageModelDictContent.setProbabilityEntry(wordId, &probabilityEntry));
47 EXPECT_TRUE(languageModelDictContent.getProbabilityEntry(wordId).isValid());
56 const int wordId = 100; local
59 languageModelDictContent.setProbabilityEntry(wordId,
98 const int wordId = 100; local
[all...]
/packages/inputmethods/LatinIME/native/jni/src/dictionary/property/
H A Dngram_context.cpp106 const int wordId = dictStructurePolicy->getWordId(codePointArrayView, local
108 if (wordId != NOT_A_WORD_ID || !tryLowerCaseSearch) {
110 return wordId;
/packages/inputmethods/LatinIME/native/jni/src/suggest/core/dicnode/
H A Ddic_node_vector.h63 const int wordId, const CodePointArrayView mergedCodePoints) {
66 mDicNodes.back().initAsChild(dicNode, childrenPtNodeArrayPos, wordId, mergedCodePoints);
62 pushLeavingChild(const DicNode *const dicNode, const int childrenPtNodeArrayPos, const int wordId, const CodePointArrayView mergedCodePoints) argument
H A Ddic_node.h139 const int wordId, const CodePointArrayView mergedCodePoints) {
145 wordId, newDepth, newLeavingDepth, dicNode->mDicNodeProperties.getPrevWordIds());
138 initAsChild(const DicNode *const dicNode, const int childrenPtNodeArrayPos, const int wordId, const CodePointArrayView mergedCodePoints) argument
/packages/inputmethods/LatinIME/native/jni/src/suggest/core/dicnode/internal/
H A Ddic_node_properties.h40 void init(const int childrenPos, const int nodeCodePoint, const int wordId, argument
44 mWordId = wordId;
/packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/pt_common/
H A Ddynamic_pt_updating_helper.cpp97 const int wordId = local
99 return mPtNodeWriter->addNgramEntry(prevWordIds, wordId, ngramProperty, outAddedNewEntry);
114 const int wordId = local
116 return mPtNodeWriter->removeNgramEntry(prevWordIds, wordId);
/packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/v4/content/
H A Dlanguage_model_dict_content.h48 WordIdAndProbabilityEntry(const int wordId, const ProbabilityEntry &probabilityEntry) argument
49 : mWordId(wordId), mProbabilityEntry(probabilityEntry) {}
153 const WordAttributes getWordAttributes(const WordIdArrayView prevWordIds, const int wordId,
156 ProbabilityEntry getProbabilityEntry(const int wordId) const {
157 return getNgramProbabilityEntry(WordIdArrayView(), wordId);
160 bool setProbabilityEntry(const int wordId, const ProbabilityEntry *const probabilityEntry) { argument
162 return setNgramProbabilityEntry(WordIdArrayView(), wordId, probabilityEntry);
165 bool removeProbabilityEntry(const int wordId) { argument
166 return removeNgramProbabilityEntry(WordIdArrayView(), wordId);
170 const int wordId) cons
[all...]
H A Dlanguage_model_dict_content.cpp43 const int wordId, const bool mustMatchAllPrevWords,
58 const ProbabilityEntry unigramProbabilityEntry = getProbabilityEntry(wordId);
67 const TrieMap::Result result = mTrieMap.get(wordId, bitmapEntryIndices[i]);
118 const WordIdArrayView prevWordIds, const int wordId) const {
123 const TrieMap::Result result = mTrieMap.get(wordId, bitmapEntryIndex);
132 const int wordId, const ProbabilityEntry *const probabilityEntry) {
133 if (wordId == Ver4DictConstants::NOT_A_TERMINAL_ID) {
140 return mTrieMap.put(wordId, probabilityEntry->encode(mHasHistoricalInfo), bitmapEntryIndex);
144 const int wordId) {
150 return mTrieMap.remove(wordId, bitmapEntryInde
42 getWordAttributes(const WordIdArrayView prevWordIds, const int wordId, const bool mustMatchAllPrevWords, const HeaderPolicy *const headerPolicy) const argument
131 setNgramProbabilityEntry(const WordIdArrayView prevWordIds, const int wordId, const ProbabilityEntry *const probabilityEntry) argument
143 removeNgramProbabilityEntry(const WordIdArrayView prevWordIds, const int wordId) argument
179 const int wordId = entry.key(); local
220 updateAllEntriesOnInputWord(const WordIdArrayView prevWordIds, const int wordId, const bool isValid, const HistoricalInfo historicalInfo, const HeaderPolicy *const headerPolicy, MutableEntryCounters *const entryCountersToUpdate) argument
[all...]
/packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/v4/
H A Dver4_patricia_trie_node_writer.cpp206 bool Ver4PatriciaTrieNodeWriter::addNgramEntry(const WordIdArrayView prevWordIds, const int wordId, argument
211 languageModelDictContent->getNgramProbabilityEntry(prevWordIds, wordId);
214 prevWordIds, wordId, &probabilityEntryOfNgramProperty)) {
215 AKLOGE("Cannot add new ngram entry. prevWordId[0]: %d, prevWordId.size(): %zd, wordId: %d",
216 prevWordIds[0], prevWordIds.size(), wordId);
226 const int wordId) {
229 return languageModelDictContent->removeNgramProbabilityEntry(prevWordIds, wordId);
225 removeNgramEntry(const WordIdArrayView prevWordIds, const int wordId) argument
H A Dver4_patricia_trie_policy.cpp61 const int wordId = isTerminal ? ptNodeParams.getTerminalId() : NOT_A_WORD_ID; local
63 wordId, ptNodeParams.getCodePointArrayView());
72 int Ver4PatriciaTriePolicy::getCodePointsAndReturnCodePointCount(const int wordId, argument
76 mBuffers->getTerminalPositionLookupTable()->getTerminalPtNodePosition(wordId);
108 const WordIdArrayView prevWordIds, const int wordId,
110 if (wordId == NOT_A_WORD_ID) {
113 return mBuffers->getLanguageModelDictContent()->getWordAttributes(prevWordIds, wordId,
118 const int wordId) const {
119 if (wordId == NOT_A_WORD_ID || prevWordIds.contains(NOT_A_WORD_ID)) {
123 mBuffers->getLanguageModelDictContent()->getWordAttributes(prevWordIds, wordId,
107 getWordAttributesInContext( const WordIdArrayView prevWordIds, const int wordId, MultiBigramMap *const multiBigramMap) const argument
223 const int wordId = getWordId(codePointArrayView, false /* forceLowerCaseSearch */); local
252 const int wordId = getWordId(wordCodePoints, false /* forceLowerCaseSearch */); local
317 const int wordId = getWordId(CodePointArrayView(*ngramProperty->getTargetCodePoints()), local
359 const int wordId = getWordId(wordCodePoints, false /* forceLowerCaseSearch */); local
382 int wordId = getWordId(wordCodePoints, false /* tryLowerCaseSearch */); local
506 const int wordId = getWordId(wordCodePoints, false /* forceLowerCaseSearch */); local
[all...]
/packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/backward/v402/
H A Dver4_patricia_trie_node_writer.cpp234 bool Ver4PatriciaTrieNodeWriter::addNgramEntry(const WordIdArrayView prevWordIds, const int wordId, argument
236 if (!mBigramPolicy->addNewEntry(prevWordIds[0], wordId, ngramProperty, outAddedNewEntry)) {
237 AKLOGE("Cannot add new bigram entry. prevWordId: %d, wordId: %d",
238 prevWordIds[0], wordId);
257 const int wordId) {
258 return mBigramPolicy->removeEntry(prevWordIds[0], wordId);
256 removeNgramEntry(const WordIdArrayView prevWordIds, const int wordId) argument
H A Dver4_patricia_trie_policy.cpp81 const int wordId = isTerminal ? ptNodeParams.getHeadPos() : NOT_A_WORD_ID; local
83 wordId, ptNodeParams.getCodePointArrayView());
91 int Ver4PatriciaTriePolicy::getCodePointsAndReturnCodePointCount(const int wordId, argument
94 const int ptNodePos = getTerminalPtNodePosFromWordId(wordId);
119 const WordIdArrayView prevWordIds, const int wordId,
121 if (wordId == NOT_A_WORD_ID) {
124 const int ptNodePos = getTerminalPtNodePosFromWordId(wordId);
128 prevWordIds, wordId, ptNodeParams.getProbability());
132 const int probability = getProbabilityOfWord(prevWordIds, wordId);
161 const int wordId) cons
118 getWordAttributesInContext( const WordIdArrayView prevWordIds, const int wordId, MultiBigramMap *const multiBigramMap) const argument
[all...]
/packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/v2/
H A Dpatricia_trie_policy.cpp60 int PatriciaTriePolicy::getCodePointsAndReturnCodePointCount(const int wordId, argument
62 return getCodePointsAndProbabilityAndReturnCodePointCount(wordId, maxCodePointCount,
76 * wordId: Id of the word we are searching for.
83 const int wordId, const int maxCodePointCount, int *const outCodePoints,
85 const int ptNodePos = getTerminalPtNodePosFromWordId(wordId);
294 const WordIdArrayView prevWordIds, const int wordId,
296 if (wordId == NOT_A_WORD_ID) {
299 const int ptNodePos = getTerminalPtNodePosFromWordId(wordId);
304 prevWordIds, wordId, ptNodeParams.getProbability());
308 const int bigramProbability = getProbabilityOfWord(prevWordIds, wordId);
82 getCodePointsAndProbabilityAndReturnCodePointCount( const int wordId, const int maxCodePointCount, int *const outCodePoints, int *const outUnigramProbability) const argument
293 getWordAttributesInContext( const WordIdArrayView prevWordIds, const int wordId, MultiBigramMap *const multiBigramMap) const argument
419 const int wordId = PatriciaTrieReadingUtils::isTerminal(flags) ? ptNodePos : NOT_A_WORD_ID; local
428 const int wordId = getWordId(wordCodePoints, false /* forceLowerCaseSearch */); local
[all...]
/packages/inputmethods/LatinIME/native/jni/src/suggest/core/dictionary/
H A Ddictionary.cpp116 const int wordId = mDictionaryStructureWithBufferPolicy->getWordId(codePoints, local
118 if (wordId == NOT_A_WORD_ID) return NOT_A_PROBABILITY;
120 return getDictionaryStructurePolicy()->getProbabilityOfWord(WordIdArrayView(), wordId);
126 return getDictionaryStructurePolicy()->getProbabilityOfWord(prevWordIds, wordId);

Completed in 199 milliseconds