Collections

Vector, List, Queue, Stack... More...

Classes
class	List< T >
	Double linked list. More...
class	ListLockFree< T >
	Lock-free double linked list using atomic operations. More...
class	PriorityQueue< T >
	Priority Queue which is based on a List. The order of the elements is defined by a compare function which is provided in the constructor. If the function returns > 0 if v1 > v2, the data will be provided in increasing order. More...
class	Queue< T >
	FIFO Queue which is based on a List. More...
class	QueueFromVector< T >
	FIFO Queue which is based on a Vector. More...
class	QueueRTOS< T >
	FIFO Queue whch is based on the FreeRTOS queue API. The default allocator will allocate the memory from psram if available. More...
class	Slice< T >
	Helps to split up a big memory array into smaller slices. There are no additinal heap allocations! Example: if we have an array with 9 entries (1,2,3,4,5,6,7,8,9): slices(5) gives 2. slice(5,0) returns size 5 with 1,2,3,4,5 and slice(5,1) returns size 4 with 6,7,8,9! More...
class	Stack< T >
	LIFO Stack which is based on a List. More...
class	SynchronizedQueue< T, TMutex >
	FIFO Queue which is based on a List that is thread save. More...
class	Vector< T >
	Vector implementation which provides the most important methods as defined by std::vector. This class it is quite handy to have and most of the times quite better then dealing with raw c arrays. More...

Detailed Description

Vector, List, Queue, Stack...