The class template rbtree is an intrusive red-black tree container, that is used to construct intrusive set and multiset containers. More...
#include <rbtree.hpp>
Public Types | |
typedef ValueTraits | value_traits |
typedef implementation_defined::pointer | pointer |
typedef implementation_defined::const_pointer | const_pointer |
typedef implementation_defined::value_type | value_type |
typedef implementation_defined::key_type | key_type |
typedef implementation_defined::reference | reference |
typedef implementation_defined::const_reference | const_reference |
typedef implementation_defined::difference_type | difference_type |
typedef implementation_defined::size_type | size_type |
typedef implementation_defined::value_compare | value_compare |
typedef implementation_defined::key_compare | key_compare |
typedef implementation_defined::iterator | iterator |
typedef implementation_defined::const_iterator | const_iterator |
typedef implementation_defined::reverse_iterator | reverse_iterator |
typedef implementation_defined::const_reverse_iterator | const_reverse_iterator |
typedef implementation_defined::node_traits | node_traits |
typedef implementation_defined::node | node |
typedef implementation_defined::node_ptr | node_ptr |
typedef implementation_defined::const_node_ptr | const_node_ptr |
typedef implementation_defined::node_algorithms | node_algorithms |
typedef implementation_defined::insert_commit_data | insert_commit_data |
Public Member Functions | |
rbtree_impl (const value_compare &cmp=value_compare(), const value_traits &v_traits=value_traits()) | |
template<class Iterator > | |
rbtree_impl (bool unique, Iterator b, Iterator e, const value_compare &cmp=value_compare(), const value_traits &v_traits=value_traits()) | |
rbtree_impl (BOOST_RV_REF(rbtree_impl) x) | |
rbtree_impl & | operator= (BOOST_RV_REF(rbtree_impl) x) |
Static Public Attributes | |
static const bool | constant_time_size = implementation_defined::constant_time_size |
The class template rbtree is an intrusive red-black tree container, that is used to construct intrusive set and multiset containers.
The no-throw guarantee holds only, if the value_compare object doesn't throw.
The template parameter T
is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.
The container supports the following options: base_hook<>/member_hook<>/value_traits<>
, constant_time_size<>
, size_type<>
and compare<>
.
typedef implementation_defined::const_iterator boost::intrusive::rbtree_impl< ValueTraits, VoidOrKeyComp, SizeType, ConstantTimeSize, HeaderHolder >::const_iterator |
typedef implementation_defined::const_node_ptr boost::intrusive::rbtree_impl< ValueTraits, VoidOrKeyComp, SizeType, ConstantTimeSize, HeaderHolder >::const_node_ptr |
typedef implementation_defined::const_pointer boost::intrusive::rbtree_impl< ValueTraits, VoidOrKeyComp, SizeType, ConstantTimeSize, HeaderHolder >::const_pointer |
typedef implementation_defined::const_reference boost::intrusive::rbtree_impl< ValueTraits, VoidOrKeyComp, SizeType, ConstantTimeSize, HeaderHolder >::const_reference |
typedef implementation_defined::const_reverse_iterator boost::intrusive::rbtree_impl< ValueTraits, VoidOrKeyComp, SizeType, ConstantTimeSize, HeaderHolder >::const_reverse_iterator |
typedef implementation_defined::difference_type boost::intrusive::rbtree_impl< ValueTraits, VoidOrKeyComp, SizeType, ConstantTimeSize, HeaderHolder >::difference_type |
typedef implementation_defined::insert_commit_data boost::intrusive::rbtree_impl< ValueTraits, VoidOrKeyComp, SizeType, ConstantTimeSize, HeaderHolder >::insert_commit_data |
typedef implementation_defined::iterator boost::intrusive::rbtree_impl< ValueTraits, VoidOrKeyComp, SizeType, ConstantTimeSize, HeaderHolder >::iterator |
typedef implementation_defined::key_compare boost::intrusive::rbtree_impl< ValueTraits, VoidOrKeyComp, SizeType, ConstantTimeSize, HeaderHolder >::key_compare |
typedef implementation_defined::key_type boost::intrusive::rbtree_impl< ValueTraits, VoidOrKeyComp, SizeType, ConstantTimeSize, HeaderHolder >::key_type |
typedef implementation_defined::node boost::intrusive::rbtree_impl< ValueTraits, VoidOrKeyComp, SizeType, ConstantTimeSize, HeaderHolder >::node |
typedef implementation_defined::node_algorithms boost::intrusive::rbtree_impl< ValueTraits, VoidOrKeyComp, SizeType, ConstantTimeSize, HeaderHolder >::node_algorithms |
typedef implementation_defined::node_ptr boost::intrusive::rbtree_impl< ValueTraits, VoidOrKeyComp, SizeType, ConstantTimeSize, HeaderHolder >::node_ptr |
typedef implementation_defined::node_traits boost::intrusive::rbtree_impl< ValueTraits, VoidOrKeyComp, SizeType, ConstantTimeSize, HeaderHolder >::node_traits |
typedef implementation_defined::pointer boost::intrusive::rbtree_impl< ValueTraits, VoidOrKeyComp, SizeType, ConstantTimeSize, HeaderHolder >::pointer |
typedef implementation_defined::reference boost::intrusive::rbtree_impl< ValueTraits, VoidOrKeyComp, SizeType, ConstantTimeSize, HeaderHolder >::reference |
typedef implementation_defined::reverse_iterator boost::intrusive::rbtree_impl< ValueTraits, VoidOrKeyComp, SizeType, ConstantTimeSize, HeaderHolder >::reverse_iterator |
typedef implementation_defined::size_type boost::intrusive::rbtree_impl< ValueTraits, VoidOrKeyComp, SizeType, ConstantTimeSize, HeaderHolder >::size_type |
typedef implementation_defined::value_compare boost::intrusive::rbtree_impl< ValueTraits, VoidOrKeyComp, SizeType, ConstantTimeSize, HeaderHolder >::value_compare |
typedef ValueTraits boost::intrusive::rbtree_impl< ValueTraits, VoidOrKeyComp, SizeType, ConstantTimeSize, HeaderHolder >::value_traits |
typedef implementation_defined::value_type boost::intrusive::rbtree_impl< ValueTraits, VoidOrKeyComp, SizeType, ConstantTimeSize, HeaderHolder >::value_type |
|
inlineexplicit |
|
inline |
|
inline |
|
inline |
References boost::move(), and boost::multiprecision::backends::operator=().
|
static |