- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 71 for Difference (0.16 sec)
-
guava-testlib/src/com/google/common/collect/testing/Helpers.java
* incorrect values. This is useful for testing methods that must treat the return value from * size() as a hint only. * * @param delta the difference between the true size of the collection and the values returned by * the size method */ public static <T extends @Nullable Object> Collection<T> misleadingSizeCollection(int delta) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 26 19:46:10 GMT 2024 - 17.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
Set<E> endpointPairIncidentEdges = Sets.union(incidentEdges(endpointPair.nodeU()), incidentEdges(endpointPair.nodeV())); return edgeInvalidatableSet( Sets.difference(endpointPairIncidentEdges, ImmutableSet.of(edge)), edge); } @Override public Set<E> edgesConnecting(N nodeU, N nodeV) { Set<E> outEdgesU = outEdges(nodeU); Set<E> inEdgesV = inEdges(nodeV);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Mar 13 18:17:09 GMT 2024 - 10.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multisets.java
} } return endOfData(); } }; } }; } /** * Returns an unmodifiable view of the difference of two multisets. In the returned multiset, the * count of each element is the result of the <i>zero-truncated subtraction</i> of its count in
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 41.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
for (N node : copy) { successorFunction.successors(node); // Will throw if node doesn't exist } return copy; } /** * Abstracts away the difference between traversing a graph vs. a tree. For a tree, we just take * the next element from the next non-empty iterator; for graph, we need to loop through the next * non-empty iterator to find first unvisited node. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 30 20:12:45 GMT 2023 - 19.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/SetsTest.java
set1.add(samples().e3()); Set<String> set2 = Sets.newHashSet(samples().e3()); return Sets.difference(set1, set2); } }) .named("Sets.difference") .withFeatures(CollectionSize.ANY, CollectionFeature.ALLOWS_NULL_VALUES) .createTestSuite()); suite.addTest(
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 49.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Sets.java
return set1.containsAll(collection) && set2.containsAll(collection); } }; } /** * Returns an unmodifiable <b>view</b> of the difference of two sets. The returned set contains * all elements that are contained by {@code set1} and not contained by {@code set2}. {@code set2}
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 77.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/LongMathTest.java
@AndroidIncompatible // slow public void testLessThanBranchFree() { for (long x : ALL_LONG_CANDIDATES) { for (long y : ALL_LONG_CANDIDATES) { BigInteger difference = BigInteger.valueOf(x).subtract(BigInteger.valueOf(y)); if (fitsInLong(difference)) { int expected = (x < y) ? 1 : 0; int actual = LongMath.lessThanBranchFree(x, y); assertEquals(expected, actual); } }
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Mar 04 20:15:57 GMT 2024 - 32.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/ImmutableRangeSetTest.java
.add(Range.openClosed(3, 4)) .add(Range.open(8, 10)) .add(Range.openClosed(15, 17)) .build(); assertThat(RANGE_SET_ONE.difference(RANGE_SET_TWO)).isEqualTo(expected); } public void testAsSet() { ImmutableSortedSet<Integer> expectedSet = ImmutableSortedSet.of(2, 3, 4, 8, 9, 16, 17);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 21.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/AbstractStreamingHasherTest.java
} /** * This test creates a long random sequence of inputs, then a lot of differently configured sinks * process it; all should produce the same answer, the only difference should be the number of * process()/processRemaining() invocations, due to alignment. */ @AndroidIncompatible // slow. TODO(cpovirk): Maybe just reduce iterations under Android.
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 8.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/SmoothRateLimiter.java
* "an unused RateLimiter" is also defined by that notion: when we observe that the * "expected arrival time of the next request" is actually in the past, then the difference (now - * past) is the amount of time that the RateLimiter was formally unused, and it is that amount of * time which we translate to storedPermits. (We increase storedPermits with the amount of permits
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 19.3K bytes - Viewed (0)