Buffers

Dynamic arrays, memory management, and container utilities. More...

Collaboration diagram for Buffers:

Classes
class	BinaryHeap< t_comp_type, t_value_type, t_is_min >
	A heap data structure that takes the form of a binary tree which is a common way of implementing priority queues. More...
class	BitAlignedBuffer
	A buffer that stores elements using a configurable number of bits per element. More...
class	Buffer< t_type, t_memory_manager >
	The equivelent of std::vector but with a bit more control. More...
class	BufferAllocator< t_type, t_aligned_size, t_is_primitive, t_index_type, t_null_term, t_allow_reference >
	Specific logic for reserving memory for a Buffer. More...
class	BufferFunctions
	A dummy class to include complex Buffer insert and sort functions Functions that enhance the functionality of the Buffer class. More...
class	Dictionary< t_key, t_value, t_hash >
	A hash-based key-value store, useful for quick associative lookups. More...
class	IndexMatchQueue< t_a, t_b, t_index >
	A queue-based index matcher that pairs elements from two asynchronous streams by their index. More...
struct	IndexMatchQueue< t_a, t_b, t_index >::NodeA
	Internal node storing an A-stream element and its associated index. More...
struct	IndexMatchQueue< t_a, t_b, t_index >::NodeB
	Internal node storing a B-stream element and its associated index. More...
class	Set< t_value >
	Container that stores unique elements in no particular order, and which allow for fast retrieval or insertion of individual elements based on their value. More...

Detailed Description

Dynamic arrays, memory management, and container utilities.

The core Buffer template and related containers including dictionaries, sets, bit-packed buffers, binary heaps, and the underlying memory allocator system.