Class ByteRBTreeSet
- All Implemented Interfaces:
ByteBidirectionalIterable,ByteCollection,ByteIterable,ByteSet,ByteSortedSet,Serializable,Cloneable,Iterable<Byte>,Collection<Byte>,SequencedCollection<Byte>,SequencedSet<Byte>,Set<Byte>,SortedSet<Byte>
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.
- See Also:
-
Constructor Summary
ConstructorsConstructorDescriptionCreates a new empty tree set.ByteRBTreeSet(byte[] a) Creates a new tree set copying the elements of an array.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 givenComparator.ByteRBTreeSet(byte[] a, Comparator<? super Byte> c) Creates a new tree set copying the elements of an array using a givenComparator.Creates a new tree set copying a given type-specific collection.Creates a new tree set using elements provided by a type-specific iterator.Creates a new tree set copying a given type-specific sorted set (and itsComparator).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<?> i) Creates a new tree set using elements provided by an iterator.Creates a new tree set copying a given sorted set (and itsComparator). -
Method Summary
Modifier and TypeMethodDescriptionbooleanadd(byte k) Ensures that this collection contains the specified element (optional operation).voidclear()clone()Returns a deep copy of this tree set.booleancontains(byte k) Returnstrueif this collection contains the specified element.byteReturns the first (lowest) element currently in this set.headSet(byte to) Returns a view of the portion of this sorted set whose elements are strictly less thantoElement.booleanisEmpty()iterator()Returns a type-specific iterator on the elements of this collection.iterator(byte from) Returns a type-specificBidirectionalIteratoron the elements in this set, starting from a given element of the domain (optional operation).bytelastByte()Returns the last (highest) element currently in this set.booleanremove(byte k) Removes an element from this set.intsize()subSet(byte from, byte to) Returns a view of the portion of this sorted set whose elements range fromfromElement, inclusive, totoElement, exclusive.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, remMethods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByteCollection
add, addAll, addAll, contains, containsAll, containsAll, remove, removeAll, removeAll, retainAll, retainAll, toArray, toByteArray, toByteArray, toStringMethods inherited from class java.util.AbstractCollection
toArray, toArrayMethods inherited from interface it.unimi.dsi.fastutil.bytes.ByteCollection
addAll, containsAll, intIterator, intParallelStream, intSpliterator, intStream, parallelStream, removeAll, removeIf, removeIf, removeIf, retainAll, stream, toArray, toByteArray, toByteArrayMethods inherited from interface it.unimi.dsi.fastutil.bytes.ByteIterable
forEach, forEach, forEachMethods inherited from interface it.unimi.dsi.fastutil.bytes.ByteSortedSet
first, headSet, last, spliterator, subSet, tailSetMethods inherited from interface java.util.Collection
toArrayMethods inherited from interface java.util.Set
add, addAll, contains, containsAll, equals, hashCode, remove, removeAll, retainAll, toArray, toArrayMethods inherited from interface java.util.SortedSet
addFirst, addLast, getFirst, getLast, removeFirst, removeLast, reversed
-
Constructor Details
-
ByteRBTreeSet
public ByteRBTreeSet()Creates a new empty tree set. -
ByteRBTreeSet
Creates a new empty tree set with the given comparator.- Parameters:
c- aComparator(even better, a type-specific comparator).
-
ByteRBTreeSet
Creates a new tree set copying a given collection.- Parameters:
c- a collection to be copied into the new tree set.
-
ByteRBTreeSet
Creates a new tree set copying a given sorted set (and itsComparator).- Parameters:
s- aSortedSetto be copied into the new tree set.
-
ByteRBTreeSet
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.
-
ByteRBTreeSet
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.
-
ByteRBTreeSet
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.
-
ByteRBTreeSet
Creates a new tree set using elements provided by an iterator.- Parameters:
i- an iterator whose elements will fill the set.
-
ByteRBTreeSet
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).
-
ByteRBTreeSet
public ByteRBTreeSet(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.
-
ByteRBTreeSet
public ByteRBTreeSet(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.
-
ByteRBTreeSet
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 Details
-
add
public boolean add(byte k) Description copied from class:AbstractByteCollectionEnsures that this collection contains the specified element (optional operation).- Specified by:
addin interfaceByteCollection- Overrides:
addin classAbstractByteCollection- See Also:
-
remove
public boolean remove(byte k) Description copied from class:AbstractByteSetRemoves an element from this set. Delegates to the type-specificrem()method implemented by type-specific abstractCollectionsuperclass.- Specified by:
removein interfaceByteSet- Overrides:
removein classAbstractByteSet- See Also:
-
contains
public boolean contains(byte k) Description copied from class:AbstractByteCollectionReturnstrueif this collection contains the specified element.- Specified by:
containsin interfaceByteCollection- Overrides:
containsin classAbstractByteCollection- See Also:
-
clear
public void clear()- Specified by:
clearin interfaceCollection<Byte>- Specified by:
clearin interfaceSet<Byte>- Overrides:
clearin classAbstractCollection<Byte>
-
size
public int size()- Specified by:
sizein interfaceCollection<Byte>- Specified by:
sizein interfaceSet<Byte>- Specified by:
sizein classAbstractCollection<Byte>
-
isEmpty
public boolean isEmpty()- Specified by:
isEmptyin interfaceCollection<Byte>- Specified by:
isEmptyin interfaceSet<Byte>- Overrides:
isEmptyin classAbstractCollection<Byte>
-
firstByte
public byte firstByte()Description copied from interface:ByteSortedSetReturns the first (lowest) element currently in this set.- Specified by:
firstBytein interfaceByteSortedSet- See Also:
-
lastByte
public byte lastByte()Description copied from interface:ByteSortedSetReturns the last (highest) element currently in this set.- Specified by:
lastBytein interfaceByteSortedSet- See Also:
-
iterator
Description copied from interface:ByteCollectionReturns a type-specific iterator on the elements of this collection.- Specified by:
iteratorin interfaceByteBidirectionalIterable- Specified by:
iteratorin interfaceByteCollection- Specified by:
iteratorin interfaceByteIterable- Specified by:
iteratorin interfaceByteSet- Specified by:
iteratorin interfaceByteSortedSet- Specified by:
iteratorin interfaceCollection<Byte>- Specified by:
iteratorin interfaceIterable<Byte>- Specified by:
iteratorin interfaceSet<Byte>- Specified by:
iteratorin classAbstractByteSortedSet- Returns:
- a type-specific iterator on the elements of this collection.
- See Also:
-
iterator
Description copied from interface:ByteSortedSetReturns a type-specificBidirectionalIteratoron 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:
iteratorin interfaceByteSortedSet- Parameters:
from- an element to start from.- Returns:
- a bidirectional iterator on the element in this set, starting at the given element.
-
comparator
Description copied from interface:ByteSortedSet- Specified by:
comparatorin interfaceByteSortedSet- Specified by:
comparatorin interfaceSortedSet<Byte>
-
headSet
Description copied from interface:ByteSortedSetReturns a view of the portion of this sorted set whose elements are strictly less thantoElement.- Specified by:
headSetin interfaceByteSortedSet- See Also:
-
tailSet
Description copied from interface:ByteSortedSetReturns a view of the portion of this sorted set whose elements are greater than or equal tofromElement.- Specified by:
tailSetin interfaceByteSortedSet- See Also:
-
subSet
Description copied from interface:ByteSortedSetReturns a view of the portion of this sorted set whose elements range fromfromElement, inclusive, totoElement, exclusive.- Specified by:
subSetin interfaceByteSortedSet- See Also:
-
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.
-