- Sort Score
- Result 10 results
- Languages All
Results 1 - 4 of 4 for trial (0.14 sec)
-
android/guava-tests/test/com/google/common/graph/GraphMutationTest.java
} private static void testGraphMutation(GraphBuilder<? super Integer> graphBuilder) { Random gen = new Random(42); // Fixed seed so test results are deterministic. for (int trial = 0; trial < NUM_TRIALS; ++trial) { MutableGraph<Integer> graph = graphBuilder.allowsSelfLoops(true).build(); assertThat(graph.nodes()).isEmpty(); assertThat(graph.edges()).isEmpty();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Aug 18 16:17:46 GMT 2017 - 4.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/NetworkMutationTest.java
} private static void testNetworkMutation(NetworkBuilder<? super Integer, Object> networkBuilder) { Random gen = new Random(42); // Fixed seed so test results are deterministic. for (int trial = 0; trial < NUM_TRIALS; ++trial) { MutableNetwork<Integer, Object> network = networkBuilder.allowsParallelEdges(true).allowsSelfLoops(true).build(); assertThat(network.nodes()).isEmpty();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 10 19:42:18 GMT 2024 - 4.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/NetworkMutationTest.java
} private static void testNetworkMutation(NetworkBuilder<? super Integer, Object> networkBuilder) { Random gen = new Random(42); // Fixed seed so test results are deterministic. for (int trial = 0; trial < NUM_TRIALS; ++trial) { MutableNetwork<Integer, Object> network = networkBuilder.allowsParallelEdges(true).allowsSelfLoops(true).build(); assertThat(network.nodes()).isEmpty();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 10 19:42:18 GMT 2024 - 4.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/GraphMutationTest.java
} private static void testGraphMutation(GraphBuilder<? super Integer> graphBuilder) { Random gen = new Random(42); // Fixed seed so test results are deterministic. for (int trial = 0; trial < NUM_TRIALS; ++trial) { MutableGraph<Integer> graph = graphBuilder.allowsSelfLoops(true).build(); assertThat(graph.nodes()).isEmpty(); assertThat(graph.edges()).isEmpty();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Fri Aug 18 16:17:46 GMT 2017 - 4.2K bytes - Viewed (0)