Lock-free linked list data structure. More...
#include <mitsuba/core/octree.h>
Classes | |
struct | ListItem |
Public Member Functions | |
LockFreeList () | |
~LockFreeList () | |
const ListItem * | head () const |
void | append (const T &value) |
Lock-free linked list data structure.
This class provides a very basic linked list data structure whose primary purpose it is to efficiently service append operations from multiple parallel threads. These are internally realized via atomic compare and exchange operations, meaning that no lock must be acquired.
|
inline |
|
inline |
|
inline |
|
inline |