Home
last modified time | relevance | path

Searched refs:endpointPair (Results 1 – 13 of 13) sorted by relevance

/external/guava/android/guava/src/com/google/common/graph/
DAbstractBaseGraph.java92 EndpointPair<?> endpointPair = (EndpointPair<?>) obj; in edges() local
93 return isOrderingCompatible(endpointPair) in edges()
94 && nodes().contains(endpointPair.nodeU()) in edges()
95 && successors((N) endpointPair.nodeU()).contains(endpointPair.nodeV()); in edges()
219 EndpointPair<?> endpointPair = (EndpointPair<?>) obj;
220 if (!endpointPair.isOrdered()) {
224 Object source = endpointPair.source();
225 Object target = endpointPair.target();
260 EndpointPair<?> endpointPair = (EndpointPair<?>) obj;
261 if (endpointPair.isOrdered()) {
[all …]
DAbstractNetwork.java96 EndpointPair<?> endpointPair = (EndpointPair<?>) obj; in asGraph()
97 return isOrderingCompatible(endpointPair) in asGraph()
98 && nodes().contains(endpointPair.nodeU()) in asGraph()
99 && successors((N) endpointPair.nodeU()).contains(endpointPair.nodeV()); in asGraph()
159 EndpointPair<N> endpointPair = incidentNodes(edge); // Verifies that edge is in this network.
161 Sets.union(incidentEdges(endpointPair.nodeU()), incidentEdges(endpointPair.nodeV()));
DGraphs.java417 EndpointPair<N> endpointPair = delegate().incidentNodes(edge); in incidentNodes() local
418 return EndpointPair.of(network, endpointPair.nodeV(), endpointPair.nodeU()); // transpose in incidentNodes()
572 EndpointPair<N> endpointPair = network.incidentNodes(edge); in copyOf() local
573 copy.addEdge(endpointPair.nodeU(), endpointPair.nodeV(), edge); in copyOf()
/external/guava/guava/src/com/google/common/graph/
DAbstractBaseGraph.java92 EndpointPair<?> endpointPair = (EndpointPair<?>) obj; in edges() local
93 return isOrderingCompatible(endpointPair) in edges()
94 && nodes().contains(endpointPair.nodeU()) in edges()
95 && successors((N) endpointPair.nodeU()).contains(endpointPair.nodeV()); in edges()
219 EndpointPair<?> endpointPair = (EndpointPair<?>) obj;
220 if (!endpointPair.isOrdered()) {
224 Object source = endpointPair.source();
225 Object target = endpointPair.target();
260 EndpointPair<?> endpointPair = (EndpointPair<?>) obj;
261 if (endpointPair.isOrdered()) {
[all …]
DAbstractNetwork.java97 EndpointPair<?> endpointPair = (EndpointPair<?>) obj; in asGraph()
98 return isOrderingCompatible(endpointPair) in asGraph()
99 && nodes().contains(endpointPair.nodeU()) in asGraph()
100 && successors((N) endpointPair.nodeU()).contains(endpointPair.nodeV()); in asGraph()
160 EndpointPair<N> endpointPair = incidentNodes(edge); // Verifies that edge is in this network.
162 Sets.union(incidentEdges(endpointPair.nodeU()), incidentEdges(endpointPair.nodeV()));
DGraphs.java423 EndpointPair<N> endpointPair = delegate().incidentNodes(edge); in incidentNodes() local
424 return EndpointPair.of(network, endpointPair.nodeV(), endpointPair.nodeU()); // transpose in incidentNodes()
588 EndpointPair<N> endpointPair = network.incidentNodes(edge); in copyOf() local
589 copy.addEdge(endpointPair.nodeU(), endpointPair.nodeV(), edge); in copyOf()
/external/guava/android/guava-tests/test/com/google/common/graph/
DAbstractDirectedNetworkTest.java43 EndpointPair<Integer> endpointPair = network.incidentNodes(inEdge); in validateSourceAndTarget() local
44 assertThat(endpointPair.source()).isEqualTo(endpointPair.adjacentNode(node)); in validateSourceAndTarget()
45 assertThat(endpointPair.target()).isEqualTo(node); in validateSourceAndTarget()
49 EndpointPair<Integer> endpointPair = network.incidentNodes(outEdge); in validateSourceAndTarget() local
50 assertThat(endpointPair.source()).isEqualTo(node); in validateSourceAndTarget()
51 assertThat(endpointPair.target()).isEqualTo(endpointPair.adjacentNode(node)); in validateSourceAndTarget()
DEndpointPairTest.java93 EndpointPair<Integer> endpointPair = network.incidentNodes("1-2"); in testAdjacentNode_nodeNotIncident() local
95 endpointPair.adjacentNode(3); in testAdjacentNode_nodeNotIncident()
DAbstractNetworkTest.java176 EndpointPair<N> endpointPair = network.incidentNodes(edge); in validateNetwork() local
177 N nodeU = endpointPair.nodeU(); in validateNetwork()
178 N nodeV = endpointPair.nodeV(); in validateNetwork()
/external/guava/guava-tests/test/com/google/common/graph/
DAbstractDirectedNetworkTest.java44 EndpointPair<Integer> endpointPair = network.incidentNodes(inEdge); in validateSourceAndTarget() local
45 assertThat(endpointPair.source()).isEqualTo(endpointPair.adjacentNode(node)); in validateSourceAndTarget()
46 assertThat(endpointPair.target()).isEqualTo(node); in validateSourceAndTarget()
50 EndpointPair<Integer> endpointPair = network.incidentNodes(outEdge); in validateSourceAndTarget() local
51 assertThat(endpointPair.source()).isEqualTo(node); in validateSourceAndTarget()
52 assertThat(endpointPair.target()).isEqualTo(endpointPair.adjacentNode(node)); in validateSourceAndTarget()
DEndpointPairTest.java93 EndpointPair<Integer> endpointPair = network.incidentNodes("1-2"); in testAdjacentNode_nodeNotIncident() local
95 endpointPair.adjacentNode(3); in testAdjacentNode_nodeNotIncident()
DAbstractNetworkTest.java176 EndpointPair<N> endpointPair = network.incidentNodes(edge); in validateNetwork() local
177 N nodeU = endpointPair.nodeU(); in validateNetwork()
178 N nodeV = endpointPair.nodeV(); in validateNetwork()
/external/dagger2/java/dagger/internal/codegen/
DDependencyCycleValidator.java79 for (EndpointPair<Node> endpointPair : dependencyEndpointPairs) { in visitGraph()
80 cycleContainingEndpointPair(endpointPair, dependencyGraph, visited) in visitGraph()
172 .map(endpointPair -> nonCycleBreakingEdge(endpointPair, graph)) in errorMessage()
184 private DependencyEdge nonCycleBreakingEdge(EndpointPair<Node> endpointPair, BindingGraph graph) { in nonCycleBreakingEdge() argument
185 return graph.network().edgesConnecting(endpointPair.source(), endpointPair.target()).stream() in nonCycleBreakingEdge()