- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 18 for Winters (0.16 sec)
-
android/guava/src/com/google/common/util/concurrent/Monitor.java
* fast) one */ public Monitor(boolean fair) { this.fair = fair; this.lock = new ReentrantLock(fair); } /** Enters this monitor. Blocks indefinitely. */ public void enter() { lock.lock(); } /** * Enters this monitor. Blocks at most the given time. * * @return whether the monitor was entered */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 18:22:01 GMT 2023 - 38.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
} private static final int ENDPOINT = -2; /** * Contains the link pointers corresponding with the entries, in the range of [0, size()). The * high 32 bits of each long is the "prev" pointer, whereas the low 32 bits is the "succ" pointer * (pointing to the next entry in the linked list). The pointers in [size(), entries.length) are * all "null" (UNSET). *
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/src/com/google/common/util/concurrent/ExecutionList.java
// drop the contract on the method that enforces this queue like behavior since depending on it // is likely to be a bug anyway. // N.B. All writes to the list and the next pointers must have happened before the above // synchronized block, so we can iterate the list without the lock held here. RunnableExecutorPair reversedList = null; while (list != null) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 6.9K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/DerivedCollectionGenerators.java
SortedSet<E> set = delegate.create(allEntries.toArray()); return createSubSet(set, firstExclusive, lastExclusive); } /** Calls the smallest subSet overload that filters out the extreme values. */ SortedSet<E> createSubSet(SortedSet<E> set, E firstExclusive, E lastExclusive) { if (from == Bound.NO_BOUND && to == Bound.EXCLUSIVE) { return set.headSet(lastExclusive);
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/net/InetAddresses.java
* <li><a target="_parent" href="http://www.cymru.com/Bogons/v6bogon.html">http://www.cymru.com/ * Bogons/v6bogon.html</a> * <li><a target="_parent" href="http://www.space.net/~gert/RIPE/ipv6-filters.html">http://www. * space.net/~gert/RIPE/ipv6-filters.html</a> * </ul> * * @author Erik Kline * @since 5.0 */ @J2ktIncompatible @GwtIncompatible @ElementTypesAreNonnullByDefault public final class InetAddresses {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 44K bytes - Viewed (1) -
android/guava/src/com/google/common/collect/CompactHashSet.java
* less than or equal to the hashtable mask. * * <pre> * hash = aaaaaaaa * mask = 00000fff * next = 00000bbb * entry = aaaaabbb * </pre> * * <p>The pointers in [size(), entries.length) are all "null" (UNSET). */ @CheckForNull private transient int[] entries; /** * The elements contained in the set, in the range of [0, size()). The elements in [size(),
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableMultimap.java
currentKey = entry.getKey(); valueItr = entry.getValue().iterator(); } /* * requireNonNull is safe: The first call to this method always enters the !hasNext() case * and populates currentKey, after which it's never cleared. */ return immutableEntry(requireNonNull(currentKey), valueItr.next()); } }; } /**
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 24.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableMultimap.java
currentKey = entry.getKey(); valueItr = entry.getValue().iterator(); } /* * requireNonNull is safe: The first call to this method always enters the !hasNext() case * and populates currentKey, after which it's never cleared. */ return immutableEntry(requireNonNull(currentKey), valueItr.next()); } }; }
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 25.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableMapEntry.java
* RegularImmutableBiMap}, which don't have to recopy the entries created by their {@code Builder} * implementations. * * <p>This base implementation has no key or value pointers, so instances of ImmutableMapEntry (but * not its subclasses) can be reused when copied from one ImmutableMap to another. * * @author Louis Wasserman */ @GwtIncompatible // unnecessary
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 4.4K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilter.java
* but if it claims that an element is <i>not</i> contained in it, then this is definitely true. * * <p>If you are unfamiliar with Bloom filters, this nice <a * href="http://llimllib.github.io/bloomfilter-tutorial/">tutorial</a> may help you understand how * they work. * * <p>The false positive probability ({@code FPP}) of a Bloom filter is defined as the probability
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 23.1K bytes - Viewed (0)