- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 1,033 for Fall (0.15 sec)
-
android/guava/src/com/google/common/hash/Murmur3_128HashFunction.java
k2 ^= (long) toInt(bb.get(14)) << 48; // fall through case 14: k2 ^= (long) toInt(bb.get(13)) << 40; // fall through case 13: k2 ^= (long) toInt(bb.get(12)) << 32; // fall through case 12: k2 ^= (long) toInt(bb.get(11)) << 24; // fall through case 11: k2 ^= (long) toInt(bb.get(10)) << 16; // fall through case 10:
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 20 18:43:59 GMT 2021 - 5.6K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/LittleEndianByteArray.java
| ((source[offset + 3] & 0xFF) << 24); } /** * Indicates that the loading of Unsafe was successful and the load and store operations will be * very efficient. May be useful for calling code to fall back on an alternative implementation * that is slower than Unsafe.get/store but faster than the pure-Java mask-and-shift. */ static boolean usingUnsafe() { return (byteArray instanceof UnsafeByteArray); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 9.7K bytes - Viewed (0) -
android/guava/src/com/google/common/math/IntMath.java
* >40% faster than the Euclidean algorithm in benchmarks. */ int aTwos = Integer.numberOfTrailingZeros(a); a >>= aTwos; // divide out all 2s int bTwos = Integer.numberOfTrailingZeros(b); b >>= bTwos; // divide out all 2s while (a != b) { // both a, b are odd // The key to the binary GCD algorithm is as follows: // Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b).
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/cache/CacheLoader.java
* CacheBuilder#refreshAfterWrite}, or through a call to {@link LoadingCache#refresh}. * * <p>This implementation synchronously delegates to {@link #load}. It is recommended that it be * overridden with an asynchronous implementation when using {@link * CacheBuilder#refreshAfterWrite}. * * <p><b>Note:</b> <i>all exceptions thrown by this method will be logged and then swallowed</i>. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 19 20:20:14 GMT 2022 - 9.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ConcurrentHashMultiset.java
existingCounter = countMap.putIfAbsent(element, new AtomicInteger(occurrences)); if (existingCounter == null) { return 0; } // existingCounter != null: fall through to operate against the existing AtomicInteger } while (true) { int oldValue = existingCounter.get(); if (oldValue != 0) { try {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 20.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedBytes.java
} /** * Provides a lexicographical comparator implementation; either a Java implementation or a faster * implementation based on {@link Unsafe}. * * <p>Uses reflection to gracefully fall back to the Java implementation if {@code Unsafe} isn't * available. */ @VisibleForTesting static class LexicographicalComparatorHolder { static final String UNSAFE_COMPARATOR_NAME =
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 18.3K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
* bad. We do the leadingZeros check to avoid the division below if at all possible. * * Otherwise, if b == Long.MIN_VALUE, then the only allowed values of a are 0 and 1. We take * care of all a < 0 with their own check, because in particular, the case a == -1 will * incorrectly pass the division check below. * * In all other cases, we check that either a is 0 or the result is consistent with division.
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) -
guava/src/com/google/common/cache/Striped64.java
init = true; } } finally { busy = 0; } if (init) break; } else if (casBase(v = base, fn(v, x))) break; // Fall back on using base } } /** Sets base and all cells to the given value. */ final void internalReset(long initialValue) { Cell[] as = cells; base = initialValue; if (as != null) { int n = as.length;
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/math/BigIntegerMath.java
checkPositive("x", checkNotNull(x)); int logFloor = x.bitLength() - 1; switch (mode) { case UNNECESSARY: checkRoundingUnnecessary(isPowerOfTwo(x)); // fall through case DOWN: case FLOOR: return logFloor; case UP: case CEILING: return isPowerOfTwo(x) ? logFloor : logFloor + 1; case HALF_DOWN:
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 18.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/io/IoTestCase.java
testDir = testFile.getParentFile(); // the testdata directory } catch (Exception ignore) { // probably URISyntaxException or IllegalArgumentException // fall back to copying URLs to files in the testDir == null block below } } if (testDir == null) { // testdata resources aren't file:// urls, so create a directory to store them in and then
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 5.6K bytes - Viewed (0)