- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 35 for French (0.19 sec)
-
guava-testlib/src/com/google/common/collect/testing/DerivedCollectionGenerators.java
// should never reach here! throw new UnsupportedOperationException(); } @Override public Entry<K, V> belowSamplesGreater() { // should never reach here! throw new UnsupportedOperationException(); } @Override public Entry<K, V> aboveSamplesLesser() { // should never reach here! throw new UnsupportedOperationException();
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 18.2K bytes - Viewed (0) -
android/guava/src/com/google/common/math/IntMath.java
return x > 0 & (x & (x - 1)) == 0; } /** * Returns 1 if {@code x < y} as unsigned integers, and 0 otherwise. Assumes that x - y fits into * a signed int. The implementation is branch-free, and benchmarks suggest it is measurably (if * narrowly) faster than the straightforward ternary expression. */ @VisibleForTesting static int lessThanBranchFree(int x, int y) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 23.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/DiscreteDomain.java
@CheckForNull public abstract C previous(C value); /** * Returns a signed value indicating how many nested invocations of {@link #next} (if positive) or * {@link #previous} (if negative) are needed to reach {@code end} starting from {@code start}. * For example, if {@code end = next(next(next(start)))}, then {@code distance(start, end) == 3} * and {@code distance(end, start) == -3}. As well, {@code distance(a, a)} is always zero.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 10.3K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/Striped64.java
* than CPUs, supposing that each thread were bound to a CPU, * there would exist a perfect hash function mapping threads to * slots that eliminates collisions. When we reach capacity, we * search for this mapping by randomly varying the hash codes of * colliding threads. Because search is random, and collisions * only become known via CAS failures, convergence can be slow,
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
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) -
android/guava/src/com/google/common/io/ByteStreams.java
int initialBufferSize = min(BUFFER_SIZE, max(128, Integer.highestOneBit(totalLen) * 2)); // Starting with an 8k buffer, double the size of each successive buffer. Smaller buffers // quadruple in size until they reach 8k, to minimize the number of small reads for longer // streams. Buffers are retained in a deque so that there's no copying between buffers while
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Jan 17 18:59:58 GMT 2024 - 29.7K bytes - Viewed (0) -
guava/src/com/google/common/base/Strings.java
return Platform.stringIsNullOrEmpty(string); } /** * Returns a string, of length at least {@code minLength}, consisting of {@code string} prepended * with as many copies of {@code padChar} as are necessary to reach that length. For example, * * <ul> * <li>{@code padStart("7", 3, '0')} returns {@code "007"} * <li>{@code padStart("2010", 3, '0')} returns {@code "2010"} * </ul> *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Sep 17 20:47:03 GMT 2021 - 12.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/DiscreteDomain.java
@CheckForNull public abstract C previous(C value); /** * Returns a signed value indicating how many nested invocations of {@link #next} (if positive) or * {@link #previous} (if negative) are needed to reach {@code end} starting from {@code start}. * For example, if {@code end = next(next(next(start)))}, then {@code distance(start, end) == 3} * and {@code distance(end, start) == -3}. As well, {@code distance(a, a)} is always zero.
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 10.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashBiMap.java
hashTableKToV[keyBucket] = dest; } else { int prevInBucket = hashTableKToV[keyBucket]; for (int entryInBucket = nextInBucketKToV[prevInBucket]; /* should never reach end */ ; entryInBucket = nextInBucketKToV[entryInBucket]) { if (entryInBucket == src) { nextInBucketKToV[prevInBucket] = dest; break; }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 06 16:06:58 GMT 2023 - 36.4K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
return x > 0 & (x & (x - 1)) == 0; } /** * Returns 1 if {@code x < y} as unsigned longs, and 0 otherwise. Assumes that x - y fits into a * signed long. The implementation is branch-free, and benchmarks suggest it is measurably faster * than the straightforward ternary expression. */ @VisibleForTesting static int lessThanBranchFree(long x, long y) { // Returns the sign bit of x - y.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 44.6K bytes - Viewed (0)