public static class ImmutableMap.KeySet<K,V> extends ImmutableCollectionBase<ImmutableMap.MapEntry<K,V>,K> implements Set<K>
array, emptyArray, length| Constructor and Description |
|---|
KeySet(ImmutableMap.MapEntry<K,V>[] array,
int length) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
contains(Object o) |
boolean |
equals(Object other) |
int |
hashCode()
Returns the hash code value for this set.
|
Iterator<K> |
iterator() |
Object[] |
toArray() |
<T> T[] |
toArray(T[] a) |
add, addAll, containsAll, remove, removeAll, retainAll, toStringclear, isEmpty, sizeclone, finalize, getClass, notify, notifyAll, wait, wait, waitadd, addAll, clear, containsAll, isEmpty, remove, removeAll, retainAll, size, spliteratorparallelStream, removeIf, streampublic KeySet(ImmutableMap.MapEntry<K,V>[] array, int length)
public boolean contains(Object o)
public Object[] toArray()
public <T> T[] toArray(T[] a)
public boolean equals(Object other)
public int hashCode()
null element is defined to be zero. This
ensures that s1.equals(s2) implies that s1.hashCode() == s2.hashCode() for any two sets
s1 and s2, as required by the general contract of Object.hashCode().Copyright © 2021. All rights reserved.