- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 100 for ranked (0.14 sec)
-
guava/src/com/google/common/collect/HashBiMap.java
import java.util.Set; import java.util.function.BiConsumer; import java.util.function.BiFunction; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * A {@link BiMap} backed by two hash tables. This implementation allows null keys and values. A * {@code HashBiMap} and its inverse are both serializable. * * <p>This implementation guarantees insertion-based iteration order of its keys. *
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) -
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,
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) -
guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ImmutableCollection.java
default: return new RegularImmutableAsList<E>(this, toArray()); } } /** If this collection is backed by an array of its elements in insertion order, returns it. */ Object @Nullable [] internalArray() { return null; } /** * If this collection is backed by an array of its elements in insertion order, returns the offset * where this collection's elements start. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Jan 23 18:43:40 GMT 2024 - 5K 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) -
guava/src/com/google/common/collect/JdkBackedImmutableMap.java
/** * Implementation of ImmutableMap backed by a JDK HashMap, which has smartness protecting against * hash flooding. */ @GwtCompatible(emulated = true) @ElementTypesAreNonnullByDefault final class JdkBackedImmutableMap<K, V> extends ImmutableMap<K, V> { /** * Creates an {@code ImmutableMap} backed by a JDK HashMap. Used when probable hash flooding is
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Nov 30 21:54:06 GMT 2023 - 4.8K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/RateLimiter.java
* acquire(1000)} will result in exactly the same throttling, if any), but it affects the throttling * of the <i>next</i> request. I.e., if an expensive task arrives at an idle RateLimiter, it will be * granted immediately, but it is the <i>next</i> request that will experience extra throttling, * thus paying for the cost of the expensive task. * * @author Dimitris Andreou * @since 13.0 */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 18.2K 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
*/ @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) -
android/guava/src/com/google/common/collect/EnumHashBiMap.java
import java.util.EnumMap; import java.util.HashMap; import java.util.Map; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * A {@code BiMap} backed by an {@code EnumMap} instance for keys-to-values, and a {@code HashMap} * instance for values-to-keys. Null keys are not permitted, but null values are. An {@code * EnumHashBiMap} and its inverse are both serializable. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Aug 24 01:40:03 GMT 2023 - 5.4K 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 May 03 12:43:13 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 27.2K bytes - Viewed (0)