ShortLinkedOpenCustomHashSet (fastutil-reference-char-maps 8.3.1 API)

java.lang.Object
- java.util.AbstractCollection<Short>
- - it.unimi.dsi.fastutil.shorts.AbstractShortCollection
  - - it.unimi.dsi.fastutil.shorts.AbstractShortSet
    - - it.unimi.dsi.fastutil.shorts.AbstractShortSortedSet
      - it.unimi.dsi.fastutil.shorts.ShortLinkedOpenCustomHashSet

All Implemented Interfaces:

Hash, ShortBidirectionalIterable, ShortCollection, ShortIterable, ShortSet, ShortSortedSet, Serializable, Cloneable, Iterable<Short>, Collection<Short>, Set<Short>, SortedSet<Short>
```
public class ShortLinkedOpenCustomHashSet
extends AbstractShortSortedSet
implements Serializable, Cloneable, Hash
```
A type-specific linked 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.
Iterators generated by this set will enumerate elements in the same order in which they have been added to the set (addition of elements already present in the set does not change the iteration order). Note that this order has nothing in common with the natural order of the keys. The order is kept by means of a doubly linked list, represented via an array of longs parallel to the table.
This class implements the interface of a sorted set, so to allow easy access of the iteration order: for instance, you can get the first element in iteration order with first() without having to create an iterator; however, this class partially violates the SortedSet contract because all subset methods throw an exception and comparator() returns always null.
Additional methods, such as addAndMoveToFirst(), make it easy to use instances of this class as a cache (e.g., with LRU policy).
The iterators provided by this class are type-specific list iterators, and can be started at any element which is in the set (if the provided element is not in the set, a NoSuchElementException exception will be thrown). If, however, the provided element is not the first or last element in the set, the first access to the list index will require linear time, as in the worst case the entire set must be scanned in iteration order to retrieve the positional index of the starting element. If you use just the methods of a type-specific BidirectionalIterator, however, all operations will be performed in constant time.

See Also:

Hash, HashCommon, Serialized Form

Nested Class Summary
- Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.Hash
  Hash.Strategy<K>

Field Summary

Fields
Modifier and Type	Field and Description
`protected boolean`	`containsNull` Whether this set contains the null key.
`protected float`	`f` The acceptable load factor.
`protected int`	`first` The index of the first entry in iteration order.
`protected short[]`	`key` The array of keys.
`protected int`	`last` The index of the last entry in iteration order.
`protected long[]`	`link` For each entry, the next and the previous entry in iteration order, stored as `((prev & 0xFFFFFFFFL) << 32) \| (next & 0xFFFFFFFFL)`.
`protected int`	`mask` The mask for wrapping a position counter.
`protected int`	`maxFill` Threshold after which we rehash.
`protected int`	`minN` We never resize below this threshold, which is the construction-time {#n}.
`protected int`	`n` The current table size.
`protected int`	`size` Number of entries in the set (including the null key, if present).
`protected ShortHash.Strategy`	`strategy` The hash strategy of this custom set.

Fields inherited from interface it.unimi.dsi.fastutil.Hash
DEFAULT_GROWTH_FACTOR, DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR, FAST_LOAD_FACTOR, FREE, OCCUPIED, PRIMES, REMOVED, VERY_FAST_LOAD_FACTOR

Constructor Summary

Constructors
Constructor and Description
`ShortLinkedOpenCustomHashSet(Collection<? extends Short> c, float f, ShortHash.Strategy strategy)` Creates a new hash set copying a given collection.
`ShortLinkedOpenCustomHashSet(Collection<? extends Short> c, ShortHash.Strategy strategy)` Creates a new hash set with `Hash.DEFAULT_LOAD_FACTOR` as load factor copying a given collection.
`ShortLinkedOpenCustomHashSet(int expected, float f, ShortHash.Strategy strategy)` Creates a new hash set.
`ShortLinkedOpenCustomHashSet(int expected, ShortHash.Strategy strategy)` Creates a new hash set with `Hash.DEFAULT_LOAD_FACTOR` as load factor.
`ShortLinkedOpenCustomHashSet(Iterator<?> i, float f, ShortHash.Strategy strategy)` Creates a new hash set using elements provided by an iterator.
`ShortLinkedOpenCustomHashSet(Iterator<?> i, ShortHash.Strategy strategy)` Creates a new hash set with `Hash.DEFAULT_LOAD_FACTOR` as load factor using elements provided by an iterator.
`ShortLinkedOpenCustomHashSet(short[] a, float f, ShortHash.Strategy strategy)` Creates a new hash set copying the elements of an array.
`ShortLinkedOpenCustomHashSet(short[] a, int offset, int length, float f, ShortHash.Strategy strategy)` Creates a new hash set and fills it with the elements of a given array.
`ShortLinkedOpenCustomHashSet(short[] a, int offset, int length, ShortHash.Strategy strategy)` Creates a new hash set with `Hash.DEFAULT_LOAD_FACTOR` as load factor and fills it with the elements of a given array.
`ShortLinkedOpenCustomHashSet(short[] a, ShortHash.Strategy strategy)` Creates a new hash set with `Hash.DEFAULT_LOAD_FACTOR` as load factor copying the elements of an array.
`ShortLinkedOpenCustomHashSet(ShortCollection c, float f, ShortHash.Strategy strategy)` Creates a new hash set copying a given type-specific collection.
`ShortLinkedOpenCustomHashSet(ShortCollection c, ShortHash.Strategy strategy)` Creates a new hash set with `Hash.DEFAULT_LOAD_FACTOR` as load factor copying a given type-specific collection.
`ShortLinkedOpenCustomHashSet(ShortHash.Strategy strategy)` Creates a new hash set with initial expected `Hash.DEFAULT_INITIAL_SIZE` elements and `Hash.DEFAULT_LOAD_FACTOR` as load factor.
`ShortLinkedOpenCustomHashSet(ShortIterator i, float f, ShortHash.Strategy strategy)` Creates a new hash set using elements provided by a type-specific iterator.
`ShortLinkedOpenCustomHashSet(ShortIterator i, ShortHash.Strategy strategy)` Creates a new hash set with `Hash.DEFAULT_LOAD_FACTOR` as load factor using elements provided by a type-specific iterator.

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`boolean`	`add(short k)` Ensures that this collection contains the specified element (optional operation).
`boolean`	`addAll(Collection<? extends Short> c)`
`boolean`	`addAll(ShortCollection c)` Adds all elements of the given type-specific collection to this collection.
`boolean`	`addAndMoveToFirst(short k)` Adds a key to the set; if the key is already present, it is moved to the first position of the iteration order.
`boolean`	`addAndMoveToLast(short k)` Adds a key to the set; if the key is already present, it is moved to the last position of the iteration order.
`void`	`clear()`
`ShortLinkedOpenCustomHashSet`	`clone()` Returns a deep copy of this set.
`ShortComparator`	`comparator()`
`boolean`	`contains(short k)` Returns `true` if this collection contains the specified element.
`short`	`firstShort()` Returns the first element of this set in iteration order.
`protected void`	`fixPointers(int i)` Modifies the `link` vector so that the given entry is removed.
`protected void`	`fixPointers(int s, int d)` Modifies the `link` vector for a shift from s to d.
`int`	`hashCode()` Returns a hash code for this set.
`ShortSortedSet`	`headSet(short to)` Returns a view of the portion of this sorted set whose elements are strictly less than `toElement`.
`boolean`	`isEmpty()`
`ShortListIterator`	`iterator()` Returns a type-specific list iterator on the elements in this set, starting from the first element.
`ShortListIterator`	`iterator(short from)` Returns a type-specific list iterator on the elements in this set, starting from a given element of the set.
`short`	`lastShort()` Returns the last element of this set in iteration order.
`protected void`	`rehash(int newN)` Rehashes the set.
`boolean`	`remove(short k)` Removes an element from this set.
`short`	`removeFirstShort()` Removes the first key in iteration order.
`short`	`removeLastShort()` Removes the the last key in iteration order.
`protected void`	`shiftKeys(int pos)` Shifts left entries with the specified hash code, starting at the specified position, and empties the resulting free entry.
`int`	`size()`
`ShortHash.Strategy`	`strategy()` Returns the hashing strategy.
`ShortSortedSet`	`subSet(short from, short to)` Returns a view of the portion of this sorted set whose elements range from `fromElement`, inclusive, to `toElement`, exclusive.
`ShortSortedSet`	`tailSet(short from)` Returns a view of the portion of this sorted set whose elements are greater than or equal to `fromElement`.
`boolean`	`trim()` Rehashes this set, making the table as small as possible.
`boolean`	`trim(int n)` Rehashes this set if the table is too large.

Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShortSet
equals, rem

Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShortCollection
add, contains, containsAll, remove, removeAll, retainAll, toArray, toShortArray, toShortArray, toString

Methods inherited from class java.util.AbstractCollection
containsAll, removeAll, retainAll, toArray, toArray

Methods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface it.unimi.dsi.fastutil.shorts.ShortSortedSet
first, headSet, last, subSet, tailSet

Methods inherited from interface it.unimi.dsi.fastutil.shorts.ShortSet
add, contains, rem, remove

Methods inherited from interface it.unimi.dsi.fastutil.shorts.ShortCollection
containsAll, removeAll, removeIf, removeIf, retainAll, toArray, toShortArray, toShortArray

Methods inherited from interface it.unimi.dsi.fastutil.shorts.ShortIterable
forEach, forEach

Methods inherited from interface java.util.SortedSet
spliterator

Methods inherited from interface java.util.Set
containsAll, equals, removeAll, retainAll, toArray, toArray

Methods inherited from interface java.util.Collection
parallelStream, stream

- Field Detail
  - key
```
protected transient short[] key
```
    The array of keys.
  - mask
```
protected transient int mask
```
    The mask for wrapping a position counter.
  - containsNull
```
protected transient boolean containsNull
```
    Whether this set contains the null key.
  - strategy
```
protected ShortHash.Strategy strategy
```
    The hash strategy of this custom set.
  - first
```
protected transient int first
```
    The index of the first entry in iteration order. It is valid iff size is nonzero; otherwise, it contains -1.
  - last
```
protected transient int last
```
    The index of the last entry in iteration order. It is valid iff size is nonzero; otherwise, it contains -1.
  - link
```
protected transient long[] link
```
    For each entry, the next and the previous entry in iteration order, stored as ((prev & 0xFFFFFFFFL) << 32) | (next & 0xFFFFFFFFL). The first entry contains predecessor -1, and the last entry contains successor -1.
  - n
```
protected transient int n
```
    The current table size. Note that an additional element is allocated for storing the null key.
  - maxFill
```
protected transient int maxFill
```
    Threshold after which we rehash. It must be the table size times f.
  - minN
```
protected final transient int minN
```
    We never resize below this threshold, which is the construction-time {#n}.
  - size
```
protected int size
```
    Number of entries in the set (including the null key, if present).
  - f
```
protected final float f
```
    The acceptable load factor.
- Constructor Detail
  - ShortLinkedOpenCustomHashSet
```
public ShortLinkedOpenCustomHashSet(int expected,
                                    float f,
                                    ShortHash.Strategy strategy)
```
    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.
    
    strategy - the strategy.
  - ShortLinkedOpenCustomHashSet
```
public ShortLinkedOpenCustomHashSet(int expected,
                                    ShortHash.Strategy strategy)
```
    Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor.
    
    Parameters:
    
    expected - the expected number of elements in the hash set.
    
    strategy - the strategy.
  - ShortLinkedOpenCustomHashSet
```
public ShortLinkedOpenCustomHashSet(ShortHash.Strategy strategy)
```
    Creates a new hash set with initial expected Hash.DEFAULT_INITIAL_SIZE elements and Hash.DEFAULT_LOAD_FACTOR as load factor.
    
    Parameters:
    
    strategy - the strategy.
  - ShortLinkedOpenCustomHashSet
```
public ShortLinkedOpenCustomHashSet(Collection<? extends Short> c,
                                    float f,
                                    ShortHash.Strategy strategy)
```
    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.
    
    strategy - the strategy.
  - ShortLinkedOpenCustomHashSet
```
public ShortLinkedOpenCustomHashSet(Collection<? extends Short> c,
                                    ShortHash.Strategy strategy)
```
    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.
    
    strategy - the strategy.
  - ShortLinkedOpenCustomHashSet
```
public ShortLinkedOpenCustomHashSet(ShortCollection c,
                                    float f,
                                    ShortHash.Strategy strategy)
```
    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.
    
    strategy - the strategy.
  - ShortLinkedOpenCustomHashSet
```
public ShortLinkedOpenCustomHashSet(ShortCollection c,
                                    ShortHash.Strategy strategy)
```
    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.
    
    strategy - the strategy.
  - ShortLinkedOpenCustomHashSet
```
public ShortLinkedOpenCustomHashSet(ShortIterator i,
                                    float f,
                                    ShortHash.Strategy strategy)
```
    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.
    
    strategy - the strategy.
  - ShortLinkedOpenCustomHashSet
```
public ShortLinkedOpenCustomHashSet(ShortIterator i,
                                    ShortHash.Strategy strategy)
```
    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.
    
    strategy - the strategy.
  - ShortLinkedOpenCustomHashSet
```
public ShortLinkedOpenCustomHashSet(Iterator<?> i,
                                    float f,
                                    ShortHash.Strategy strategy)
```
    Creates a new hash set using elements provided by an iterator.
    
    Parameters:
    
    i - an iterator whose elements will fill the set.
    
    f - the load factor.
    
    strategy - the strategy.
  - ShortLinkedOpenCustomHashSet
```
public ShortLinkedOpenCustomHashSet(Iterator<?> i,
                                    ShortHash.Strategy strategy)
```
    Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor using elements provided by an iterator.
    
    Parameters:
    
    i - an iterator whose elements will fill the set.
    
    strategy - the strategy.
  - ShortLinkedOpenCustomHashSet
```
public ShortLinkedOpenCustomHashSet(short[] a,
                                    int offset,
                                    int length,
                                    float f,
                                    ShortHash.Strategy strategy)
```
    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.
    
    strategy - the strategy.
  - ShortLinkedOpenCustomHashSet
```
public ShortLinkedOpenCustomHashSet(short[] a,
                                    int offset,
                                    int length,
                                    ShortHash.Strategy strategy)
```
    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.
    
    strategy - the strategy.
  - ShortLinkedOpenCustomHashSet
```
public ShortLinkedOpenCustomHashSet(short[] a,
                                    float f,
                                    ShortHash.Strategy strategy)
```
    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.
    
    strategy - the strategy.
  - ShortLinkedOpenCustomHashSet
```
public ShortLinkedOpenCustomHashSet(short[] a,
                                    ShortHash.Strategy strategy)
```
    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.
    
    strategy - the strategy.
- Method Detail
  - strategy
```
public ShortHash.Strategy strategy()
```
    Returns the hashing strategy.
    
    Returns:
    
    the hashing strategy of this custom hash set.
  - addAll
```
public boolean addAll(ShortCollection c)
```
    Description copied from interface: ShortCollection
    
    Adds all elements of the given type-specific collection to this collection.
    
    Specified by:
    
    addAll in interface ShortCollection
    
    Overrides:
    
    addAll in class AbstractShortCollection
    
    Parameters:
    
    c - a type-specific collection.
    
    Returns:
    
    true if this collection changed as a result of the call.
    
    See Also:
    
    Collection.addAll(Collection)
  - addAll
```
public boolean addAll(Collection<? extends Short> c)
```
    Specified by:
    
    addAll in interface Collection<Short>
    
    Specified by:
    
    addAll in interface Set<Short>
    
    Overrides:
    
    addAll in class AbstractCollection<Short>
  - add
```
public boolean add(short k)
```
    Description copied from class: AbstractShortCollection
    
    Ensures that this collection contains the specified element (optional operation).
    This implementation always throws an UnsupportedOperationException.
    
    Specified by:
    
    add in interface ShortCollection
    
    Overrides:
    
    add in class AbstractShortCollection
    
    See Also:
    
    Collection.add(Object)
  - shiftKeys
```
protected final void shiftKeys(int pos)
```
    Shifts left entries with the specified hash code, starting at the specified position, and empties the resulting free entry.
    
    Parameters:
    
    pos - a starting position.
  - remove
```
public boolean remove(short k)
```
    Description copied from class: AbstractShortSet
    
    Removes an element from this set.
    Note that the corresponding method of a type-specific collection is rem(). This unfortunate situation is caused by the clash with the similarly named index-based method in the List interface. Delegates to the type-specific rem() method implemented by type-specific abstract Collection superclass.
    
    Specified by:
    
    remove in interface ShortSet
    
    Overrides:
    
    remove in class AbstractShortSet
    
    See Also:
    
    Collection.remove(Object)
  - contains
```
public boolean contains(short k)
```
    Description copied from class: AbstractShortCollection
    
    Returns true if this collection contains the specified element.
    This implementation iterates over the elements in the collection, looking for the specified element.
    
    Specified by:
    
    contains in interface ShortCollection
    
    Overrides:
    
    contains in class AbstractShortCollection
    
    See Also:
    
    Collection.contains(Object)
  - removeFirstShort
```
public short removeFirstShort()
```
    Removes the first key in iteration order.
    
    Returns:
    
    the first key.
    
    Throws:
    
    NoSuchElementException - is this set is empty.
  - removeLastShort
```
public short removeLastShort()
```
    Removes the the last key in iteration order.
    
    Returns:
    
    the last key.
    
    Throws:
    
    NoSuchElementException - is this set is empty.
  - addAndMoveToFirst
```
public boolean addAndMoveToFirst(short k)
```
    Adds a key to the set; if the key is already present, it is moved to the first position of the iteration order.
    
    Parameters:
    
    k - the key.
    
    Returns:
    
    true if the key was not present.
  - addAndMoveToLast
```
public boolean addAndMoveToLast(short k)
```
    Adds a key to the set; if the key is already present, it is moved to the last position of the iteration order.
    
    Parameters:
    
    k - the key.
    
    Returns:
    
    true if the key was not present.
  - clear
```
public void clear()
```
    Specified by:
    
    clear in interface Collection<Short>
    
    Specified by:
    
    clear in interface Set<Short>
    
    Overrides:
    
    clear in class AbstractCollection<Short>
  - size
```
public int size()
```
    Specified by:
    
    size in interface Collection<Short>
    
    Specified by:
    
    size in interface Set<Short>
    
    Specified by:
    
    size in class AbstractCollection<Short>
  - isEmpty
```
public boolean isEmpty()
```
    Specified by:
    
    isEmpty in interface Collection<Short>
    
    Specified by:
    
    isEmpty in interface Set<Short>
    
    Overrides:
    
    isEmpty in class AbstractCollection<Short>
  - fixPointers
```
protected void fixPointers(int i)
```
    Modifies the link vector so that the given entry is removed. This method will complete in constant time.
    
    Parameters:
    
    i - the index of an entry.
  - fixPointers
```
protected void fixPointers(int s,
                           int d)
```
    Modifies the link vector for a shift from s to d. This method will complete in constant time.
    
    Parameters:
    
    s - the source position.
    
    d - the destination position.
  - firstShort
```
public short firstShort()
```
    Returns the first element of this set in iteration order.
    
    Specified by:
    
    firstShort in interface ShortSortedSet
    
    Returns:
    
    the first element in iteration order.
    
    See Also:
    
    SortedSet.first()
  - lastShort
```
public short lastShort()
```
    Returns the last element of this set in iteration order.
    
    Specified by:
    
    lastShort in interface ShortSortedSet
    
    Returns:
    
    the last element in iteration order.
    
    See Also:
    
    SortedSet.last()
  - tailSet
```
public ShortSortedSet tailSet(short from)
```
    Returns a view of the portion of this sorted set whose elements are greater than or equal to fromElement.
    Note that this specification strengthens the one given in SortedSet.headSet(Object).
    This implementation just throws an UnsupportedOperationException.
    
    Specified by:
    
    tailSet in interface ShortSortedSet
    
    See Also:
    
    SortedSet.tailSet(Object)
  - headSet
```
public ShortSortedSet headSet(short to)
```
    Returns a view of the portion of this sorted set whose elements are strictly less than toElement.
    Note that this specification strengthens the one given in SortedSet.headSet(Object).
    This implementation just throws an UnsupportedOperationException.
    
    Specified by:
    
    headSet in interface ShortSortedSet
    
    See Also:
    
    SortedSet.headSet(Object)
  - subSet
```
public ShortSortedSet subSet(short from,
                             short to)
```
    Returns a view of the portion of this sorted set whose elements range from fromElement, inclusive, to toElement, exclusive.
    Note that this specification strengthens the one given in SortedSet.subSet(Object,Object).
    This implementation just throws an UnsupportedOperationException.
    
    Specified by:
    
    subSet in interface ShortSortedSet
    
    See Also:
    
    SortedSet.subSet(Object,Object)
  - comparator
```
public ShortComparator comparator()
```
    Note that this specification strengthens the one given in SortedSet.comparator().
    This implementation just returns null.
    
    Specified by:
    
    comparator in interface ShortSortedSet
    
    Specified by:
    
    comparator in interface SortedSet<Short>
  - iterator
```
public ShortListIterator iterator(short from)
```
    Returns a type-specific list iterator on the elements in this set, starting from a given element of the set. Please see the class documentation for implementation details.
    
    Specified by:
    
    iterator in interface ShortSortedSet
    
    Parameters:
    
    from - an element to start from.
    
    Returns:
    
    a type-specific list iterator starting at the given element.
    
    Throws:
    
    IllegalArgumentException - if from does not belong to the set.
  - iterator
```
public ShortListIterator iterator()
```
    Returns a type-specific list iterator on the elements in this set, starting from the first element. Please see the class documentation for implementation details.
    
    Specified by:
    
    iterator in interface ShortBidirectionalIterable
    
    Specified by:
    
    iterator in interface ShortCollection
    
    Specified by:
    
    iterator in interface ShortIterable
    
    Specified by:
    
    iterator in interface ShortSet
    
    Specified by:
    
    iterator in interface ShortSortedSet
    
    Specified by:
    
    iterator in interface Iterable<Short>
    
    Specified by:
    
    iterator in interface Collection<Short>
    
    Specified by:
    
    iterator in interface Set<Short>
    
    Specified by:
    
    iterator in class AbstractShortSortedSet
    
    Returns:
    
    a type-specific list iterator starting at the first element.
    
    See Also:
    
    Iterable.iterator()
  - 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()
  - rehash
```
protected void rehash(int newN)
```
    Rehashes the set.
    This method implements the basic rehashing strategy, and may be overriden by subclasses implementing different rehashing strategies (e.g., disk-based rehashing). However, you should not override this method unless you understand the internal workings of this class.
    
    Parameters:
    
    newN - the new size
  - clone
```
public ShortLinkedOpenCustomHashSet 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.
    
    Overrides:
    
    clone in class Object
    
    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 Collection<Short>
    
    Specified by:
    
    hashCode in interface Set<Short>
    
    Overrides:
    
    hashCode in class AbstractShortSet
    
    Returns:
    
    a hash code for this set.

Class ShortLinkedOpenCustomHashSet

Nested Class Summary

Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.Hash

Field Summary

Fields inherited from interface it.unimi.dsi.fastutil.Hash

Constructor Summary

Method Summary

Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShortSet

Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShortCollection

Methods inherited from class java.util.AbstractCollection

Methods inherited from class java.lang.Object

Methods inherited from interface it.unimi.dsi.fastutil.shorts.ShortSortedSet

Methods inherited from interface it.unimi.dsi.fastutil.shorts.ShortSet

Methods inherited from interface it.unimi.dsi.fastutil.shorts.ShortCollection

Methods inherited from interface it.unimi.dsi.fastutil.shorts.ShortIterable

Methods inherited from interface java.util.SortedSet

Methods inherited from interface java.util.Set

Methods inherited from interface java.util.Collection

Field Detail

key

mask

containsNull

strategy

first

last

link

n

maxFill

minN

size

f

Constructor Detail

ShortLinkedOpenCustomHashSet

ShortLinkedOpenCustomHashSet

ShortLinkedOpenCustomHashSet

ShortLinkedOpenCustomHashSet

ShortLinkedOpenCustomHashSet

ShortLinkedOpenCustomHashSet

ShortLinkedOpenCustomHashSet

ShortLinkedOpenCustomHashSet

ShortLinkedOpenCustomHashSet

ShortLinkedOpenCustomHashSet

ShortLinkedOpenCustomHashSet

ShortLinkedOpenCustomHashSet

ShortLinkedOpenCustomHashSet

ShortLinkedOpenCustomHashSet

ShortLinkedOpenCustomHashSet

Method Detail

strategy

addAll

addAll

add

shiftKeys

remove

contains

removeFirstShort

removeLastShort

addAndMoveToFirst

addAndMoveToLast

clear

size

isEmpty

fixPointers

fixPointers

firstShort

lastShort

tailSet

headSet

subSet

comparator

iterator

iterator

trim

trim

rehash

clone

hashCode