- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 31 for nearby (0.15 sec)
-
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
links = null; return result; } /* * For discussion of the safety of the following methods for operating on predecessors and * successors, see the comments near the end of CompactHashMap, noting that the methods here call * link(), which is defined at the end of this file. */ private int getPredecessor(int entry) { return ((int) (link(entry) >>> 32)) - 1; }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/base/AsciiTest.java
assertFalse(Ascii.equalsIgnoreCase("x", "")); assertTrue(Ascii.equalsIgnoreCase(LOWER, UPPER)); assertTrue(Ascii.equalsIgnoreCase(UPPER, LOWER)); // Create new strings here to avoid early-out logic. assertTrue(Ascii.equalsIgnoreCase(new String(IGNORED), new String(IGNORED))); // Compare to: "\u00c1".equalsIgnoreCase("\u00e1") == true assertFalse(Ascii.equalsIgnoreCase("\u00c1", "\u00e1"));
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 5.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
this.predecessor = null; this.successor = null; return result; } /* * For discussion of the safety of the following methods for operating on predecessors and * successors, see the comments near the end of CompactHashMap, noting that the methods here call * requirePredecessors() and requireSuccessors(), which are defined at the end of this file. */ private int getPredecessor(int entry) {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.7K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
* technique previously used by BigIntegerMath: maintain separate numerator and * denominator accumulators, multiplying the fraction into result when near overflow. */ for (int i = 2; i <= k; i++, n--) { if (numeratorBits + nBits < Long.SIZE - 1) { // It's definitely safe to multiply into numerator and denominator.
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
/* * This class maintains a lazily-initialized table of atomically * updated variables, plus an extra "base" field. The table size * is a power of two. Indexing uses masked per-thread hash codes. * Nearly all declarations in this class are package-private, * accessed directly by subclasses. * * Table entries are of class Cell; a variant of AtomicLong padded * to reduce cache contention on most processors. Padding is
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/collect/SortedLists.java
* key, the choice of {@link KeyAbsentBehavior} decides which index is returned. * * <p>This method runs in log(n) time on random-access lists, which offer near-constant-time * access to each list element. * * @param list the list to be searched. * @param key the value to be searched for. * @param comparator the comparator by which the list is ordered.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 10.9K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Converter.java
* `Function<@Nullable A, @Nullable B>` already had to find a workaround. Still, there is a *ton* of * fallout from trying to switch. I would be shocked if the switch would offer benefits to anywhere * near enough users to justify the costs. * * Fortunately, if anyone does want to use a Converter as a `Function<@Nullable A, @Nullable B>`, * it's easy to get one: `converter::convert`. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 23K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/FuturesTest.java
* used to bail after 20ms during the expected-successful tests, and there we saw a failure rate * of ~1/5000, meaning that the other thread's get() call nearly always completes within 20ms if * it's going to complete at all). * * <p>[*] To avoid hangs, I've disabled the in-thread calls. This makes the test take (very
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 144.5K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/Striped64.java
/* * This class maintains a lazily-initialized table of atomically * updated variables, plus an extra "base" field. The table size * is a power of two. Indexing uses masked per-thread hash codes. * Nearly all declarations in this class are package-private, * accessed directly by subclasses. * * Table entries are of class Cell; a variant of AtomicLong padded * to reduce cache contention on most processors. Padding is
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/util/concurrent/TimeoutFuture.java
import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * Implementation of {@code Futures#withTimeout}. * * <p>Future that delegates to another but will finish early (via a {@link TimeoutException} wrapped * in an {@link ExecutionException}) if the specified duration expires. The delegate future is * interrupted and cancelled if it times out. */ @J2ktIncompatible @GwtIncompatible
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 7.7K bytes - Viewed (0)