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

Lines Matching refs:hasNext
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()) {
201    * iterator. The iterator will be left exhausted: its {@code hasNext()}
214     while (removeFrom.hasNext()) {
226    * {@code hasNext()} method will return {@code false}.
236     while (removeFrom.hasNext()) {
257     while (iterator1.hasNext()) {
258       if (!iterator2.hasNext()) {
267     return !iterator2.hasNext();
273    * {@code hasNext()} method will return {@code false}.
276     if (!iterator.hasNext()) {
281     while (iterator.hasNext()) {
296     if (!iterator.hasNext()) {
302     for (int i = 0; i < 4 && iterator.hasNext(); i++) {
305     if (iterator.hasNext()) {
322     return iterator.hasNext() ? getOnlyElement(iterator) : defaultValue;
327    * will be left exhausted: its {@code hasNext()} method will return
337     while (iterator.hasNext()) {
346    * {@code hasNext()} method will return {@code false}.
353       while (iterator.hasNext()) {
359       while (iterator.hasNext()) {
375    * {@code hasNext()} method returns {@code true} until {@code iterable} is
389       public boolean hasNext() {
390         if (!iterator.hasNext()) {
393         return iterator.hasNext();
397         if (!hasNext()) {
419    * {@code hasNext()} method returns {@code true} until all of the original
515       public boolean hasNext() {
517         // current.hasNext() might be relatively expensive, worth minimizing.
524         while (!(currentHasNext = checkNotNull(current).hasNext())
525             && inputs.hasNext()) {
532         if (!hasNext()) {
595       public boolean hasNext() {
596         return iterator.hasNext();
600         if (!hasNext()) {
605         for (; count < size && iterator.hasNext(); count++) {
629         while (unfiltered.hasNext()) {
647     while (iterator.hasNext()) {
664     while (iterator.hasNext()) {
677    * hasNext()} method will return {@code false}. If it is possible that
693    * {@code hasNext()} method will return {@code false}. Note that this can
702     return filteredIterator.hasNext() ? filteredIterator.next() : defaultValue;
710    * hasNext()} method will return {@code false}.
721     return filteredIterator.hasNext()
736    * {@code hasNext()} method will return {@code false}.  Otherwise,
746     while (iterator.hasNext()) {
770       public boolean hasNext() {
771         return fromIterator.hasNext();
799     while (iterator.hasNext()) {
854     return iterator.hasNext() ? iterator.next() : defaultValue;
866       if (!iterator.hasNext()) {
881     return iterator.hasNext() ? getLast(iterator) : defaultValue;
886    * or until {@code hasNext()} returns {@code false}, whichever comes first.
897     for (i = 0; i < numberToSkip && iterator.hasNext(); i++) {
923       public boolean hasNext() {
924         return count < limitSize && iterator.hasNext();
929         if (!hasNext()) {
960       public boolean hasNext() {
961         return iterator.hasNext();
980     while (iterator.hasNext()) {
1054       public boolean hasNext() {
1081       public boolean hasNext() {
1103         return iterator.hasNext();
1126     public boolean hasNext() {
1127       return hasPeeked || iterator.hasNext();
1271         if (iterator.hasNext()) {
1286       if (nextIter.hasNext()) {