public class ByteRBTreeSet 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 |
---|
ByteRBTreeSet()
Creates a new empty tree set.
|
ByteRBTreeSet(byte[] a)
Creates a new tree set copying the elements of an array.
|
ByteRBTreeSet(byte[] a,
Comparator<? super Byte> c)
Creates a new tree set copying the elements of an array using a given
Comparator . |
ByteRBTreeSet(byte[] a,
int offset,
int length)
Creates a new tree set and fills it with the elements of a given array.
|
ByteRBTreeSet(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 . |
ByteRBTreeSet(ByteCollection c)
Creates a new tree set copying a given type-specific collection.
|
ByteRBTreeSet(ByteIterator i)
Creates a new tree set using elements provided by a type-specific iterator.
|
ByteRBTreeSet(ByteSortedSet s)
Creates a new tree set copying a given type-specific sorted set (and its
Comparator ). |
ByteRBTreeSet(Collection<? extends Byte> c)
Creates a new tree set copying a given collection.
|
ByteRBTreeSet(Comparator<? super Byte> c)
Creates a new empty tree set with the given comparator.
|
ByteRBTreeSet(Iterator<? extends Byte> i)
Creates a new tree set using elements provided by an iterator.
|
ByteRBTreeSet(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 |
remove(byte k)
Removes an element from this set.
|
int |
size() |
ByteSortedSet |
subSet(byte from,
byte to) |
ByteSortedSet |
tailSet(byte from) |
byteIterator, first, headSet, last, subSet, tailSet
equals, hashCode, rem, remove
add, addAll, addAll, contains, containsAll, containsAll, rem, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toByteArray, toByteArray, toString
byteIterator, headSet, subSet, tailSet
addAll, containsAll, rem, removeAll, retainAll, toArray, toArray, toByteArray, toByteArray
public ByteRBTreeSet()
public ByteRBTreeSet(Comparator<? super Byte> c)
c
- a Comparator
(even better, a type-specific comparator).public ByteRBTreeSet(Collection<? extends Byte> c)
c
- a collection to be copied into the new tree set.public ByteRBTreeSet(SortedSet<Byte> s)
Comparator
).s
- a SortedSet
to be copied into the new tree set.public ByteRBTreeSet(ByteCollection c)
c
- a type-specific collection to be copied into the new tree set.public ByteRBTreeSet(ByteSortedSet s)
Comparator
).s
- a type-specific sorted set to be copied into the new tree set.public ByteRBTreeSet(ByteIterator i)
i
- a type-specific iterator whose elements will fill the set.public ByteRBTreeSet(Iterator<? extends Byte> i)
i
- an iterator whose elements will fill the set.public ByteRBTreeSet(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 ByteRBTreeSet(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 ByteRBTreeSet(byte[] a)
a
- an array to be copied into the new tree set.public ByteRBTreeSet(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 ByteCollection
add
in class AbstractByteCollection
Collection.add(Object)
public boolean remove(byte k)
ByteSet
Note that the corresponding method of the type-specific collection is rem()
.
This unfortunate situation is caused by the clash
with the similarly named index-based method in the List
interface.
remove
in interface ByteSet
remove
in class AbstractByteSet
Collection.remove(Object)
public boolean contains(byte k)
contains
in interface ByteCollection
contains
in class AbstractByteCollection
Collection.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 AbstractByteCollection
public byte firstByte()
firstByte
in interface ByteSortedSet
SortedSet.first()
public byte lastByte()
lastByte
in interface ByteSortedSet
SortedSet.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 ByteCollection
iterator
in interface ByteIterable
iterator
in interface ByteSet
iterator
in interface ByteSortedSet
iterator
in interface Iterable<Byte>
iterator
in interface Collection<Byte>
iterator
in interface Set<Byte>
iterator
in class AbstractByteSortedSet
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
Note that this specification strengthens the one given in SortedSet.comparator()
.
comparator
in interface ByteSortedSet
comparator
in interface SortedSet<Byte>
SortedSet.comparator()
public ByteSortedSet headSet(byte to)
headSet
in interface ByteSortedSet
SortedSet.headSet(Object)
public ByteSortedSet tailSet(byte from)
tailSet
in interface ByteSortedSet
SortedSet.tailSet(Object)
public ByteSortedSet subSet(byte from, byte to)
subSet
in interface ByteSortedSet
SortedSet.subSet(Object,Object)