boost_intrusive

detail

Use BitScanReverse intrinsic also in floor_log2 also in MSVC 7.1 and avoid including "intrin.h"

2014-02-08 12:15:23 +01:00

any_hook.hpp

Fixes #9520

2013-12-24 17:10:24 +01:00

avl_set_hook.hpp

Fixes #9520

2013-12-24 17:10:24 +01:00

avl_set.hpp

Implemented equal_range for unique associative containers using lower_bound_range. This might be a bit slower when comparison function is very lightweight, but shines when it's heavy as it just needs to perform a single additional comparison and a possible successor iteration.

2014-01-20 12:13:53 +01:00

avltree_algorithms.hpp

Optimized tree-rebalancing code to avoid redundant pointer updates.

2014-02-06 11:10:47 +01:00

avltree.hpp

Fixed ABI regression introduced in Boost 1.55

2014-01-30 14:22:04 +01:00

bs_set_hook.hpp

Fixes #9520

2013-12-24 17:10:24 +01:00

bs_set.hpp

Implemented equal_range for unique associative containers using lower_bound_range. This might be a bit slower when comparison function is very lightweight, but shines when it's heavy as it just needs to perform a single additional comparison and a possible successor iteration.

2014-01-20 12:13:53 +01:00

bstree_algorithms.hpp

Optimized tree-rebalancing code to avoid redundant pointer updates.

2014-02-06 11:10:47 +01:00

bstree.hpp

Fixed ABI regression introduced in Boost 1.55

2014-01-30 14:22:04 +01:00

circular_list_algorithms.hpp

* Big refactoring in order to reduce template and debug symbol bloat.

2013-07-28 22:10:37 +00:00

circular_slist_algorithms.hpp

* Big refactoring in order to reduce template and debug symbol bloat.

2013-07-28 22:10:37 +00:00

derivation_value_traits.hpp

Changes for 1.56 made during Git transition:

2013-12-23 10:15:53 +01:00

hashtable.hpp

Fixed ABI regression introduced in Boost 1.55

2014-01-30 14:22:04 +01:00

intrusive_fwd.hpp

Changes for 1.56 made during Git transition:

2013-12-23 10:15:53 +01:00

linear_slist_algorithms.hpp

* Big refactoring in order to reduce template and debug symbol bloat.

2013-07-28 22:10:37 +00:00

link_mode.hpp

* Big refactoring in order to reduce template and debug symbol bloat.

2013-07-28 22:10:37 +00:00

list_hook.hpp

Fixes #9520

2013-12-24 17:10:24 +01:00

list.hpp

Fixed ABI regression introduced in Boost 1.55

2014-01-30 14:22:04 +01:00

member_value_traits.hpp

Changes for 1.56 made during Git transition:

2013-12-23 10:15:53 +01:00

options.hpp

Fixed ABI regression introduced in Boost 1.55

2014-01-30 14:22:04 +01:00

pack_options.hpp

pack_options is now public, documented and tested so that it can be used by other libraries like Container, to specify new options for customizable containers.

2013-12-29 13:42:55 +01:00

parent_from_member.hpp

Changes for 1.56 made during Git transition:

2013-12-23 10:15:53 +01:00

pointer_plus_bits.hpp

Changes for 1.56 made during Git transition:

2013-12-23 10:15:53 +01:00

pointer_traits.hpp

Changes for 1.56 made during Git transition:

2013-12-23 10:15:53 +01:00

priority_compare.hpp

Fixed ABI regression introduced in Boost 1.55

2014-01-30 14:22:04 +01:00

rbtree_algorithms.hpp

Optimized tree-rebalancing code to avoid redundant pointer updates.

2014-02-06 11:10:47 +01:00

rbtree.hpp

Fixed ABI regression introduced in Boost 1.55

2014-01-30 14:22:04 +01:00

set_hook.hpp

Fixes #9520

2013-12-24 17:10:24 +01:00

set.hpp

Implemented equal_range for unique associative containers using lower_bound_range. This might be a bit slower when comparison function is very lightweight, but shines when it's heavy as it just needs to perform a single additional comparison and a possible successor iteration.

2014-01-20 12:13:53 +01:00

sg_set.hpp

Implemented equal_range for unique associative containers using lower_bound_range. This might be a bit slower when comparison function is very lightweight, but shines when it's heavy as it just needs to perform a single additional comparison and a possible successor iteration.

2014-01-20 12:13:53 +01:00

sgtree_algorithms.hpp

Improved "count" for unique associative containers. Instead of calling tree's count just use find() != end() to avoid iterations as there is only one potential key.

2014-01-19 14:28:57 +01:00

sgtree.hpp

Fixed ABI regression introduced in Boost 1.55

2014-01-30 14:22:04 +01:00

slist_hook.hpp

Fixes #9520

2013-12-24 17:10:24 +01:00

slist.hpp

Fixed ABI regression introduced in Boost 1.55

2014-01-30 14:22:04 +01:00

splay_set.hpp

Implemented equal_range for unique associative containers using lower_bound_range. This might be a bit slower when comparison function is very lightweight, but shines when it's heavy as it just needs to perform a single additional comparison and a possible successor iteration.

2014-01-20 12:13:53 +01:00

splaytree_algorithms.hpp

Optimized tree-rebalancing code to avoid redundant pointer updates.

2014-02-06 11:10:47 +01:00

splaytree.hpp

Fixed ABI regression introduced in Boost 1.55

2014-01-30 14:22:04 +01:00

treap_algorithms.hpp

Optimized tree-rebalancing code to avoid redundant pointer updates.

2014-02-06 11:10:47 +01:00

treap_set.hpp

Fixed ABI regression introduced in Boost 1.55

2014-01-30 14:22:04 +01:00

treap.hpp

Fixed ABI regression introduced in Boost 1.55

2014-01-30 14:22:04 +01:00

trivial_value_traits.hpp

Changes for 1.56 made during Git transition:

2013-12-23 10:15:53 +01:00

unordered_set_hook.hpp

Fixes #9520

2013-12-24 17:10:24 +01:00

unordered_set.hpp

Fixed ABI regression introduced in Boost 1.55

2014-01-30 14:22:04 +01:00