| Modifier and Type | Class and Description |
|---|---|
static interface |
LIFO.Criterium |
| Constructor and Description |
|---|
LIFO() |
| Modifier and Type | Method and Description |
|---|---|
void |
clear() |
boolean |
contains(T element) |
com.googlecode.n_orm.cache.perthread.LIFO.Node<T> |
findWithCriterium(LIFO.Criterium c,
Object... args) |
com.googlecode.n_orm.cache.perthread.LIFO.Node<T> |
getFirstElement() |
Iterator<T> |
iterator()
An iterator starting from the tail of the LIFO.
|
T |
pop() |
void |
push(T element) |
void |
pushAll(LIFO<T> available) |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitforEach, spliteratorpublic T pop()
public void push(T element)
public Iterator<T> iterator()
Iterator.remove().
The iterator should be used by only one thread.
Won't throw ConcurrentModificationException even if LIFO is modified (for instance by calling push(Object), Iterator.remove()}.
However, it can iterate over popped or removed elements...public void clear()
public com.googlecode.n_orm.cache.perthread.LIFO.Node<T> findWithCriterium(LIFO.Criterium c, Object... args)
public com.googlecode.n_orm.cache.perthread.LIFO.Node<T> getFirstElement()
public boolean contains(T element)
Copyright © 2016. All Rights Reserved.