- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 27 for linkedin (0.2 sec)
-
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 Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Jun 15 18:00:07 GMT 2021 - 3.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
* 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). * * <p>A node with "prev" pointer equal to {@code ENDPOINT} is the first node in the linked list, * and a node with "next" pointer equal to {@code ENDPOINT} is the last node. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedHashMultimap.java
} /** * LinkedHashMultimap entries are in no less than three coexisting linked lists: a bucket in the * hash table for a {@code Set<V>} associated with a key, the linked list of insertion-ordered * entries in that {@code Set<V>}, and the linked list of entries in the LinkedHashMultimap as a * whole. */ @VisibleForTesting
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 23.6K bytes - Viewed (0) -
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 Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.7K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/metadata/ClasspathTransformation.java
* * @param dirtyGraph - dependency graph * @param scope - which classpath to extract * @param resolve - whether to resolve artifacts. * @return Collection of metadata objects in the linked subgraph of the graph which * contains the graph.getEntry() vertice */ ClasspathContainer transform(MetadataGraph dirtyGraph, ArtifactScopeEnum scope, boolean resolve)
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Wed Sep 06 11:28:54 GMT 2023 - 1.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/HashBasedTable.java
import com.google.common.annotations.GwtCompatible; import com.google.common.base.Supplier; import java.io.Serializable; import java.util.LinkedHashMap; import java.util.Map; /** * Implementation of {@link Table} using linked hash tables. This guarantees predictable iteration * order of the various views. * * <p>The views returned by {@link #column}, {@link #columnKeySet()}, and {@link #columnMap()} have
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Jan 24 17:47:51 GMT 2022 - 4K 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 Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedListMultimap.java
extends AbstractMultimap<K, V> implements ListMultimap<K, V>, Serializable { /* * Order is maintained using a linked list containing all key-value pairs. In * addition, a series of disjoint linked lists of "siblings", each containing * the values for a specific key, is used to implement {@link * ValueForKeyIterator} in constant time. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 27.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashBiMap.java
setSucceeds(oldPredecessor, oldSuccessor); // remove from insertion order linked list deleteFromTableKToV(entry, Hashing.smearedHash(keys[entry])); keys[entry] = newKey; insertIntoTableKToV(entry, Hashing.smearedHash(newKey)); // insert into insertion order linked list, usually at the end setSucceeds(newPredecessor, entry); setSucceeds(entry, newSuccessor); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Mar 06 16:06:58 GMT 2023 - 36.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/HashBiMap.java
this.lastInKeyInsertionOrder = null; this.size = 0; this.mask = tableSize - 1; this.modCount = 0; } /** * Finds and removes {@code entry} from the bucket linked lists in both the key-to-value direction * and the value-to-key direction. */ private void delete(BiEntry<K, V> entry) { int keyBucket = entry.keyHash & mask; BiEntry<K, V> prevBucketEntry = null;
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 24.5K bytes - Viewed (0)