it.unimi.dsi.fastutil.chars
Interface CharSortedSet

All Superinterfaces:
CharCollection, CharSet, Collection, Set, SortedSet
All Known Implementing Classes:
AbstractCharSortedSet, CharAVLTreeSet, CharLinkedOpenHashSet, CharRBTreeSet, CharSortedSets.Singleton, CharSortedSets.SynchronizedSortedSet, Sets.EmptySet

public interface CharSortedSet
extends CharSet, SortedSet

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

See Also:
SortedSet

Method Summary
 char firstChar()
           
 CharSortedSet headSet(char toElement)
           
 CharBidirectionalIterator iterator(char fromElement)
          Returns a type-specific BidirectionalIterator on the elements in this set, starting from a given element of the domain (optional operation).
 char lastChar()
           
 CharSortedSet subSet(char fromElement, char toElement)
           
 CharSortedSet tailSet(char fromElement)
           
 
Methods inherited from interface it.unimi.dsi.fastutil.chars.CharSet
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.chars.CharCollection
add, addAll, charIterator, contains, containsAll, rem, removeAll, retainAll, toArray, toCharArray, toCharArray
 
Methods inherited from interface java.util.SortedSet
comparator, first, headSet, last, subSet, tailSet
 

Method Detail

iterator

public CharBidirectionalIterator iterator(char 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 CharSortedSet subSet(char fromElement,
                            char toElement)
See Also:
SortedSet.subSet(Object,Object)

headSet

public CharSortedSet headSet(char toElement)
See Also:
SortedSet.headSet(Object)

tailSet

public CharSortedSet tailSet(char fromElement)
See Also:
SortedSet.tailSet(Object)

firstChar

public char firstChar()
See Also:
SortedSet.first()

lastChar

public char lastChar()
See Also:
SortedSet.last()