FilteredEdgeIterator.java
/*
* Copyright 2006 - 2013
* Stefan Balev <stefan.balev@graphstream-project.org>
* Julien Baudry <julien.baudry@graphstream-project.org>
* Antoine Dutot <antoine.dutot@graphstream-project.org>
* Yoann Pign�� <yoann.pigne@graphstream-project.org>
* Guilhelm Savin <guilhelm.savin@graphstream-project.org>
*
* This file is part of GraphStream <http://graphstream-project.org>.
*
* GraphStream is a library whose purpose is to handle static or dynamic
* graph, create them from scratch, file or any source and display them.
*
* This program is free software distributed under the terms of two licenses, the
* CeCILL-C license that fits European law, and the GNU Lesser General Public
* License. You can use, modify and/ or redistribute the software under the terms
* of the CeCILL-C license as circulated by CEA, CNRS and INRIA at the following
* URL <http://www.cecill.info> or under the terms of the GNU LGPL as published by
* the Free Software Foundation, either version 3 of the License, or (at your
* option) any later version.
*
* This program is distributed in the hope that it will be useful, but WITHOUT ANY
* WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
* PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* The fact that you are presently reading this means that you have had
* knowledge of the CeCILL-C and LGPL licenses and that you accept their terms.
*/
package org.graphstream.util;
import java.util.Iterator;
import org.graphstream.graph.Graph;
import org.graphstream.graph.Edge;
public class FilteredEdgeIterator<T extends Edge> implements Iterator<T> {
protected Iterator<T> globalIterator;
protected Filter<Edge> filter;
protected T next;
public FilteredEdgeIterator(Graph g, Filter<Edge> filter) {
this(g.<T>getEdgeIterator(), filter);
}
public FilteredEdgeIterator(Iterator<T> ite, Filter<Edge> filter) {
this.globalIterator = ite;
this.filter = (Filter<Edge>) filter;
findNext();
}
protected void findNext() {
next = null;
while (globalIterator.hasNext() && next == null) {
next = globalIterator.next();
if (!filter.isAvailable(next))
next = null;
}
}
/*
* (non-Javadoc)
* @see java.util.Iterator#hasNext()
*/
public boolean hasNext() {
return next != null;
}
/*
* (non-Javadoc)
* @see java.util.Iterator#next()
*/
public T next() {
T tmp = next;
findNext();
return tmp;
}
/*
* (non-Javadoc)
* @see java.util.Iterator#remove()
*/
public void remove() {
}
}