final class RegularImmutableBiMap.Inverse.InverseEntrySet extends ImmutableMapEntrySet<V,K>
ImmutableMapEntrySet.RegularEntrySet<K,V>
ImmutableSet.Builder<E>, ImmutableSet.Indexed<E>
HASH_FLOODING_FPP, MAX_RUN_MULTIPLIER, MAX_TABLE_SIZE, SPLITERATOR_CHARACTERISTICS
Constructor and Description |
---|
InverseEntrySet() |
Modifier and Type | Method and Description |
---|---|
(package private) ImmutableList<java.util.Map.Entry<V,K>> |
createAsList() |
void |
forEach(java.util.function.Consumer<? super java.util.Map.Entry<V,K>> action) |
int |
hashCode() |
(package private) boolean |
isHashCodeFast()
Returns
true if the hashCode() method runs quickly. |
UnmodifiableIterator<java.util.Map.Entry<V,K>> |
iterator()
Returns an unmodifiable iterator across the elements in this collection.
|
(package private) ImmutableMap<V,K> |
map() |
contains, isPartialView, size, writeReplace
asList, builder, builderWithExpectedSize, chooseTableSize, copyOf, copyOf, copyOf, copyOf, equals, hashFloodingDetected, maxRunBeforeFallback, of, of, of, of, of, of, of, rebuildHashTable, toImmutableSet
add, addAll, clear, copyIntoArray, remove, removeAll, removeIf, retainAll, spliterator, toArray, toArray
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
ImmutableMap<V,K> map()
map
in class ImmutableMapEntrySet<V,K>
boolean isHashCodeFast()
ImmutableSet
true
if the hashCode()
method runs quickly.isHashCodeFast
in class ImmutableMapEntrySet<V,K>
public int hashCode()
public UnmodifiableIterator<java.util.Map.Entry<V,K>> iterator()
ImmutableCollection
iterator
in interface java.lang.Iterable<java.util.Map.Entry<V,K>>
iterator
in interface java.util.Collection<java.util.Map.Entry<V,K>>
iterator
in interface java.util.Set<java.util.Map.Entry<V,K>>
iterator
in class ImmutableSet<java.util.Map.Entry<V,K>>
ImmutableList<java.util.Map.Entry<V,K>> createAsList()
createAsList
in class ImmutableSet<java.util.Map.Entry<V,K>>