This class describes a dynamic size data structure for thread safe computation. It is a linked list of arrays that also stores the current number of elements. Its key feature is that the addition of an element will never cause the moving of the data structure in memory, unlike an std::vector, making the access to an element thread safe even if another thread is adding elements. More...

#include <ArrayLinkedList.h>

Public Member Functions
	ArrayLinkedList ()

datatype *	addArrayElement (datatype element)

Public Attributes
std::list< std::array< datatype, size > >	list_

int	numberOfElements_

std::array< unsigned char, 32 >	padding_ {}

Detailed Description

template<typename datatype, int size>
class ttk::ArrayLinkedList< datatype, size >

This class describes a dynamic size data structure for thread safe computation. It is a linked list of arrays that also stores the current number of elements. Its key feature is that the addition of an element will never cause the moving of the data structure in memory, unlike an std::vector, making the access to an element thread safe even if another thread is adding elements.

Author: Eve Le Guillou eve.l.nosp@m.e-gu.nosp@m.illou.nosp@m.@lip.nosp@m.6.fr

Date: Mars 2022.

See also: IntegralLines.h for a usage example.

Definition at line 21 of file ArrayLinkedList.h.