Release Notes: This release applies accumulated patches and ideas: changing find_lower() to not use binary search for small node sizes, implementing bulk_load() to construct a B+ tree from a pre-sorted iterator range, replacing copy loops with std::copy calls, and changing the template header source code license to Boost Software License. Overall, these modifications yield a notable performance boost.
Release Notes: A missing STL function, erase(iterator iter), was implemented. Support was added for STL allocators as template parameters. A bug when shifting pairs from left to right leaf nodes during deletion was fixed. Speed tests were run again on up-to-date hardware.
Release Notes: All issues with root node pointer == NULL have been fixed. A crash when attempting to copy-construct an empty btree or when trying to remove a nonexistent item from an empty btree has been fixed. A crash when running verify() on an empty btree object has been fixed. Now the root node is freed when the last item is removed.
Release Notes: All issues with reverse_iterators not working properly and one harmless bad-memory access were fixed.
Release Notes: This release fixed a possibly illegal memory access during a find() or derived lookup call, if the queried key is larger than any item contained in the tree.
Release Notes: This release introduces the demonstration program wxBTreeDemo. This program draws illustrations of the B+ trees constructed by the STX B+ Tree template classes. It allows the user to select different types of B+ tree instantiations: integer or string keys and different slot numbers. The user may insert and erase key/data pairs from the tree and run different search operations. The demo program uses the cross-platform wxWidgets toolkit and can be compiled on Linux, Windows, and Mac OS X.