| /external/guava/guava/src/com/google/common/graph/ |
| D | GraphBuilder.java | 95 .incidentEdgeOrder(graph.incidentEdgeOrder()); in from()
159 public <N1 extends N> GraphBuilder<N1> incidentEdgeOrder(ElementOrder<N1> incidentEdgeOrder) { in incidentEdgeOrder() method in GraphBuilder
161 incidentEdgeOrder.type() == ElementOrder.Type.UNORDERED in incidentEdgeOrder()
162 || incidentEdgeOrder.type() == ElementOrder.Type.STABLE, in incidentEdgeOrder()
165 incidentEdgeOrder); in incidentEdgeOrder() local
167 newBuilder.incidentEdgeOrder = checkNotNull(incidentEdgeOrder); in incidentEdgeOrder()
181 newBuilder.incidentEdgeOrder = incidentEdgeOrder; in copy()
|
| D | ValueGraphBuilder.java | 98 .incidentEdgeOrder(graph.incidentEdgeOrder()); in from()
163 public <N1 extends N> ValueGraphBuilder<N1, V> incidentEdgeOrder( in incidentEdgeOrder() method in ValueGraphBuilder
164 ElementOrder<N1> incidentEdgeOrder) { in incidentEdgeOrder() argument
166 incidentEdgeOrder.type() == ElementOrder.Type.UNORDERED in incidentEdgeOrder()
167 || incidentEdgeOrder.type() == ElementOrder.Type.STABLE, in incidentEdgeOrder()
170 incidentEdgeOrder); in incidentEdgeOrder() local
172 newBuilder.incidentEdgeOrder = checkNotNull(incidentEdgeOrder); in incidentEdgeOrder()
188 newBuilder.incidentEdgeOrder = incidentEdgeOrder; in copy()
|
| D | StandardMutableValueGraph.java | 44 private final ElementOrder<N> incidentEdgeOrder; field in StandardMutableValueGraph
49 incidentEdgeOrder = builder.incidentEdgeOrder.cast(); in StandardMutableValueGraph()
53 public ElementOrder<N> incidentEdgeOrder() { in incidentEdgeOrder() method in StandardMutableValueGraph
54 return incidentEdgeOrder; in incidentEdgeOrder()
178 ? DirectedGraphConnections.<N, V>of(incidentEdgeOrder) in newConnections()
179 : UndirectedGraphConnections.<N, V>of(incidentEdgeOrder); in newConnections()
|
| D | UndirectedGraphConnections.java | 47 static <N, V> UndirectedGraphConnections<N, V> of(ElementOrder<N> incidentEdgeOrder) { in of() argument
48 switch (incidentEdgeOrder.type()) { in of()
56 throw new AssertionError(incidentEdgeOrder.type()); in of()
|
| D | ForwardingGraph.java | 61 public ElementOrder<N> incidentEdgeOrder() { in incidentEdgeOrder() method in ForwardingGraph
62 return delegate().incidentEdgeOrder(); in incidentEdgeOrder()
|
| /external/guava/android/guava/src/com/google/common/graph/ |
| D | GraphBuilder.java | 95 .incidentEdgeOrder(graph.incidentEdgeOrder()); in from()
159 public <N1 extends N> GraphBuilder<N1> incidentEdgeOrder(ElementOrder<N1> incidentEdgeOrder) { in incidentEdgeOrder() argument
161 incidentEdgeOrder.type() == ElementOrder.Type.UNORDERED in incidentEdgeOrder()
162 || incidentEdgeOrder.type() == ElementOrder.Type.STABLE, in incidentEdgeOrder()
165 incidentEdgeOrder); in incidentEdgeOrder() local
167 newBuilder.incidentEdgeOrder = checkNotNull(incidentEdgeOrder); in incidentEdgeOrder()
181 newBuilder.incidentEdgeOrder = incidentEdgeOrder; in copy()
|
| D | ValueGraphBuilder.java | 98 .incidentEdgeOrder(graph.incidentEdgeOrder()); in from()
163 public <N1 extends N> ValueGraphBuilder<N1, V> incidentEdgeOrder( in incidentEdgeOrder() method in ValueGraphBuilder
164 ElementOrder<N1> incidentEdgeOrder) { in incidentEdgeOrder() argument
166 incidentEdgeOrder.type() == ElementOrder.Type.UNORDERED in incidentEdgeOrder()
167 || incidentEdgeOrder.type() == ElementOrder.Type.STABLE, in incidentEdgeOrder()
170 incidentEdgeOrder); in incidentEdgeOrder() local
172 newBuilder.incidentEdgeOrder = checkNotNull(incidentEdgeOrder); in incidentEdgeOrder()
188 newBuilder.incidentEdgeOrder = incidentEdgeOrder; in copy()
|
| D | StandardMutableValueGraph.java | 44 private final ElementOrder<N> incidentEdgeOrder; field in StandardMutableValueGraph
49 incidentEdgeOrder = builder.incidentEdgeOrder.cast(); in StandardMutableValueGraph()
53 public ElementOrder<N> incidentEdgeOrder() { in incidentEdgeOrder() method in StandardMutableValueGraph
54 return incidentEdgeOrder; in incidentEdgeOrder()
178 ? DirectedGraphConnections.<N, V>of(incidentEdgeOrder) in newConnections()
179 : UndirectedGraphConnections.<N, V>of(incidentEdgeOrder); in newConnections()
|
| D | UndirectedGraphConnections.java | 47 static <N, V> UndirectedGraphConnections<N, V> of(ElementOrder<N> incidentEdgeOrder) { in of() argument
48 switch (incidentEdgeOrder.type()) { in of()
56 throw new AssertionError(incidentEdgeOrder.type()); in of()
|
| D | ForwardingGraph.java | 61 public ElementOrder<N> incidentEdgeOrder() { in incidentEdgeOrder() method in ForwardingGraph
62 return delegate().incidentEdgeOrder(); in incidentEdgeOrder()
|
| D | ForwardingValueGraph.java | 63 public ElementOrder<N> incidentEdgeOrder() { in incidentEdgeOrder() method in ForwardingValueGraph
64 return delegate().incidentEdgeOrder(); in incidentEdgeOrder()
|
| /external/guava/guava-tests/test/com/google/common/graph/ |
| D | StandardMutableUndirectedGraphTest.java | 42 private final ElementOrder<Integer> incidentEdgeOrder; field in StandardMutableUndirectedGraphTest
45 boolean allowsSelfLoops, ElementOrder<Integer> incidentEdgeOrder) { in StandardMutableUndirectedGraphTest() argument
47 this.incidentEdgeOrder = incidentEdgeOrder; in StandardMutableUndirectedGraphTest()
54 .incidentEdgeOrder(incidentEdgeOrder) in createGraph()
|
| D | StandardMutableDirectedGraphTest.java | 42 private final ElementOrder<Integer> incidentEdgeOrder; field in StandardMutableDirectedGraphTest
45 boolean allowsSelfLoops, ElementOrder<Integer> incidentEdgeOrder) { in StandardMutableDirectedGraphTest() argument
47 this.incidentEdgeOrder = incidentEdgeOrder; in StandardMutableDirectedGraphTest()
54 .incidentEdgeOrder(incidentEdgeOrder) in createGraph()
|
| D | ImmutableValueGraphTest.java | 58 assertThat(immutableValueGraph.incidentEdgeOrder()).isEqualTo(ElementOrder.stable()); in incidentEdgeOrder_stable()
66 .incidentEdgeOrder(ElementOrder.unordered()) in incidentEdgeOrder_fromUnorderedGraph_stable()
69 assertThat(immutableValueGraph.incidentEdgeOrder()).isEqualTo(ElementOrder.stable()); in incidentEdgeOrder_fromUnorderedGraph_stable()
166 assertThat(graph.incidentEdgeOrder()).isEqualTo(ElementOrder.stable()); in immutableValueGraphBuilder_incidentEdgeOrder_stable()
173 .incidentEdgeOrder(ElementOrder.unordered()) in immutableValueGraphBuilder_fromUnorderedBuilder_incidentEdgeOrder_stable()
177 assertThat(graph.incidentEdgeOrder()).isEqualTo(ElementOrder.stable()); in immutableValueGraphBuilder_fromUnorderedBuilder_incidentEdgeOrder_stable()
|
| D | StandardImmutableGraphAdditionalTest.java | 93 assertThat(graph.incidentEdgeOrder()).isEqualTo(ElementOrder.stable()); in copyOf_incidentEdgeOrder()
100 GraphBuilder.undirected().incidentEdgeOrder(ElementOrder.unordered()).build()); in copyOf_fromUnorderedGraph_incidentEdgeOrder()
102 assertThat(graph.incidentEdgeOrder()).isEqualTo(ElementOrder.stable()); in copyOf_fromUnorderedGraph_incidentEdgeOrder()
|
| D | ValueGraphTest.java | 56 assertThat(graph.incidentEdgeOrder()).isEqualTo(asGraph.incidentEdgeOrder()); in validateGraphState()
128 graph = ValueGraphBuilder.directed().incidentEdgeOrder(ElementOrder.unordered()).build(); in incidentEdgeOrder_unordered()
129 assertThat(graph.incidentEdgeOrder()).isEqualTo(ElementOrder.unordered()); in incidentEdgeOrder_unordered()
134 graph = ValueGraphBuilder.directed().incidentEdgeOrder(ElementOrder.stable()).build(); in incidentEdgeOrder_stable()
135 assertThat(graph.incidentEdgeOrder()).isEqualTo(ElementOrder.stable()); in incidentEdgeOrder_stable()
416 graph = ValueGraphBuilder.directed().incidentEdgeOrder(ElementOrder.stable()).build(); in incidentEdges_stableIncidentEdgeOrder_preservesIncidentEdgesOrder_directed()
429 graph = ValueGraphBuilder.undirected().incidentEdgeOrder(ElementOrder.stable()).build(); in incidentEdges_stableIncidentEdgeOrder_preservesIncidentEdgesOrder_undirected()
|
| D | AbstractStandardUndirectedGraphTest.java | 249 assume().that(graph.incidentEdgeOrder().type()).isEqualTo(ElementOrder.Type.STABLE); in stableIncidentEdgeOrder_edges_returnsInStableOrder()
264 assume().that(graph.incidentEdgeOrder().type()).isEqualTo(ElementOrder.Type.STABLE); in stableIncidentEdgeOrder_adjacentNodes_returnsInConnectingEdgeInsertionOrder()
273 assume().that(graph.incidentEdgeOrder().type()).isEqualTo(ElementOrder.Type.STABLE); in stableIncidentEdgeOrder_predecessors_returnsInConnectingEdgeInsertionOrder()
282 assume().that(graph.incidentEdgeOrder().type()).isEqualTo(ElementOrder.Type.STABLE); in stableIncidentEdgeOrder_successors_returnsInConnectingEdgeInsertionOrder()
291 assume().that(graph.incidentEdgeOrder().type()).isEqualTo(ElementOrder.Type.STABLE); in stableIncidentEdgeOrder_incidentEdges_returnsInEdgeInsertionOrder()
305 assume().that(graph.incidentEdgeOrder().type()).isEqualTo(ElementOrder.Type.STABLE); in stableIncidentEdgeOrder_incidentEdges_withSelfLoop_returnsInEdgeInsertionOrder()
|
| D | AbstractStandardDirectedGraphTest.java | 247 assume().that(graph.incidentEdgeOrder().type()).isEqualTo(ElementOrder.Type.STABLE); in stableIncidentEdgeOrder_edges_returnsInStableOrder()
264 assume().that(graph.incidentEdgeOrder().type()).isEqualTo(ElementOrder.Type.STABLE); in stableIncidentEdgeOrder_adjacentNodes_returnsInConnectingEdgeInsertionOrder()
273 assume().that(graph.incidentEdgeOrder().type()).isEqualTo(ElementOrder.Type.STABLE); in stableIncidentEdgeOrder_predecessors_returnsInConnectingEdgeInsertionOrder()
282 assume().that(graph.incidentEdgeOrder().type()).isEqualTo(ElementOrder.Type.STABLE); in stableIncidentEdgeOrder_successors_returnsInConnectingEdgeInsertionOrder()
291 assume().that(graph.incidentEdgeOrder().type()).isEqualTo(ElementOrder.Type.STABLE); in stableIncidentEdgeOrder_incidentEdges_returnsInEdgeInsertionOrder()
308 assume().that(graph.incidentEdgeOrder().type()).isEqualTo(ElementOrder.Type.STABLE); in stableIncidentEdgeOrder_incidentEdges_withSelfLoop_returnsInEdgeInsertionOrder()
|
| /external/guava/android/guava-tests/test/com/google/common/graph/ |
| D | StandardMutableDirectedGraphTest.java | 42 private final ElementOrder<Integer> incidentEdgeOrder; field in StandardMutableDirectedGraphTest
45 boolean allowsSelfLoops, ElementOrder<Integer> incidentEdgeOrder) { in StandardMutableDirectedGraphTest() argument
47 this.incidentEdgeOrder = incidentEdgeOrder; in StandardMutableDirectedGraphTest()
54 .incidentEdgeOrder(incidentEdgeOrder) in createGraph()
|
| D | StandardMutableUndirectedGraphTest.java | 42 private final ElementOrder<Integer> incidentEdgeOrder; field in StandardMutableUndirectedGraphTest
45 boolean allowsSelfLoops, ElementOrder<Integer> incidentEdgeOrder) { in StandardMutableUndirectedGraphTest() argument
47 this.incidentEdgeOrder = incidentEdgeOrder; in StandardMutableUndirectedGraphTest()
54 .incidentEdgeOrder(incidentEdgeOrder) in createGraph()
|
| D | ImmutableValueGraphTest.java | 58 assertThat(immutableValueGraph.incidentEdgeOrder()).isEqualTo(ElementOrder.stable()); in incidentEdgeOrder_stable()
66 .incidentEdgeOrder(ElementOrder.unordered()) in incidentEdgeOrder_fromUnorderedGraph_stable()
69 assertThat(immutableValueGraph.incidentEdgeOrder()).isEqualTo(ElementOrder.stable()); in incidentEdgeOrder_fromUnorderedGraph_stable()
166 assertThat(graph.incidentEdgeOrder()).isEqualTo(ElementOrder.stable()); in immutableValueGraphBuilder_incidentEdgeOrder_stable()
173 .incidentEdgeOrder(ElementOrder.unordered()) in immutableValueGraphBuilder_fromUnorderedBuilder_incidentEdgeOrder_stable()
177 assertThat(graph.incidentEdgeOrder()).isEqualTo(ElementOrder.stable()); in immutableValueGraphBuilder_fromUnorderedBuilder_incidentEdgeOrder_stable()
|
| D | ValueGraphTest.java | 54 assertThat(graph.incidentEdgeOrder()).isEqualTo(asGraph.incidentEdgeOrder()); in validateGraphState()
126 graph = ValueGraphBuilder.directed().incidentEdgeOrder(ElementOrder.unordered()).build(); in incidentEdgeOrder_unordered()
127 assertThat(graph.incidentEdgeOrder()).isEqualTo(ElementOrder.unordered()); in incidentEdgeOrder_unordered()
132 graph = ValueGraphBuilder.directed().incidentEdgeOrder(ElementOrder.stable()).build(); in incidentEdgeOrder_stable()
133 assertThat(graph.incidentEdgeOrder()).isEqualTo(ElementOrder.stable()); in incidentEdgeOrder_stable()
356 graph = ValueGraphBuilder.directed().incidentEdgeOrder(ElementOrder.stable()).build(); in incidentEdges_stableIncidentEdgeOrder_preservesIncidentEdgesOrder_directed()
369 graph = ValueGraphBuilder.undirected().incidentEdgeOrder(ElementOrder.stable()).build(); in incidentEdges_stableIncidentEdgeOrder_preservesIncidentEdgesOrder_undirected()
|
| D | StandardImmutableGraphAdditionalTest.java | 93 assertThat(graph.incidentEdgeOrder()).isEqualTo(ElementOrder.stable()); in copyOf_incidentEdgeOrder()
100 GraphBuilder.undirected().incidentEdgeOrder(ElementOrder.unordered()).build()); in copyOf_fromUnorderedGraph_incidentEdgeOrder()
102 assertThat(graph.incidentEdgeOrder()).isEqualTo(ElementOrder.stable()); in copyOf_fromUnorderedGraph_incidentEdgeOrder()
|
| D | AbstractStandardUndirectedGraphTest.java | 249 assume().that(graph.incidentEdgeOrder().type()).isEqualTo(ElementOrder.Type.STABLE); in stableIncidentEdgeOrder_edges_returnsInStableOrder()
264 assume().that(graph.incidentEdgeOrder().type()).isEqualTo(ElementOrder.Type.STABLE); in stableIncidentEdgeOrder_adjacentNodes_returnsInConnectingEdgeInsertionOrder()
273 assume().that(graph.incidentEdgeOrder().type()).isEqualTo(ElementOrder.Type.STABLE); in stableIncidentEdgeOrder_predecessors_returnsInConnectingEdgeInsertionOrder()
282 assume().that(graph.incidentEdgeOrder().type()).isEqualTo(ElementOrder.Type.STABLE); in stableIncidentEdgeOrder_successors_returnsInConnectingEdgeInsertionOrder()
291 assume().that(graph.incidentEdgeOrder().type()).isEqualTo(ElementOrder.Type.STABLE); in stableIncidentEdgeOrder_incidentEdges_returnsInEdgeInsertionOrder()
305 assume().that(graph.incidentEdgeOrder().type()).isEqualTo(ElementOrder.Type.STABLE); in stableIncidentEdgeOrder_incidentEdges_withSelfLoop_returnsInEdgeInsertionOrder()
|
| D | AbstractStandardDirectedGraphTest.java | 247 assume().that(graph.incidentEdgeOrder().type()).isEqualTo(ElementOrder.Type.STABLE); in stableIncidentEdgeOrder_edges_returnsInStableOrder()
264 assume().that(graph.incidentEdgeOrder().type()).isEqualTo(ElementOrder.Type.STABLE); in stableIncidentEdgeOrder_adjacentNodes_returnsInConnectingEdgeInsertionOrder()
273 assume().that(graph.incidentEdgeOrder().type()).isEqualTo(ElementOrder.Type.STABLE); in stableIncidentEdgeOrder_predecessors_returnsInConnectingEdgeInsertionOrder()
282 assume().that(graph.incidentEdgeOrder().type()).isEqualTo(ElementOrder.Type.STABLE); in stableIncidentEdgeOrder_successors_returnsInConnectingEdgeInsertionOrder()
291 assume().that(graph.incidentEdgeOrder().type()).isEqualTo(ElementOrder.Type.STABLE); in stableIncidentEdgeOrder_incidentEdges_returnsInEdgeInsertionOrder()
308 assume().that(graph.incidentEdgeOrder().type()).isEqualTo(ElementOrder.Type.STABLE); in stableIncidentEdgeOrder_incidentEdges_withSelfLoop_returnsInEdgeInsertionOrder()
|