public class ByteLinkedOpenHashSet extends ByteOpenHashSet implements ByteSortedSet
| Constructor and Description |
|---|
ByteLinkedOpenHashSet()
Default Constructor
|
ByteLinkedOpenHashSet(byte[] array)
Helper constructor that allow to create a set from unboxed values
|
ByteLinkedOpenHashSet(byte[] array,
float loadFactor)
Helper constructor that allow to create a set from unboxed values
|
ByteLinkedOpenHashSet(byte[] array,
int offset,
int length)
Helper constructor that allow to create a set from unboxed values
|
ByteLinkedOpenHashSet(byte[] array,
int offset,
int length,
float loadFactor)
Helper constructor that allow to create a set from unboxed values
|
ByteLinkedOpenHashSet(ByteCollection collection)
A Helper constructor that allows to create a Set with exactly the same values as the provided collection.
|
ByteLinkedOpenHashSet(ByteCollection collection,
float loadFactor)
A Helper constructor that allows to create a Set with exactly the same values as the provided collection.
|
ByteLinkedOpenHashSet(ByteIterator iterator)
A Helper constructor that allows to create a set from a iterator of an unknown size
|
ByteLinkedOpenHashSet(ByteIterator iterator,
float loadFactor)
A Helper constructor that allows to create a set from a iterator of an unknown size
|
ByteLinkedOpenHashSet(java.util.Collection<? extends java.lang.Byte> collection)
Deprecated.
|
ByteLinkedOpenHashSet(java.util.Collection<? extends java.lang.Byte> collection,
float loadFactor)
Deprecated.
|
ByteLinkedOpenHashSet(int minCapacity)
Constructor that defines the minimum capacity
|
ByteLinkedOpenHashSet(int minCapacity,
float loadFactor)
Constructor that defines the minimum capacity and load factor
|
ByteLinkedOpenHashSet(java.util.Iterator<java.lang.Byte> iterator)
A Helper constructor that allows to create a set from a iterator of an unknown size
|
ByteLinkedOpenHashSet(java.util.Iterator<java.lang.Byte> 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(byte o)
A customized add method that allows you to insert into the first index.
|
boolean |
addAndMoveToLast(byte 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
|
ByteComparator |
comparator()
A Type Specific Comparator method
|
byte |
firstByte()
A method to get the first element in the set
|
ByteSortedSet |
headSet(byte toElement)
A Type Specific HeadSet method to reduce boxing/unboxing
|
ByteListIterator |
iterator()
Returns a Type-Specific Iterator to reduce (un)boxing
|
ByteBidirectionalIterator |
iterator(byte fromElement)
A type Specific Iterator starting from a given key
|
byte |
lastByte()
A method to get the last element in the set
|
boolean |
moveToFirst(byte o)
A specific move method to move a given key to the first index.
|
boolean |
moveToLast(byte o)
A specific move method to move a given key to the last index.
|
byte |
pollFirstByte()
A method to get and remove the first element in the set
|
byte |
pollLastByte()
A method to get and remove the last element in the set
|
ByteSortedSet |
subSet(byte fromElement,
byte toElement)
A Type Specific SubSet method to reduce boxing/unboxing
|
ByteSortedSet |
tailSet(byte fromElement)
A Type Specific TailSet method to reduce boxing/unboxing
|
add, addAll, addAll, contains, contains, remove, remove, size, trimequals, hashCodeadd, containsAll, containsAny, containsAny, remByte, removeAll, retainAll, toByteArray, toByteArraycontainsAll, isEmpty, removeAll, retainAll, toArray, toArray, toStringfirst, headSet, last, spliterator, subSet, tailSetadd, contains, remByte, remove, removeadd, addAll, contains, containsAll, containsAny, containsAny, parallelPrimitiveStream, primitiveStream, remIf, removeAll, removeIf, retainAll, toByteArray, toByteArrayforEach, forEachaddAll, containsAll, equals, hashCode, isEmpty, removeAll, retainAll, size, toArray, toArrayclearAndTrim, trimpublic ByteLinkedOpenHashSet()
public ByteLinkedOpenHashSet(int minCapacity)
minCapacity - the minimum capacity the HashSet is allowed to be.java.lang.IllegalStateException - if the minimum capacity is negativepublic ByteLinkedOpenHashSet(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 ByteLinkedOpenHashSet(byte[] array)
array - the elements that should be put into the setpublic ByteLinkedOpenHashSet(byte[] 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 ByteLinkedOpenHashSet(byte[] 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 ByteLinkedOpenHashSet(byte[] 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 ByteLinkedOpenHashSet(java.util.Collection<? extends java.lang.Byte> collection)
collection - the set the elements should be added to the Set@Deprecated
public ByteLinkedOpenHashSet(java.util.Collection<? extends java.lang.Byte> 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 ByteLinkedOpenHashSet(ByteCollection collection)
collection - the set the elements should be added to the Setpublic ByteLinkedOpenHashSet(ByteCollection 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 ByteLinkedOpenHashSet(java.util.Iterator<java.lang.Byte> iterator)
iterator - the elements that should be added to the setpublic ByteLinkedOpenHashSet(java.util.Iterator<java.lang.Byte> 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 ByteLinkedOpenHashSet(ByteIterator iterator)
iterator - the elements that should be added to the setpublic ByteLinkedOpenHashSet(ByteIterator 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(byte o)
ByteSortedSetaddAndMoveToFirst in interface ByteSortedSeto - the element that should be insertedSet.add(Object)public boolean addAndMoveToLast(byte o)
ByteSortedSetaddAndMoveToLast in interface ByteSortedSeto - the element that should be insertedSet.add(Object)public boolean moveToFirst(byte o)
ByteSortedSetmoveToFirst in interface ByteSortedSeto - that should be moved to the first indexpublic boolean moveToLast(byte o)
ByteSortedSetmoveToLast in interface ByteSortedSeto - that should be moved to the first lastpublic byte firstByte()
ByteSortedSetfirstByte in interface ByteSortedSetpublic byte pollFirstByte()
ByteSortedSetpollFirstByte in interface ByteSortedSetpublic byte lastByte()
ByteSortedSetlastByte in interface ByteSortedSetpublic byte pollLastByte()
ByteSortedSetpollLastByte in interface ByteSortedSetpublic void clear()
clear in interface java.util.Collection<java.lang.Byte>clear in interface java.util.Set<java.lang.Byte>clear in class ByteOpenHashSetpublic void clearAndTrim(int size)
ITrimmableclearAndTrim in interface ITrimmableclearAndTrim in class ByteOpenHashSetsize - the amount of elements that should be allowedpublic ByteListIterator iterator()
ByteCollectioniterator in interface java.lang.Iterable<java.lang.Byte>iterator in interface java.util.Collection<java.lang.Byte>iterator in interface java.util.Set<java.lang.Byte>iterator in interface ByteCollectioniterator in interface ByteIterableiterator in interface ByteSetiterator in interface ByteSortedSetiterator in class ByteOpenHashSetCollection.iterator()public ByteBidirectionalIterator iterator(byte fromElement)
ByteSortedSetiterator in interface ByteSortedSetfromElement - the element the iterator should start frompublic ByteComparator comparator()
ByteSortedSetcomparator in interface java.util.SortedSet<java.lang.Byte>comparator in interface ByteSortedSetpublic ByteSortedSet subSet(byte fromElement, byte toElement)
ByteSortedSetsubSet in interface ByteSortedSetfromElement - where the SubSet should starttoElement - where the SubSet should endpublic ByteSortedSet headSet(byte toElement)
ByteSortedSetheadSet in interface ByteSortedSettoElement - where the HeadSet should endpublic ByteSortedSet tailSet(byte fromElement)
ByteSortedSettailSet in interface ByteSortedSetfromElement - where the TailSet should start