SC::IntrusiveDoubleLinkedList< T > Struct Template Reference

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

Detailed Description

template<typename T>
struct SC::IntrusiveDoubleLinkedList< T >

An Intrusive Double Linked List.

Template Parameters

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.

    struct Node
    {
        Node* next = nullptr; // <-- Required by IntrusiveDoubleLinkedList
        Node* prev = nullptr; // <-- Required by IntrusiveDoubleLinkedList
        int   data = 0;
    };
    IntrusiveDoubleLinkedList<Node> queue;
 
    Node items[2];
    items[0].data = 0;
    items[1].data = 1;
    SC_TRY(queue.isEmpty());
 
    queue.queueBack(items[0]);
    queue.queueBack(items[1]);
 
    SC_TRY(not queue.isEmpty());
    Node* first = queue.dequeueFront();
    SC_TRY(first->data == 0);
    SC_TRY(not queue.isEmpty());
 
    Node* second = queue.dequeueFront();
    SC_TRY(second->data == 1);
    SC_TRY(queue.isEmpty());

---

The documentation for this struct was generated from the following file:

• IntrusiveDoubleLinkedList.h