- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 321 for linkTo (0.22 sec)
-
guava/src/com/google/common/collect/CompactLinkedHashMap.java
* and a node with "next" pointer equal to {@code ENDPOINT} is the last node. */ @CheckForNull @VisibleForTesting transient long[] links; /** 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. */
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 10.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashMap.java
// We need to rewrite the `next` link of each of the elements so that it is in the appropriate // 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;
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 39.8K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/collect/StreamsBenchmark.java
* * @author Louis Wasserman */ public class StreamsBenchmark { @Param({"1", "10", "100", "1000", "10000"}) private int size; enum CollectionType { ARRAY_LIST(ArrayList::new), LINKED_LIST(LinkedList::new); final Supplier<Collection<Object>> supplier; private CollectionType(Supplier<Collection<Object>> supplier) { this.supplier = supplier; } }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Nov 03 19:39:41 GMT 2016 - 2.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashBasedTable.java
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 * iterators that don't support {@code remove()}. Otherwise, all optional operations are supported.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jan 24 17:47:51 GMT 2022 - 4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
* and a node with "next" pointer equal to {@code ENDPOINT} is the last node. */ @CheckForNull @VisibleForTesting transient long[] links; /** 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. */
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/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 May 03 12:43:13 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
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(); } CompactLinkedHashSet(int expectedSize) { super(expectedSize); } @Override void init(int expectedSize) {
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) -
guava/src/com/google/common/collect/HashBasedTable.java
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 * iterators that don't support {@code remove()}. Otherwise, all optional operations are supported.
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/LinkedListMultimap.java
* iterate across the key-value mappings in the order they were added to the multimap. * * <p>The {@link #values()} and {@link #entries()} methods both return a {@code List}, instead of * the {@code Collection} specified by the {@link ListMultimap} interface. * * <p>The methods {@link #get}, {@link #keySet()}, {@link #keys()}, {@link #values}, {@link
Java - Registered: Fri May 03 12:43:13 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 May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 06 16:06:58 GMT 2023 - 36.4K bytes - Viewed (0)