STXXL
1.4.0
|
An internal fifo queue that allows removing elements addressed with (a copy of) themselves.
KeyType | Type of contained elements. |
Definition at line 27 of file addressable_queues.h.
Public Types | |
typedef meta_iter_t | handle |
Type of handle to an entry. For use with insert and remove. More... | |
Public Member Functions | |
addressable_fifo_queue () | |
Create an empty queue. More... | |
~addressable_fifo_queue () | |
bool | empty () const |
Check if queue is empty. More... | |
bool | erase (const KeyType &e) |
Erase element from the queue. More... | |
void | erase (handle i) |
Erase element from the queue. More... | |
std::pair< handle, bool > | insert (const KeyType &e) |
Insert new element. If the element is already in, it is moved to the back. More... | |
KeyType | pop () |
Remove top element from the queue. More... | |
const KeyType & | top () const |
Access top element in the queue. More... | |
Private Types | |
typedef container_t::iterator | container_iter_t |
typedef std::list< KeyType > | container_t |
typedef meta_t::iterator | meta_iter_t |
typedef std::map< KeyType, container_iter_t > | meta_t |
Private Attributes | |
meta_t | meta |
container_t | vals |
|
private |
Definition at line 30 of file addressable_queues.h.
|
private |
Definition at line 29 of file addressable_queues.h.
typedef meta_iter_t stxxl::addressable_fifo_queue< KeyType >::handle |
Type of handle to an entry. For use with insert and remove.
Definition at line 39 of file addressable_queues.h.
|
private |
Definition at line 32 of file addressable_queues.h.
|
private |
Definition at line 31 of file addressable_queues.h.
|
inline |
Create an empty queue.
Definition at line 42 of file addressable_queues.h.
|
inline |
Definition at line 43 of file addressable_queues.h.
|
inline |
Check if queue is empty.
Definition at line 47 of file addressable_queues.h.
|
inline |
Erase element from the queue.
e | Element to remove. |
Definition at line 69 of file addressable_queues.h.
|
inline |
Erase element from the queue.
i | Iterator to element to remove. |
Definition at line 81 of file addressable_queues.h.
|
inline |
Insert new element. If the element is already in, it is moved to the back.
e | Element to insert. |
Definition at line 53 of file addressable_queues.h.
|
inline |
Remove top element from the queue.
Definition at line 94 of file addressable_queues.h.
|
inline |
Access top element in the queue.
Definition at line 89 of file addressable_queues.h.
|
private |
Definition at line 35 of file addressable_queues.h.
|
private |
Definition at line 34 of file addressable_queues.h.