E
- @StoreNotUseStandardSerialization @StorableClass public abstract class AbstractPTreeSet<E> extends AbstractPSet<E> implements IPNavigableTreeSet<E>, NavigableSet<E>, Cloneable, Serializable
Modifier and Type | Field and Description |
---|---|
protected IInstanceFactory |
instanceFactory |
protected TreeSupport<E> |
treeSupport
the tree list support used by this set
can be its own instance or a instance of on other set to be a view of this other set |
Modifier | Constructor and Description |
---|---|
protected |
AbstractPTreeSet(IInstanceFactory instanceFactory) |
protected |
AbstractPTreeSet(IInstanceFactory instanceFactory,
boolean concurrentAccess) |
|
AbstractPTreeSet(IInstanceFactory instanceFactory,
Collection<? extends E> collection) |
|
AbstractPTreeSet(IInstanceFactory instanceFactory,
Collection<? extends E> collection,
boolean concurrentAccess) |
|
AbstractPTreeSet(IInstanceFactory instanceFactory,
Collection<? extends E> collection,
Comparator<E> comparator) |
|
AbstractPTreeSet(IInstanceFactory instanceFactory,
Collection<? extends E> collection,
Comparator<E> comparator,
boolean concurrentAccess) |
|
AbstractPTreeSet(IInstanceFactory instanceFactory,
Comparator<E> comparator) |
|
AbstractPTreeSet(IInstanceFactory instanceFactory,
Comparator<E> comparator,
boolean concurrentAccess) |
|
AbstractPTreeSet(IInstanceFactory instanceFactory,
SortedSet<E> sortedSet) |
|
AbstractPTreeSet(IInstanceFactory instanceFactory,
SortedSet<E> sortedSet,
boolean concurrentAccess) |
|
AbstractPTreeSet(TreeSupport<E> treeSupport)
this set is a view of set that use
treeSupport so changes to this set are reflected in the set using the treeSupport , and vice-versa. |
Modifier and Type | Method and Description |
---|---|
boolean |
add(E element) |
E |
addOrReplace(E element) |
E |
ceiling(E element) |
void |
clear() |
AbstractPTreeSet<E> |
clone() |
Comparator<? super E> |
comparator() |
boolean |
contains(Object object) |
Iterator<E> |
descendingIterator() |
ListIterator<E> |
descendingListIterator() |
NavigableSet<E> |
descendingSet() |
E |
first() |
E |
floor(E element) |
E |
get(Object object)
get the real instance of object equals to reference object
|
Comparator<? super E> |
getComparator() |
RedBlackTree<E> |
getTree() |
TreeSupport<E> |
getTreeSupport() |
SortedSet<E> |
headSet(E toElement) |
NavigableSet<E> |
headSet(E toElement,
boolean inclusive) |
E |
higher(E element) |
boolean |
isEmpty() |
Iterator<E> |
iterator() |
E |
last() |
ListIterator<E> |
listIterator() |
ListIterator<E> |
listIterator(int index) |
E |
lower(E element) |
E |
pollFirst() |
E |
pollLast() |
boolean |
remove(Object object) |
E |
removeAndGetRemoved(Object object) |
void |
setTreeSupport(TreeSupport<E> treeSupport) |
int |
size() |
NavigableSet<E> |
subSet(E fromElement,
boolean fromInclusive,
E toElement,
boolean toInclusive) |
SortedSet<E> |
subSet(E fromElement,
E toElement) |
SortedSet<E> |
tailSet(E fromElement) |
NavigableSet<E> |
tailSet(E fromElement,
boolean inclusive) |
equals, hashCode, removeAll
addAll, containsAll, retainAll, toArray, toArray, toString
finalize, getClass, notify, notifyAll, wait, wait, wait
notifyAdded, notifyRemoved
addListerner, removeListener
protected TreeSupport<E> treeSupport
protected final transient IInstanceFactory instanceFactory
protected AbstractPTreeSet(IInstanceFactory instanceFactory)
protected AbstractPTreeSet(IInstanceFactory instanceFactory, boolean concurrentAccess)
public AbstractPTreeSet(TreeSupport<E> treeSupport)
treeSupport
treeSupport
, and vice-versa.treeSupport
- tree list support this set use, set treeSupport
public AbstractPTreeSet(IInstanceFactory instanceFactory, Comparator<E> comparator)
public AbstractPTreeSet(IInstanceFactory instanceFactory, Comparator<E> comparator, boolean concurrentAccess)
public AbstractPTreeSet(IInstanceFactory instanceFactory, Collection<? extends E> collection)
public AbstractPTreeSet(IInstanceFactory instanceFactory, Collection<? extends E> collection, boolean concurrentAccess)
public AbstractPTreeSet(IInstanceFactory instanceFactory, Collection<? extends E> collection, Comparator<E> comparator)
public AbstractPTreeSet(IInstanceFactory instanceFactory, Collection<? extends E> collection, Comparator<E> comparator, boolean concurrentAccess)
public AbstractPTreeSet(IInstanceFactory instanceFactory, SortedSet<E> sortedSet)
public AbstractPTreeSet(IInstanceFactory instanceFactory, SortedSet<E> sortedSet, boolean concurrentAccess)
public ListIterator<E> listIterator()
listIterator
in interface IPTreeSet<E>
public ListIterator<E> listIterator(int index)
listIterator
in interface IPTreeSet<E>
public Iterator<E> descendingIterator()
descendingIterator
in interface NavigableSet<E>
public ListIterator<E> descendingListIterator()
descendingListIterator
in interface IPTreeSet<E>
public int size()
public boolean isEmpty()
isEmpty
in interface Collection<E>
isEmpty
in interface Set<E>
isEmpty
in class PAbstractCollection<E>
public boolean contains(Object object)
contains
in interface Collection<E>
contains
in interface Set<E>
contains
in class PAbstractCollection<E>
public E get(Object object)
IPSet
public boolean remove(Object object)
remove
in interface Collection<E>
remove
in interface Set<E>
remove
in class PAbstractCollection<E>
public E removeAndGetRemoved(Object object)
removeAndGetRemoved
in interface IPTreeSet<E>
public boolean add(E element)
public E addOrReplace(E element)
addOrReplace
in interface IPTreeSet<E>
public void clear()
clear
in interface Collection<E>
clear
in interface Set<E>
clear
in class PAbstractCollection<E>
public NavigableSet<E> descendingSet()
descendingSet
in interface NavigableSet<E>
public NavigableSet<E> subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive)
subSet
in interface NavigableSet<E>
public NavigableSet<E> tailSet(E fromElement, boolean inclusive)
tailSet
in interface NavigableSet<E>
public NavigableSet<E> headSet(E toElement, boolean inclusive)
headSet
in interface NavigableSet<E>
public Comparator<? super E> comparator()
comparator
in interface SortedSet<E>
public E lower(E element)
lower
in interface NavigableSet<E>
public E floor(E element)
floor
in interface NavigableSet<E>
public E higher(E element)
higher
in interface NavigableSet<E>
public E ceiling(E element)
ceiling
in interface NavigableSet<E>
public E pollFirst()
pollFirst
in interface NavigableSet<E>
public E pollLast()
pollLast
in interface NavigableSet<E>
public Comparator<? super E> getComparator()
getComparator
in interface IPTreeSet<E>
public void setTreeSupport(TreeSupport<E> treeSupport)
@Fortest public TreeSupport<E> getTreeSupport()
public AbstractPTreeSet<E> clone()
clone
in interface IPNavigableTreeSet<E>
clone
in class Object
@Fortest public RedBlackTree<E> getTree()
Copyright © 2007-2012 Luc Peuvrier. All Rights Reserved.