Class ReferenceOpenHashSet<K>

java.lang.Object
java.util.AbstractCollection<K>
All Implemented Interfaces:
Hash, ObjectIterable<K>, ReferenceCollection<K>, ReferenceSet<K>, java.io.Serializable, java.lang.Cloneable, java.lang.Iterable<K>, java.util.Collection<K>, java.util.Set<K>

public class ReferenceOpenHashSet<K>
extends AbstractReferenceSet<K>
implements java.io.Serializable, java.lang.Cloneable, Hash
A type-specific hash set with with a fast, small-footprint implementation.

Instances of this class use a hash table to represent a set. The table is filled up to a specified load factor, and then doubled in size to accommodate new entries. If the table is emptied below one fourth of the load factor, it is halved in size; however, the table is never reduced to a size smaller than that at creation time: this approach makes it possible to create sets with a large capacity in which insertions and deletions do not cause immediately rehashing. Moreover, halving is not performed when deleting entries from an iterator, as it would interfere with the iteration process.

Note that clear() does not modify the hash table size. Rather, a family of trimming methods lets you control the size of the table; this is particularly useful if you reuse instances of this class.

See Also:
Hash, HashCommon, Serialized Form
  • Constructor Details

    • ReferenceOpenHashSet

      public ReferenceOpenHashSet​(int expected, float f)
      Creates a new hash set.

      The actual table size will be the least power of two greater than expected/f.

      Parameters:
      expected - the expected number of elements in the hash set.
      f - the load factor.
    • ReferenceOpenHashSet

      public ReferenceOpenHashSet​(int expected)
      Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor.
      Parameters:
      expected - the expected number of elements in the hash set.
    • ReferenceOpenHashSet

      public ReferenceOpenHashSet()
      Creates a new hash set with initial expected Hash.DEFAULT_INITIAL_SIZE elements and Hash.DEFAULT_LOAD_FACTOR as load factor.
    • ReferenceOpenHashSet

      public ReferenceOpenHashSet​(java.util.Collection<? extends K> c, float f)
      Creates a new hash set copying a given collection.
      Parameters:
      c - a Collection to be copied into the new hash set.
      f - the load factor.
    • ReferenceOpenHashSet

      public ReferenceOpenHashSet​(java.util.Collection<? extends K> c)
      Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given collection.
      Parameters:
      c - a Collection to be copied into the new hash set.
    • ReferenceOpenHashSet

      public ReferenceOpenHashSet​(ReferenceCollection<? extends K> c, float f)
      Creates a new hash set copying a given type-specific collection.
      Parameters:
      c - a type-specific collection to be copied into the new hash set.
      f - the load factor.
    • ReferenceOpenHashSet

      public ReferenceOpenHashSet​(ReferenceCollection<? extends K> c)
      Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific collection.
      Parameters:
      c - a type-specific collection to be copied into the new hash set.
    • ReferenceOpenHashSet

      public ReferenceOpenHashSet​(java.util.Iterator<? extends K> i, float f)
      Creates a new hash set using elements provided by a type-specific iterator.
      Parameters:
      i - a type-specific iterator whose elements will fill the set.
      f - the load factor.
    • ReferenceOpenHashSet

      public ReferenceOpenHashSet​(java.util.Iterator<? extends K> i)
      Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor using elements provided by a type-specific iterator.
      Parameters:
      i - a type-specific iterator whose elements will fill the set.
    • ReferenceOpenHashSet

      public ReferenceOpenHashSet​(K[] a, int offset, int length, float f)
      Creates a new hash set and fills it with the elements of a given array.
      Parameters:
      a - an array whose elements will be used to fill the set.
      offset - the first element to use.
      length - the number of elements to use.
      f - the load factor.
    • ReferenceOpenHashSet

      public ReferenceOpenHashSet​(K[] a, int offset, int length)
      Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor and fills it with the elements of a given array.
      Parameters:
      a - an array whose elements will be used to fill the set.
      offset - the first element to use.
      length - the number of elements to use.
    • ReferenceOpenHashSet

      public ReferenceOpenHashSet​(K[] a, float f)
      Creates a new hash set copying the elements of an array.
      Parameters:
      a - an array to be copied into the new hash set.
      f - the load factor.
    • ReferenceOpenHashSet

      public ReferenceOpenHashSet​(K[] a)
      Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor copying the elements of an array.
      Parameters:
      a - an array to be copied into the new hash set.
  • Method Details

    • of

      public static <K> ReferenceOpenHashSet<K> of()
      Creates a new empty hash set.
      Returns:
      a new empty hash set.
    • of

      public static <K> ReferenceOpenHashSet<K> of​(K e)
      Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor using the given element.
      Parameters:
      e - the element that the returned set will contain.
      Returns:
      a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor containing e.
    • of

      public static <K> ReferenceOpenHashSet<K> of​(K e0, K e1)
      Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor using the elements given.
      Parameters:
      e0 - the first element.
      e1 - the second element.
      Returns:
      a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor containing e0 and e1.
      Throws:
      java.lang.IllegalArgumentException - if there were duplicate entries.
    • of

      public static <K> ReferenceOpenHashSet<K> of​(K e0, K e1, K e2)
      Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor using the elements given.
      Parameters:
      e0 - the first element.
      e1 - the second element.
      e2 - the third element.
      Returns:
      a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor containing e0, e1, and e2.
      Throws:
      java.lang.IllegalArgumentException - if there were duplicate entries.
    • of

      @SafeVarargs public static <K> ReferenceOpenHashSet<K> of​(K... a)
      Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor using a list of elements.
      Parameters:
      a - a list of elements that will be used to initialize the new hash set.
      Returns:
      a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor containing the elements of a.
      Throws:
      java.lang.IllegalArgumentException - if a duplicate entry was encountered.
    • toSet

      public static <K> java.util.stream.Collector<K,​?,​ReferenceOpenHashSet<K>> toSet()
      Returns a Collector that collects a Stream's elements into a new hash set.
    • toSetWithExpectedSize

      public static <K> java.util.stream.Collector<K,​?,​ReferenceOpenHashSet<K>> toSetWithExpectedSize​(int expectedSize)
      Returns a Collector that collects a Stream's elements into a new hash set, potentially pre-allocated to handle the given size.
    • addAll

      public boolean addAll​(java.util.Collection<? extends K> c)
      Specified by:
      addAll in interface java.util.Collection<K>
      Specified by:
      addAll in interface java.util.Set<K>
      Overrides:
      addAll in class java.util.AbstractCollection<K>
    • add

      public boolean add​(K k)
      Specified by:
      add in interface java.util.Collection<K>
      Specified by:
      add in interface java.util.Set<K>
      Overrides:
      add in class java.util.AbstractCollection<K>
    • remove

      public boolean remove​(java.lang.Object k)
      Specified by:
      remove in interface java.util.Collection<K>
      Specified by:
      remove in interface java.util.Set<K>
      Overrides:
      remove in class java.util.AbstractCollection<K>
    • contains

      public boolean contains​(java.lang.Object k)
      Specified by:
      contains in interface java.util.Collection<K>
      Specified by:
      contains in interface java.util.Set<K>
      Overrides:
      contains in class java.util.AbstractCollection<K>
    • clear

      public void clear()
      Specified by:
      clear in interface java.util.Collection<K>
      Specified by:
      clear in interface java.util.Set<K>
      Overrides:
      clear in class java.util.AbstractCollection<K>
    • size

      public int size()
      Specified by:
      size in interface java.util.Collection<K>
      Specified by:
      size in interface java.util.Set<K>
      Specified by:
      size in class java.util.AbstractCollection<K>
    • isEmpty

      public boolean isEmpty()
      Specified by:
      isEmpty in interface java.util.Collection<K>
      Specified by:
      isEmpty in interface java.util.Set<K>
      Overrides:
      isEmpty in class java.util.AbstractCollection<K>
    • iterator

      public ObjectIterator<K> iterator()
      Description copied from interface: ReferenceCollection
      Returns a type-specific iterator on the elements of this collection.
      Specified by:
      iterator in interface java.util.Collection<K>
      Specified by:
      iterator in interface java.lang.Iterable<K>
      Specified by:
      iterator in interface ObjectIterable<K>
      Specified by:
      iterator in interface ReferenceCollection<K>
      Specified by:
      iterator in interface ReferenceSet<K>
      Specified by:
      iterator in interface java.util.Set<K>
      Specified by:
      iterator in class AbstractReferenceSet<K>
      Returns:
      a type-specific iterator on the elements of this collection.
      See Also:
      Iterable.iterator()
    • spliterator

      public ObjectSpliterator<K> spliterator()
      Description copied from interface: ReferenceSet
      Returns a type-specific spliterator on the elements of this set.

      Set spliterators must report at least Spliterator.DISTINCT.

      See Set.spliterator() for more documentation on the requirements of the returned spliterator.

      Specified by:
      spliterator in interface java.util.Collection<K>
      Specified by:
      spliterator in interface java.lang.Iterable<K>
      Specified by:
      spliterator in interface ObjectIterable<K>
      Specified by:
      spliterator in interface ReferenceCollection<K>
      Specified by:
      spliterator in interface ReferenceSet<K>
      Specified by:
      spliterator in interface java.util.Set<K>
      Returns:
      a type-specific spliterator on the elements of this collection.
    • forEach

      public void forEach​(java.util.function.Consumer<? super K> action)
      Specified by:
      forEach in interface java.lang.Iterable<K>
    • trim

      public boolean trim()
      Rehashes this set, making the table as small as possible.

      This method rehashes the table to the smallest size satisfying the load factor. It can be used when the set will not be changed anymore, so to optimize access speed and size.

      If the table size is already the minimum possible, this method does nothing.

      Returns:
      true if there was enough memory to trim the set.
      See Also:
      trim(int)
    • trim

      public boolean trim​(int n)
      Rehashes this set if the table is too large.

      Let N be the smallest table size that can hold max(n,size()) entries, still satisfying the load factor. If the current table size is smaller than or equal to N, this method does nothing. Otherwise, it rehashes this set in a table of size N.

      This method is useful when reusing sets. Clearing a set leaves the table size untouched. If you are reusing a set many times, you can call this method with a typical size to avoid keeping around a very large table just because of a few large transient sets.

      Parameters:
      n - the threshold for the trimming.
      Returns:
      true if there was enough memory to trim the set.
      See Also:
      trim()
    • clone

      public ReferenceOpenHashSet<K> clone()
      Returns a deep copy of this set.

      This method performs a deep copy of this hash set; the data stored in the set, however, is not cloned. Note that this makes a difference only for object keys.

      Returns:
      a deep copy of this set.
    • hashCode

      public int hashCode()
      Returns a hash code for this set. This method overrides the generic method provided by the superclass. Since equals() is not overriden, it is important that the value returned by this method is the same value as the one returned by the overriden method.
      Specified by:
      hashCode in interface java.util.Collection<K>
      Specified by:
      hashCode in interface java.util.Set<K>
      Overrides:
      hashCode in class AbstractReferenceSet<K>
      Returns:
      a hash code for this set.