E - @StoreNotUseStandardSerialization @StorableClass public class PLinkedTreeSet<E> extends AbstractPLinkedTreeSet<E> implements List<E>, Deque<E>, Cloneable, Serializable
LinkedHashSet when element are
comparable pour file persistenceinstanceFactory, linkedTreeSupport| Modifier | Constructor and Description |
|---|---|
|
PLinkedTreeSet() |
|
PLinkedTreeSet(Collection<? extends E> collection) |
|
PLinkedTreeSet(Collection<? extends E> collection,
Comparator<E> comparator) |
|
PLinkedTreeSet(Comparator<E> comparator) |
protected |
PLinkedTreeSet(IInstanceFactory instanceFactory) |
protected |
PLinkedTreeSet(IInstanceFactory instanceFactory,
Collection<? extends E> collection) |
protected |
PLinkedTreeSet(IInstanceFactory instanceFactory,
Collection<? extends E> collection,
Comparator<E> comparator) |
protected |
PLinkedTreeSet(IInstanceFactory instanceFactory,
Comparator<E> comparator) |
protected |
PLinkedTreeSet(IInstanceFactory instanceFactory,
SortedSet<E> sortedSet) |
|
PLinkedTreeSet(SortedSet<E> sortedSet) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
addAll(int index,
Collection<? extends E> collection) |
void |
addFirst(E element) |
void |
addLast(E element) |
void |
addListerner(ICollectionListener<E> listener) |
E |
addOrReplaceToEnd(E element)
add or replace an element, element is added or moved to end
|
PLinkedTreeSet<E> |
clone() |
E |
element() |
E |
get(int index) |
E |
getFirst() |
E |
getLast() |
int |
indexOf(Object object) |
int |
lastIndexOf(Object object) |
boolean |
moveDown(E element) |
boolean |
moveToFirstPosition(E element)
move element at begin of the list
|
boolean |
moveToLastPosition(E element)
move element at end of the list
|
static PLinkedTreeSet |
newInstance(IInstanceFactory instanceFactory) |
static PLinkedTreeSet |
newInstance(IInstanceFactory instanceFactory,
Collection collection) |
static PLinkedTreeSet |
newInstance(IInstanceFactory instanceFactory,
Collection collection,
Comparator comparator) |
static PLinkedTreeSet |
newInstance(IInstanceFactory instanceFactory,
Comparator comparator) |
static PLinkedTreeSet |
newInstance(IInstanceFactory instanceFactory,
SortedSet sortedSet) |
void |
notifyAdded(E added) |
void |
notifyRemoved(E removed) |
boolean |
offer(E element) |
boolean |
offerFirst(E element) |
boolean |
offerLast(E element) |
E |
peek() |
E |
peekFirst() |
E |
peekLast() |
E |
poll() |
E |
pollFirst() |
E |
pollLast() |
E |
pop() |
void |
push(E element) |
E |
remove() |
E |
remove(int index) |
boolean |
remove(Object object) |
E |
removeAndGetRemoved(Object object) |
E |
removeFirst() |
boolean |
removeFirstOccurrence(Object object) |
E |
removeGetRemoved(Object object)
remove an element and return it
|
E |
removeLast() |
boolean |
removeLastOccurrence(Object object) |
void |
removeListener(int listenerIdentifier) |
E |
set(int index,
E element) |
List<E> |
subList(int fromIndex,
int toIndex) |
add, add, addOrReplace, ceiling, clear, comparator, contains, descendingIterator, descendingListIterator, first, floor, get, getComparator, getTree, higher, isEmpty, iterator, last, listIterator, listIterator, lower, removeGreater, removeSmaller, setLinkedTreeSupport, sizeequals, hashCode, removeAlladdAll, containsAll, retainAll, toArray, toArray, toStringfinalize, getClass, notify, notifyAll, wait, wait, waitpublic PLinkedTreeSet()
protected PLinkedTreeSet(IInstanceFactory instanceFactory)
public PLinkedTreeSet(Comparator<E> comparator)
protected PLinkedTreeSet(IInstanceFactory instanceFactory, Comparator<E> comparator)
public PLinkedTreeSet(Collection<? extends E> collection, Comparator<E> comparator)
protected PLinkedTreeSet(IInstanceFactory instanceFactory, Collection<? extends E> collection, Comparator<E> comparator)
public PLinkedTreeSet(Collection<? extends E> collection)
protected PLinkedTreeSet(IInstanceFactory instanceFactory, Collection<? extends E> collection)
protected PLinkedTreeSet(IInstanceFactory instanceFactory, SortedSet<E> sortedSet)
public static PLinkedTreeSet newInstance(IInstanceFactory instanceFactory)
public static PLinkedTreeSet newInstance(IInstanceFactory instanceFactory, Comparator comparator)
public static PLinkedTreeSet newInstance(IInstanceFactory instanceFactory, Collection collection, Comparator comparator)
public static PLinkedTreeSet newInstance(IInstanceFactory instanceFactory, Collection collection)
public static PLinkedTreeSet newInstance(IInstanceFactory instanceFactory, SortedSet sortedSet)
public void addListerner(ICollectionListener<E> listener)
addListerner in interface ICollectionListenable<E>public void removeListener(int listenerIdentifier)
removeListener in interface ICollectionListenable<E>public void notifyAdded(E added)
notifyAdded in interface ISupportListener<E>public void notifyRemoved(E removed)
notifyRemoved in interface ISupportListener<E>public E addOrReplaceToEnd(E element)
element - the element to add or use for replacementpublic boolean remove(Object object)
public E removeAndGetRemoved(Object object)
removeAndGetRemoved in interface IPTreeSet<E>removeAndGetRemoved in class AbstractPLinkedTreeSet<E>public E removeGetRemoved(Object object)
object - the reference for searchpublic E removeFirst()
removeFirst in interface Deque<E>public E remove()
public boolean offer(E element)
public boolean offerFirst(E element)
offerFirst in interface Deque<E>public E element()
public E peek()
public E poll()
public E removeLast()
removeLast in interface Deque<E>public boolean removeFirstOccurrence(Object object)
removeFirstOccurrence in interface Deque<E>public boolean removeLastOccurrence(Object object)
removeLastOccurrence in interface Deque<E>public boolean moveToLastPosition(E element)
element - public boolean moveDown(E element)
element - public boolean moveToFirstPosition(E element)
element - public boolean addAll(int index,
Collection<? extends E> collection)
public int lastIndexOf(Object object)
lastIndexOf in interface List<E>public PLinkedTreeSet<E> clone()
clone in class AbstractPLinkedTreeSet<E>Copyright © 2007-2012 Luc Peuvrier. All Rights Reserved.