public class IntLinkedOpenHashSet extends IntOpenHashSet implements IntSortedSet
| Constructor and Description |
|---|
IntLinkedOpenHashSet()
Default Constructor
|
IntLinkedOpenHashSet(java.util.Collection<? extends java.lang.Integer> collection)
Deprecated.
|
IntLinkedOpenHashSet(java.util.Collection<? extends java.lang.Integer> collection,
float loadFactor)
Deprecated.
|
IntLinkedOpenHashSet(int minCapacity)
Constructor that defines the minimum capacity
|
IntLinkedOpenHashSet(int[] array)
Helper constructor that allow to create a set from unboxed values
|
IntLinkedOpenHashSet(int[] array,
float loadFactor)
Helper constructor that allow to create a set from unboxed values
|
IntLinkedOpenHashSet(int[] array,
int offset,
int length)
Helper constructor that allow to create a set from unboxed values
|
IntLinkedOpenHashSet(int[] array,
int offset,
int length,
float loadFactor)
Helper constructor that allow to create a set from unboxed values
|
IntLinkedOpenHashSet(IntCollection collection)
A Helper constructor that allows to create a Set with exactly the same values as the provided collection.
|
IntLinkedOpenHashSet(IntCollection collection,
float loadFactor)
A Helper constructor that allows to create a Set with exactly the same values as the provided collection.
|
IntLinkedOpenHashSet(int minCapacity,
float loadFactor)
Constructor that defines the minimum capacity and load factor
|
IntLinkedOpenHashSet(IntIterator iterator)
A Helper constructor that allows to create a set from a iterator of an unknown size
|
IntLinkedOpenHashSet(IntIterator iterator,
float loadFactor)
A Helper constructor that allows to create a set from a iterator of an unknown size
|
IntLinkedOpenHashSet(java.util.Iterator<java.lang.Integer> iterator)
A Helper constructor that allows to create a set from a iterator of an unknown size
|
IntLinkedOpenHashSet(java.util.Iterator<java.lang.Integer> iterator,
float loadFactor)
A Helper constructor that allows to create a set from a iterator of an unknown size
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
addAndMoveToFirst(int o)
A customized add method that allows you to insert into the first index.
|
boolean |
addAndMoveToLast(int o)
A customized add method that allows you to insert into the last index.
|
void |
clear() |
void |
clearAndTrim(int size)
Trims the collection down to the requested size and clears all elements while doing so
|
IntComparator |
comparator()
A Type Specific Comparator method
|
int |
firstInt()
A method to get the first element in the set
|
IntSortedSet |
headSet(int toElement)
A Type Specific HeadSet method to reduce boxing/unboxing
|
IntListIterator |
iterator()
Returns a Type-Specific Iterator to reduce (un)boxing
|
IntBidirectionalIterator |
iterator(int fromElement)
A type Specific Iterator starting from a given key
|
int |
lastInt()
A method to get the last element in the set
|
boolean |
moveToFirst(int o)
A specific move method to move a given key to the first index.
|
boolean |
moveToLast(int o)
A specific move method to move a given key to the last index.
|
int |
pollFirstInt()
A method to get and remove the first element in the set
|
int |
pollLastInt()
A method to get and remove the last element in the set
|
IntSortedSet |
subSet(int fromElement,
int toElement)
A Type Specific SubSet method to reduce boxing/unboxing
|
IntSortedSet |
tailSet(int fromElement)
A Type Specific TailSet method to reduce boxing/unboxing
|
add, addAll, addAll, contains, contains, remove, remove, size, trimequals, hashCodeadd, containsAll, containsAny, containsAny, remInt, removeAll, retainAll, toIntArray, toIntArraycontainsAll, isEmpty, removeAll, retainAll, toArray, toArray, toStringfirst, headSet, last, spliterator, subSet, tailSetadd, contains, remInt, remove, removeadd, addAll, contains, containsAll, containsAny, containsAny, parallelPrimitiveStream, primitiveStream, remIf, removeAll, removeIf, retainAll, toIntArray, toIntArrayforEach, forEachaddAll, containsAll, equals, hashCode, isEmpty, removeAll, retainAll, size, toArray, toArrayclearAndTrim, trimpublic IntLinkedOpenHashSet()
public IntLinkedOpenHashSet(int minCapacity)
minCapacity - the minimum capacity the HashSet is allowed to be.java.lang.IllegalStateException - if the minimum capacity is negativepublic IntLinkedOpenHashSet(int minCapacity,
float loadFactor)
minCapacity - the minimum capacity the HashSet is allowed to be.loadFactor - the percentage of how full the backing array can be before they resizejava.lang.IllegalStateException - if the minimum capacity is negativejava.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1public IntLinkedOpenHashSet(int[] array)
array - the elements that should be put into the setpublic IntLinkedOpenHashSet(int[] array,
float loadFactor)
array - the elements that should be put into the setloadFactor - the percentage of how full the backing array can be before they resizejava.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1public IntLinkedOpenHashSet(int[] array,
int offset,
int length)
array - the elements that should be put into the setoffset - the starting index within the array that should be usedlength - the amount of elements used from the arrayjava.lang.IllegalStateException - if offset and length causes to step outside of the arrays rangepublic IntLinkedOpenHashSet(int[] array,
int offset,
int length,
float loadFactor)
array - the elements that should be put into the setoffset - the starting index within the array that should be usedlength - the amount of elements used from the arrayloadFactor - the percentage of how full the backing array can be before they resizejava.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1java.lang.IllegalStateException - if offset and length causes to step outside of the arrays range@Deprecated public IntLinkedOpenHashSet(java.util.Collection<? extends java.lang.Integer> collection)
collection - the set the elements should be added to the Set@Deprecated
public IntLinkedOpenHashSet(java.util.Collection<? extends java.lang.Integer> collection,
float loadFactor)
collection - the set the elements should be added to the SetloadFactor - the percentage of how full the backing array can be before they resizejava.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1public IntLinkedOpenHashSet(IntCollection collection)
collection - the set the elements should be added to the Setpublic IntLinkedOpenHashSet(IntCollection collection, float loadFactor)
collection - the set the elements should be added to the SetloadFactor - the percentage of how full the backing array can be before they resizejava.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1public IntLinkedOpenHashSet(java.util.Iterator<java.lang.Integer> iterator)
iterator - the elements that should be added to the setpublic IntLinkedOpenHashSet(java.util.Iterator<java.lang.Integer> iterator,
float loadFactor)
iterator - the elements that should be added to the setloadFactor - the percentage of how full the backing array can be before they resizejava.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1public IntLinkedOpenHashSet(IntIterator iterator)
iterator - the elements that should be added to the setpublic IntLinkedOpenHashSet(IntIterator iterator, float loadFactor)
iterator - the elements that should be added to the setloadFactor - the percentage of how full the backing array can be before they resizejava.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1public boolean addAndMoveToFirst(int o)
IntSortedSetaddAndMoveToFirst in interface IntSortedSeto - the element that should be insertedSet.add(Object)public boolean addAndMoveToLast(int o)
IntSortedSetaddAndMoveToLast in interface IntSortedSeto - the element that should be insertedSet.add(Object)public boolean moveToFirst(int o)
IntSortedSetmoveToFirst in interface IntSortedSeto - that should be moved to the first indexpublic boolean moveToLast(int o)
IntSortedSetmoveToLast in interface IntSortedSeto - that should be moved to the first lastpublic int firstInt()
IntSortedSetfirstInt in interface IntSortedSetpublic int pollFirstInt()
IntSortedSetpollFirstInt in interface IntSortedSetpublic int lastInt()
IntSortedSetlastInt in interface IntSortedSetpublic int pollLastInt()
IntSortedSetpollLastInt in interface IntSortedSetpublic void clear()
clear in interface java.util.Collection<java.lang.Integer>clear in interface java.util.Set<java.lang.Integer>clear in class IntOpenHashSetpublic void clearAndTrim(int size)
ITrimmableclearAndTrim in interface ITrimmableclearAndTrim in class IntOpenHashSetsize - the amount of elements that should be allowedpublic IntListIterator iterator()
IntCollectioniterator in interface java.lang.Iterable<java.lang.Integer>iterator in interface java.util.Collection<java.lang.Integer>iterator in interface java.util.Set<java.lang.Integer>iterator in interface IntCollectioniterator in interface IntIterableiterator in interface IntSetiterator in interface IntSortedSetiterator in class IntOpenHashSetCollection.iterator()public IntBidirectionalIterator iterator(int fromElement)
IntSortedSetiterator in interface IntSortedSetfromElement - the element the iterator should start frompublic IntComparator comparator()
IntSortedSetcomparator in interface java.util.SortedSet<java.lang.Integer>comparator in interface IntSortedSetpublic IntSortedSet subSet(int fromElement, int toElement)
IntSortedSetsubSet in interface IntSortedSetfromElement - where the SubSet should starttoElement - where the SubSet should endpublic IntSortedSet headSet(int toElement)
IntSortedSetheadSet in interface IntSortedSettoElement - where the HeadSet should endpublic IntSortedSet tailSet(int fromElement)
IntSortedSettailSet in interface IntSortedSetfromElement - where the TailSet should start