An Intrusive Double Linked List. More...
#include <IntrusiveDoubleLinkedList.h>
Public Member Functions | |
T * | peekFront () const |
bool | isEmpty () const |
void | clear () |
void | appendBack (IntrusiveDoubleLinkedList &other) |
void | queueBack (T &item) |
T * | dequeueFront () |
void | remove (T &item) |
Public Attributes | |
T * | back = nullptr |
T * | front = nullptr |
An Intrusive Double Linked List.
T | The Type being linked. It must declare two pointers to itself named next and prev . |
This is an useful data structure when we want to delegate the allocation strategy to caller.
Both Async and Process use this data structure to store requests.