Class ByteAVLTreeSet
- java.lang.Object
-
- java.util.AbstractCollection<java.lang.Byte>
-
- it.unimi.dsi.fastutil.bytes.AbstractByteCollection
-
- it.unimi.dsi.fastutil.bytes.AbstractByteSet
-
- it.unimi.dsi.fastutil.bytes.AbstractByteSortedSet
-
- it.unimi.dsi.fastutil.bytes.ByteAVLTreeSet
-
- All Implemented Interfaces:
ByteBidirectionalIterable
,ByteCollection
,ByteIterable
,ByteSet
,ByteSortedSet
,java.io.Serializable
,java.lang.Cloneable
,java.lang.Iterable<java.lang.Byte>
,java.util.Collection<java.lang.Byte>
,java.util.Set<java.lang.Byte>
,java.util.SortedSet<java.lang.Byte>
public class ByteAVLTreeSet extends AbstractByteSortedSet implements java.io.Serializable, java.lang.Cloneable, ByteSortedSet
A type-specific AVL tree set with a fast, small-footprint implementation.The iterators provided by this class are type-specific
bidirectional iterators
. Moreover, the iterator returned byiterator()
can be safely cast to a type-specific list iterator.- See Also:
- Serialized Form
-
-
Constructor Summary
Constructors Constructor 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, 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 givenComparator
.ByteAVLTreeSet(byte[] a, java.util.Comparator<? super java.lang.Byte> c)
Creates a new tree set copying the elements of an array using a givenComparator
.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 itsComparator
).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 itsComparator
).
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method 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)
Returnstrue
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 thantoElement
.boolean
isEmpty()
ByteBidirectionalIterator
iterator()
Returns a type-specific iterator on the elements of this collection.ByteBidirectionalIterator
iterator(byte from)
Returns a type-specificBidirectionalIterator
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 fromfromElement
, inclusive, totoElement
, exclusive.ByteSortedSet
tailSet(byte from)
Returns a view of the portion of this sorted set whose elements are greater than or equal tofromElement
.-
Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByteSet
equals, hashCode, rem
-
Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByteCollection
add, addAll, addAll, contains, containsAll, containsAll, remove, removeAll, removeAll, retainAll, retainAll, toArray, toByteArray, toByteArray, toString
-
Methods inherited from interface it.unimi.dsi.fastutil.bytes.ByteCollection
addAll, containsAll, removeAll, removeIf, removeIf, retainAll, toArray, toByteArray, toByteArray
-
Methods inherited from interface it.unimi.dsi.fastutil.bytes.ByteIterable
forEach, forEach
-
Methods inherited from interface it.unimi.dsi.fastutil.bytes.ByteSortedSet
first, headSet, last, subSet, tailSet
-
-
-
-
Constructor Detail
-
ByteAVLTreeSet
public ByteAVLTreeSet()
Creates a new empty tree set.
-
ByteAVLTreeSet
public ByteAVLTreeSet(java.util.Comparator<? super java.lang.Byte> c)
Creates a new empty tree set with the given comparator.- Parameters:
c
- aComparator
(even better, a type-specific comparator).
-
ByteAVLTreeSet
public ByteAVLTreeSet(java.util.Collection<? extends java.lang.Byte> c)
Creates a new tree set copying a given set.- Parameters:
c
- a collection to be copied into the new tree set.
-
ByteAVLTreeSet
public ByteAVLTreeSet(java.util.SortedSet<java.lang.Byte> s)
Creates a new tree set copying a given sorted set (and itsComparator
).- Parameters:
s
- aSortedSet
to be copied into the new tree set.
-
ByteAVLTreeSet
public ByteAVLTreeSet(ByteCollection c)
Creates a new tree set copying a given type-specific collection.- Parameters:
c
- a type-specific collection to be copied into the new tree set.
-
ByteAVLTreeSet
public ByteAVLTreeSet(ByteSortedSet s)
Creates a new tree set copying a given type-specific sorted set (and itsComparator
).- Parameters:
s
- a type-specific sorted set to be copied into the new tree set.
-
ByteAVLTreeSet
public ByteAVLTreeSet(ByteIterator i)
Creates a new tree set using elements provided by a type-specific iterator.- Parameters:
i
- a type-specific iterator whose elements will fill the set.
-
ByteAVLTreeSet
public ByteAVLTreeSet(java.util.Iterator<?> i)
Creates a new tree set using elements provided by an iterator.- Parameters:
i
- an iterator whose elements will fill the set.
-
ByteAVLTreeSet
public 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 givenComparator
.- Parameters:
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
- aComparator
(even better, a type-specific comparator).
-
ByteAVLTreeSet
public ByteAVLTreeSet(byte[] a, int offset, int length)
Creates a new tree set and fills it with the elements of a given array.- Parameters:
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.
-
ByteAVLTreeSet
public ByteAVLTreeSet(byte[] a)
Creates a new tree set copying the elements of an array.- Parameters:
a
- an array to be copied into the new tree set.
-
ByteAVLTreeSet
public ByteAVLTreeSet(byte[] a, java.util.Comparator<? super java.lang.Byte> c)
Creates a new tree set copying the elements of an array using a givenComparator
.- Parameters:
a
- an array to be copied into the new tree set.c
- aComparator
(even better, a type-specific comparator).
-
-
Method Detail
-
add
public boolean add(byte k)
Description copied from class:AbstractByteCollection
Ensures that this collection contains the specified element (optional operation).This implementation always throws an
UnsupportedOperationException
.- Specified by:
add
in interfaceByteCollection
- Overrides:
add
in classAbstractByteCollection
- See Also:
Collection.add(Object)
-
remove
public boolean remove(byte k)
Description copied from class:AbstractByteSet
Removes an element from this set.Note that the corresponding method of a type-specific collection is
rem()
. This unfortunate situation is caused by the clash with the similarly named index-based method in theList
interface. Delegates to the type-specificrem()
method implemented by type-specific abstractCollection
superclass.- Specified by:
remove
in interfaceByteSet
- Overrides:
remove
in classAbstractByteSet
- See Also:
Collection.remove(Object)
-
contains
public boolean contains(byte k)
Description copied from class:AbstractByteCollection
Returnstrue
if this collection contains the specified element.This implementation iterates over the elements in the collection, looking for the specified element.
- Specified by:
contains
in interfaceByteCollection
- Overrides:
contains
in classAbstractByteCollection
- See Also:
Collection.contains(Object)
-
clear
public void clear()
- Specified by:
clear
in interfacejava.util.Collection<java.lang.Byte>
- Specified by:
clear
in interfacejava.util.Set<java.lang.Byte>
- Overrides:
clear
in classjava.util.AbstractCollection<java.lang.Byte>
-
size
public int size()
- Specified by:
size
in interfacejava.util.Collection<java.lang.Byte>
- Specified by:
size
in interfacejava.util.Set<java.lang.Byte>
- Specified by:
size
in classjava.util.AbstractCollection<java.lang.Byte>
-
isEmpty
public boolean isEmpty()
- Specified by:
isEmpty
in interfacejava.util.Collection<java.lang.Byte>
- Specified by:
isEmpty
in interfacejava.util.Set<java.lang.Byte>
- Overrides:
isEmpty
in classjava.util.AbstractCollection<java.lang.Byte>
-
firstByte
public byte firstByte()
Description copied from interface:ByteSortedSet
Returns the first (lowest) element currently in this set.- Specified by:
firstByte
in interfaceByteSortedSet
- See Also:
SortedSet.first()
-
lastByte
public byte lastByte()
Description copied from interface:ByteSortedSet
Returns the last (highest) element currently in this set.- Specified by:
lastByte
in interfaceByteSortedSet
- See Also:
SortedSet.last()
-
iterator
public ByteBidirectionalIterator iterator()
Description copied from interface:ByteCollection
Returns a type-specific iterator on the elements of this collection.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 extendsCollection
.- Specified by:
iterator
in interfaceByteBidirectionalIterable
- Specified by:
iterator
in interfaceByteCollection
- Specified by:
iterator
in interfaceByteIterable
- Specified by:
iterator
in interfaceByteSet
- Specified by:
iterator
in interfaceByteSortedSet
- Specified by:
iterator
in interfacejava.util.Collection<java.lang.Byte>
- Specified by:
iterator
in interfacejava.lang.Iterable<java.lang.Byte>
- Specified by:
iterator
in interfacejava.util.Set<java.lang.Byte>
- Specified by:
iterator
in classAbstractByteSortedSet
- Returns:
- a type-specific iterator on the elements of this collection.
- See Also:
Iterable.iterator()
-
iterator
public ByteBidirectionalIterator iterator(byte from)
Description copied from interface:ByteSortedSet
Returns a type-specificBidirectionalIterator
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 returnfalse
). 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 returnfalse
).Note that passing the last element of the set as starting point and calling
previous()
you can traverse the entire set in reverse order.- Specified by:
iterator
in interfaceByteSortedSet
- Parameters:
from
- an element to start from.- Returns:
- a bidirectional iterator on the element in this set, starting at the given element.
-
comparator
public ByteComparator comparator()
Description copied from interface:ByteSortedSet
Note that this specification strengthens the one given in
SortedSet.comparator()
.- Specified by:
comparator
in interfaceByteSortedSet
- Specified by:
comparator
in interfacejava.util.SortedSet<java.lang.Byte>
-
headSet
public ByteSortedSet headSet(byte to)
Description copied from interface:ByteSortedSet
Returns a view of the portion of this sorted set whose elements are strictly less thantoElement
.Note that this specification strengthens the one given in
SortedSet.headSet(Object)
.- Specified by:
headSet
in interfaceByteSortedSet
- See Also:
SortedSet.headSet(Object)
-
tailSet
public ByteSortedSet tailSet(byte from)
Description copied from interface:ByteSortedSet
Returns a view of the portion of this sorted set whose elements are greater than or equal tofromElement
.Note that this specification strengthens the one given in
SortedSet.headSet(Object)
.- Specified by:
tailSet
in interfaceByteSortedSet
- See Also:
SortedSet.tailSet(Object)
-
subSet
public ByteSortedSet subSet(byte from, byte to)
Description copied from interface:ByteSortedSet
Returns a view of the portion of this sorted set whose elements range fromfromElement
, inclusive, totoElement
, exclusive.Note that this specification strengthens the one given in
SortedSet.subSet(Object,Object)
.- Specified by:
subSet
in interfaceByteSortedSet
- See Also:
SortedSet.subSet(Object,Object)
-
clone
public java.lang.Object clone()
Returns a deep copy of this tree set.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.
- Returns:
- a deep copy of this tree set.
-
-