- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 91 for isFalse (0.14 sec)
-
guava-tests/test/com/google/common/graph/GraphPropertiesTest.java
assertThat(hasCycle(directedGraph)).isFalse(); assertThat(hasCycle(undirectedGraph)).isFalse(); } @Test public void hasCycle_isolatedNodes() { for (MutableGraph<Integer> graph : graphsToTest) { graph.addNode(1); graph.addNode(2); } assertThat(hasCycle(directedGraph)).isFalse(); assertThat(hasCycle(undirectedGraph)).isFalse(); } @Test
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 07 15:09:01 GMT 2016 - 5.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/AbstractAbstractFutureTest.java
assertThat(future.set(99)).isFalse(); assertThat(future.setException(new IndexOutOfBoundsException())).isFalse(); assertThat(future.setFuture(new AbstractFuture<Integer>() {})).isFalse(); assertThat(future.setFuture(immediateFuture(99))).isFalse(); } private static void assertCannotCancel(AbstractFuture<Integer> future) { assertThat(future.cancel(true)).isFalse();
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 13 14:28:25 GMT 2024 - 15.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java
putEdge(N1, N2); assertThat(graph.hasEdgeConnecting(EndpointPair.ordered(N2, N1))).isFalse(); } @Test public void hasEdgeConnecting_mismatch() { putEdge(N1, N2); assertThat(graph.hasEdgeConnecting(EndpointPair.unordered(N1, N2))).isFalse(); assertThat(graph.hasEdgeConnecting(EndpointPair.unordered(N2, N1))).isFalse(); } @Test public void adjacentNodes_selfLoop() {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 14.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractGraphTest.java
assertThat(graphAsMutableGraph.addNode(N1)).isFalse(); assertThat(graph.nodes()).containsExactlyElementsIn(nodes); } @Test public void removeNode_existingNode() { assume().that(graphIsMutable()).isTrue(); putEdge(N1, N2); putEdge(N4, N1); assertThat(graphAsMutableGraph.removeNode(N1)).isTrue(); assertThat(graphAsMutableGraph.removeNode(N1)).isFalse();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 16.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/BooleansTest.java
assertThat(listEqualsArray).isFalse(); assertThat(Booleans.asList(ARRAY_FALSE).equals(null)).isFalse(); assertThat(Booleans.asList(ARRAY_FALSE).equals(Booleans.asList(ARRAY_FALSE_TRUE))).isFalse(); assertThat(Booleans.asList(ARRAY_FALSE_FALSE).equals(Booleans.asList(ARRAY_FALSE_TRUE))) .isFalse(); assertEquals(1, Booleans.asList(ARRAY_FALSE_TRUE).lastIndexOf(true));
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Mar 04 15:43:29 GMT 2024 - 23.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/BooleansTest.java
assertThat(listEqualsArray).isFalse(); assertThat(Booleans.asList(ARRAY_FALSE).equals(null)).isFalse(); assertThat(Booleans.asList(ARRAY_FALSE).equals(Booleans.asList(ARRAY_FALSE_TRUE))).isFalse(); assertThat(Booleans.asList(ARRAY_FALSE_FALSE).equals(Booleans.asList(ARRAY_FALSE_TRUE))) .isFalse(); assertEquals(1, Booleans.asList(ARRAY_FALSE_TRUE).lastIndexOf(true));
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 04 15:43:29 GMT 2024 - 23.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/LinearTransformationTest.java
double y1 = 3.4; double slope = Double.MIN_VALUE; LinearTransformation transformation = LinearTransformation.mapping(x1, y1).withSlope(slope); assertThat(transformation.isVertical()).isFalse(); assertThat(transformation.isHorizontal()).isFalse(); assertThat(transformation.slope()).isWithin(ALLOWED_ERROR).of(slope); // Note that we cannot test the actual mapping of points, as the results will be unreliable due
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 7.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/LinearTransformationTest.java
double y1 = 3.4; double slope = Double.MIN_VALUE; LinearTransformation transformation = LinearTransformation.mapping(x1, y1).withSlope(slope); assertThat(transformation.isVertical()).isFalse(); assertThat(transformation.isHorizontal()).isFalse(); assertThat(transformation.slope()).isWithin(ALLOWED_ERROR).of(slope); // Note that we cannot test the actual mapping of points, as the results will be unreliable due
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 7.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/CompactLinkedHashSetTest.java
CompactHashSet<Integer> set = CompactHashSet.create(); assertThat(set.needsAllocArrays()).isTrue(); assertThat(set.elements).isNull(); set.add(1); assertThat(set.needsAllocArrays()).isFalse(); assertThat(set.elements).hasLength(CompactHashing.DEFAULT_SIZE); } public void testAllocArraysExpectedSize() { for (int i = 0; i <= CompactHashing.DEFAULT_SIZE; i++) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Oct 24 18:57:48 GMT 2019 - 3.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java
assume().that(graphIsMutable()).isTrue(); addEdge(N1, N2, E12); ImmutableSet<String> edges = ImmutableSet.copyOf(network.edges()); assertThat(networkAsMutableNetwork.addEdge(N1, N2, E12)).isFalse(); assertThat(network.edges()).containsExactlyElementsIn(edges); } @Test public void addEdge_existingEdgeBetweenDifferentNodes() { assume().that(graphIsMutable()).isTrue();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.2K bytes - Viewed (0)