| /external/guava/guava-tests/test/com/google/common/graph/ |
| D | ConfigurableSimpleDirectedGraphTest.java | 99 Set<EndpointPair<Integer>> incidentEdges = graph.incidentEdges(N1); in incidentEdges_checkReturnedSetMutability() local
101 incidentEdges.add(EndpointPair.ordered(N1, N2)); in incidentEdges_checkReturnedSetMutability()
105 assertThat(incidentEdges).containsExactlyElementsIn(graph.incidentEdges(N1)); in incidentEdges_checkReturnedSetMutability()
|
| D | ConfigurableSimpleUndirectedGraphTest.java | 99 Set<EndpointPair<Integer>> incidentEdges = graph.incidentEdges(N1); in incidentEdges_checkReturnedSetMutability() local
101 incidentEdges.add(EndpointPair.unordered(N1, N2)); in incidentEdges_checkReturnedSetMutability()
105 assertThat(incidentEdges).containsExactlyElementsIn(graph.incidentEdges(N1)); in incidentEdges_checkReturnedSetMutability()
|
| D | AbstractNetworkTest.java | 184 assertThat(network.incidentEdges(nodeU)).contains(edge); in validateNetwork()
188 assertThat(network.incidentEdges(nodeV)).contains(edge); in validateNetwork()
192 for (E adjacentEdge : network.incidentEdges(incidentNode)) { in validateNetwork()
207 assertThat(network.incidentEdges(node).size() + selfLoopCount) in validateNetwork()
211 assertThat(network.incidentEdges(node).size() + selfLoopCount) in validateNetwork()
218 assertThat(network.inEdges(node)).isEqualTo(network.incidentEdges(node)); in validateNetwork()
219 assertThat(network.outEdges(node)).isEqualTo(network.incidentEdges(node)); in validateNetwork()
294 for (E incidentEdge : sanityCheckSet(network.incidentEdges(node))) { in validateNetwork()
303 assertThat(network.incidentEdges(node)).contains(inEdge); in validateNetwork()
312 assertThat(network.incidentEdges(node)).contains(outEdge); in validateNetwork()
[all …]
|
| D | ConfigurableSimpleDirectedNetworkTest.java | 70 Set<String> incidentEdges = network.incidentEdges(N1); in incidentEdges_checkReturnedSetMutability() local
72 incidentEdges.add(E12); in incidentEdges_checkReturnedSetMutability()
76 assertThat(network.incidentEdges(N1)).containsExactlyElementsIn(incidentEdges); in incidentEdges_checkReturnedSetMutability()
|
| D | ConfigurableSimpleUndirectedNetworkTest.java | 70 Set<String> incidentEdges = network.incidentEdges(N1); in incidentEdges_checkReturnedSetMutability() local
72 incidentEdges.add(E12); in incidentEdges_checkReturnedSetMutability()
76 assertThat(network.incidentEdges(N1)).containsExactlyElementsIn(incidentEdges); in incidentEdges_checkReturnedSetMutability()
|
| D | AbstractGraphTest.java | 166 assertThat(graph.incidentEdges(node)).contains(EndpointPair.of(graph, predecessor, node)); in validateGraph()
173 assertThat(graph.incidentEdges(node)).contains(EndpointPair.of(graph, node, successor)); in validateGraph()
176 for (EndpointPair<N> endpoints : sanityCheckSet(graph.incidentEdges(node))) { in validateGraph()
294 assertThat(graph.incidentEdges(N1)).isEmpty(); in incidentEdges_noIncidentEdges()
300 graph.incidentEdges(NODE_NOT_IN_GRAPH); in incidentEdges_nodeNotInGraph()
|
| D | AbstractUndirectedGraphTest.java | 62 assertThat(graph.incidentEdges(N1)).containsExactly(expectedEndpoints); in incidentEdges_oneEdge()
63 assertThat(graph.incidentEdges(N2)).containsExactly(expectedEndpoints); in incidentEdges_oneEdge()
|
| /external/guava/android/guava-tests/test/com/google/common/graph/ |
| D | ConfigurableSimpleUndirectedGraphTest.java | 99 Set<EndpointPair<Integer>> incidentEdges = graph.incidentEdges(N1); in incidentEdges_checkReturnedSetMutability() local
101 incidentEdges.add(EndpointPair.unordered(N1, N2)); in incidentEdges_checkReturnedSetMutability()
105 assertThat(incidentEdges).containsExactlyElementsIn(graph.incidentEdges(N1)); in incidentEdges_checkReturnedSetMutability()
|
| D | ConfigurableSimpleDirectedGraphTest.java | 99 Set<EndpointPair<Integer>> incidentEdges = graph.incidentEdges(N1); in incidentEdges_checkReturnedSetMutability() local
101 incidentEdges.add(EndpointPair.ordered(N1, N2)); in incidentEdges_checkReturnedSetMutability()
105 assertThat(incidentEdges).containsExactlyElementsIn(graph.incidentEdges(N1)); in incidentEdges_checkReturnedSetMutability()
|
| D | AbstractNetworkTest.java | 184 assertThat(network.incidentEdges(nodeU)).contains(edge); in validateNetwork()
188 assertThat(network.incidentEdges(nodeV)).contains(edge); in validateNetwork()
192 for (E adjacentEdge : network.incidentEdges(incidentNode)) { in validateNetwork()
207 assertThat(network.incidentEdges(node).size() + selfLoopCount) in validateNetwork()
211 assertThat(network.incidentEdges(node).size() + selfLoopCount) in validateNetwork()
218 assertThat(network.inEdges(node)).isEqualTo(network.incidentEdges(node)); in validateNetwork()
219 assertThat(network.outEdges(node)).isEqualTo(network.incidentEdges(node)); in validateNetwork()
287 for (E incidentEdge : sanityCheckSet(network.incidentEdges(node))) { in validateNetwork()
296 assertThat(network.incidentEdges(node)).contains(inEdge); in validateNetwork()
305 assertThat(network.incidentEdges(node)).contains(outEdge); in validateNetwork()
[all …]
|
| D | ConfigurableSimpleDirectedNetworkTest.java | 70 Set<String> incidentEdges = network.incidentEdges(N1); in incidentEdges_checkReturnedSetMutability() local
72 incidentEdges.add(E12); in incidentEdges_checkReturnedSetMutability()
76 assertThat(network.incidentEdges(N1)).containsExactlyElementsIn(incidentEdges); in incidentEdges_checkReturnedSetMutability()
|
| D | ConfigurableSimpleUndirectedNetworkTest.java | 70 Set<String> incidentEdges = network.incidentEdges(N1); in incidentEdges_checkReturnedSetMutability() local
72 incidentEdges.add(E12); in incidentEdges_checkReturnedSetMutability()
76 assertThat(network.incidentEdges(N1)).containsExactlyElementsIn(incidentEdges); in incidentEdges_checkReturnedSetMutability()
|
| D | AbstractGraphTest.java | 166 assertThat(graph.incidentEdges(node)).contains(EndpointPair.of(graph, predecessor, node)); in validateGraph()
173 assertThat(graph.incidentEdges(node)).contains(EndpointPair.of(graph, node, successor)); in validateGraph()
176 for (EndpointPair<N> endpoints : sanityCheckSet(graph.incidentEdges(node))) { in validateGraph()
294 assertThat(graph.incidentEdges(N1)).isEmpty(); in incidentEdges_noIncidentEdges()
300 graph.incidentEdges(NODE_NOT_IN_GRAPH); in incidentEdges_nodeNotInGraph()
|
| D | AbstractUndirectedGraphTest.java | 62 assertThat(graph.incidentEdges(N1)).containsExactly(expectedEndpoints); in incidentEdges_oneEdge()
63 assertThat(graph.incidentEdges(N2)).containsExactly(expectedEndpoints); in incidentEdges_oneEdge()
|
| D | ConfigurableDirectedGraphTest.java | 60 assertThat(graph.incidentEdges(N1)).containsExactly(EndpointPair.ordered(N1, N1)); in incidentEdges_selfLoop()
62 assertThat(graph.incidentEdges(N1)) in incidentEdges_selfLoop()
|
| /external/guava/android/guava/src/com/google/common/graph/ |
| D | UndirectedMultiNetworkConnections.java | 45 private UndirectedMultiNetworkConnections(Map<E, N> incidentEdges) { in UndirectedMultiNetworkConnections() argument
46 super(incidentEdges); in UndirectedMultiNetworkConnections()
54 static <N, E> UndirectedMultiNetworkConnections<N, E> ofImmutable(Map<E, N> incidentEdges) { in ofImmutable() argument
55 return new UndirectedMultiNetworkConnections<>(ImmutableMap.copyOf(incidentEdges)); in ofImmutable()
|
| D | AbstractUndirectedNetworkConnections.java | 52 public Set<E> incidentEdges() { in incidentEdges() method in AbstractUndirectedNetworkConnections
58 return incidentEdges(); in inEdges()
63 return incidentEdges(); in outEdges()
|
| D | AbstractDirectedNetworkConnections.java | 65 public Set<E> incidentEdges() { in incidentEdges() method in AbstractDirectedNetworkConnections
69 Iterable<E> incidentEdges = in incidentEdges()
73 return Iterators.unmodifiableIterator(incidentEdges.iterator()); in incidentEdges()
|
| D | UndirectedNetworkConnections.java | 45 static <N, E> UndirectedNetworkConnections<N, E> ofImmutable(Map<E, N> incidentEdges) { in ofImmutable() argument
46 return new UndirectedNetworkConnections<>(ImmutableBiMap.copyOf(incidentEdges)); in ofImmutable()
|
| D | ForwardingNetwork.java | 83 public Set<E> incidentEdges(N node) { in incidentEdges() method in ForwardingNetwork
84 return delegate().incidentEdges(node); in incidentEdges()
|
| /external/guava/guava/src/com/google/common/graph/ |
| D | UndirectedMultiNetworkConnections.java | 45 private UndirectedMultiNetworkConnections(Map<E, N> incidentEdges) { in UndirectedMultiNetworkConnections() argument
46 super(incidentEdges); in UndirectedMultiNetworkConnections()
54 static <N, E> UndirectedMultiNetworkConnections<N, E> ofImmutable(Map<E, N> incidentEdges) { in ofImmutable() argument
55 return new UndirectedMultiNetworkConnections<>(ImmutableMap.copyOf(incidentEdges)); in ofImmutable()
|
| D | AbstractUndirectedNetworkConnections.java | 52 public Set<E> incidentEdges() { in incidentEdges() method in AbstractUndirectedNetworkConnections
58 return incidentEdges(); in inEdges()
63 return incidentEdges(); in outEdges()
|
| D | AbstractDirectedNetworkConnections.java | 65 public Set<E> incidentEdges() { in incidentEdges() method in AbstractDirectedNetworkConnections
69 Iterable<E> incidentEdges = in incidentEdges()
73 return Iterators.unmodifiableIterator(incidentEdges.iterator()); in incidentEdges()
|
| D | UndirectedNetworkConnections.java | 45 static <N, E> UndirectedNetworkConnections<N, E> ofImmutable(Map<E, N> incidentEdges) { in ofImmutable() argument
46 return new UndirectedNetworkConnections<>(ImmutableBiMap.copyOf(incidentEdges)); in ofImmutable()
|
| D | ForwardingNetwork.java | 84 public Set<E> incidentEdges(N node) { in incidentEdges() method in ForwardingNetwork
85 return delegate().incidentEdges(node); in incidentEdges()
|