Serializable, Cloneable, Iterable, Collection, Set

JobStateReasons, LinkedHashSet

public class HashSet
extends AbstractSet
implements Set, Cloneable, Serializable
{
   //
}
  

1.2

Collection, Set, TreeSet, HashMap, Serialized Form

HashSet()

Constructs a new, empty set; the backing HashMap instance has default initial capacity (16) and load factor (0.75).

HashSet(Collection c)

Constructs a new set containing the elements in the specified collection.

HashSet(int initialCapacity)

Constructs a new, empty set; the backing HashMap instance has the specified initial capacity and default load factor (0.75).

HashSet(int initialCapacity, float loadFactor)

Constructs a new, empty set; the backing HashMap instance has the specified initial capacity and the specified load factor.

Adds the specified element to this set if it is not already present.

Removes all of the elements from this set.

Returns a shallow copy of this HashSet instance: the elements themselves are not cloned.

Returns true if this set contains the specified element.

Returns true if this set contains no elements.

Returns an iterator over the elements in this set.

Removes the specified element from this set if it is present.\

Returns the number of elements in this set (its cardinality).

Removes from this set all of its elements that are contained in the specified collection (optional operation). If the specified collection is also a set, this operation effectively modifies this set so that its value is the asymmetric set difference of the two sets.

Adds all of the elements in the specified collection to this collection (optional operation). The behavior of this operation is undefined if the specified collection is modified while the operation is in progress. (This implies that the behavior of this call is undefined if the specified collection is this collection, and this collection is nonempty.)

Returns true if this collection contains all of the elements in the specified collection.

Retains only the elements in this collection that are contained in the specified collection (optional operation). In other words, removes from this collection all of its elements that are not contained in the specified collection.

Returns an array containing all of the elements in this collection. If this collection makes any guarantees as to what order its elements are returned by its iterator, this method must return the elements in the same order.

Returns an array containing all of the elements in this collection; the runtime type of the returned array is that of the specified array. If the collection fits in the specified array, it is returned therein. Otherwise, a new array is allocated with the runtime type of the specified array and the size of this collection.

Returns a string representation of this collection. The string representation consists of a list of the collection's elements in the order they are returned by its iterator, enclosed in square brackets ("[]"). Adjacent elements are separated by the characters ", " (comma and space). Elements are converted to strings as by String.valueOf(Object).

Adds all of the elements in the specified collection to this set if they're not already present (optional operation). If the specified collection is also a set, the addAll operation effectively modifies this set so that its value is the union of the two sets. The behavior of this operation is undefined if the specified collection is modified while the operation is in progress.

public boolean containsAll(Collection c)

Returns true if this collection contains all of the elements in the specified collection.

boolean removeAll(Collection c)

Removes from this set all of its elements that are contained in the specified collection (optional operation). If the specified collection is also a set, this operation effectively modifies this set so that its value is the asymmetric set difference of the two sets.

equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Recent Posts

Beginners java programming examples

Java program to find largest number in an array

Java program to find second largest number in an array

Java program to find largest and second largest in an array

Find the index of the largest number in an array

find largest and smallest number in an array in java

find the second smallest number in an array in java

Find the index of the smallest number in an array

Spring mvc hello world example for beginners

Spring MVC tutorial with examples