public class StoredSortedKeySet<K> extends StoredKeySet<K> implements java.util.SortedSet<K>
In addition to the standard SortedSet methods, this class provides the following methods for stored sorted sets only. Note that the use of these methods is not compatible with the standard Java collections interface.
DEFAULT_ITERATOR_BLOCK_SIZE
Constructor and Description |
---|
StoredSortedKeySet(Database database,
EntryBinding<K> keyBinding,
boolean writeAllowed)
Creates a sorted key set view of a
Database . |
Modifier and Type | Method and Description |
---|---|
java.util.Comparator<? super K> |
comparator()
Returns null since comparators are not supported.
|
K |
first()
Returns the first (lowest) element currently in this sorted set.
|
java.util.SortedSet<K> |
headSet(K toKey)
Returns a view of the portion of this sorted set whose elements are
strictly less than toKey.
|
java.util.SortedSet<K> |
headSet(K toKey,
boolean toInclusive)
Returns a view of the portion of this sorted set whose elements are
strictly less than toKey, optionally including toKey.
|
K |
last()
Returns the last (highest) element currently in this sorted set.
|
java.util.SortedSet<K> |
subSet(K fromKey,
boolean fromInclusive,
K toKey,
boolean toInclusive)
Returns a view of the portion of this sorted set whose elements are
strictly greater than fromKey and strictly less than toKey,
optionally including fromKey and toKey.
|
java.util.SortedSet<K> |
subSet(K fromKey,
K toKey)
Returns a view of the portion of this sorted set whose elements range
from fromKey, inclusive, to toKey, exclusive.
|
java.util.SortedSet<K> |
tailSet(K fromKey)
Returns a view of the portion of this sorted set whose elements are
greater than or equal to fromKey.
|
java.util.SortedSet<K> |
tailSet(K fromKey,
boolean fromInclusive)
Returns a view of the portion of this sorted set whose elements are
strictly greater than fromKey, optionally including fromKey.
|
add, contains, remove
addAll, containsAll, equals, getIteratorBlockSize, hashCode, iterator, iterator, join, removeAll, retainAll, setIteratorBlockSize, size, storedIterator, storedIterator, toArray, toArray, toList, toString
areDuplicatesAllowed, areDuplicatesOrdered, areKeyRangesAllowed, areKeysRenumbered, clear, getCursorConfig, isDirtyRead, isDirtyReadAllowed, isEmpty, isOrdered, isSecondary, isTransactional, isWriteAllowed
public StoredSortedKeySet(Database database, EntryBinding<K> keyBinding, boolean writeAllowed)
Database
.database
- is the Database underlying the new collection.keyBinding
- is the binding used to translate between key buffers
and key objects.writeAllowed
- is true to create a read-write collection or false
to create a read-only collection.java.lang.IllegalArgumentException
- if formats are not consistently
defined or a parameter is invalid.RuntimeExceptionWrapper
- if a DatabaseException
is thrown.public java.util.Comparator<? super K> comparator()
Comparable
interface or not.
This method does not conform to the SortedSet.comparator()
interface.comparator
in interface java.util.SortedSet<K>
public K first()
SortedSet.first()
interface.first
in interface java.util.SortedSet<K>
RuntimeExceptionWrapper
- if a DatabaseException
is thrown.public K last()
SortedSet.last()
interface.last
in interface java.util.SortedSet<K>
RuntimeExceptionWrapper
- if a DatabaseException
is thrown.public java.util.SortedSet<K> headSet(K toKey)
SortedSet.headSet(E)
interface.
Note that the return value is a StoredCollection and must be treated as such; for example, its iterators must be explicitly closed.
headSet
in interface java.util.SortedSet<K>
toKey
- is the upper bound.RuntimeExceptionWrapper
- if a DatabaseException
is thrown.public java.util.SortedSet<K> headSet(K toKey, boolean toInclusive)
SortedSet
interface.
Note that the return value is a StoredCollection and must be treated as such; for example, its iterators must be explicitly closed.
toKey
- is the upper bound.toInclusive
- is true to include toKey.RuntimeExceptionWrapper
- if a DatabaseException
is thrown.public java.util.SortedSet<K> tailSet(K fromKey)
SortedSet.tailSet(E)
interface.
Note that the return value is a StoredCollection and must be treated as such; for example, its iterators must be explicitly closed.
tailSet
in interface java.util.SortedSet<K>
fromKey
- is the lower bound.RuntimeExceptionWrapper
- if a DatabaseException
is thrown.public java.util.SortedSet<K> tailSet(K fromKey, boolean fromInclusive)
SortedSet
interface.
Note that the return value is a StoredCollection and must be treated as such; for example, its iterators must be explicitly closed.
fromKey
- is the lower bound.fromInclusive
- is true to include fromKey.RuntimeExceptionWrapper
- if a DatabaseException
is thrown.public java.util.SortedSet<K> subSet(K fromKey, K toKey)
SortedSet.subSet(E, E)
interface.
Note that the return value is a StoredCollection and must be treated as such; for example, its iterators must be explicitly closed.
subSet
in interface java.util.SortedSet<K>
fromKey
- is the lower bound.toKey
- is the upper bound.RuntimeExceptionWrapper
- if a DatabaseException
is thrown.public java.util.SortedSet<K> subSet(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive)
SortedSet
interface.
Note that the return value is a StoredCollection and must be treated as such; for example, its iterators must be explicitly closed.
fromKey
- is the lower bound.fromInclusive
- is true to include fromKey.toKey
- is the upper bound.toInclusive
- is true to include toKey.RuntimeExceptionWrapper
- if a DatabaseException
is thrown.