containers Directory Reference

Files
file	array.h [code]
	This files contains an implementation of a static-sized (but dynamically allocated) array.
file	darray.h [code]
	This files contains an implementation of a dynamic array.
file	freelist.h [code]
	This file contains a free list, used for custom memory allocation tracking.
file	hashtable.h [code]
	This file contains the hashtable implementation.
file	queue.h [code]
	A simple queue container. Elements are popped off the queue in the same order they were pushed to it.
file	registry.h [code]
	A registry holds arbitrarily-sized blocks of memory that are referenced by handle. These blocks are stored along with their size in the registry, and the registry owns its own copy of the data (if a block is probided, it takes a copy in the add and set functions). Entries can opt-in to being auto-released when thier internal reference counter reaches 0. Callers can also register callbacks when acquiring references to registry blocks to be informed of any updates to said block when it occurs (via the block_set function) by passing a callback during acquisition.
file	ring_queue.h [code]
file	stack.h [code]
	A simple stack container. Elements may be pushed on or popped off of the stack only.
file	stackarray.h [code]
	This files contains an implementation of a static-sized stack-allocated array.
file	u64_bst.h [code]