UnorderedStack< ElementType, SIZE, LockType > Class Template Reference

A container that has a unsorted but packed list of elements. More...

Public Member Functions
void	insert (const ElementType &elementTypeToInsert)
	Inserts an element at the end of the unordered stack. More...
void	remove (const ElementType &elementTypeToRemove)
	Removes the given element and puts the last element into its slot. More...
	UnorderedStack () noexcept
	Creates an unordered stack. More...

Detailed Description

template<typename ElementType, int SIZE = UNORDERED_STACK_SIZE, typename LockType = DummyCriticalSection>
class hise::UnorderedStack< ElementType, SIZE, LockType >

A container that has a unsorted but packed list of elements.

Features:

• no allocation (uses a fixed size)
• O(1) insertion (just adds it at the end)
• O(n) deletion (it will put the last element in the "hole")
• O(1) size
• fast iteration (unlike unlinked lists)
• cache line friendly (the data is aligned)

Constructor & Destructor Documentation

UnorderedStack ( )

inlinenoexcept

Creates an unordered stack.

Member Function Documentation

void insert ( const ElementType &  elementTypeToInsert )

inline

Inserts an element at the end of the unordered stack.

void remove ( const ElementType &  elementTypeToRemove )

inline

Removes the given element and puts the last element into its slot.