Home
last modified time | relevance | path

Searched refs:sanityCheckSet (Results 1 – 6 of 6) sorted by relevance

/external/guava/guava-tests/test/com/google/common/graph/
DAbstractGraphTest.java22 import static com.google.common.graph.TestUtil.sanityCheckSet;
124 for (N node : sanityCheckSet(graph.nodes())) { in validateGraph()
140 for (N adjacentNode : sanityCheckSet(graph.adjacentNodes(node))) { in validateGraph()
150 for (N predecessor : sanityCheckSet(graph.predecessors(node))) { in validateGraph()
156 for (N successor : sanityCheckSet(graph.successors(node))) { in validateGraph()
163 for (EndpointPair<N> endpoints : sanityCheckSet(graph.incidentEdges(node))) { in validateGraph()
172 sanityCheckSet(graph.edges()); in validateGraph()
DAbstractNetworkTest.java23 import static com.google.common.graph.TestUtil.sanityCheckSet;
164 for (E edge : sanityCheckSet(network.edges())) { in validateNetwork()
191 for (N node : sanityCheckSet(network.nodes())) { in validateNetwork()
217 Set<E> edgesConnecting = sanityCheckSet(network.edgesConnecting(node, otherNode)); in validateNetwork()
267 for (N adjacentNode : sanityCheckSet(network.adjacentNodes(node))) { in validateNetwork()
276 for (N predecessor : sanityCheckSet(network.predecessors(node))) { in validateNetwork()
281 for (N successor : sanityCheckSet(network.successors(node))) { in validateNetwork()
286 for (E incidentEdge : sanityCheckSet(network.incidentEdges(node))) { in validateNetwork()
294 for (E inEdge : sanityCheckSet(network.inEdges(node))) { in validateNetwork()
303 for (E outEdge : sanityCheckSet(network.outEdges(node))) { in validateNetwork()
DTestUtil.java82 static <T> Set<T> sanityCheckSet(Set<T> set) { in sanityCheckSet() method in TestUtil
/external/guava/android/guava-tests/test/com/google/common/graph/
DAbstractGraphTest.java22 import static com.google.common.graph.TestUtil.sanityCheckSet;
124 for (N node : sanityCheckSet(graph.nodes())) { in validateGraph()
140 for (N adjacentNode : sanityCheckSet(graph.adjacentNodes(node))) { in validateGraph()
150 for (N predecessor : sanityCheckSet(graph.predecessors(node))) { in validateGraph()
156 for (N successor : sanityCheckSet(graph.successors(node))) { in validateGraph()
163 for (EndpointPair<N> endpoints : sanityCheckSet(graph.incidentEdges(node))) { in validateGraph()
172 sanityCheckSet(graph.edges()); in validateGraph()
DAbstractNetworkTest.java23 import static com.google.common.graph.TestUtil.sanityCheckSet;
164 for (E edge : sanityCheckSet(network.edges())) { in validateNetwork()
191 for (N node : sanityCheckSet(network.nodes())) { in validateNetwork()
217 Set<E> edgesConnecting = sanityCheckSet(network.edgesConnecting(node, otherNode)); in validateNetwork()
260 for (N adjacentNode : sanityCheckSet(network.adjacentNodes(node))) { in validateNetwork()
269 for (N predecessor : sanityCheckSet(network.predecessors(node))) { in validateNetwork()
274 for (N successor : sanityCheckSet(network.successors(node))) { in validateNetwork()
279 for (E incidentEdge : sanityCheckSet(network.incidentEdges(node))) { in validateNetwork()
287 for (E inEdge : sanityCheckSet(network.inEdges(node))) { in validateNetwork()
296 for (E outEdge : sanityCheckSet(network.outEdges(node))) { in validateNetwork()
DTestUtil.java82 static <T> Set<T> sanityCheckSet(Set<T> set) { in sanityCheckSet() method in TestUtil