Release Notes:

• Change child replacement for cut child operation of priority queue to preserve runtime bounds.

Release Notes:

• All trees based containers now have linear time and constant space clear and clear_and_free functions. The array based containers have constant time and space deletion if no destructor callback is provided.

Release Notes:

• Bug fix in intrusive priority queue increase and decrease operations.

Release Notes:

• Drop size() for all container functions that count elements stored by the container (replace with count()).

Release Notes:

• New test suite added for ccc_buffer.
• Buffer insert and erase minor bug fixes.
• Added _as helper macros to buffer to cast returned void * to the user specified and stored type.

Release Notes:

• Remove ccc_ordered_multimap from ccc.

Release Notes:

• Simplify lazy initialization path and logic checks for flat hash map.

Release Notes:

• Flat Hash Map now iterates in steps of the group size on a given platform. This means much faster iteration for sparser hash maps as empty groups are skipped in one step.

Release Notes:

• Add new sample program that illustrates file compression algorithms, starting with Huffman Encoding. These use bit sets and buffers extensively.
• Add reserve interface to buffer.
• Add clear and clear and free interface to buffer.
• All initializers specify type for buffer or array backed containers.
• Memory pointer is set to NULL on all flat and handle data structures after freeing.

Release Notes:

• Internal bitset branching simplified when fixing end block