public class ByteAVLTreeSet extends AbstractByteSortedSet implements java.io.Serializable, java.lang.Cloneable, ByteSortedSet
The iterators provided by this class are type-specific bidirectional iterators.
Moreover, the iterator returned by iterator() can be safely cast
to a type-specific list iterator.
| Modifier and Type | Field and Description |
|---|---|
protected it.unimi.dsi.fastutil.bytes.ByteComparator |
actualComparator
This set's actual comparator; it may differ from
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping. |
protected int |
count
Number of elements in this set.
|
protected it.unimi.dsi.fastutil.bytes.ByteAVLTreeSet.Entry |
firstEntry
The entry of the first element of this set.
|
protected it.unimi.dsi.fastutil.bytes.ByteAVLTreeSet.Entry |
lastEntry
The entry of the last element of this set.
|
protected java.util.Comparator<? super java.lang.Byte> |
storedComparator
This set's comparator, as provided in the constructor.
|
protected it.unimi.dsi.fastutil.bytes.ByteAVLTreeSet.Entry |
tree
A reference to the root entry.
|
| Constructor and Description |
|---|
ByteAVLTreeSet()
Creates a new empty tree set.
|
ByteAVLTreeSet(byte[] a)
Creates a new tree set copying the elements of an array.
|
ByteAVLTreeSet(byte[] a,
java.util.Comparator<? super java.lang.Byte> c)
Creates a new tree set copying the elements of an array using a given
Comparator. |
ByteAVLTreeSet(byte[] a,
int offset,
int length)
Creates a new tree set and fills it with the elements of a given array.
|
ByteAVLTreeSet(byte[] a,
int offset,
int length,
java.util.Comparator<? super java.lang.Byte> c)
Creates a new tree set and fills it with the elements of a given array using a given
Comparator. |
ByteAVLTreeSet(it.unimi.dsi.fastutil.bytes.ByteCollection c)
Creates a new tree set copying a given type-specific collection.
|
ByteAVLTreeSet(it.unimi.dsi.fastutil.bytes.ByteIterator i)
Creates a new tree set using elements provided by a type-specific iterator.
|
ByteAVLTreeSet(ByteSortedSet s)
Creates a new tree set copying a given type-specific sorted set (and its
Comparator). |
ByteAVLTreeSet(java.util.Collection<? extends java.lang.Byte> c)
Creates a new tree set copying a given set.
|
ByteAVLTreeSet(java.util.Comparator<? super java.lang.Byte> c)
Creates a new empty tree set with the given comparator.
|
ByteAVLTreeSet(java.util.Iterator<?> i)
Creates a new tree set using elements provided by an iterator.
|
ByteAVLTreeSet(java.util.SortedSet<java.lang.Byte> s)
Creates a new tree set copying a given sorted set (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(byte k) |
void |
clear() |
java.lang.Object |
clone()
Returns a deep copy of this tree set.
|
it.unimi.dsi.fastutil.bytes.ByteComparator |
comparator() |
boolean |
contains(byte k) |
byte |
firstByte()
Returns the first (lowest) element currently in this set.
|
ByteSortedSet |
headSet(byte to)
Returns a view of the portion of this sorted set whose elements are strictly less than
toElement. |
boolean |
isEmpty() |
it.unimi.dsi.fastutil.bytes.ByteBidirectionalIterator |
iterator()
Returns a type-specific iterator on the elements of this set.
|
it.unimi.dsi.fastutil.bytes.ByteBidirectionalIterator |
iterator(byte from)
Returns a type-specific
BidirectionalIterator on the elements in
this set, starting from a given element of the domain (optional operation). |
byte |
lastByte()
Returns the last (highest) element currently in this set.
|
boolean |
remove(byte k)
Removes an element from this set.
|
int |
size() |
ByteSortedSet |
subSet(byte from,
byte to)
Returns a view of the portion of this sorted set whose elements range from
fromElement, inclusive, to toElement, exclusive. |
ByteSortedSet |
tailSet(byte from)
Returns a view of the portion of this sorted set whose elements are greater than or equal to
fromElement. |
equals, hashCode, remadd, addAll, addAll, contains, containsAll, containsAll, remove, removeAll, removeAll, retainAll, retainAll, toArray, toByteArray, toByteArray, toStringfinalize, getClass, notify, notifyAll, wait, wait, waitfirst, headSet, last, spliterator, subSet, tailSetadd, contains, of, of, of, of, of, rem, removeprotected transient it.unimi.dsi.fastutil.bytes.ByteAVLTreeSet.Entry tree
protected int count
protected transient it.unimi.dsi.fastutil.bytes.ByteAVLTreeSet.Entry firstEntry
protected transient it.unimi.dsi.fastutil.bytes.ByteAVLTreeSet.Entry lastEntry
protected java.util.Comparator<? super java.lang.Byte> storedComparator
protected transient it.unimi.dsi.fastutil.bytes.ByteComparator actualComparator
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping.public ByteAVLTreeSet()
public ByteAVLTreeSet(java.util.Comparator<? super java.lang.Byte> c)
c - a Comparator (even better, a type-specific comparator).public ByteAVLTreeSet(java.util.Collection<? extends java.lang.Byte> c)
c - a collection to be copied into the new tree set.public ByteAVLTreeSet(java.util.SortedSet<java.lang.Byte> s)
Comparator).s - a SortedSet to be copied into the new tree set.public ByteAVLTreeSet(it.unimi.dsi.fastutil.bytes.ByteCollection c)
c - a type-specific collection to be copied into the new tree set.public ByteAVLTreeSet(ByteSortedSet s)
Comparator).s - a type-specific sorted set to be copied into the new tree set.public ByteAVLTreeSet(it.unimi.dsi.fastutil.bytes.ByteIterator i)
i - a type-specific iterator whose elements will fill the set.public ByteAVLTreeSet(java.util.Iterator<?> i)
i - an iterator whose elements will fill the set.public ByteAVLTreeSet(byte[] a,
int offset,
int length,
java.util.Comparator<? super java.lang.Byte> c)
Comparator.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.c - a Comparator (even better, a type-specific comparator).public ByteAVLTreeSet(byte[] a,
int offset,
int length)
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.public ByteAVLTreeSet(byte[] a)
a - an array to be copied into the new tree set.public ByteAVLTreeSet(byte[] a,
java.util.Comparator<? super java.lang.Byte> c)
Comparator.a - an array to be copied into the new tree set.c - a Comparator (even better, a type-specific comparator).public boolean add(byte k)
add in interface it.unimi.dsi.fastutil.bytes.ByteCollectionadd in class it.unimi.dsi.fastutil.bytes.AbstractByteCollectionpublic boolean remove(byte k)
AbstractByteSetrem() method
implemented by type-specific abstract Collection superclass.remove in interface ByteSetremove in class AbstractByteSetCollection.remove(Object)public boolean contains(byte k)
contains in interface it.unimi.dsi.fastutil.bytes.ByteCollectioncontains in class it.unimi.dsi.fastutil.bytes.AbstractByteCollectionpublic void clear()
clear in interface java.util.Collection<java.lang.Byte>clear in interface java.util.Set<java.lang.Byte>clear in class java.util.AbstractCollection<java.lang.Byte>public int size()
size in interface java.util.Collection<java.lang.Byte>size in interface java.util.Set<java.lang.Byte>size in class java.util.AbstractCollection<java.lang.Byte>public boolean isEmpty()
isEmpty in interface java.util.Collection<java.lang.Byte>isEmpty in interface java.util.Set<java.lang.Byte>isEmpty in class java.util.AbstractCollection<java.lang.Byte>public byte firstByte()
ByteSortedSetfirstByte in interface ByteSortedSetSortedSet.first()public byte lastByte()
ByteSortedSetlastByte in interface ByteSortedSetSortedSet.last()public it.unimi.dsi.fastutil.bytes.ByteBidirectionalIterator iterator()
ByteSetiterator in interface it.unimi.dsi.fastutil.bytes.ByteBidirectionalIterableiterator in interface it.unimi.dsi.fastutil.bytes.ByteCollectioniterator in interface it.unimi.dsi.fastutil.bytes.ByteIterableiterator in interface ByteSetiterator in interface ByteSortedSetiterator 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 class AbstractByteSortedSetpublic it.unimi.dsi.fastutil.bytes.ByteBidirectionalIterator iterator(byte from)
ByteSortedSetBidirectionalIterator on the elements in
this set, starting from a given element of the domain (optional operation).
This method returns a type-specific bidirectional iterator with given
starting point. The starting point is any element comparable to the
elements of this set (even if it does not actually belong to the
set). The next element of the returned iterator is the least element of
the set that is greater than the starting point (if there are no
elements greater than the starting point, hasNext() will return
false). The previous element of the returned iterator is
the greatest element of the set that is smaller than or equal to the
starting point (if there are no elements smaller than or equal to the
starting point, hasPrevious() will return false).
Note that passing the last element of the set as starting point and
calling previous() you can traverse the
entire set in reverse order.
iterator in interface ByteSortedSetfrom - an element to start from.public it.unimi.dsi.fastutil.bytes.ByteComparator comparator()
ByteSortedSetcomparator in interface ByteSortedSetcomparator in interface java.util.SortedSet<java.lang.Byte>public ByteSortedSet headSet(byte to)
ByteSortedSettoElement.headSet in interface ByteSortedSetSortedSet.headSet(Object)public ByteSortedSet tailSet(byte from)
ByteSortedSetfromElement.tailSet in interface ByteSortedSetSortedSet.tailSet(Object)public ByteSortedSet subSet(byte from, byte to)
ByteSortedSetfromElement, inclusive, to toElement, exclusive.subSet in interface ByteSortedSetSortedSet.subSet(Object,Object)public java.lang.Object clone()
This method performs a deep copy of this tree set; the data stored in the set, however, is not cloned. Note that this makes a difference only for object keys.
clone in class java.lang.Object