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.
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(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(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)
Ensures that this collection contains the specified element (optional operation).
|
void |
clear() |
java.lang.Object |
clone()
Returns a deep copy of this tree set.
|
ByteComparator |
comparator() |
boolean |
contains(byte k)
Returns
true if this collection contains the specified element. |
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() |
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()
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, rem
add, addAll, addAll, contains, containsAll, containsAll, remove, removeAll, removeAll, retainAll, retainAll, toArray, toByteArray, toByteArray, toString
first, headSet, last, spliterator, subSet, tailSet
add, contains, of, of, of, of, of, rem, remove
addAll, containsAll, intIterator, intParallelStream, intSpliterator, intStream, parallelStream, removeAll, removeIf, removeIf, removeIf, retainAll, stream, toArray, toByteArray, toByteArray
forEach, forEach, forEach
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(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(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)
AbstractByteCollection
add
in interface ByteCollection
add
in class AbstractByteCollection
Collection.add(Object)
public boolean remove(byte k)
AbstractByteSet
rem()
method
implemented by type-specific abstract Collection
superclass.remove
in interface ByteSet
remove
in class AbstractByteSet
Collection.remove(Object)
public boolean contains(byte k)
AbstractByteCollection
true
if this collection contains the specified element.contains
in interface ByteCollection
contains
in class AbstractByteCollection
Collection.contains(Object)
public 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()
ByteSortedSet
firstByte
in interface ByteSortedSet
SortedSet.first()
public byte lastByte()
ByteSortedSet
lastByte
in interface ByteSortedSet
SortedSet.last()
public ByteBidirectionalIterator iterator()
ByteCollection
iterator
in interface ByteBidirectionalIterable
iterator
in interface ByteCollection
iterator
in interface ByteIterable
iterator
in interface ByteSet
iterator
in interface ByteSortedSet
iterator
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 AbstractByteSortedSet
Iterable.iterator()
public ByteBidirectionalIterator iterator(byte from)
ByteSortedSet
BidirectionalIterator
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 ByteSortedSet
from
- an element to start from.public ByteComparator comparator()
ByteSortedSet
comparator
in interface ByteSortedSet
comparator
in interface java.util.SortedSet<java.lang.Byte>
public ByteSortedSet headSet(byte to)
ByteSortedSet
toElement
.headSet
in interface ByteSortedSet
SortedSet.headSet(Object)
public ByteSortedSet tailSet(byte from)
ByteSortedSet
fromElement
.tailSet
in interface ByteSortedSet
SortedSet.tailSet(Object)
public ByteSortedSet subSet(byte from, byte to)
ByteSortedSet
fromElement
, inclusive, to toElement
, exclusive.subSet
in interface ByteSortedSet
SortedSet.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