Start line:  
End line:  

Snippet Preview

Snippet HTML Code

Stack Overflow Questions
 /*
  * Copyright (C) 2010 The Guava Authors
  *
  * Licensed under the Apache License, Version 2.0 (the "License");
  * you may not use this file except in compliance with the License.
  * You may obtain a copy of the License at
  *
  * http://www.apache.org/licenses/LICENSE-2.0
  *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package com.google.common.collect;
This class provides a skeletal implementation of the Iterator interface for sequences whose next element can always be derived from the previous element. Null elements are not supported, nor is the UnmodifiableIterator.remove() method.

Example:

   Iterator<Integer> powersOfTwo = new AbstractLinkedIterator<Integer>(1) {
     protected Integer computeNext(Integer previous) {
       return (previous == 1 << 30) ? null : previous * 2;
     
   };}

Deprecated:
This class has been renamed AbstractSequentialIterator. This class is scheduled to be removed in Guava release 13.0.
Author(s):
Chris Povirk
Since:
8.0
public abstract class AbstractLinkedIterator<T>
    extends UnmodifiableIterator<T> {
  private T nextOrNull;

  
Creates a new iterator with the given first element, or, if firstOrNull is null, creates a new empty iterator.
  protected AbstractLinkedIterator(@Nullable T firstOrNull) {
    this. = firstOrNull;
  }

  
Returns the element that follows previous, or returns null if no elements remain. This method is invoked during each call to next() in order to compute the result of a future call to next().
  protected abstract T computeNext(T previous);
  public final boolean hasNext() {
    return  != null;
  }
  public final T next() {
    if (!hasNext()) {
      throw new NoSuchElementException();
    }
    try {
      return ;
    } finally {
    }
  }
New to GrepCode? Check out our FAQ X