Searched defs:hasNext (Results 1 - 25 of 31) sorted by relevance

12

/packages/inputmethods/LatinIME/native/jni/src/suggest/core/dictionary/
H A Dbinary_dictionary_bigrams_iterator.h43 AK_FORCE_INLINE bool hasNext() const { function in class:latinime::BinaryDictionaryBigramsIterator
/packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/pt_common/bigram/
H A Dbigram_list_read_write_utils.h41 static AK_FORCE_INLINE bool hasNext(const BigramFlags flags) { function in class:latinime::BigramListReadWriteUtils
/packages/apps/UnifiedEmail/src/org/apache/commons/io/
H A DLineIterator.java38 * while (it.hasNext()) {
88 public boolean hasNext() { method in class:LineIterator
139 if (!hasNext()) {
/packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/pt_common/shortcut/
H A Dshortcut_list_reading_utils.h36 static AK_FORCE_INLINE bool hasNext(const ShortcutFlags flags) { function in class:latinime::ShortcutListReadingUtils
/packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/backward/v402/content/
H A Dbigram_entry.h42 BigramEntry(const bool hasNext, const int probability, const int targetTerminalId) argument
43 : mHasNext(hasNext), mProbability(probability), mHistoricalInfo(),
47 BigramEntry(const bool hasNext, const int probability, argument
49 : mHasNext(hasNext), mProbability(probability), mHistoricalInfo(*historicalInfo),
56 const BigramEntry updateHasNextAndGetEntry(const bool hasNext) const {
57 return BigramEntry(hasNext, mProbability, &mHistoricalInfo, mTargetTerminalId);
77 bool hasNext() const { function in class:latinime::backward::v402::BigramEntry
H A Dshortcut_dict_content.h77 const int probability, const bool hasNext, const int shortcutEntryPos) {
80 hasNext, &writingPos);
84 const int codePointCount, const int probability, const bool hasNext,
96 int createAndGetShortcutFlags(const int probability, const bool hasNext) const;
76 writeShortcutEntry(const int *const codePoint, const int codePointCount, const int probability, const bool hasNext, const int shortcutEntryPos) argument
H A Dbigram_dict_content.cpp41 return BigramEntry(false /* hasNext */, NOT_A_PROBABILITY,
46 const bool hasNext = (bigramFlags & Ver4DictConstants::BIGRAM_HAS_NEXT_MASK) != 0; local
69 return BigramEntry(hasNext, probability, &historicalInfo, targetTerminalId);
71 return BigramEntry(hasNext, probability, targetTerminalId);
78 const int bigramFlags = createAndGetBigramFlags(bigramEntryToWrite->hasNext());
129 bool hasNext = true; local
130 while (hasNext) {
132 hasNext = bigramEntry.hasNext();
133 if (!hasNext) {
184 bool hasNext = true; local
[all...]
H A Dshortcut_dict_content.cpp116 bool hasNext = true; local
120 while (hasNext) {
124 codePoints, &codePointCount, &probability, &hasNext, &readingPos);
126 hasNext, &writingPos)) {
138 const bool hasNext = shortcutFlags & Ver4DictConstants::SHORTCUT_HAS_NEXT_MASK; local
139 const int shortcutFlagsToWrite = createAndGetShortcutFlags(probability, hasNext);
145 const int codePointCount, const int probability, const bool hasNext,
148 const int shortcutFlags = createAndGetShortcutFlags(probability, hasNext);
165 bool hasNext = true; local
168 while (hasNext) {
144 writeShortcutEntryAndAdvancePosition(const int *const codePoint, const int codePointCount, const int probability, const bool hasNext, int *const shortcutEntryPos) argument
[all...]
/packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/backward/v402/shortcut/
H A Dver4_shortcut_list_policy.h77 false /* hasNext */, writingPos);
90 codePointCount, probability, true /* hasNext */, &writingPos)) {
98 bool hasNext = false; local
100 0 /* outCodePointCount */ , 0 /* probability */, &hasNext, entryPos);
102 codePointCount, probability, hasNext, entryPos)) {
/packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/v4/content/
H A Dbigram_entry.h33 BigramEntry(const bool hasNext, const int probability, const int targetTerminalId) argument
34 : mHasNext(hasNext), mProbability(probability), mHistoricalInfo(),
38 BigramEntry(const bool hasNext, const int probability, argument
40 : mHasNext(hasNext), mProbability(probability), mHistoricalInfo(*historicalInfo),
47 const BigramEntry updateHasNextAndGetEntry(const bool hasNext) const {
48 return BigramEntry(hasNext, mProbability, &mHistoricalInfo, mTargetTerminalId);
68 bool hasNext() const { function in class:latinime::BigramEntry
H A Dshortcut_dict_content.h70 const int probability, const bool hasNext, const int shortcutEntryPos) {
73 hasNext, &writingPos);
77 const int codePointCount, const int probability, const bool hasNext,
89 int createAndGetShortcutFlags(const int probability, const bool hasNext) const;
69 writeShortcutEntry(const int *const codePoint, const int codePointCount, const int probability, const bool hasNext, const int shortcutEntryPos) argument
H A Dbigram_dict_content.cpp34 return BigramEntry(false /* hasNext */, NOT_A_PROBABILITY,
64 return BigramEntry(false /* hasNext */, NOT_A_PROBABILITY,
70 // hasNext is always true because we should continue to read the next entry until the terminator
74 return BigramEntry(true /* hasNext */, probability, &historicalInfo, targetTerminalId);
76 return BigramEntry(true /* hasNext */, probability, targetTerminalId);
186 bool hasNext = true; local
189 while (hasNext) {
192 hasNext = originalBigramEntry.hasNext();
H A Dshortcut_dict_content.cpp101 bool hasNext = true; local
105 while (hasNext) {
109 codePoints, &codePointCount, &probability, &hasNext, &readingPos);
111 hasNext, &writingPos)) {
123 const bool hasNext = shortcutFlags & Ver4DictConstants::SHORTCUT_HAS_NEXT_MASK; local
124 const int shortcutFlagsToWrite = createAndGetShortcutFlags(probability, hasNext);
130 const int codePointCount, const int probability, const bool hasNext,
133 const int shortcutFlags = createAndGetShortcutFlags(probability, hasNext);
150 bool hasNext = true; local
153 while (hasNext) {
129 writeShortcutEntryAndAdvancePosition(const int *const codePoint, const int codePointCount, const int probability, const bool hasNext, int *const shortcutEntryPos) argument
[all...]
/packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/v4/shortcut/
H A Dver4_shortcut_list_policy.h67 false /* hasNext */, writingPos);
80 codePointCount, probability, true /* hasNext */, &writingPos)) {
88 bool hasNext = false; local
90 0 /* outCodePointCount */ , 0 /* probability */, &hasNext, entryPos);
92 codePointCount, probability, hasNext, entryPos)) {
/packages/apps/UnifiedEmail/src/org/apache/james/mime4j/field/address/
H A DBuilder.java100 while (it.hasNext()) {
170 while (it.hasNext()) {
230 public boolean hasNext() { method in class:Builder.ChildNodeIterator
/packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/backward/v402/bigram/
H A Dver4_bigram_list_policy.cpp58 *outHasNext = bigramEntry.hasNext();
79 const BigramEntry newBigramEntry(false /* hasNext */, NOT_A_PROBABILITY,
112 const BigramEntry newBigramEntry(false /* hasNext */, NOT_A_PROBABILITY,
120 if (!updateHasNextFlag(true /* hasNext */, tailEntryPos)) {
174 bool hasNext = true; local
176 while (hasNext) {
180 hasNext = bigramEntry.hasNext();
223 bool hasNext = true; local
225 while (hasNext) {
241 bool hasNext = true; local
282 updateHasNextFlag(const bool hasNext, const int bigramEntryPos) argument
[all...]
/packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/v4/bigram/
H A Dver4_bigram_list_policy.cpp48 *outHasNext = bigramEntry.hasNext();
69 const BigramEntry newBigramEntry(false /* hasNext */, NOT_A_PROBABILITY,
103 const BigramEntry newBigramEntry(false /* hasNext */, NOT_A_PROBABILITY,
175 bool hasNext = true; local
177 while (hasNext) {
181 hasNext = bigramEntry.hasNext();
224 bool hasNext = true; local
226 while (hasNext) {
229 hasNext
[all...]
/packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/v4/
H A Dver4_patricia_trie_writing_helper.cpp242 bool hasNext = true; local
244 while (hasNext) {
248 hasNext = bigramEntry.hasNext();
H A Dver4_patricia_trie_policy.cpp137 while (bigramsIt.hasNext()) {
156 while (bigramsIt.hasNext()) {
468 bool hasNext = true; local
470 while (hasNext) {
473 hasNext = bigramEntry.hasNext();
504 bool hasNext = true; local
505 while (hasNext) {
509 &shortcutTargetLength, &shortcutProbability, &hasNext, &shortcutPos);
/packages/apps/TvSettings/Settings/src/com/android/tv/settings/dialog/old/
H A DAction.java142 public Builder hasNext(boolean hasNext) { argument
143 mHasNext = hasNext;
167 int drawableResource, boolean checked, boolean multilineDescription, boolean hasNext,
176 mHasNext = hasNext;
311 public boolean hasNext() { method in class:Action
317 * If both this and {@link #hasNext()} are true, infoOnly takes precedence. (default is false)
166 Action(String key, String title, String description, String resourcePackageName, int drawableResource, boolean checked, boolean multilineDescription, boolean hasNext, boolean infoOnly, Intent intent, int checkSetId) argument
/packages/apps/UnifiedEmail/src/com/android/mail/lib/base/
H A DSplitter.java423 public final boolean hasNext() { method in class:Splitter.AbstractIterator
446 if (!hasNext()) {
/packages/apps/UnifiedEmail/src/com/google/android/mail/common/base/
H A DSplitter.java423 public final boolean hasNext() { method in class:Splitter.AbstractIterator
446 if (!hasNext()) {
/packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/backward/v402/
H A Dver4_patricia_trie_writing_helper.cpp251 bool hasNext = true; local
253 while (hasNext) {
257 hasNext = bigramEntry.hasNext();
H A Dver4_patricia_trie_policy.cpp147 while (bigramsIt.hasNext()) {
166 while (bigramsIt.hasNext()) {
456 bool hasNext = true; local
458 while (hasNext) {
461 hasNext = bigramEntry.hasNext();
492 bool hasNext = true; local
493 while (hasNext) {
497 &shortcutTargetLength, &shortcutProbability, &hasNext, &shortcutPos);
/packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/v2/
H A Dpatricia_trie_policy.cpp316 while (bigramsIt.hasNext()) {
335 while (bigramsIt.hasNext()) {
397 while (bigramsIt.hasNext()) {
419 bool hasNext = true; local
420 while (hasNext) {
423 hasNext = ShortcutListReadingUtils::hasNext(shortcutFlags);

Completed in 1052 milliseconds

12