intrusive_fwd.hpp File Reference

This header file forward declares most Intrusive classes. More...

#include <cstddef>
#include <boost/intrusive/link_mode.hpp>
#include <boost/intrusive/detail/workaround.hpp>

Include dependency graph for intrusive_fwd.hpp:

This graph shows which files directly or indirectly include this file:

Classes
singleton	boost::intrusive::circular_list_algorithms< NodeTraits >
	circular_list_algorithms provides basic algorithms to manipulate nodes forming a circular doubly linked list. More...
singleton	boost::intrusive::circular_slist_algorithms< NodeTraits >
	circular_slist_algorithms provides basic algorithms to manipulate nodes forming a circular singly linked list. More...
class	boost::intrusive::linear_slist_algorithms< NodeTraits >
	linear_slist_algorithms provides basic algorithms to manipulate nodes forming a linear singly linked list. More...
singleton	boost::intrusive::bstree_algorithms< NodeTraits >
	This is an implementation of a binary search tree. More...
class	boost::intrusive::rbtree_algorithms< NodeTraits >
	rbtree_algorithms provides basic algorithms to manipulate nodes forming a red-black tree. More...
singleton	boost::intrusive::avltree_algorithms< NodeTraits >
	avltree_algorithms is configured with a NodeTraits class, which encapsulates the information about the node to be manipulated. More...
class	boost::intrusive::sgtree_algorithms< NodeTraits >
	sgtree_algorithms is configured with a NodeTraits class, which encapsulates the information about the node to be manipulated. More...
class	boost::intrusive::splaytree_algorithms< NodeTraits >
	A splay tree is an implementation of a binary search tree. More...
class	boost::intrusive::treap_algorithms< NodeTraits >
	treap_algorithms provides basic algorithms to manipulate nodes forming a treap. More...
class	boost::intrusive::slist< T, O1, O2, O3, O4, O5, O6 >
class	boost::intrusive::slist_base_hook< O1, O2, O3 >
	Derive a class from slist_base_hook in order to store objects in in an list. More...
class	boost::intrusive::slist_member_hook< O1, O2, O3 >
	Put a public data member slist_member_hook in order to store objects of this class in an list. More...
class	boost::intrusive::list< T, O1, O2, O3, O4 >
class	boost::intrusive::list_base_hook< O1, O2, O3 >
	Derive a class from this hook in order to store objects of that class in an list. More...
class	boost::intrusive::list_member_hook< O1, O2, O3 >
	Store this hook in a class to be inserted in an list. More...
class	boost::intrusive::rbtree< T, O1, O2, O3, O4, O5 >
class	boost::intrusive::set< T, O1, O2, O3, O4, O5 >
class	boost::intrusive::multiset< T, O1, O2, O3, O4, O5 >
class	boost::intrusive::set_base_hook< O1, O2, O3, O4 >
	Derive a class from set_base_hook in order to store objects in in a set/multiset. More...
class	boost::intrusive::set_member_hook< O1, O2, O3, O4 >
	Put a public data member set_member_hook in order to store objects of this class in a set/multiset. More...
class	boost::intrusive::splaytree< T, O1, O2, O3, O4, O5 >
class	boost::intrusive::splay_set< T, O1, O2, O3, O4, O5 >
class	boost::intrusive::splay_multiset< T, O1, O2, O3, O4, O5 >
singleton	boost::intrusive::avltree< T, O1, O2, O3, O4, O5 >
singleton	boost::intrusive::avl_set< T, O1, O2, O3, O4, O5 >
singleton	boost::intrusive::avl_multiset< T, O1, O2, O3, O4, O5 >
singleton	boost::intrusive::avl_set_base_hook< O1, O2, O3, O4 >
	Derive a class from avl_set_base_hook in order to store objects in in an avl_set/avl_multiset. More...
singleton	boost::intrusive::avl_set_member_hook< O1, O2, O3, O4 >
	Put a public data member avl_set_member_hook in order to store objects of this class in an avl_set/avl_multiset. More...
class	boost::intrusive::treap< T, O1, O2, O3, O4, O5 >
class	boost::intrusive::treap_set< T, O1, O2, O3, O4, O5 >
class	boost::intrusive::treap_multiset< T, O1, O2, O3, O4, O5 >
class	boost::intrusive::sgtree< T, O1, O2, O3, O4, O5 >
class	boost::intrusive::sg_set< T, O1, O2, O3, O4, O5 >
class	boost::intrusive::sg_multiset< T, O1, O2, O3, O4, O5 >
singleton	boost::intrusive::bstree< T, O1, O2, O3, O4, O5 >
singleton	boost::intrusive::bs_set< T, O1, O2, O3, O4, O5 >
singleton	boost::intrusive::bs_multiset< T, O1, O2, O3, O4, O5 >
singleton	boost::intrusive::bs_set_base_hook< O1, O2, O3 >
	Derive a class from bs_set_base_hook in order to store objects in in a bs_set/bs_multiset. More...
singleton	boost::intrusive::bs_set_member_hook< O1, O2, O3 >
	Put a public data member bs_set_member_hook in order to store objects of this class in a bs_set/bs_multiset. More...
singleton	boost::intrusive::hashtable< T, O1, O2, O3, O4, O5, O6, O7, O8, O9, O10 >
class	boost::intrusive::unordered_set< T, O1, O2, O3, O4, O5, O6, O7, O8, O9, O10 >
class	boost::intrusive::unordered_multiset< T, O1, O2, O3, O4, O5, O6, O7, O8, O9, O10 >
class	boost::intrusive::unordered_set_base_hook< O1, O2, O3, O4 >
	Derive a class from unordered_set_base_hook in order to store objects in in an unordered_set/unordered_multi_set. More...
class	boost::intrusive::unordered_set_member_hook< O1, O2, O3, O4 >
	Put a public data member unordered_set_member_hook in order to store objects of this class in an unordered_set/unordered_multi_set. More...
singleton	boost::intrusive::any_base_hook< O1, O2, O3 >
	Derive a class from this hook in order to store objects of that class in an intrusive container. More...
singleton	boost::intrusive::any_member_hook< O1, O2, O3 >
	Store this hook in a class to be inserted in an intrusive container. More...
struct	boost::intrusive::constant_time_size< Enabled >
struct	boost::intrusive::size_type< SizeType >
struct	boost::intrusive::compare< Compare >
struct	boost::intrusive::floating_point< Enabled >
struct	boost::intrusive::equal< Equal >
struct	boost::intrusive::priority< Priority >
struct	boost::intrusive::hash< Hash >
struct	boost::intrusive::value_traits< ValueTraits >
struct	boost::intrusive::member_hook< Parent, MemberHook, PtrToMember >
	This option setter specifies if the intrusive container stores its size as a member to obtain constant-time size() member. More...
struct	boost::intrusive::function_hook< Functor >
struct	boost::intrusive::base_hook< BaseHook >
struct	boost::intrusive::void_pointer< VoidPointer >
struct	boost::intrusive::tag< Tag >
struct	boost::intrusive::link_mode< LinkType >
struct	boost::intrusive::optimize_size< Enabled >
struct	boost::intrusive::linear< Enabled >
struct	boost::intrusive::cache_last< Enabled >
struct	boost::intrusive::bucket_traits< BucketTraits >
struct	boost::intrusive::store_hash< Enabled >
struct	boost::intrusive::optimize_multikey< Enabled >
struct	boost::intrusive::power_2_buckets< Enabled >
struct	boost::intrusive::cache_begin< Enabled >
struct	boost::intrusive::compare_hash< Enabled >
struct	boost::intrusive::incremental< Enabled >
struct	boost::intrusive::value_traits< ValueTraits >
struct	boost::intrusive::member_hook< Parent, MemberHook, PtrToMember >
	This option setter specifies if the intrusive container stores its size as a member to obtain constant-time size() member. More...
struct	boost::intrusive::function_hook< Functor >
struct	boost::intrusive::base_hook< BaseHook >
struct	boost::intrusive::derivation_value_traits< T, NodeTraits, LinkMode >
	This value traits template is used to create value traits from user defined node traits where value_traits::value_type will derive from node_traits::node. More...
struct	boost::intrusive::trivial_value_traits< NodeTraits, LinkMode >
	This value traits template is used to create value traits from user defined node traits where value_traits::value_type and node_traits::node should be equal. More...
struct	boost::intrusive::max_pointer_plus_bits< VoidPointer, Alignment >
	This trait class is used to know if a pointer can embed extra bits of information if it's going to be used to point to objects with an alignment of "Alignment" bytes. More...
struct	boost::intrusive::pointer_plus_bits< Pointer, NumBits >
	This is class that is supposed to have static methods to embed extra bits of information in a pointer. More...
struct	boost::intrusive::pointer_traits< Ptr >
	pointer_traits is the implementation of C++11 std::pointer_traits class with some extensions like castings. More...

Namespaces
	boost
	Duration formatting facet for input.
	boost::intrusive

Detailed Description

This header file forward declares most Intrusive classes.

It forward declares the following containers and hooks:

• boost::intrusive::slist / boost::intrusive::slist_base_hook / boost::intrusive::slist_member_hook
• boost::intrusive::list / boost::intrusive::list_base_hook / boost::intrusive::list_member_hook
• boost::intrusive::bstree / boost::intrusive::bs_set / boost::intrusive::bs_multiset / boost::intrusive::bs_set_base_hook / boost::intrusive::bs_set_member_hook
• boost::intrusive::rbtree / boost::intrusive::set / boost::intrusive::multiset / boost::intrusive::set_base_hook / boost::intrusive::set_member_hook
• boost::intrusive::avltree / boost::intrusive::avl_set / boost::intrusive::avl_multiset / boost::intrusive::avl_set_base_hook / boost::intrusive::avl_set_member_hook
• boost::intrusive::splaytree / boost::intrusive::splay_set / boost::intrusive::splay_multiset
• boost::intrusive::sgtree / boost::intrusive::sg_set / boost::intrusive::sg_multiset
• boost::intrusive::treap / boost::intrusive::treap_set / boost::intrusive::treap_multiset
• boost::intrusive::hashtable / boost::intrusive::unordered_set / boost::intrusive::unordered_multiset / boost::intrusive::unordered_set_base_hook / boost::intrusive::unordered_set_member_hook /
• boost::intrusive::any_base_hook / boost::intrusive::any_member_hook

It forward declares the following container or hook options:

• boost::intrusive::constant_time_size / boost::intrusive::size_type / boost::intrusive::compare / boost::intrusive::equal
• boost::intrusive::floating_point / boost::intrusive::priority / boost::intrusive::hash
• boost::intrusive::value_traits / boost::intrusive::member_hook / boost::intrusive::function_hook / boost::intrusive::base_hook
• boost::intrusive::void_pointer / boost::intrusive::tag / boost::intrusive::link_mode
• boost::intrusive::optimize_size / boost::intrusive::linear / boost::intrusive::cache_last
• boost::intrusive::bucket_traits / boost::intrusive::store_hash / boost::intrusive::optimize_multikey
• boost::intrusive::power_2_buckets / boost::intrusive::cache_begin / boost::intrusive::compare_hash / boost::intrusive::incremental

It forward declares the following value traits utilities:

• boost::intrusive::value_traits / boost::intrusive::derivation_value_traits / boost::intrusive::trivial_value_traits

Finally it forward declares the following general purpose utilities:

• boost::intrusive::pointer_plus_bits / boost::intrusive::priority_compare.