| Home | Libraries | People | FAQ | More

## Release Notes

### Boost 1.45 Release

- Added `function_hook` option.
- Fixed bugs #3668, #3688, #3698, #3706, #3721. #3729, #3746, #3781, #3829, #3840, #3339, #3419, #3431, #4021,

### Boost 1.40 Release

- Code cleanup in tree_algorithms.hpp and avl_tree_algorithms.hpp
- Fixed bug #3164.

### Boost 1.39 Release

- Optimized `list::merge` and `slist::merge`
- `list::sort` and `slist::sort` are now stable.
- Fixed bugs #2689, #2755, #2786, #2807, #2810, #2862.

### Boost 1.38 Release

- New treap-based containers: treap, treap_set, treap_multiset.
- Corrected compilation bug for Windows-based 64 bit compilers.
- Corrected exception-safety bugs in container constructors.
- Updated documentation to show rvalue-references functions instead of emulation functions.

### Boost 1.37 Release

- Intrusive now takes advantage of compilers with variadic templates.
- `clone_from` functions now copy predicates and hash functions of associative containers.
- Added incremental hashing to unordered containers via `incremental<>` option.
- Update some function parameters from `iterator` to `const_iterator` in containers to keep up with the draft of the next standard.
- Added an option to specify include files for intrusive configurable assertion macros.

### Boost 1.36 Release

- Added `linear<>` and `cache_last<>` options to singly linked lists.
- Added `optimize_multikey<>` option to unordered container hooks.
- Optimized unordered containers when `store_hash` option is used in the hook.
- Implementation changed to be exception agnostic so that it can be used in environments without exceptions.
- Added `container_from_iterator` function to tree-based containers.