Version 1.20120609 of libx1f4l2
Release Notes: This release introduces a new critical bit tree variety. The new tree caches a small number of critical bit-adjacent bits to eliminate the final string comparison. Several bugs have been fixed across the featured data structures, and new methods have been introduced. The license is now GPLv3.
Other releases
Release Notes: Data swapping utilities for some of the featured data structures were added.
Release Notes: A bug in the deletion algorithm of the previously-introduced radix tree associative array was fixed.
Release Notes: A new radix tree associative array breed is introduced. The array maps pointer for string keys. It organizes its dense nodes as lookup tables and the sparse nodes as sorted compact tables. The new structure generally performs better than similar structures that keep all nodes organized as sorted tables, except for deletion.
Release Notes: Several bugs in the last introduced radix tree based associate array were fixed.
Release Notes: The interface for the B-tree-based sequences has been expanded, as has one of the string key associative arrays. The performance of the previously-introduced B-tree-based string key associative array has been improved, and a new string key and variable size data array of similar traits has been introduced. The new associative array is radix tree-based. More profiling and tests have been added.
