|
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorg.ozoneDB.OzoneObject
org.ozoneDB.collections.AbstractOzoneCollection
org.ozoneDB.collections.AbstractOzoneSet
org.ozoneDB.collections.BaseTreeSetImpl
org.ozoneDB.collections.FullTreeSetImpl
Note that calling iterator()
results in the creation of
an ozone object and thus in a write-action for the db.
Field Summary |
Fields inherited from class org.ozoneDB.collections.BaseTreeSetImpl |
map |
Constructor Summary | |
FullTreeSetImpl()
Construct a new TreeSet whose backing TreeMap using the "natural" ordering of keys. |
|
FullTreeSetImpl(java.util.Collection collection)
Construct a new TreeSet whose backing TreeMap uses the "natural" orering of the keys and which contains all of the elements in the supplied Collection. |
|
FullTreeSetImpl(java.util.Comparator comparator)
Construct a new TreeSet whose backing TreeMap uses the supplied Comparator. |
|
FullTreeSetImpl(java.util.SortedMap backingMap,
DoNotUse_SeeJavadoc x)
DO NOT USE THIS CONSTRUCTOR YOURSELF, NOR USE EQUIVALENT CREATE METHOD FROM FACTORY. |
|
FullTreeSetImpl(java.util.SortedSet sortedSet)
Construct a new TreeSet, using the same key ordering as the supplied SortedSet and containing all of the elements in the supplied SortedSet. |
Method Summary | |
java.lang.Object |
clone()
Returns a shallow copy of this Set. |
java.util.SortedSet |
headSet(java.lang.Object to)
Returns a view of this Set including all elements less than to . |
protected java.util.SortedMap |
newBackingMap()
|
protected java.util.SortedMap |
newBackingMap(java.util.Comparator comparator)
|
java.util.SortedSet |
subSet(java.lang.Object from,
java.lang.Object to)
Returns a view of this Set including all elements greater or equal to from and less than to (a half-open interval).
|
java.util.SortedSet |
tailSet(java.lang.Object from)
Returns a view of this Set including all elements greater or equal to from . |
Methods inherited from class org.ozoneDB.collections.BaseTreeSetImpl |
_org_ozoneDB_internalIterator, add, addAll, clear, comparator, contains, first, getClientCollection, getClientSet, getClientSortedSet, getClientTreeSet, isEmpty, iterator, last, onCreate, ozoneHeadSet, ozoneSubSet, ozoneTailSet, remove, size, toString |
Methods inherited from class org.ozoneDB.collections.AbstractOzoneSet |
equals, hashCode, removeAll |
Methods inherited from class org.ozoneDB.collections.AbstractOzoneCollection |
containsAll, retainAll, toArray, toArray |
Methods inherited from class org.ozoneDB.OzoneObject |
container, database, deleteRecursive, getHandle, getObjectID, handle, onActivate, onDelete, onPassivate, requireWriteLocking, self, setContainer, toXML |
Methods inherited from class java.lang.Object |
finalize, getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface org.ozoneDB.collections.OzoneTreeSet |
getClientTreeSet |
Methods inherited from interface org.ozoneDB.collections.OzoneSortedSet |
getClientSortedSet, ozoneHeadSet, ozoneSubSet, ozoneTailSet |
Methods inherited from interface org.ozoneDB.collections.OzoneSet |
getClientSet |
Methods inherited from interface org.ozoneDB.collections.OzoneCollection |
_org_ozoneDB_internalIterator, add, addAll, clear, getClientCollection, remove, removeAll, retainAll |
Methods inherited from interface java.util.Collection |
contains, containsAll, equals, hashCode, isEmpty, iterator, size, toArray, toArray |
Methods inherited from interface org.ozoneDB.OzoneCompatibleOrProxy |
getObjectID |
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 java.util.SortedSet |
comparator, first, last |
Constructor Detail |
public FullTreeSetImpl()
Comparable
public FullTreeSetImpl(java.util.Comparator comparator)
comparator
- the Comparator this Set will usepublic FullTreeSetImpl(java.util.Collection collection)
collection
- the new Set will be initialized with all
of the elements in this Collection
java.lang.ClassCastException
- if the elements of the collection are not
comparable
java.lang.NullPointerException
- if the collection is nullComparable
public FullTreeSetImpl(java.util.SortedSet sortedSet)
sortedSet
- the new TreeSet will use this SortedSet's comparator
and will initialize itself with all its elements
java.lang.NullPointerException
- if sortedSet is nullpublic FullTreeSetImpl(java.util.SortedMap backingMap, DoNotUse_SeeJavadoc x)
DO NOT USE THIS CONSTRUCTOR YOURSELF, NOR USE EQUIVALENT CREATE METHOD FROM FACTORY.
This constructor is used to implement the subSet() calls around a backing TreeMap.SubMap.
backingMap
- the submapMethod Detail |
public java.lang.Object clone()
public java.util.SortedSet headSet(java.lang.Object to)
to
. The returned set is backed by the original, so changes
in one appear in the other. The subset will throw an
IllegalArgumentException
for any attempt to access or add an
element beyond the specified cutoff. The returned set does not include
the endpoint; if you want inclusion, pass the successor element.
headSet
in interface java.util.SortedSet
to
- the (exclusive) cutoff point
java.lang.ClassCastException
- if to
is not compatible with
the comparator (or is not Comparable, for natural ordering)
java.lang.NullPointerException
- if to is null, but the comparator does not
tolerate null elementspublic java.util.SortedSet subSet(java.lang.Object from, java.lang.Object to)
from
and less than to
(a half-open interval).
The returned set is backed by the original, so changes in one appear in
the other. The subset will throw an IllegalArgumentException
for any attempt to access or add an element beyond the specified cutoffs.
The returned set includes the low endpoint but not the high; if you want
to reverse this behavior on either end, pass in the successor element.
subSet
in interface java.util.SortedSet
from
- the (inclusive) low cutoff pointto
- the (exclusive) high cutoff point
java.lang.ClassCastException
- if either cutoff is not compatible with
the comparator (or is not Comparable, for natural ordering)
java.lang.NullPointerException
- if from or to is null, but the comparator
does not tolerate null elements
java.lang.IllegalArgumentException
- if from is greater than topublic java.util.SortedSet tailSet(java.lang.Object from)
from
. The returned set is backed by the original, so
changes in one appear in the other. The subset will throw an
IllegalArgumentException
for any attempt to access or add an
element beyond the specified cutoff. The returned set includes the
endpoint; if you want to exclude it, pass in the successor element.
tailSet
in interface java.util.SortedSet
from
- the (inclusive) low cutoff point
java.lang.ClassCastException
- if from
is not compatible with
the comparator (or is not Comparable, for natural ordering)
java.lang.NullPointerException
- if from is null, but the comparator
does not tolerate null elementsprotected java.util.SortedMap newBackingMap()
newBackingMap
in class BaseTreeSetImpl
protected java.util.SortedMap newBackingMap(java.util.Comparator comparator)
newBackingMap
in class BaseTreeSetImpl
|
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |