E
- @StoreNotUseStandardSerialization @StorableClass public class PLinkedHashSet<E> extends AbstractPSet<E> implements Set<E>, Deque<E>, List<E>, Cloneable, Serializable
LinkedHashSet
pour file persistenceModifier | Constructor and Description |
---|---|
|
PLinkedHashSet() |
|
PLinkedHashSet(IEqualsHashComparator comparator) |
protected |
PLinkedHashSet(IInstanceFactory instanceFactory) |
protected |
PLinkedHashSet(IInstanceFactory instanceFactory,
IEqualsHashComparator comparator) |
Modifier and Type | Method and Description |
---|---|
boolean |
add(E element)
return false if already contains same value object
|
void |
add(int index,
E element) |
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
|
void |
clear() |
protected PLinkedHashSet<E> |
clone() |
boolean |
contains(Object object) |
Iterator<E> |
descendingIterator() |
E |
element() |
E |
get(int index) |
E |
get(Object object)
get the real instance of object equals to reference object
|
E |
getFirst() |
E |
getLast() |
LinkedHashSupport<E> |
getLinkedHashSupport() |
int |
hashCode() |
int |
indexOf(Object object) |
Iterator<E> |
iterator() |
int |
lastIndexOf(Object object) |
ListIterator<E> |
listIterator() |
ListIterator<E> |
listIterator(int index) |
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 PLinkedHashSet |
newInstance(IInstanceFactory instanceFactory) |
static PLinkedHashSet |
newInstance(IInstanceFactory instanceFactory,
IEqualsHashComparator comparator) |
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 |
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) |
void |
setLinkedHashSupport(LinkedHashSupport<E> linkedHashSupport) |
int |
size() |
List<E> |
subList(int fromIndex,
int toIndex) |
equals, removeAll
addAll, containsAll, isEmpty, retainAll, toArray, toArray, toString
finalize, getClass, notify, notifyAll, wait, wait, wait
public PLinkedHashSet()
protected PLinkedHashSet(IInstanceFactory instanceFactory)
public PLinkedHashSet(IEqualsHashComparator comparator)
protected PLinkedHashSet(IInstanceFactory instanceFactory, IEqualsHashComparator comparator)
public static PLinkedHashSet newInstance(IInstanceFactory instanceFactory)
public static PLinkedHashSet newInstance(IInstanceFactory instanceFactory, IEqualsHashComparator comparator)
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 ListIterator<E> listIterator()
listIterator
in interface List<E>
public ListIterator<E> listIterator(int index)
listIterator
in interface List<E>
public int size()
public boolean contains(Object object)
public E get(Object object)
IPSet
public boolean add(E element)
public E addOrReplaceToEnd(E element)
element
- the element to add or use for replacemnentpublic boolean remove(Object object)
public E removeGetRemoved(Object object)
object
- the reference for searchpublic E removeLast()
removeLast
in interface Deque<E>
public E removeFirst()
removeFirst
in interface Deque<E>
public void clear()
protected PLinkedHashSet<E> clone()
public boolean moveToLastPosition(E element)
element
- public boolean moveDown(E element)
element
- public boolean moveToFirstPosition(E element)
element
- public void setLinkedHashSupport(LinkedHashSupport<E> linkedHashSupport)
public LinkedHashSupport<E> getLinkedHashSupport()
public int hashCode()
public boolean addAll(int index, Collection<? extends E> collection)
public int lastIndexOf(Object object)
lastIndexOf
in interface List<E>
public Iterator<E> descendingIterator()
descendingIterator
in interface Deque<E>
public E element()
public boolean offer(E element)
public boolean offerFirst(E element)
offerFirst
in interface Deque<E>
public E peek()
public E poll()
public E remove()
public boolean removeFirstOccurrence(Object object)
removeFirstOccurrence
in interface Deque<E>
public boolean removeLastOccurrence(Object object)
removeLastOccurrence
in interface Deque<E>
Copyright © 2007-2012 Luc Peuvrier. All Rights Reserved.