it.unimi.dsi.fastutil.bytes
Interface ByteSortedSet

All Superinterfaces:
ByteCollection, ByteSet, Collection, Set, SortedSet
All Known Implementing Classes:
AbstractByteSortedSet, ByteAVLTreeSet, ByteLinkedOpenHashSet, ByteRBTreeSet, ByteSortedSets.Singleton, ByteSortedSets.SynchronizedSortedSet, Sets.EmptySet

public interface ByteSortedSet
extends ByteSet, SortedSet

A type-specific SortedSet; provides some additional methods that use polymorphism to reduce type juggling.

See Also:
SortedSet

Method Summary
 byte firstByte()
           
 ByteSortedSet headSet(byte toElement)
           
 ByteBidirectionalIterator iterator(byte fromElement)
          Returns a type-specific BidirectionalIterator on the elements in this set, starting from a given element of the domain (optional operation).
 byte lastByte()
           
 ByteSortedSet subSet(byte fromElement, byte toElement)
           
 ByteSortedSet tailSet(byte fromElement)
           
 
Methods inherited from interface it.unimi.dsi.fastutil.bytes.ByteSet
remove
 
Methods inherited from interface java.util.Set
add, addAll, clear, contains, containsAll, equals, hashCode, isEmpty, iterator, remove, removeAll, retainAll, size, toArray, toArray
 
Methods inherited from interface it.unimi.dsi.fastutil.bytes.ByteCollection
add, addAll, byteIterator, contains, containsAll, rem, removeAll, retainAll, toArray, toByteArray, toByteArray
 
Methods inherited from interface java.util.SortedSet
comparator, first, headSet, last, subSet, tailSet
 

Method Detail

iterator

public ByteBidirectionalIterator iterator(byte fromElement)
Returns a type-specific 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.

Parameters:
fromElement - an element to start from.
Returns:
a bidirectional iterator iterator starting at the given element.
Throws:
UnsupportedOperationException - if this set does not support iterators with a starting point.

subSet

public ByteSortedSet subSet(byte fromElement,
                            byte toElement)
See Also:
SortedSet.subSet(Object,Object)

headSet

public ByteSortedSet headSet(byte toElement)
See Also:
SortedSet.headSet(Object)

tailSet

public ByteSortedSet tailSet(byte fromElement)
See Also:
SortedSet.tailSet(Object)

firstByte

public byte firstByte()
See Also:
SortedSet.first()

lastByte

public byte lastByte()
See Also:
SortedSet.last()