Class AbstractSet<E>
- java.lang.Object
-
- java.util.AbstractCollection<E>
-
- com.macrofocus.utils.AbstractSet<E>
-
- Type Parameters:
E
- the type of elements maintained by this set
- All Implemented Interfaces:
java.lang.Iterable<E>
,java.util.Collection<E>
,java.util.Set<E>
public abstract class AbstractSet<E> extends java.util.AbstractCollection<E> implements java.util.Set<E>
This class provides a skeletal implementation of the Set interface to minimize the effort required to implement this interface.- Since:
- 1.2
- See Also:
Collection
,AbstractCollection
,Set
-
-
Constructor Summary
Constructors Modifier Constructor Description protected
AbstractSet()
Sole constructor.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description boolean
equals(java.lang.Object o)
Compares the specified object with this set for equality.int
hashCode()
Returns the hash code value for this set.boolean
removeAll(java.util.Collection<?> c)
Removes from this set all of its elements that are contained in the specified collection (optional operation).-
Methods inherited from class java.util.AbstractCollection
add, addAll, clear, contains, containsAll, isEmpty, iterator, remove, retainAll, size, toArray, toArray, toString
-
-
-
-
Method Detail
-
equals
public boolean equals(java.lang.Object o)
Compares the specified object with this set for equality. Returns true if the given object is also a set, the two sets have the same size, and every member of the given set is contained in this set. This ensures that the equals method works properly across different implementations of the Set interface.
-
hashCode
public int hashCode()
Returns the hash code value for this set. The hash code of a set is defined to be the sum of the hash codes of the elements in the set, where the hash code of a 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 ofObject.hashCode()
.This implementation iterates over the set, calling the hashCode method on each element in the set, and adding up the results.
-
removeAll
public boolean removeAll(java.util.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.This implementation determines which is the smaller of this set and the specified collection, by invoking the size method on each. If this set has fewer elements, then the implementation iterates over this set, checking each element returned by the iterator in turn to see if it is contained in the specified collection. If it is so contained, it is removed from this set with the iterator's remove method. If the specified collection has fewer elements, then the implementation iterates over the specified collection, removing from this set each element returned by the iterator, using this set's remove method.
Note that this implementation will throw an UnsupportedOperationException if the iterator returned by the iterator method does not implement the remove method.
- Specified by:
removeAll
in interfacejava.util.Collection<E>
- Specified by:
removeAll
in interfacejava.util.Set<E>
- Overrides:
removeAll
in classjava.util.AbstractCollection<E>
- Parameters:
c
- collection containing elements to be removed from this set- Returns:
- true if this set changed as a result of the call
- Throws:
java.lang.UnsupportedOperationException
- if the removeAll operation is not supported by this setjava.lang.ClassCastException
- if the class of an element of this set is incompatible with the specified collection (optional)java.lang.NullPointerException
- if this set contains a null element and the specified collection does not permit null elements (optional), or if the specified collection is null- See Also:
AbstractCollection.remove(Object)
,AbstractCollection.contains(Object)
-
-