HomeSort by relevance Sort by last modified time
    Searched refs:hasNext (Results 26 - 50 of 1463) sorted by null

12 3 4 5 6 7 8 91011>>

  /external/guava/guava/src/com/google/common/collect/
AbstractLinkedIterator.java 66 public final boolean hasNext() {
72 if (!hasNext()) {
Iterators.java 66 public boolean hasNext() {
89 @Override public boolean hasNext() {
123 public boolean hasNext() {
124 return iterator.hasNext();
146 * will be left exhausted: its {@code hasNext()} method will return
151 while (iterator.hasNext()) {
164 while (iterator.hasNext()) {
170 while (iterator.hasNext()) {
182 * {@code hasNext()} method will return {@code false}.
192 while (removeFrom.hasNext()) {
    [all...]
AbstractIndexedListIterator.java 75 public final boolean hasNext() {
81 if (!hasNext()) {
  /external/smali/dexlib2/src/main/java/org/jf/dexlib2/dexbacked/util/
FixedSizeSet.java 49 @Override public boolean hasNext() { return index < size(); }
53 if (!hasNext()) {
  /frameworks/base/core/java/android/content/
CursorEntityIterator.java 58 public final boolean hasNext() {
60 throw new IllegalStateException("calling hasNext() when the iterator is closed");
73 * @see EntityIterator#hasNext()
79 if (!hasNext()) {
80 throw new IllegalStateException("you may only call next() if hasNext() is true");
  /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/
ANTLRStreamEnumerator.h 43 -(BOOL) hasNext;
  /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/
ANTLRStreamEnumerator.h 43 -(BOOL) hasNext;
  /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/
ANTLRStreamEnumerator.h 43 -(BOOL) hasNext;
  /external/chromium_org/third_party/protobuf/java/src/main/java/com/google/protobuf/
UnmodifiableLazyStringList.java 80 public boolean hasNext() {
81 return iter.hasNext();
132 public boolean hasNext() {
133 return iter.hasNext();
  /external/guava/guava/src/com/google/common/base/
PairwiseEquivalence.java 41 while (iteratorA.hasNext() && iteratorB.hasNext()) {
47 return !iteratorA.hasNext() && !iteratorB.hasNext();
AbstractIterator.java 50 public final boolean hasNext() {
74 if (!hasNext()) {
  /external/smack/src/org/jivesoftware/smack/util/collections/
MapIterator.java 36 * while (it.hasNext()) {
54 boolean hasNext();
  /external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/
XMPIteratorImpl.java 142 * @see java.util.Iterator#hasNext()
144 public boolean hasNext()
146 return nodeIterator.hasNext();
262 * @see Iterator#hasNext()
264 public boolean hasNext()
268 // hasNext has been called before
284 boolean hasNext = iterateChildren(childrenIterator);
286 if (!hasNext && visitedNode.hasQualifier() && !getOptions().isOmitQualifiers())
290 hasNext = hasNext();
    [all...]
  /libcore/luni/src/main/java/java/util/
ListIterator.java 48 public boolean hasNext();
65 * @see #hasNext
  /libcore/luni/src/test/java/libcore/java/util/
ServiceLoaderTest.java 26 assertFalse(ServiceLoader.load(UnimplementedInterface.class).iterator().hasNext());
34 assertTrue(it.hasNext());
36 assertTrue(it.hasNext());
38 assertFalse(it.hasNext());
  /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/backward/v402/bigram/
ver4_bigram_list_policy.cpp 58 *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;
176 while (hasNext) {
180 hasNext = bigramEntry.hasNext();
223 bool hasNext = true;
225 while (hasNext) {
    [all...]
  /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/backward/v402/content/
shortcut_dict_content.h 77 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;
bigram_dict_content.cpp 41 return BigramEntry(false /* hasNext */, NOT_A_PROBABILITY,
46 const bool hasNext = (bigramFlags & Ver4DictConstants::BIGRAM_HAS_NEXT_MASK) != 0;
69 return BigramEntry(hasNext, probability, &historicalInfo, targetTerminalId);
71 return BigramEntry(hasNext, probability, targetTerminalId);
78 const int bigramFlags = createAndGetBigramFlags(bigramEntryToWrite->hasNext());
129 bool hasNext = true;
130 while (hasNext) {
132 hasNext = bigramEntry.hasNext();
133 if (!hasNext) {
    [all...]
  /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/v4/content/
shortcut_dict_content.h 70 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;
  /external/mockito/cglib-and-asm/src/org/mockito/cglib/core/
CollectionUtils.java 30 for (Iterator it = c.iterator(); it.hasNext();) {
43 for (Iterator it = source.keySet().iterator(); it.hasNext();) {
51 while (it.hasNext()) {
61 for (Iterator it = c.iterator(); it.hasNext();) {
70 for (Iterator it = list.iterator(); it.hasNext();) {
  /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
Iterators.java 64 public boolean hasNext() {
87 @Override public boolean hasNext() {
121 public boolean hasNext() {
122 return iterator.hasNext();
144 * will be left exhausted: its {@code hasNext()} method will return
149 while (iterator.hasNext()) {
162 while (iterator.hasNext()) {
168 while (iterator.hasNext()) {
180 * {@code hasNext()} method will return {@code false}.
190 while (removeFrom.hasNext()) {
    [all...]
  /external/easymock/src/org/easymock/internal/matchers/
And.java 45 for (Iterator<IArgumentMatcher> it = matchers.iterator(); it.hasNext();) {
47 if (it.hasNext()) {
Or.java 45 for (Iterator<IArgumentMatcher> it = matchers.iterator(); it.hasNext();) {
47 if (it.hasNext()) {
  /external/mockito/src/org/mockito/internal/matchers/
And.java 37 for (Iterator<Matcher> it = matchers.iterator(); it.hasNext();) {
39 if (it.hasNext()) {
Or.java 37 for (Iterator<Matcher> it = matchers.iterator(); it.hasNext();) {
39 if (it.hasNext()) {

Completed in 404 milliseconds

12 3 4 5 6 7 8 91011>>