/usr/include/boost/intrusive
NameSizeModeActions
detail/-0755rm
any_hook.hpp105060644editdlrm
avltree.hpp241240644editdlrm
avltree_algorithms.hpp289780644editdlrm
avl_set.hpp453820644editdlrm
avl_set_hook.hpp109650644editdlrm
bstree.hpp952080644editdlrm
bstree_algorithms.hpp800710644editdlrm
bs_set.hpp448980644editdlrm
bs_set_hook.hpp105010644editdlrm
circular_list_algorithms.hpp153760644editdlrm
circular_slist_algorithms.hpp150290644editdlrm
derivation_value_traits.hpp27490644editdlrm
hashtable.hpp1560710644editdlrm
intrusive_fwd.hpp163820644editdlrm
linear_slist_algorithms.hpp119680644editdlrm
link_mode.hpp20910644editdlrm
list.hpp580890644editdlrm
list_hook.hpp101710644editdlrm
member_value_traits.hpp34810644editdlrm
options.hpp109960644editdlrm
pack_options.hpp101740644editdlrm
parent_from_member.hpp20050644editdlrm
pointer_plus_bits.hpp37520644editdlrm
pointer_rebind.hpp63060644editdlrm
pointer_traits.hpp138980644editdlrm
priority_compare.hpp18120644editdlrm
rbtree.hpp242450644editdlrm
rbtree_algorithms.hpp259740644editdlrm
set.hpp447510644editdlrm
set_hook.hpp108120644editdlrm
sgtree.hpp418930644editdlrm
sgtree_algorithms.hpp175150644editdlrm
sg_set.hpp457290644editdlrm
slist.hpp884920644editdlrm
slist_hook.hpp108680644editdlrm
splaytree.hpp283250644editdlrm
splaytree_algorithms.hpp297510644editdlrm
splay_set.hpp475350644editdlrm
treap.hpp588700644editdlrm
treap_algorithms.hpp293270644editdlrm
treap_set.hpp473870644editdlrm
trivial_value_traits.hpp23810644editdlrm
unordered_set.hpp450700644editdlrm
unordered_set_hook.hpp167700644editdlrm
Edit: /usr/include/boost/intrusive/avl_set_hook.hpp (10965B)
///////////////////////////////////////////////////////////////////////////// // // (C) Copyright Ion Gaztanaga 2007-2013 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/intrusive for documentation. // ///////////////////////////////////////////////////////////////////////////// #ifndef BOOST_INTRUSIVE_AVL_SET_HOOK_HPP #define BOOST_INTRUSIVE_AVL_SET_HOOK_HPP #include #include #include #include #include #include #if defined(BOOST_HAS_PRAGMA_ONCE) # pragma once #endif namespace boost { namespace intrusive { //! Helper metafunction to define a \c avl_set_base_hook that yields to the same //! type when the same options (either explicitly or implicitly) are used. #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) template #else template #endif struct make_avl_set_base_hook { /// @cond typedef typename pack_options #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) #else #endif ::type packed_options; typedef generic_hook < AvlTreeAlgorithms , avltree_node_traits , typename packed_options::tag , packed_options::link_mode , AvlTreeBaseHookId > implementation_defined; /// @endcond typedef implementation_defined type; }; //! Derive a class from avl_set_base_hook in order to store objects in //! in an avl_set/avl_multiset. avl_set_base_hook holds the data necessary to maintain //! the avl_set/avl_multiset and provides an appropriate value_traits class for avl_set/avl_multiset. //! //! The hook admits the following options: \c tag<>, \c void_pointer<>, //! \c link_mode<> and \c optimize_size<>. //! //! \c tag<> defines a tag to identify the node. //! The same tag value can be used in different classes, but if a class is //! derived from more than one \c list_base_hook, then each \c list_base_hook needs its //! unique tag. //! //! \c void_pointer<> is the pointer type that will be used internally in the hook //! and the container configured to use this hook. //! //! \c link_mode<> will specify the linking mode of the hook (\c normal_link, //! \c auto_unlink or \c safe_link). //! //! \c optimize_size<> will tell the hook to optimize the hook for size instead //! of speed. #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) template #else template #endif class avl_set_base_hook : public make_avl_set_base_hook #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) #else #endif ::type { #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) public: //! Effects: If link_mode is \c auto_unlink or \c safe_link //! initializes the node to an unlinked state. //! //! Throws: Nothing. avl_set_base_hook(); //! Effects: If link_mode is \c auto_unlink or \c safe_link //! initializes the node to an unlinked state. The argument is ignored. //! //! Throws: Nothing. //! //! Rationale: Providing a copy-constructor //! makes classes using the hook STL-compliant without forcing the //! user to do some additional work. \c swap can be used to emulate //! move-semantics. avl_set_base_hook(const avl_set_base_hook& ); //! Effects: Empty function. The argument is ignored. //! //! Throws: Nothing. //! //! Rationale: Providing an assignment operator //! makes classes using the hook STL-compliant without forcing the //! user to do some additional work. \c swap can be used to emulate //! move-semantics. avl_set_base_hook& operator=(const avl_set_base_hook& ); //! Effects: If link_mode is \c normal_link, the destructor does //! nothing (ie. no code is generated). If link_mode is \c safe_link and the //! object is stored in a set an assertion is raised. If link_mode is //! \c auto_unlink and \c is_linked() is true, the node is unlinked. //! //! Throws: Nothing. ~avl_set_base_hook(); //! Effects: Swapping two nodes swaps the position of the elements //! related to those nodes in one or two containers. That is, if the node //! this is part of the element e1, the node x is part of the element e2 //! and both elements are included in the containers s1 and s2, then after //! the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 //! at the position of e1. If one element is not in a container, then //! after the swap-operation the other element is not in a container. //! Iterators to e1 and e2 related to those nodes are invalidated. //! //! Complexity: Constant //! //! Throws: Nothing. void swap_nodes(avl_set_base_hook &other); //! Precondition: link_mode must be \c safe_link or \c auto_unlink. //! //! Returns: true, if the node belongs to a container, false //! otherwise. This function can be used to test whether \c set::iterator_to //! will return a valid iterator. //! //! Complexity: Constant bool is_linked() const; //! Effects: Removes the node if it's inserted in a container. //! This function is only allowed if link_mode is \c auto_unlink. //! //! Throws: Nothing. void unlink(); #endif }; //! Helper metafunction to define a \c avl_set_member_hook that yields to the same //! type when the same options (either explicitly or implicitly) are used. #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) template #else template #endif struct make_avl_set_member_hook { /// @cond typedef typename pack_options #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) #else #endif ::type packed_options; typedef generic_hook < AvlTreeAlgorithms , avltree_node_traits , member_tag , packed_options::link_mode , NoBaseHookId > implementation_defined; /// @endcond typedef implementation_defined type; }; //! Put a public data member avl_set_member_hook in order to store objects of this class in //! an avl_set/avl_multiset. avl_set_member_hook holds the data necessary for maintaining the //! avl_set/avl_multiset and provides an appropriate value_traits class for avl_set/avl_multiset. //! //! The hook admits the following options: \c void_pointer<>, //! \c link_mode<> and \c optimize_size<>. //! //! \c void_pointer<> is the pointer type that will be used internally in the hook //! and the container configured to use this hook. //! //! \c link_mode<> will specify the linking mode of the hook (\c normal_link, //! \c auto_unlink or \c safe_link). //! //! \c optimize_size<> will tell the hook to optimize the hook for size instead //! of speed. #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) template #else template #endif class avl_set_member_hook : public make_avl_set_member_hook #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) #else #endif ::type { #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) public: //! Effects: If link_mode is \c auto_unlink or \c safe_link //! initializes the node to an unlinked state. //! //! Throws: Nothing. avl_set_member_hook(); //! Effects: If link_mode is \c auto_unlink or \c safe_link //! initializes the node to an unlinked state. The argument is ignored. //! //! Throws: Nothing. //! //! Rationale: Providing a copy-constructor //! makes classes using the hook STL-compliant without forcing the //! user to do some additional work. \c swap can be used to emulate //! move-semantics. avl_set_member_hook(const avl_set_member_hook& ); //! Effects: Empty function. The argument is ignored. //! //! Throws: Nothing. //! //! Rationale: Providing an assignment operator //! makes classes using the hook STL-compliant without forcing the //! user to do some additional work. \c swap can be used to emulate //! move-semantics. avl_set_member_hook& operator=(const avl_set_member_hook& ); //! Effects: If link_mode is \c normal_link, the destructor does //! nothing (ie. no code is generated). If link_mode is \c safe_link and the //! object is stored in a set an assertion is raised. If link_mode is //! \c auto_unlink and \c is_linked() is true, the node is unlinked. //! //! Throws: Nothing. ~avl_set_member_hook(); //! Effects: Swapping two nodes swaps the position of the elements //! related to those nodes in one or two containers. That is, if the node //! this is part of the element e1, the node x is part of the element e2 //! and both elements are included in the containers s1 and s2, then after //! the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 //! at the position of e1. If one element is not in a container, then //! after the swap-operation the other element is not in a container. //! Iterators to e1 and e2 related to those nodes are invalidated. //! //! Complexity: Constant //! //! Throws: Nothing. void swap_nodes(avl_set_member_hook &other); //! Precondition: link_mode must be \c safe_link or \c auto_unlink. //! //! Returns: true, if the node belongs to a container, false //! otherwise. This function can be used to test whether \c set::iterator_to //! will return a valid iterator. //! //! Complexity: Constant bool is_linked() const; //! Effects: Removes the node if it's inserted in a container. //! This function is only allowed if link_mode is \c auto_unlink. //! //! Throws: Nothing. void unlink(); #endif }; } //namespace intrusive } //namespace boost #include #endif //BOOST_INTRUSIVE_AVL_SET_HOOK_HPP