- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 289 for unordered (0.18 sec)
-
guava-tests/test/com/google/common/graph/StandardImmutableGraphAdditionalTest.java
assertThat(graph.nodes()).containsExactly("A", "B"); assertThat(graph.edges()).containsExactly(EndpointPair.ordered("A", "B")); } @Test public void immutableGraphBuilder_putEdgeFromEndpointPair() { ImmutableGraph<String> graph = GraphBuilder.directed().<String>immutable().putEdge(EndpointPair.ordered("A", "B")).build(); assertThat(graph.nodes()).containsExactly("A", "B");
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Jan 09 20:24:43 GMT 2020 - 4.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphBuilder.java
* * <p>The default value is {@link ElementOrder#unordered() unordered} for mutable graphs. For * immutable graphs, this value is ignored; they always have a {@link ElementOrder#stable() * stable} order. * * @throws IllegalArgumentException if {@code incidentEdgeOrder} is not either {@code * ElementOrder.unordered()} or {@code ElementOrder.stable()}. * @since 29.0 */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jun 03 01:21:31 GMT 2022 - 7.3K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/TestIntegerSetGenerator.java
* * <p>Note: This default implementation is overkill (but valid) for an unordered container. An * equally valid implementation for an unordered container is to throw an exception. The chosen * implementation, however, has the advantage of working for insertion-ordered containers, as * well. */ @Override public List<Integer> order(List<Integer> insertionOrder) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 2.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/ImmutableValueGraphTest.java
.putEdgeValue(1, 2, "1-2") .build(); assertThat(graph.incidentEdges(2)) .containsExactly( EndpointPair.ordered(2, 1), EndpointPair.ordered(2, 3), EndpointPair.ordered(1, 2)) .inOrder(); } @Test public void immutableValueGraphBuilder_incidentEdgeOrder_stable() { ImmutableValueGraph<Integer, String> graph =
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jan 09 20:24:43 GMT 2020 - 6.4K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/TestStringSetGenerator.java
* * <p>Note: This default implementation is overkill (but valid) for an unordered container. An * equally valid implementation for an unordered container is to throw an exception. The chosen * implementation, however, has the advantage of working for insertion-ordered containers, as * well. */ @Override public List<String> order(List<String> insertionOrder) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 2.1K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/TestIntegerSetGenerator.java
* * <p>Note: This default implementation is overkill (but valid) for an unordered container. An * equally valid implementation for an unordered container is to throw an exception. The chosen * implementation, however, has the advantage of working for insertion-ordered containers, as * well. */ @Override public List<Integer> order(List<Integer> insertionOrder) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 2.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/ElementOrderTest.java
@RunWith(JUnit4.class) public final class ElementOrderTest { // Node order tests @Test public void nodeOrder_none() { MutableGraph<Integer> graph = GraphBuilder.directed().nodeOrder(unordered()).build(); assertThat(graph.nodeOrder()).isEqualTo(unordered()); } @Test public void nodeOrder_insertion() { MutableGraph<Integer> graph = GraphBuilder.directed().nodeOrder(insertion()).build(); addNodes(graph);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 8.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/StandardMutableDirectedGraphTest.java
@Parameters(name = "allowsSelfLoops={0}, incidentEdgeOrder={1}") public static Collection<Object[]> parameters() { return Arrays.asList( new Object[][] { {false, ElementOrder.unordered()}, {true, ElementOrder.unordered()}, {false, ElementOrder.stable()}, {true, ElementOrder.stable()}, }); } private final boolean allowsSelfLoops;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Mar 10 17:54:18 GMT 2020 - 2K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java
} @Test public void edges_containsOrderMismatch() { addEdge(N1, N2, E12); EndpointPair<Integer> endpointsN1N2 = EndpointPair.unordered(N1, N2); EndpointPair<Integer> endpointsN2N1 = EndpointPair.unordered(N2, N1); assertThat(network.asGraph().edges()).doesNotContain(endpointsN1N2); assertThat(network.asGraph().edges()).doesNotContain(endpointsN2N1); } @Test
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/StandardMutableDirectedGraphTest.java
@Parameters(name = "allowsSelfLoops={0}, incidentEdgeOrder={1}") public static Collection<Object[]> parameters() { return Arrays.asList( new Object[][] { {false, ElementOrder.unordered()}, {true, ElementOrder.unordered()}, {false, ElementOrder.stable()}, {true, ElementOrder.stable()}, }); } private final boolean allowsSelfLoops;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Mar 10 17:54:18 GMT 2020 - 2K bytes - Viewed (0)