final class RegularImmutableBiMap.Inverse.InverseEntrySet extends ImmutableMapEntrySet<V,K>
ImmutableMapEntrySet.RegularEntrySet<K,V>ImmutableSet.Builder<E>, ImmutableSet.CachingAsList<E>, ImmutableSet.Indexed<E>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, writeReplaceasListbuilder, builderWithExpectedSize, chooseTableSize, copyOf, copyOf, copyOf, copyOf, equals, of, of, of, of, of, of, of, toImmutableSetadd, addAll, clear, copyIntoArray, internalArray, internalArrayEnd, internalArrayStart, remove, removeAll, removeIf, retainAll, spliterator, toArray, toArrayclone, finalize, getClass, notify, notifyAll, wait, wait, waitImmutableMap<V,K> map()
map in class ImmutableMapEntrySet<V,K>boolean isHashCodeFast()
ImmutableSettrue if the hashCode() method runs quickly.isHashCodeFast in class ImmutableMapEntrySet<V,K>public int hashCode()
public UnmodifiableIterator<java.util.Map.Entry<V,K>> iterator()
ImmutableCollectioniterator 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.CachingAsList<java.util.Map.Entry<V,K>>