FilteredEdgeIterator.java

1
/*
2
 * Copyright 2006 - 2013
3
 *     Stefan Balev     <stefan.balev@graphstream-project.org>
4
 *     Julien Baudry    <julien.baudry@graphstream-project.org>
5
 *     Antoine Dutot    <antoine.dutot@graphstream-project.org>
6
 *     Yoann Pign��      <yoann.pigne@graphstream-project.org>
7
 *     Guilhelm Savin   <guilhelm.savin@graphstream-project.org>
8
 * 
9
 * This file is part of GraphStream <http://graphstream-project.org>.
10
 * 
11
 * GraphStream is a library whose purpose is to handle static or dynamic
12
 * graph, create them from scratch, file or any source and display them.
13
 * 
14
 * This program is free software distributed under the terms of two licenses, the
15
 * CeCILL-C license that fits European law, and the GNU Lesser General Public
16
 * License. You can  use, modify and/ or redistribute the software under the terms
17
 * of the CeCILL-C license as circulated by CEA, CNRS and INRIA at the following
18
 * URL <http://www.cecill.info> or under the terms of the GNU LGPL as published by
19
 * the Free Software Foundation, either version 3 of the License, or (at your
20
 * option) any later version.
21
 * 
22
 * This program is distributed in the hope that it will be useful, but WITHOUT ANY
23
 * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
24
 * PARTICULAR PURPOSE.  See the GNU Lesser General Public License for more details.
25
 * 
26
 * You should have received a copy of the GNU Lesser General Public License
27
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
28
 * 
29
 * The fact that you are presently reading this means that you have had
30
 * knowledge of the CeCILL-C and LGPL licenses and that you accept their terms.
31
 */
32
package org.graphstream.util;
33
34
import java.util.Iterator;
35
36
import org.graphstream.graph.Graph;
37
import org.graphstream.graph.Edge;
38
39
public class FilteredEdgeIterator<T extends Edge> implements Iterator<T> {
40
41
	protected Iterator<T> globalIterator;
42
	protected Filter<Edge> filter;
43
	protected T next;
44
45
	public FilteredEdgeIterator(Graph g, Filter<Edge> filter) {
46
		this(g.<T>getEdgeIterator(), filter);
47
	}
48
	
49
	public FilteredEdgeIterator(Iterator<T> ite, Filter<Edge> filter) {
50
		this.globalIterator = ite;
51
		this.filter = (Filter<Edge>) filter;
52
53 1 1. : removed call to org/graphstream/util/FilteredEdgeIterator::findNext → NO_COVERAGE
		findNext();
54
	}
55
56
	protected void findNext() {
57
		next = null;
58
59 2 1. findNext : negated conditional → NO_COVERAGE
2. findNext : negated conditional → NO_COVERAGE
		while (globalIterator.hasNext() && next == null) {
60
			next = globalIterator.next();
61
62 1 1. findNext : negated conditional → NO_COVERAGE
			if (!filter.isAvailable(next))
63
				next = null;
64
		}
65
	}
66
67
	/*
68
	 * (non-Javadoc)
69
	 * @see java.util.Iterator#hasNext()
70
	 */
71
	public boolean hasNext() {
72 3 1. hasNext : negated conditional → NO_COVERAGE
2. hasNext : replaced return of integer sized value with (x == 0 ? 1 : 0) → NO_COVERAGE
3. hasNext : replaced return of integer sized value with (x == 0 ? 1 : 0) → NO_COVERAGE
		return next != null;
73
	}
74
75
	/*
76
	 * (non-Javadoc)
77
	 * @see java.util.Iterator#next()
78
	 */
79
	public T next() {
80
		T tmp = next;
81 1 1. next : removed call to org/graphstream/util/FilteredEdgeIterator::findNext → NO_COVERAGE
		findNext();
82
83 1 1. next : mutated return of Object value for org/graphstream/util/FilteredEdgeIterator::next to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE
		return tmp;
84
	}
85
86
	/*
87
	 * (non-Javadoc)
88
	 * @see java.util.Iterator#remove()
89
	 */
90
	public void remove() {
91
	}
92
}

Mutations

53

1.1
Location :
Killed by : none
removed call to org/graphstream/util/FilteredEdgeIterator::findNext → NO_COVERAGE

59

1.1
Location : findNext
Killed by : none
negated conditional → NO_COVERAGE

2.2
Location : findNext
Killed by : none
negated conditional → NO_COVERAGE

62

1.1
Location : findNext
Killed by : none
negated conditional → NO_COVERAGE

72

1.1
Location : hasNext
Killed by : none
negated conditional → NO_COVERAGE

2.2
Location : hasNext
Killed by : none
replaced return of integer sized value with (x == 0 ? 1 : 0) → NO_COVERAGE

3.3
Location : hasNext
Killed by : none
replaced return of integer sized value with (x == 0 ? 1 : 0) → NO_COVERAGE

81

1.1
Location : next
Killed by : none
removed call to org/graphstream/util/FilteredEdgeIterator::findNext → NO_COVERAGE

83

1.1
Location : next
Killed by : none
mutated return of Object value for org/graphstream/util/FilteredEdgeIterator::next to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE

Active mutators

Tests examined


Report generated by PIT 0.33