| /packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/backward/v402/bigram/ |
| D | ver4_bigram_list_policy.cpp | 58 *outHasNext = bigramEntry.hasNext(); in getNextBigram()
174 bool hasNext = true; in updateAllBigramEntriesAndDeleteUselessEntries() local
176 while (hasNext) { in updateAllBigramEntriesAndDeleteUselessEntries()
180 hasNext = bigramEntry.hasNext(); in updateAllBigramEntriesAndDeleteUselessEntries()
223 bool hasNext = true; in getBigramEntryConut() local
225 while (hasNext) { in getBigramEntryConut()
228 hasNext = bigramEntry.hasNext(); in getBigramEntryConut()
241 bool hasNext = true; in getEntryPosToUpdate() local
244 while (hasNext) { in getEntryPosToUpdate()
248 hasNext = bigramEntry.hasNext(); in getEntryPosToUpdate()
[all …]
|
| /packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/v4/content/ |
| D | shortcut_dict_content.cpp | 101 bool hasNext = true; in copyShortcutListFromDictContent() local
105 while (hasNext) { in copyShortcutListFromDictContent()
109 codePoints, &codePointCount, &probability, &hasNext, &readingPos); in copyShortcutListFromDictContent()
111 hasNext, &writingPos)) { in copyShortcutListFromDictContent()
123 const bool hasNext = shortcutFlags & Ver4DictConstants::SHORTCUT_HAS_NEXT_MASK; in setProbability() local
124 const int shortcutFlagsToWrite = createAndGetShortcutFlags(probability, hasNext); in setProbability()
130 const int codePointCount, const int probability, const bool hasNext, in writeShortcutEntryAndAdvancePosition() argument
133 const int shortcutFlags = createAndGetShortcutFlags(probability, hasNext); in writeShortcutEntryAndAdvancePosition()
150 bool hasNext = true; in findShortcutEntryAndGetPos() local
153 while (hasNext) { in findShortcutEntryAndGetPos()
[all …]
|
| D | shortcut_dict_content.h | 70 const int probability, const bool hasNext, const int shortcutEntryPos) { in writeShortcutEntry() argument
73 hasNext, &writingPos); in writeShortcutEntry()
77 const int codePointCount, const int probability, const bool hasNext,
89 int createAndGetShortcutFlags(const int probability, const bool hasNext) const;
|
| /packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/backward/v402/content/ |
| D | bigram_dict_content.cpp | 46 const bool hasNext = (bigramFlags & Ver4DictConstants::BIGRAM_HAS_NEXT_MASK) != 0; in getBigramEntryAndAdvancePosition() local
71 return BigramEntry(hasNext, probability, &historicalInfo, targetTerminalId); in getBigramEntryAndAdvancePosition()
73 return BigramEntry(hasNext, probability, targetTerminalId); in getBigramEntryAndAdvancePosition()
80 const int bigramFlags = createAndGetBigramFlags(bigramEntryToWrite->hasNext()); in writeBigramEntryAndAdvancePosition()
131 bool hasNext = true; in copyBigramList() local
132 while (hasNext) { in copyBigramList()
134 hasNext = bigramEntry.hasNext(); in copyBigramList()
135 if (!hasNext) { in copyBigramList()
186 bool hasNext = true; in runGCBigramList() local
190 while (hasNext) { in runGCBigramList()
[all …]
|
| D | shortcut_dict_content.cpp | 116 bool hasNext = true; in copyShortcutListFromDictContent() local
120 while (hasNext) { in copyShortcutListFromDictContent()
124 codePoints, &codePointCount, &probability, &hasNext, &readingPos); in copyShortcutListFromDictContent()
126 hasNext, &writingPos)) { in copyShortcutListFromDictContent()
138 const bool hasNext = shortcutFlags & Ver4DictConstants::SHORTCUT_HAS_NEXT_MASK; in setProbability() local
139 const int shortcutFlagsToWrite = createAndGetShortcutFlags(probability, hasNext); in setProbability()
145 const int codePointCount, const int probability, const bool hasNext, in writeShortcutEntryAndAdvancePosition() argument
148 const int shortcutFlags = createAndGetShortcutFlags(probability, hasNext); in writeShortcutEntryAndAdvancePosition()
165 bool hasNext = true; in findShortcutEntryAndGetPos() local
168 while (hasNext) { in findShortcutEntryAndGetPos()
[all …]
|
| D | bigram_entry.h | 42 BigramEntry(const bool hasNext, const int probability, const int targetTerminalId) in BigramEntry() argument
43 : mHasNext(hasNext), mProbability(probability), mHistoricalInfo(), in BigramEntry()
47 BigramEntry(const bool hasNext, const int probability, in BigramEntry() argument
49 : mHasNext(hasNext), mProbability(probability), mHistoricalInfo(*historicalInfo), in BigramEntry()
56 const BigramEntry updateHasNextAndGetEntry(const bool hasNext) const { in updateHasNextAndGetEntry() argument
57 return BigramEntry(hasNext, mProbability, &mHistoricalInfo, mTargetTerminalId); in updateHasNextAndGetEntry()
77 bool hasNext() const { in hasNext() function
|
| D | shortcut_dict_content.h | 77 const int probability, const bool hasNext, const int shortcutEntryPos) { in writeShortcutEntry() argument
80 hasNext, &writingPos); in writeShortcutEntry()
84 const int codePointCount, const int probability, const bool hasNext,
96 int createAndGetShortcutFlags(const int probability, const bool hasNext) const;
|
| D | bigram_dict_content.h | 107 int createAndGetBigramFlags(const bool hasNext) const { in createAndGetBigramFlags() argument
108 return hasNext ? Ver4DictConstants::BIGRAM_HAS_NEXT_MASK : 0; in createAndGetBigramFlags()
|
| /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/filters/ |
| D | FilterVignetteRepresentation.java | 212 while (sreader.hasNext()) { in deSerializeRepresentation()
216 sreader.hasNext(); in deSerializeRepresentation()
218 sreader.hasNext(); in deSerializeRepresentation()
220 sreader.hasNext(); in deSerializeRepresentation()
222 sreader.hasNext(); in deSerializeRepresentation()
224 sreader.hasNext(); in deSerializeRepresentation()
228 sreader.hasNext(); in deSerializeRepresentation()
230 sreader.hasNext(); in deSerializeRepresentation()
232 sreader.hasNext(); in deSerializeRepresentation()
234 sreader.hasNext(); in deSerializeRepresentation()
[all …]
|
| D | FilterChanSatRepresentation.java | 186 while (sreader.hasNext()) { in deSerializeRepresentation()
190 sreader.hasNext(); in deSerializeRepresentation()
192 sreader.hasNext(); in deSerializeRepresentation()
194 sreader.hasNext(); in deSerializeRepresentation()
196 sreader.hasNext(); in deSerializeRepresentation()
198 sreader.hasNext(); in deSerializeRepresentation()
200 sreader.hasNext(); in deSerializeRepresentation()
202 sreader.hasNext(); in deSerializeRepresentation()
204 sreader.hasNext(); in deSerializeRepresentation()
|
| D | FilterGradRepresentation.java | 463 while (sreader.hasNext()) { in deSerializeRepresentation()
470 sreader.hasNext(); in deSerializeRepresentation()
472 sreader.hasNext(); in deSerializeRepresentation()
474 sreader.hasNext(); in deSerializeRepresentation()
476 sreader.hasNext(); in deSerializeRepresentation()
478 sreader.hasNext(); in deSerializeRepresentation()
480 sreader.hasNext(); in deSerializeRepresentation()
482 sreader.hasNext(); in deSerializeRepresentation()
484 sreader.hasNext(); in deSerializeRepresentation()
|
| D | FilterCurvesRepresentation.java | 145 while (sreader.hasNext()) { in deSerializeRepresentation()
153 while (sreader.hasNext()) { in deSerializeRepresentation()
155 sreader.hasNext(); in deSerializeRepresentation()
157 sreader.hasNext(); in deSerializeRepresentation()
|
| /packages/apps/Bluetooth/src/com/android/bluetooth/gatt/ |
| D | ContextMap.java | 172 while (i.hasNext()) { in remove()
190 while (i.hasNext()) { in remove()
220 while (i.hasNext()) { in removeConnection()
235 while (i.hasNext()) { in getById()
248 while (i.hasNext()) { in getByUuid()
261 while (i.hasNext()) { in getByName()
293 while (i.hasNext()) { in getConnectedDevices()
305 while (ii.hasNext()) { in getByConnId()
322 while (i.hasNext()) { in connIdByAddress()
335 while (i.hasNext()) { in addressByConnId()
[all …]
|
| /packages/apps/TvSettings/Settings/src/com/android/tv/settings/dialog/old/ |
| D | Action.java | 141 public Builder hasNext(boolean hasNext) { in hasNext() argument
142 mHasNext = hasNext; in hasNext()
164 boolean hasNext, boolean infoOnly, Intent intent, int checkSetId, boolean enabled) { in Action() argument
173 mHasNext = hasNext; in Action()
278 public boolean hasNext() { in hasNext() method in Action
|
| /packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/backward/v402/ |
| D | ver4_patricia_trie_policy.cpp | 184 while (bigramsIt.hasNext()) { in getProbabilityOfWord()
211 while (bigramsIt.hasNext()) { in iterateNgramEntries()
570 bool hasNext = true; in getWordProperty() local
572 while (hasNext) { in getWordProperty()
575 hasNext = bigramEntry.hasNext(); in getWordProperty()
606 bool hasNext = true; in getWordProperty() local
607 while (hasNext) { in getWordProperty()
611 &shortcutTargetLength, &shortcutProbability, &hasNext, &shortcutPos); in getWordProperty()
|
| D | ver4_patricia_trie_writing_helper.cpp | 254 bool hasNext = true; in truncateBigrams() local
256 while (hasNext) { in truncateBigrams()
260 hasNext = bigramEntry.hasNext(); in truncateBigrams()
|
| /packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/v2/ |
| D | patricia_trie_policy.cpp | 356 while (bigramsIt.hasNext()) { in getProbabilityOfWord()
376 while (bigramsIt.hasNext()) { in iterateNgramEntries()
441 while (bigramsIt.hasNext()) { in getWordProperty()
464 bool hasNext = true; in getWordProperty() local
465 while (hasNext) { in getWordProperty()
468 hasNext = ShortcutListReadingUtils::hasNext(shortcutFlags); in getWordProperty()
|
| /packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/v4/shortcut/ |
| D | ver4_shortcut_list_policy.h | 88 bool hasNext = false; in addNewShortcut() local
90 0 /* outCodePointCount */ , 0 /* probability */, &hasNext, entryPos); in addNewShortcut()
92 codePointCount, probability, hasNext, entryPos)) { in addNewShortcut()
|
| /packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/backward/v402/shortcut/ |
| D | ver4_shortcut_list_policy.h | 98 bool hasNext = false; in addNewShortcut() local
100 0 /* outCodePointCount */ , 0 /* probability */, &hasNext, entryPos); in addNewShortcut()
102 codePointCount, probability, hasNext, entryPos)) { in addNewShortcut()
|
| /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/JAJP/ |
| D | OpenWnnClauseConverterJAJP.java | 263 while (stemsi.hasNext()) { in singleClauseConvert()
293 while (stemsi.hasNext()) { in singleClauseConvert()
297 while (fzksi.hasNext()) { in singleClauseConvert()
359 while (clauseListi.hasNext()) { in addClause()
441 while (followFzksi.hasNext()) { in getAncillaryPattern()
496 while (list.hasNext()) { in getIndependentWords()
|
| D | OpenWnnEngineJAJP.java | 236 while (convResult.hasNext()) { in getCandidate()
250 while(it.hasNext()) { in getCandidate()
426 if ((headCandidates == null) || (!headCandidates.hasNext())) { in convert()
453 while(it.hasNext()) { in convert()
502 while (clauses.hasNext()) { in learn()
|
| /packages/apps/UnifiedEmail/src/org/apache/commons/io/ |
| D | LineIterator.java | 88 public boolean hasNext() { in hasNext() method in LineIterator
139 if (!hasNext()) { in nextLine()
|
| /packages/apps/Email/src/com/beetstra/jutf7/ |
| D | CharsetProvider.java | 71 for (Iterator<Charset> iter = charsets.iterator(); iter.hasNext();) { in charsetForName()
76 for (Iterator<Charset> iter = charsets.iterator(); iter.hasNext();) { in charsetForName()
|
| /packages/apps/UnifiedEmail/src/org/apache/commons/io/filefilter/ |
| D | OrFileFilter.java | 118 for (Iterator<IOFileFilter> iter = this.fileFilters.iterator(); iter.hasNext();) { in accept()
132 for (Iterator<IOFileFilter> iter = this.fileFilters.iterator(); iter.hasNext();) { in accept()
|
| /packages/apps/UnifiedEmail/src/org/apache/james/mime4j/decoder/ |
| D | UnboundedFifoByteBuffer.java | 225 public boolean hasNext() { in iterator() method
231 if (!hasNext()) { in iterator()
|