- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 56 for Lange (1.44 sec)
-
android/guava-tests/test/com/google/common/util/concurrent/SimpleTimeLimiterTest.java
import static java.util.concurrent.TimeUnit.MILLISECONDS; import static org.junit.Assert.assertThrows; import com.google.common.base.Stopwatch; import com.google.common.collect.Range; import java.util.concurrent.Callable; import java.util.concurrent.ExecutionException; import java.util.concurrent.ExecutorService; import java.util.concurrent.Executors; import java.util.concurrent.TimeoutException;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 9.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/BoundType.java
* the License. */ package com.google.common.collect; import com.google.common.annotations.GwtCompatible; /** * Indicates whether an endpoint of some range is contained in the range itself ("closed") or not * ("open"). If a range is unbounded on a side, it is neither open nor closed on that side; the * bound simply does not exist. * * @since 10.0 */ @GwtCompatible @ElementTypesAreNonnullByDefault
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Sep 20 15:57:47 GMT 2021 - 1.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/EmptyContiguousSet.java
return 0; } @Override public ContiguousSet<C> intersection(ContiguousSet<C> other) { return this; } @Override public Range<C> range() { throw new NoSuchElementException(); } @Override public Range<C> range(BoundType lowerBoundType, BoundType upperBoundType) { throw new NoSuchElementException(); } @Override
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Tue Mar 28 18:35:00 GMT 2023 - 4.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/escape/UnicodeEscaperTest.java
UnicodeEscaper e = SIMPLE_ESCAPER; // Build up a range of surrogate pair characters to test final int min = Character.MIN_SUPPLEMENTARY_CODE_POINT; final int max = Character.MAX_CODE_POINT; final int range = max - min; final int s1 = min + (1 * range) / 4; final int s2 = min + (2 * range) / 4; final int s3 = min + (3 * range) / 4; final char[] dst = new char[12];
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 6.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/escape/ArrayBasedCharEscaperTest.java
protected char[] escapeUnsafe(char c) { return noChars; } }; EscaperAsserts.assertBasic(deletingEscaper); assertEquals( "Everything outside the printable ASCII range is deleted.", deletingEscaper.escape( "\tEverything\0 outside the\uD800\uDC00 " + "printable ASCII \uFFFFrange is \u007Fdeleted.\n")); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 07 23:02:38 GMT 2024 - 3.5K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/cache/LoadingCacheSingleThreadBenchmark.java
int max; static AtomicLong requests = new AtomicLong(0); static AtomicLong misses = new AtomicLong(0); @BeforeExperiment void setUp() { // random integers will be generated in this range, then raised to the // power of (1/concentration) and floor()ed max = Ints.checkedCast((long) Math.pow(distinctKeys, concentration)); cache = CacheBuilder.newBuilder()
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.4K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java
} return BigInteger.valueOf(result); } /* * We want each multiplication to have both sides with approximately the same number of digits. * Currently, we just divide the range in half. */ int mid = (n1 + n2) >>> 1; return oldSlowFactorial(n1, mid).multiply(oldSlowFactorial(mid, n2)); } @Benchmark int slowFactorial(int reps) { int tmp = 0;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/MathBenchmarking.java
} /** * Generates a number in [0, 2^numBits) with an exponential distribution. The floor of the log2 of * the result is chosen uniformly at random in [0, numBits), and then the result is chosen in that * range uniformly at random. Zero is treated as having log2 == 0. */ static BigInteger randomNonNegativeBigInteger(int numBits) { int digits = RANDOM_SOURCE.nextInt(numBits); if (digits == 0) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 4.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/StandardRowSortedTable.java
implements RowSortedTable<R, C, V> { /* * TODO(jlevy): Consider adding headTable, tailTable, and subTable methods, * which return a Table view with rows keys in a given range. Create a * RowSortedTable subinterface with the revised methods? */ StandardRowSortedTable( SortedMap<R, Map<C, V>> backingMap, Supplier<? extends Map<C, V>> factory) { super(backingMap, factory);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jul 15 15:41:16 GMT 2021 - 4.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/cache/LocalCacheMapComputeTest.java
final String delimiter = "-"; final String key = "key"; Cache<String, String> cache; // helper private static void doParallelCacheOp(int count, IntConsumer consumer) { IntStream.range(0, count).parallel().forEach(consumer); } @Override public void setUp() throws Exception { super.setUp(); this.cache = CacheBuilder.newBuilder()
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 6.3K bytes - Viewed (0)