Cross Reference: /external/guava/guava/src/com/google/common/collect/Iterators.java

Lines Matching refs:hasNext
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()) {
203    * iterator. The iterator will be left exhausted: its {@code hasNext()}
216     while (removeFrom.hasNext()) {
228    * {@code hasNext()} method will return {@code false}.
238     while (removeFrom.hasNext()) {
259     while (iterator1.hasNext()) {
260       if (!iterator2.hasNext()) {
269     return !iterator2.hasNext();
275    * {@code hasNext()} method will return {@code false}.
278     if (!iterator.hasNext()) {
283     while (iterator.hasNext()) {
298     if (!iterator.hasNext()) {
304     for (int i = 0; i < 4 && iterator.hasNext(); i++) {
307     if (iterator.hasNext()) {
324     return iterator.hasNext() ? getOnlyElement(iterator) : defaultValue;
329    * exhausted: its {@code hasNext()} method will return {@code false}.
345    * will be left exhausted: its {@code hasNext()} method will return
355     while (iterator.hasNext()) {
364    * {@code hasNext()} method will return {@code false}.
371       while (iterator.hasNext()) {
377       while (iterator.hasNext()) {
393    * {@code hasNext()} method returns {@code true} until {@code iterable} is
407       public boolean hasNext() {
408         if (!iterator.hasNext()) {
411         return iterator.hasNext();
415         if (!hasNext()) {
437    * {@code hasNext()} method returns {@code true} until all of the original
533       public boolean hasNext() {
535         // current.hasNext() might be relatively expensive, worth minimizing.
542         while (!(currentHasNext = checkNotNull(current).hasNext())
543             && inputs.hasNext()) {
550         if (!hasNext()) {
613       public boolean hasNext() {
614         return iterator.hasNext();
618         if (!hasNext()) {
623         for (; count < size && iterator.hasNext(); count++) {
647         while (unfiltered.hasNext()) {
683     while (iterator.hasNext()) {
700     while (iterator.hasNext()) {
713    * hasNext()} method will return {@code false}. If it is possible that
729    * {@code hasNext()} method will return {@code false}. Note that this can
738     return filteredIterator.hasNext() ? filteredIterator.next() : defaultValue;
746    * hasNext()} method will return {@code false}.
757     return filteredIterator.hasNext()
772    * {@code hasNext()} method will return {@code false}.  Otherwise,
782     while (iterator.hasNext()) {
806       public boolean hasNext() {
807         return fromIterator.hasNext();
835     while (iterator.hasNext()) {
890     return iterator.hasNext() ? iterator.next() : defaultValue;
902       if (!iterator.hasNext()) {
917     return iterator.hasNext() ? getLast(iterator) : defaultValue;
922    * or until {@code hasNext()} returns {@code false}, whichever comes first.
933     for (i = 0; i < numberToSkip && iterator.hasNext(); i++) {
959       public boolean hasNext() {
960         return count < limitSize && iterator.hasNext();
965         if (!hasNext()) {
996       public boolean hasNext() {
997         return iterator.hasNext();
1016     while (iterator.hasNext()) {
1090       public boolean hasNext() {
1117       public boolean hasNext() {
1139         return iterator.hasNext();
1162     public boolean hasNext() {
1163       return hasPeeked || iterator.hasNext();
1307         if (iterator.hasNext()) {
1322       if (nextIter.hasNext()) {