...one of the most highly
regarded and expertly designed C++ library projects in the
world.
— Herb Sutter and Andrei
Alexandrescu, C++
Coding Standards
noexcept
support to
the library to obtain better performance and diagnostics.
linear_slist_algorithms
use a simple node_ptr instead of std::pair on return.
list
/slist
use operator
<
/operator
==
instead of std::equal_to
/std::less
.
merge
functions
in ordered associative containers.
root()
function for tree-based containers.
key_compare
, the container
must be partitioned in regards to the passed comparison object.
xxx_dont_splay
functions from splay containers, splay_set_base_hook
and splay_set_member_hook
from
splay containers and bool splay = true
extra parameter in splaytree_algorithms
functions.
suggested_upper_bucket_count
/suggested_lower_bucket_count
in 64
bit platforms.
xxx_dont_splay
functions from splay
containers. Deprecated splay_set_base_hook
and splay_set_member_hook
from
splay containers, use bs_set_base_hook
or bs_set_member_hook
instead. Both will be removed in Boost 1.56.
BOOST_NO_EXCEPTIONS
support (bug #7849).
clone_from
functions
now copy predicates and hash functions of associative containers.
incremental<>
option.
iterator
to const_iterator
in
containers to keep up with the draft of the next standard.
linear<>
and cache_last<>
options to singly linked lists.
optimize_multikey<>
option to unordered container
hooks.
store_hash
option is used in the hook.
container_from_iterator
function to tree-based containers.