E - @StoreNotUseStandardSerialization @StorableClass public abstract class AbstractPLinkedTreeSet<E> extends AbstractPSet<E> implements IPTreeSet<E>, Cloneable, Serializable
| Modifier and Type | Field and Description |
|---|---|
protected IInstanceFactory |
instanceFactory |
protected LinkedTreeSupport<E> |
linkedTreeSupport
the linked tree set 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 |
AbstractPLinkedTreeSet(IInstanceFactory instanceFactory) |
protected |
AbstractPLinkedTreeSet(IInstanceFactory instanceFactory,
boolean concurrentAccess) |
protected |
AbstractPLinkedTreeSet(IInstanceFactory instanceFactory,
Collection<? extends E> collection) |
protected |
AbstractPLinkedTreeSet(IInstanceFactory instanceFactory,
Collection<? extends E> collection,
boolean concurrentAccess) |
protected |
AbstractPLinkedTreeSet(IInstanceFactory instanceFactory,
Collection<? extends E> collection,
Comparator<E> comparator) |
protected |
AbstractPLinkedTreeSet(IInstanceFactory instanceFactory,
Collection<? extends E> collection,
Comparator<E> comparator,
boolean concurrentAccess) |
protected |
AbstractPLinkedTreeSet(IInstanceFactory instanceFactory,
Comparator<E> comparator) |
protected |
AbstractPLinkedTreeSet(IInstanceFactory instanceFactory,
Comparator<E> comparator,
boolean concurrentAccess) |
protected |
AbstractPLinkedTreeSet(IInstanceFactory instanceFactory,
SortedSet<E> sortedSet) |
protected |
AbstractPLinkedTreeSet(IInstanceFactory instanceFactory,
SortedSet<E> sortedSet,
boolean concurrentAccess) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(E element) |
void |
add(int index,
E element)
return false if already contains same value object
|
E |
addOrReplace(E element) |
E |
ceiling(E element) |
void |
clear() |
AbstractPLinkedTreeSet<E> |
clone() |
Comparator<? super E> |
comparator() |
boolean |
contains(Object object) |
Iterator<E> |
descendingIterator() |
ListIterator<E> |
descendingListIterator() |
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<ILinkedListSupportNode<E>> |
getTree() |
E |
higher(E element) |
boolean |
isEmpty() |
Iterator<E> |
iterator() |
E |
last() |
ListIterator<E> |
listIterator() |
ListIterator<E> |
listIterator(int index) |
E |
lower(E element) |
boolean |
remove(Object object) |
E |
removeAndGetRemoved(Object object) |
E |
removeGreater() |
E |
removeSmaller() |
void |
setLinkedTreeSupport(LinkedTreeSupport<E> linkedTreeSupport) |
int |
size() |
equals, hashCode, removeAlladdAll, containsAll, retainAll, toArray, toArray, toStringfinalize, getClass, notify, notifyAll, wait, wait, waitnotifyAdded, notifyRemovedaddListerner, removeListenerprotected LinkedTreeSupport<E> linkedTreeSupport
protected final transient IInstanceFactory instanceFactory
protected AbstractPLinkedTreeSet(IInstanceFactory instanceFactory)
protected AbstractPLinkedTreeSet(IInstanceFactory instanceFactory, boolean concurrentAccess)
protected AbstractPLinkedTreeSet(IInstanceFactory instanceFactory, Comparator<E> comparator)
protected AbstractPLinkedTreeSet(IInstanceFactory instanceFactory, Comparator<E> comparator, boolean concurrentAccess)
protected AbstractPLinkedTreeSet(IInstanceFactory instanceFactory, Collection<? extends E> collection)
protected AbstractPLinkedTreeSet(IInstanceFactory instanceFactory, Collection<? extends E> collection, boolean concurrentAccess)
protected AbstractPLinkedTreeSet(IInstanceFactory instanceFactory, Collection<? extends E> collection, Comparator<E> comparator)
protected AbstractPLinkedTreeSet(IInstanceFactory instanceFactory, Collection<? extends E> collection, Comparator<E> comparator, boolean concurrentAccess)
protected AbstractPLinkedTreeSet(IInstanceFactory instanceFactory, SortedSet<E> sortedSet)
protected AbstractPLinkedTreeSet(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 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)
IPSetpublic 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 add(int index,
E element)
public void clear()
clear in interface Collection<E>clear in interface Set<E>clear in class PAbstractCollection<E>public Comparator<? super E> comparator()
public E removeSmaller()
public E removeGreater()
public E first()
public E last()
public Comparator<? super E> getComparator()
getComparator in interface IPTreeSet<E>public AbstractPLinkedTreeSet<E> clone()
public void setLinkedTreeSupport(LinkedTreeSupport<E> linkedTreeSupport)
@Fortest public RedBlackTree<ILinkedListSupportNode<E>> getTree()
Copyright © 2007-2012 Luc Peuvrier. All Rights Reserved.