Skip navigation links
A B C D E F G H I J K L M N O P Q R S T U V 

H

hash(Object...) - Static method in class java.util.Objects
Generates a hash code for a sequence of input values.
hashCode(long[]) - Static method in class java.util.Arrays
Returns a hash code based on the contents of the specified array.
hashCode(int[]) - Static method in class java.util.Arrays
Returns a hash code based on the contents of the specified array.
hashCode(short[]) - Static method in class java.util.Arrays
Returns a hash code based on the contents of the specified array.
hashCode(char[]) - Static method in class java.util.Arrays
Returns a hash code based on the contents of the specified array.
hashCode(byte[]) - Static method in class java.util.Arrays
Returns a hash code based on the contents of the specified array.
hashCode(boolean[]) - Static method in class java.util.Arrays
Returns a hash code based on the contents of the specified array.
hashCode(float[]) - Static method in class java.util.Arrays
Returns a hash code based on the contents of the specified array.
hashCode(double[]) - Static method in class java.util.Arrays
Returns a hash code based on the contents of the specified array.
hashCode(Object[]) - Static method in class java.util.Arrays
Returns a hash code based on the contents of the specified array.
hashCode(Object) - Static method in class java.util.Objects
Returns the hash code of a non-null argument and 0 for a null argument.
HashSet<E> - Class in java.util
This class implements the Set interface, backed by a hash table (actually a HashMap instance).
HashSet() - Constructor for class java.util.HashSet
Constructs a new, empty set; the backing HashMap instance has default initial capacity (16) and load factor (0.75).
HashSet(Collection<? extends E>) - Constructor for class java.util.HashSet
Constructs a new set containing the elements in the specified collection.
HashSet(int, float) - Constructor for class java.util.HashSet
Constructs a new, empty set; the backing HashMap instance has the specified initial capacity and the specified load factor.
HashSet(int) - Constructor for class java.util.HashSet
Constructs a new, empty set; the backing HashMap instance has the specified initial capacity and default load factor (0.75).
headMap(K, boolean) - Method in interface java.util.NavigableMap
Returns a view of the portion of this map whose keys are less than (or equal to, if inclusive is true) toKey.
headMap(K) - Method in interface java.util.NavigableMap
Returns a view of the portion of this map whose keys are strictly less than toKey.
headMap(K) - Method in interface java.util.SortedMap
Returns a view of the portion of this map whose keys are strictly less than toKey.
headMap(K, boolean) - Method in class java.util.TreeMap
 
headMap(K) - Method in class java.util.TreeMap
 
headSet(E, boolean) - Method in interface java.util.NavigableSet
Returns a view of the portion of this set whose elements are less than (or equal to, if inclusive is true) toElement.
headSet(E) - Method in interface java.util.NavigableSet
Returns a view of the portion of this set whose elements are strictly less than toElement.
headSet(E) - Method in interface java.util.SortedSet
Returns a view of the portion of this set whose elements are strictly less than toElement.
headSet(E, boolean) - Method in class java.util.TreeSet
 
headSet(E) - Method in class java.util.TreeSet
 
higher(E) - Method in interface java.util.NavigableSet
Returns the least element in this set strictly greater than the given element, or null if there is no such element.
higher(E) - Method in class java.util.TreeSet
 
higherEntry(K) - Method in interface java.util.NavigableMap
Returns a key-value mapping associated with the least key strictly greater than the given key, or null if there is no such key.
higherEntry(K) - Method in class java.util.TreeMap
 
higherKey(K) - Method in interface java.util.NavigableMap
Returns the least key strictly greater than the given key, or null if there is no such key.
higherKey(K) - Method in class java.util.TreeMap
 
A B C D E F G H I J K L M N O P Q R S T U V 
Skip navigation links