public class ByteAVLTreeSet extends AbstractByteSortedSet implements Serializable, 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.
| 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,
Comparator<? super 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,
Comparator<? super Byte> c)
Creates a new tree set and fills it with the elements of a given array
using a given
Comparator. |
ByteAVLTreeSet(ByteCollection c)
Creates a new tree set copying a given type-specific collection.
|
ByteAVLTreeSet(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(Collection<? extends Byte> c)
Creates a new tree set copying a given set.
|
ByteAVLTreeSet(Comparator<? super Byte> c)
Creates a new empty tree set with the given comparator.
|
ByteAVLTreeSet(Iterator<?> i)
Creates a new tree set using elements provided by an iterator.
|
ByteAVLTreeSet(SortedSet<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() |
Object |
clone()
Returns a deep copy of this tree set.
|
ByteComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it
uses its elements' natural ordering.
|
boolean |
contains(byte k) |
byte |
firstByte() |
ByteSortedSet |
headSet(byte to) |
boolean |
isEmpty() |
ByteBidirectionalIterator |
iterator()
Returns a type-specific iterator on the elements of this collection.
|
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() |
boolean |
rem(byte k)
|
int |
size() |
ByteSortedSet |
subSet(byte from,
byte to) |
ByteSortedSet |
tailSet(byte from) |
byteIterator, first, headSet, last, subSet, tailSetequals, hashCode, removeadd, addAll, addAll, contains, containsAll, containsAll, rem, remove, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toByteArray, toByteArray, toStringbyteIterator, headSet, subSet, tailSetaddAll, containsAll, removeAll, retainAll, toArray, toArray, toByteArray, toByteArrayfirst, last, spliteratoradd, addAll, contains, containsAll, equals, hashCode, remove, removeAll, retainAll, toArray, toArrayparallelStream, removeIf, streampublic ByteAVLTreeSet()
public ByteAVLTreeSet(Comparator<? super Byte> c)
c - a Comparator (even better, a type-specific
comparator).public ByteAVLTreeSet(Collection<? extends Byte> c)
c - a collection to be copied into the new tree set.public ByteAVLTreeSet(SortedSet<Byte> s)
Comparator).s - a SortedSet to be copied into the new tree set.public ByteAVLTreeSet(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(ByteIterator i)
i - a type-specific iterator whose elements will fill the set.public ByteAVLTreeSet(Iterator<?> i)
i - an iterator whose elements will fill the set.public ByteAVLTreeSet(byte[] a,
int offset,
int length,
Comparator<? super 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,
Comparator<? super 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 ByteCollectionadd in class AbstractByteCollectionCollection.add(Object)public boolean rem(byte k)
ByteCollectionremove(), but the clash with
the similarly named index-based method in the List
interface forces us to use a distinguished name. For simplicity, the set
interfaces reinstates remove().rem in interface ByteCollectionrem in class AbstractByteCollectionCollection.remove(Object)public boolean contains(byte k)
contains in interface ByteCollectioncontains in class AbstractByteCollectionCollection.contains(Object)public void clear()
clear in interface Collection<Byte>clear in interface Set<Byte>clear in class AbstractCollection<Byte>public int size()
size in interface Collection<Byte>size in interface Set<Byte>size in class AbstractCollection<Byte>public boolean isEmpty()
isEmpty in interface Collection<Byte>isEmpty in interface Set<Byte>isEmpty in class AbstractByteCollectionpublic byte firstByte()
firstByte in interface ByteSortedSetSortedSet.first()public byte lastByte()
lastByte in interface ByteSortedSetSortedSet.last()public ByteBidirectionalIterator iterator()
ByteCollection
Note that this specification strengthens the one given in
Iterable.iterator(), which was already strengthened in
the corresponding type-specific class, but was weakened by the fact that
this interface extends Collection.
iterator in interface ByteCollectioniterator in interface ByteIterableiterator in interface ByteSetiterator in interface ByteSortedSetiterator in interface Iterable<Byte>iterator in interface Collection<Byte>iterator in interface Set<Byte>iterator in class AbstractByteSortedSetpublic 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 ByteComparator comparator()
ByteSortedSet
Note that this specification strengthens the one given in
SortedSet.comparator().
comparator in interface ByteSortedSetcomparator in interface SortedSet<Byte>SortedSet.comparator()public ByteSortedSet headSet(byte to)
headSet in interface ByteSortedSetSortedSet.headSet(Object)public ByteSortedSet tailSet(byte from)
tailSet in interface ByteSortedSetSortedSet.tailSet(Object)public ByteSortedSet subSet(byte from, byte to)
subSet in interface ByteSortedSetSortedSet.subSet(Object,Object)