Package adams.core
Class WrapperHashSet<E>
- java.lang.Object
-
- java.util.AbstractCollection<E>
-
- adams.core.WrapperHashSet<E>
-
- Type Parameters:
E
- the type to store
- All Implemented Interfaces:
Serializable
,Iterable<E>
,Collection<E>
,Set<E>
public class WrapperHashSet<E> extends AbstractCollection<E> implements Set<E>, Serializable
An extended HashSet that wraps its objects in a wrapper object before storing them in a HashSet. The wrapper object uses the hashCode() method of the payload object in its equals(Object) method for comparison.- Version:
- $Revision$
- Author:
- fracpete (fracpete at waikato dot ac dot nz)
- See Also:
- Serialized Form
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description static class
WrapperHashSet.Wrapper
The class that wraps.
-
Field Summary
Fields Modifier and Type Field Description protected HashSet<WrapperHashSet.Wrapper>
m_HashSet
the hashset used internally.
-
Constructor Summary
Constructors Constructor Description WrapperHashSet()
Constructs a new, empty set; the backing HashMap instance has default initial capacity (16) and load factor (0.75).WrapperHashSet(int initialCapacity)
Constructs a new, empty set; the backing HashMap instance has the specified initial capacity and default load factor (0.75).WrapperHashSet(int initialCapacity, float loadFactor)
Constructs a new, empty set; the backing HashMap instance has the specified initial capacity and the specified load factor.WrapperHashSet(Collection<? extends E> c)
Constructs a new set containing the elements in the specified collection.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description boolean
add(E e)
Adds the specified element to this set if it is not already present.void
clear()
Removes all of the elements from this set.Object
clone()
Returns a shallow copy of this HashSet instance: the elements themselves are not cloned.boolean
contains(Object o)
Returns true if this set contains the specified element.boolean
isEmpty()
Returns true if this set contains no elements.Iterator<E>
iterator()
Returns an iterator over the elements in this set.boolean
remove(Object o)
Removes the specified element from this set if it is present.int
size()
Returns the number of elements in this set (its cardinality).String
toString()
Returns a string representation of the stored objects.-
Methods inherited from class java.util.AbstractCollection
addAll, containsAll, removeAll, retainAll, toArray, toArray
-
Methods inherited from class java.lang.Object
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
-
Methods inherited from interface java.util.Collection
parallelStream, removeIf, stream, toArray
-
Methods inherited from interface java.util.Set
addAll, containsAll, equals, hashCode, removeAll, retainAll, spliterator, toArray, toArray
-
-
-
-
Field Detail
-
m_HashSet
protected HashSet<WrapperHashSet.Wrapper> m_HashSet
the hashset used internally.
-
-
Constructor Detail
-
WrapperHashSet
public WrapperHashSet()
Constructs a new, empty set; the backing HashMap instance has default initial capacity (16) and load factor (0.75).
-
WrapperHashSet
public WrapperHashSet(Collection<? extends E> c)
Constructs a new set containing the elements in the specified collection. The HashMap is created with default load factor (0.75) and an initial capacity sufficient to contain the elements in the specified collection.- Parameters:
c
- the collection whose elements are to be placed into this set- Throws:
NullPointerException
- if the specified collection is null
-
WrapperHashSet
public WrapperHashSet(int initialCapacity, float loadFactor)
Constructs a new, empty set; the backing HashMap instance has the specified initial capacity and the specified load factor.- Parameters:
initialCapacity
- the initial capacity of the hash maploadFactor
- the load factor of the hash map- Throws:
IllegalArgumentException
- if the initial capacity is less than zero, or if the load factor is nonpositive
-
WrapperHashSet
public WrapperHashSet(int initialCapacity)
Constructs a new, empty set; the backing HashMap instance has the specified initial capacity and default load factor (0.75).- Parameters:
initialCapacity
- the initial capacity of the hash table- Throws:
IllegalArgumentException
- if the initial capacity is less than zero
-
-
Method Detail
-
clear
public void clear()
Removes all of the elements from this set. The set will be empty after this call returns.- Specified by:
clear
in interfaceCollection<E>
- Specified by:
clear
in interfaceSet<E>
- Overrides:
clear
in classAbstractCollection<E>
-
clone
public Object clone()
Returns a shallow copy of this HashSet instance: the elements themselves are not cloned.
-
iterator
public Iterator<E> iterator()
Returns an iterator over the elements in this set. The elements are returned in no particular order.- Specified by:
iterator
in interfaceCollection<E>
- Specified by:
iterator
in interfaceIterable<E>
- Specified by:
iterator
in interfaceSet<E>
- Specified by:
iterator
in classAbstractCollection<E>
- Returns:
- an Iterator over the elements in this set
- See Also:
ConcurrentModificationException
-
contains
public boolean contains(Object o)
Returns true if this set contains the specified element. More formally, returns true if and only if this set contains an element e such that (o==null ? e==null : o.equals(e)).- Specified by:
contains
in interfaceCollection<E>
- Specified by:
contains
in interfaceSet<E>
- Overrides:
contains
in classAbstractCollection<E>
- Parameters:
o
- element whose presence in this set is to be tested- Returns:
- true if this set contains the specified element
-
add
public boolean add(E e)
Adds the specified element to this set if it is not already present. More formally, adds the specified element e to this set if this set contains no element e2 such that (e==null ? e2==null : e.equals(e2)). If this set already contains the element, the call leaves the set unchanged and returns false.- Specified by:
add
in interfaceCollection<E>
- Specified by:
add
in interfaceSet<E>
- Overrides:
add
in classAbstractCollection<E>
- Parameters:
e
- element to be added to this set- Returns:
- true if this set did not already contain the specified element
-
remove
public boolean remove(Object o)
Removes the specified element from this set if it is present. More formally, removes an element e such that (o==null ? e==null : o.equals(e)), if this set contains such an element. Returns true if this set contained the element (or equivalently, if this set changed as a result of the call). (This set will not contain the element once the call returns.)- Specified by:
remove
in interfaceCollection<E>
- Specified by:
remove
in interfaceSet<E>
- Overrides:
remove
in classAbstractCollection<E>
- Parameters:
o
- object to be removed from this set, if present- Returns:
- true if the set contained the specified element
-
isEmpty
public boolean isEmpty()
Returns true if this set contains no elements.- Specified by:
isEmpty
in interfaceCollection<E>
- Specified by:
isEmpty
in interfaceSet<E>
- Overrides:
isEmpty
in classAbstractCollection<E>
- Returns:
- true if this set contains no elements
-
size
public int size()
Returns the number of elements in this set (its cardinality).- Specified by:
size
in interfaceCollection<E>
- Specified by:
size
in interfaceSet<E>
- Specified by:
size
in classAbstractCollection<E>
- Returns:
- the number of elements in this set (its cardinality)
-
toString
public String toString()
Returns a string representation of the stored objects.- Overrides:
toString
in classAbstractCollection<E>
- Returns:
- the string representation
-
-