- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 57 for Arantes (0.15 sec)
-
guava-tests/test/com/google/common/hash/BloomFilterTest.java
double actualReportedFpp = bf.expectedFpp(); assertEquals(expectedReportedFpp, actualReportedFpp, 0.00033); } /** Sanity checking with many combinations of false positive rates and expected insertions */ public void testBasic() { for (double fpr = 0.0000001; fpr < 0.1; fpr *= 10) { for (int expectedInsertions = 1; expectedInsertions <= 10000; expectedInsertions *= 10) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Nov 09 22:49:56 GMT 2023 - 21.3K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
* * <p>This class supports an optional fairness policy for ordering waiting producer and consumer * threads. By default, this ordering is not guaranteed. However, a queue constructed with fairness * set to {@code true} grants threads access in FIFO order. Fairness generally decreases throughput * but reduces variability and avoids starvation. * * <p>This class and its iterator implement all of the optional methods of the {@link
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 22.5K bytes - Viewed (0) -
guava/src/com/google/common/base/CharMatcher.java
} @Override public boolean matches(char c) { return c <= '\u007f'; } } /** Implementation that matches characters that fall within multiple ranges. */ private static class RangesMatcher extends CharMatcher { private final String description; private final char[] rangeStarts; private final char[] rangeEnds;
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 53.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/TreeRangeMapTest.java
for (Range<Integer> range : RANGES) { Map<Integer, Integer> model = Maps.newHashMap(); putModel(model, range, 1); RangeMap<Integer, Integer> test = TreeRangeMap.create(); test.put(range, 1); verify(model, test); } } public void testAllRangePairs() { for (Range<Integer> range1 : RANGES) { for (Range<Integer> range2 : RANGES) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 20:09:59 GMT 2024 - 33.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/AbstractRangeSet.java
public boolean enclosesAll(Iterable<Range<C>> ranges) { for (Range<C> range : ranges) { if (!encloses(range)) { return false; } } return true; } @Override public void addAll(RangeSet<C> other) { addAll(other.asRanges()); } @Override public void addAll(Iterable<Range<C>> ranges) { for (Range<C> range : ranges) { add(range); } }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 2.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ContiguousSet.java
/** * A sorted set of contiguous values in a given {@link DiscreteDomain}. Example: * * <pre>{@code * ContiguousSet.create(Range.closed(5, 42), DiscreteDomain.integers()) * }</pre> * * <p>Note that because bounded ranges over {@code int} and {@code long} values are so common, this * particular example can be written as just: * * <pre>{@code * ContiguousSet.closed(5, 42) * }</pre> *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Nov 30 21:54:06 GMT 2023 - 9.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/IntMathTest.java
@GwtIncompatible // java.math.BigInteger public void testMean() { // Odd-sized ranges have an obvious mean assertMean(2, 1, 3); assertMean(-2, -3, -1); assertMean(0, -1, 1); assertMean(1, -1, 3); assertMean((1 << 30) - 1, -1, Integer.MAX_VALUE); // Even-sized ranges should prefer the lower mean assertMean(2, 1, 4); assertMean(-3, -4, -1); assertMean(0, -1, 2);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 24.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/GeneralRange.java
return cmp > 0 | (cmp == 0 & getUpperBoundType() == OPEN); } boolean contains(@ParametricNullness T t) { return !tooLow(t) && !tooHigh(t); } /** * Returns the intersection of the two ranges, or an empty range if their intersection is empty. */ @SuppressWarnings("nullness") // TODO(cpovirk): Add casts as needed. Will be noisy and annoying... GeneralRange<T> intersect(GeneralRange<T> other) {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 10.8K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Striped64.java
* only become known via CAS failures, convergence can be slow, * and because threads are typically not bound to CPUS forever, * may not occur at all. However, despite these limitations, * observed contention rates are typically low in these cases. * * It is possible for a Cell to become unused when threads that * once hashed to it terminate, as well as in the case where * doubling the table causes no thread to hash to it under
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
* * <p>This class supports an optional fairness policy for ordering waiting producer and consumer * threads. By default, this ordering is not guaranteed. However, a queue constructed with fairness * set to {@code true} grants threads access in FIFO order. Fairness generally decreases throughput * but reduces variability and avoids starvation. * * <p>This class and its iterator implement all of the optional methods of the {@link
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 22.5K bytes - Viewed (0)