- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 17 for rinded (0.58 sec)
-
android/guava/src/com/google/common/collect/HashBiMap.java
@ParametricNullness final K key; int index; EntryForKey(int index) { // The cast is safe because we call forEntry only for indexes that contain entries. this.key = uncheckedCastNullableTToT(keys[index]); this.index = index; } void updateIndex() { if (index == ABSENT || index > size || !Objects.equal(keys[index], key)) { index = findEntryByKey(key); } }
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) -
guava/src/com/google/common/cache/ReferenceEntry.java
int getHash(); /** Returns the key for this entry. */ @CheckForNull K getKey(); /* * Used by entries that use access order. Access entries are maintained in a doubly-linked list. * New entries are added at the tail of the list at write time; stale entries are expired from * the head of the list. */ /** Returns the time that this entry was last accessed, in ns. */
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Tue Jun 15 18:00:07 GMT 2021 - 3.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
// We need to // 1. atomically swap the listeners with TOMBSTONE, this is because addListener uses that // to synchronize with us // 2. reverse the linked list, because despite our rather clear contract, people depend on us // executing listeners in the order they were added // 3. push all the items onto 'onto' and return the new head of the stack
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 63K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/ReferenceEntry.java
int getHash(); /** Returns the key for this entry. */ @CheckForNull K getKey(); /* * Used by entries that use access order. Access entries are maintained in a doubly-linked list. * New entries are added at the tail of the list at write time; stale entries are expired from * the head of the list. */ /** Returns the time that this entry was last accessed, in ns. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Jun 15 18:00:07 GMT 2021 - 3.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/QueuesTest.java
try { // if waiting works, this should get stuck Queues.drain(q, newArrayList(), 1, MAX_VALUE, NANOSECONDS); fail(); } catch (InterruptedException expected) { // we indeed waited; a slow thread had enough time to interrupt us } } // same as above; uninterruptible version private void assertUninterruptibleDrained(BlockingQueue<Object> q) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 12K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multiset.java
* @param newCount the desired count of the element in this multiset * @return {@code true} if the condition for modification was met. This implies that the multiset * was indeed modified, unless {@code oldCount == newCount}. * @throws IllegalArgumentException if {@code oldCount} or {@code newCount} is negative
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Sat Jun 17 14:40:53 GMT 2023 - 19.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
*/ @CheckForNull private transient int[] successor; /** Pointer to the first node in the linked list, or {@code ENDPOINT} if there are no entries. */ private transient int firstEntry; /** Pointer to the last node in the linked list, or {@code ENDPOINT} if there are no entries. */ private transient int lastEntry; CompactLinkedHashSet() { super(); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/ExecutionSequencer.java
private ExecutionSequencer() {} /** Creates a new instance. */ public static ExecutionSequencer create() { return new ExecutionSequencer(); } /** This reference acts as a pointer tracking the head of a linked list of ListenableFutures. */ private final AtomicReference<ListenableFuture<@Nullable Void>> ref = new AtomicReference<>(immediateVoidFuture());
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 22.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ObjectCountLinkedHashMap.java
* high 32 bits of each long is the "prev" pointer, whereas the low 32 bits is the "succ" pointer * (pointing to the nextEntry entry in the linked list). The pointers in [size(), entries.length) * are all "null" (UNSET). * * <p>A node with "prev" pointer equal to {@code ENDPOINT} is the first node in the linked list, * and a node with "nextEntry" pointer equal to {@code ENDPOINT} is the last node. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Jun 01 22:07:10 GMT 2021 - 5.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashMap.java
// linked list starting from `newTable`. In general, each element from the old linked list // belongs to a different linked list from `newTable`. We insert each element in turn at the // head of its appropriate `newTable` linked list. while (oldNext != UNSET) { int entryIndex = oldNext - 1; int oldEntry = entries[entryIndex];
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 35.8K bytes - Viewed (0)