choco.kernel.memory.structure.iterators
Class BipartiteListRemIterator

java.lang.Object
  extended by choco.kernel.common.util.disposable.Disposable
      extended by choco.kernel.common.util.iterators.DisposableIntIterator
          extended by choco.kernel.memory.structure.iterators.BipartiteListRemIterator

public final class BipartiteListRemIterator
extends DisposableIntIterator

User : cprudhom
Mail : cprudhom(a)emn.fr
Date : 29 mars 2010br/> Since : Choco 2.1.1


Constructor Summary
BipartiteListRemIterator()
           
 
Method Summary
 boolean hasNext()
          Returns true if the iteration has more elements.
 void init(int[] aList, IStateInt aLast)
          Freeze the iterator, cannot be reused.
 int next()
          Returns the next element in the iteration.
 void remove()
          Removing an element is not permitted on this structure.
 
Methods inherited from class choco.kernel.common.util.disposable.Disposable
dispose, init, reusable
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

BipartiteListRemIterator

public BipartiteListRemIterator()
Method Detail

init

public void init(int[] aList,
                 IStateInt aLast)
Freeze the iterator, cannot be reused.


hasNext

public boolean hasNext()
Returns true if the iteration has more elements. (In other words, returns true if next would return an element rather than throwing an exception.)

Returns:
true if the iterator has more elements.

next

public int next()
Returns the next element in the iteration.

Returns:
the next element in the iteration.
Throws:
NoSuchElementException - iteration has no more elements.

remove

public void remove()
Removing an element is not permitted on this structure. Indeed, the structure iterates over removed elements of a bipartite set.

Overrides:
remove in class DisposableIntIterator
Throws:
UnsupportedOperationException - if the remove operation is not supported by this Iterator.


Copyright © 2012. All Rights Reserved.