Cyclic Iteration : Iterator « Collections Data Structure « Java

1. Java
2. Collections Data Structure
3. Iterator

Cyclic Iteration

    

/**
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you 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.
 */

import java.util.Iterator;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.SortedMap;

/** Provide an cyclic {@link Iterator} for a {@link SortedMap}.
 * The {@link Iterator} navigates the entries of the map
 * according to the map's ordering.
 * If the {@link Iterator} hits the last entry of the map,
 * it will then continue from the first entry.
 */
public class CyclicIteration<K, V> implements Iterable<Map.Entry<K, V>> {
  private final SortedMap<K, V> navigablemap;
  private final SortedMap<K, V> tailmap;
  private final K startingkey;

  /** Construct an {@link Iterable} object,
   * so that an {@link Iterator} can be created  
   * for iterating the given {@link SortedMap}.
   * The iteration begins from the starting key exclusively.
   */
  public CyclicIteration(SortedMap<K, V> navigablemap, K startingkey) {
    this.startingkey = startingkey;
    if (navigablemap == null || navigablemap.isEmpty()) {
      this.navigablemap = null;
      this.tailmap = null;
    }
    else {
      this.navigablemap = navigablemap;
      this.tailmap = navigablemap.tailMap(startingkey);
    }
  }

  /** {@inheritDoc} */
  public Iterator<Map.Entry<K, V>> iterator() {
    return new CyclicIterator();
  }

  /** An {@link Iterator} for {@link CyclicIteration}. */
  private class CyclicIterator implements Iterator<Map.Entry<K, V>> {
    private boolean hasnext;
    private Iterator<Map.Entry<K, V>> i;
    /** The first entry to begin. */
    private final Map.Entry<K, V> first;
    /** The next entry. */
    private Map.Entry<K, V> next;
    
    private CyclicIterator() {
      hasnext = navigablemap != null;
      if (hasnext) {
        i = tailmap.entrySet().iterator();
        
        Map.Entry<K, V> e = nextEntry();
        if (e.getKey().equals(startingkey)) {
          e = nextEntry();
        }

        first = e; 
        next = first;
      }
      else {
        i = null;
        first = null;
        next = null;
      }
    }

    private Map.Entry<K, V> nextEntry() {
      if (!i.hasNext()) {
        i = navigablemap.entrySet().iterator();
      }
      return i.next();
    }

    /** {@inheritDoc} */
    public boolean hasNext() {
      return hasnext;
    }

    /** {@inheritDoc} */
    public Map.Entry<K, V> next() {
      if (!hasnext) {
        throw new NoSuchElementException();
      }

      final Map.Entry<K, V> curr = next;
      next = nextEntry();
      hasnext = !next.equals(first);
      return curr;
    }

    /** Not supported */
    public void remove() {
      throw new UnsupportedOperationException("Not supported");
    }
  }
}

   
    
    
    
  

Related examples in the same category

1.	Listing the Elements of a Collection
2.	De-mystify the Iterator interface, showing how to write a simple Iterator for an Array of Objects
3.	Iterate over Set
4.	Demonstrate iterators.
5.	Use the for-each for loop to cycle through a collection.
6.	List Iterator
7.	Iterate a Collection and remove an item (Exception, wrong version)
8.	Use an Iterator and remove the item with Iterator.remove()
9.	An Iterator wrapper for an Enumeration.
10.	EmptyIterator is an iterator which is empty.
11.	Implements an java.util.Iterator over any array
12.	Treat an Iterator as an Iterable
13.	Iterator class for sparse values in an array.
14.	Iterator class for values contained in an array range.
15.	Array Iterator
16.	Create singleton Iterator
17.	Empty Iterator
18.	An Iterator that wraps a number of Iterators
19.	An Iterator to iterate over the elements of an array
20.	Sorted Iterator
21.	Iterator Union of Iterators
22.	Iterator Utils
23.	Linked Iterator
24.	Prefetch Iterator
25.	Protects an given iterator by preventing calls to remove().
26.	An Iterator that returns the elements of a specified array, or other iterators etc.
27.	An Iterator wrapper for an Object[], allow us to deal with all array like structures in a consistent manner.
28.	An array iterator
29.	Adapt iterator to iterable
30.	Static utility methods, classes, and abstract classes for iteration.
31.	Iterator Collection
32.	Convert Iterable to List
33.	A singleton null object Iterator implementation.