Chris@16: ///////////////////////////////////////////////////////////////////////////// Chris@16: // Chris@101: // (C) Copyright Ion Gaztanaga 2007-2014 Chris@16: // Chris@16: // Distributed under the Boost Software License, Version 1.0. Chris@16: // (See accompanying file LICENSE_1_0.txt or copy at Chris@16: // http://www.boost.org/LICENSE_1_0.txt) Chris@16: // Chris@16: // See http://www.boost.org/libs/intrusive for documentation. Chris@16: // Chris@16: ///////////////////////////////////////////////////////////////////////////// Chris@16: // Chris@16: // The option that yields to non-floating point 1/sqrt(2) alpha is taken Chris@16: // from the scapegoat tree implementation of the PSPP library. Chris@16: // Chris@16: ///////////////////////////////////////////////////////////////////////////// Chris@16: Chris@16: #ifndef BOOST_INTRUSIVE_SGTREE_HPP Chris@16: #define BOOST_INTRUSIVE_SGTREE_HPP Chris@16: Chris@16: #include Chris@101: #include Chris@16: #include Chris@16: #include Chris@16: #include Chris@16: #include Chris@16: #include Chris@16: #include Chris@16: #include Chris@101: #include Chris@101: #include Chris@16: #include Chris@101: #include Chris@16: #include Chris@101: Chris@101: #include Chris@101: #include Chris@101: Chris@101: #include Chris@101: #include Chris@101: #include //std::pair Chris@101: #include Chris@101: #include Chris@101: Chris@101: #if defined(BOOST_HAS_PRAGMA_ONCE) Chris@101: # pragma once Chris@101: #endif Chris@16: Chris@16: namespace boost { Chris@16: namespace intrusive { Chris@16: Chris@16: /// @cond Chris@16: Chris@16: namespace detail{ Chris@16: Chris@101: ///////////////////////////////////////////////////////////// Chris@101: // Chris@101: // Halpha for fixed floating_point option Chris@101: // Chris@101: ///////////////////////////////////////////////////////////// Chris@101: Chris@16: //! Returns floor(log2(n)/log2(sqrt(2))) -> floor(2*log2(n)) Chris@16: //! Undefined if N is 0. Chris@16: //! Chris@16: //! This function does not use float point operations. Chris@16: inline std::size_t calculate_h_sqrt2 (std::size_t n) Chris@16: { Chris@16: std::size_t f_log2 = detail::floor_log2(n); Chris@101: return (2*f_log2) + static_cast(n >= detail::sqrt2_pow_2xplus1(f_log2)); Chris@16: } Chris@16: Chris@16: struct h_alpha_sqrt2_t Chris@16: { Chris@16: h_alpha_sqrt2_t(void){} Chris@16: std::size_t operator()(std::size_t n) const Chris@16: { return calculate_h_sqrt2(n); } Chris@16: }; Chris@16: Chris@16: struct alpha_0_75_by_max_size_t Chris@16: { Chris@16: alpha_0_75_by_max_size_t(void){} Chris@16: Chris@16: std::size_t operator()(std::size_t max_tree_size) const Chris@16: { Chris@16: const std::size_t max_tree_size_limit = ((~std::size_t(0))/std::size_t(3)); Chris@16: return max_tree_size > max_tree_size_limit ? max_tree_size/4*3 : max_tree_size*3/4; Chris@16: } Chris@16: }; Chris@16: Chris@101: ///////////////////////////////////////////////////////////// Chris@101: // Chris@101: // Halpha for fixed floating_point option Chris@101: // Chris@101: ///////////////////////////////////////////////////////////// Chris@101: Chris@16: struct h_alpha_t Chris@16: { Chris@16: explicit h_alpha_t(float inv_minus_logalpha) Chris@16: : inv_minus_logalpha_(inv_minus_logalpha) Chris@16: {} Chris@16: Chris@16: std::size_t operator()(std::size_t n) const Chris@16: { Chris@101: //////////////////////////////////////////////////////////// Chris@101: // This function must return "floor(log2(1/alpha(n)))" -> Chris@101: // floor(log2(n)/log(1/alpha)) -> Chris@101: // floor(log2(n)/-log2(alpha)) Chris@101: // floor(log2(n)*(1/-log2(alpha))) Chris@101: //////////////////////////////////////////////////////////// Chris@16: return static_cast(detail::fast_log2(float(n))*inv_minus_logalpha_); Chris@16: } Chris@16: Chris@16: private: Chris@16: //Since the function will be repeatedly called Chris@16: //precalculate constant data to avoid repeated Chris@16: //calls to log and division. Chris@16: //This will store 1/(-std::log2(alpha_)) Chris@16: float inv_minus_logalpha_; Chris@16: }; Chris@16: Chris@16: struct alpha_by_max_size_t Chris@16: { Chris@16: explicit alpha_by_max_size_t(float alpha) Chris@16: : alpha_(alpha) Chris@16: {} Chris@16: Chris@16: float operator()(std::size_t max_tree_size) const Chris@16: { return float(max_tree_size)*alpha_; } Chris@16: Chris@16: private: Chris@16: float alpha_; Chris@16: }; Chris@16: Chris@16: template Chris@16: struct alpha_holder Chris@16: { Chris@16: typedef boost::intrusive::detail::h_alpha_t h_alpha_t; Chris@16: typedef boost::intrusive::detail::alpha_by_max_size_t multiply_by_alpha_t; Chris@16: Chris@101: alpha_holder() Chris@101: : max_tree_size_() Chris@101: { set_alpha(0.70711f); } // ~1/sqrt(2) Chris@16: Chris@16: float get_alpha() const Chris@16: { return alpha_; } Chris@16: Chris@16: void set_alpha(float alpha) Chris@16: { Chris@16: alpha_ = alpha; Chris@16: inv_minus_logalpha_ = 1/(-detail::fast_log2(alpha)); Chris@16: } Chris@16: Chris@16: h_alpha_t get_h_alpha_t() const Chris@101: { return h_alpha_t(inv_minus_logalpha_); } Chris@16: Chris@16: multiply_by_alpha_t get_multiply_by_alpha_t() const Chris@16: { return multiply_by_alpha_t(alpha_); } Chris@16: Chris@16: protected: Chris@16: float alpha_; Chris@16: float inv_minus_logalpha_; Chris@16: SizeType max_tree_size_; Chris@16: }; Chris@16: Chris@16: template Chris@16: struct alpha_holder Chris@16: { Chris@16: //This specialization uses alpha = 1/sqrt(2) Chris@16: //without using floating point operations Chris@16: //Downside: alpha CAN't be changed. Chris@16: typedef boost::intrusive::detail::h_alpha_sqrt2_t h_alpha_t; Chris@16: typedef boost::intrusive::detail::alpha_0_75_by_max_size_t multiply_by_alpha_t; Chris@16: Chris@101: alpha_holder() Chris@101: : max_tree_size_() Chris@101: {} Chris@101: Chris@16: float get_alpha() const Chris@16: { return 0.70710677f; } Chris@16: Chris@16: void set_alpha(float) Chris@16: { //alpha CAN't be changed. Chris@16: BOOST_INTRUSIVE_INVARIANT_ASSERT(0); Chris@16: } Chris@16: Chris@16: h_alpha_t get_h_alpha_t() const Chris@16: { return h_alpha_t(); } Chris@16: Chris@16: multiply_by_alpha_t get_multiply_by_alpha_t() const Chris@16: { return multiply_by_alpha_t(); } Chris@16: Chris@16: SizeType max_tree_size_; Chris@16: }; Chris@16: Chris@16: } //namespace detail{ Chris@16: Chris@16: struct sgtree_defaults Chris@16: { Chris@101: typedef default_bstree_hook_applier proto_value_traits; Chris@16: static const bool constant_time_size = true; Chris@16: typedef std::size_t size_type; Chris@16: typedef void compare; Chris@16: static const bool floating_point = true; Chris@101: typedef void header_holder_type; Chris@16: }; Chris@16: Chris@16: /// @endcond Chris@16: Chris@16: //! The class template sgtree is an intrusive scapegoat tree container, that Chris@16: //! is used to construct intrusive sg_set and sg_multiset containers. Chris@16: //! The no-throw guarantee holds only, if the value_compare object Chris@16: //! doesn't throw. Chris@16: //! Chris@16: //! The template parameter \c T is the type to be managed by the container. Chris@16: //! The user can specify additional options and if no options are provided Chris@16: //! default options are used. Chris@16: //! Chris@16: //! The container supports the following options: Chris@16: //! \c base_hook<>/member_hook<>/value_traits<>, Chris@16: //! \c floating_point<>, \c size_type<> and Chris@16: //! \c compare<>. Chris@16: #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) Chris@16: template Chris@16: #else Chris@101: template Chris@16: #endif Chris@16: class sgtree_impl Chris@16: /// @cond Chris@101: : public bstree_impl Chris@16: , public detail::alpha_holder Chris@16: /// @endcond Chris@16: { Chris@16: public: Chris@16: typedef ValueTraits value_traits; Chris@16: /// @cond Chris@16: typedef bstree_impl< ValueTraits, VoidOrKeyComp, SizeType Chris@101: , true, SgTreeAlgorithms, HeaderHolder> tree_type; Chris@16: typedef tree_type implementation_defined; Chris@16: Chris@16: /// @endcond Chris@16: Chris@16: typedef typename implementation_defined::pointer pointer; Chris@16: typedef typename implementation_defined::const_pointer const_pointer; Chris@16: typedef typename implementation_defined::value_type value_type; Chris@16: typedef typename implementation_defined::key_type key_type; Chris@16: typedef typename implementation_defined::reference reference; Chris@16: typedef typename implementation_defined::const_reference const_reference; Chris@16: typedef typename implementation_defined::difference_type difference_type; Chris@16: typedef typename implementation_defined::size_type size_type; Chris@16: typedef typename implementation_defined::value_compare value_compare; Chris@16: typedef typename implementation_defined::key_compare key_compare; Chris@16: typedef typename implementation_defined::iterator iterator; Chris@16: typedef typename implementation_defined::const_iterator const_iterator; Chris@16: typedef typename implementation_defined::reverse_iterator reverse_iterator; Chris@16: typedef typename implementation_defined::const_reverse_iterator const_reverse_iterator; Chris@16: typedef typename implementation_defined::node_traits node_traits; Chris@16: typedef typename implementation_defined::node node; Chris@16: typedef typename implementation_defined::node_ptr node_ptr; Chris@16: typedef typename implementation_defined::const_node_ptr const_node_ptr; Chris@16: typedef BOOST_INTRUSIVE_IMPDEF(sgtree_algorithms) node_algorithms; Chris@16: Chris@16: static const bool constant_time_size = implementation_defined::constant_time_size; Chris@16: static const bool floating_point = FloatingPoint; Chris@16: static const bool stateful_value_traits = implementation_defined::stateful_value_traits; Chris@16: Chris@16: /// @cond Chris@16: private: Chris@16: Chris@16: //noncopyable Chris@16: typedef detail::alpha_holder alpha_traits; Chris@16: typedef typename alpha_traits::h_alpha_t h_alpha_t; Chris@16: typedef typename alpha_traits::multiply_by_alpha_t multiply_by_alpha_t; Chris@16: Chris@16: BOOST_MOVABLE_BUT_NOT_COPYABLE(sgtree_impl) Chris@101: BOOST_STATIC_ASSERT(((int)value_traits::link_mode != (int)auto_unlink)); Chris@16: Chris@16: enum { safemode_or_autounlink = Chris@101: (int)value_traits::link_mode == (int)auto_unlink || Chris@101: (int)value_traits::link_mode == (int)safe_link }; Chris@16: Chris@16: /// @endcond Chris@16: Chris@16: public: Chris@16: Chris@16: typedef BOOST_INTRUSIVE_IMPDEF(typename node_algorithms::insert_commit_data) insert_commit_data; Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::bstree(const value_compare &,const value_traits &) Chris@16: explicit sgtree_impl( const value_compare &cmp = value_compare() Chris@16: , const value_traits &v_traits = value_traits()) Chris@16: : tree_type(cmp, v_traits) Chris@16: {} Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::bstree(bool,Iterator,Iterator,const value_compare &,const value_traits &) Chris@16: template Chris@16: sgtree_impl( bool unique, Iterator b, Iterator e Chris@16: , const value_compare &cmp = value_compare() Chris@16: , const value_traits &v_traits = value_traits()) Chris@16: : tree_type(cmp, v_traits) Chris@16: { Chris@16: if(unique) Chris@16: this->insert_unique(b, e); Chris@16: else Chris@16: this->insert_equal(b, e); Chris@16: } Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::bstree(bstree &&) Chris@16: sgtree_impl(BOOST_RV_REF(sgtree_impl) x) Chris@101: : tree_type(BOOST_MOVE_BASE(tree_type, x)), alpha_traits(x.get_alpha_traits()) Chris@101: { ::boost::adl_move_swap(this->get_alpha_traits(), x.get_alpha_traits()); } Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::operator=(bstree &&) Chris@16: sgtree_impl& operator=(BOOST_RV_REF(sgtree_impl) x) Chris@16: { Chris@16: this->get_alpha_traits() = x.get_alpha_traits(); Chris@101: return static_cast(tree_type::operator=(BOOST_MOVE_BASE(tree_type, x))); Chris@16: } Chris@16: Chris@16: /// @cond Chris@16: private: Chris@16: Chris@16: const alpha_traits &get_alpha_traits() const Chris@16: { return *this; } Chris@16: Chris@16: alpha_traits &get_alpha_traits() Chris@16: { return *this; } Chris@16: Chris@16: h_alpha_t get_h_alpha_func() const Chris@16: { return this->get_alpha_traits().get_h_alpha_t(); } Chris@16: Chris@16: multiply_by_alpha_t get_alpha_by_max_size_func() const Chris@16: { return this->get_alpha_traits().get_multiply_by_alpha_t(); } Chris@16: Chris@16: /// @endcond Chris@16: Chris@16: public: Chris@16: Chris@16: #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED Chris@16: //! @copydoc ::boost::intrusive::bstree::~bstree() Chris@16: ~sgtree_impl(); Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::begin() Chris@16: iterator begin(); Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::begin()const Chris@16: const_iterator begin() const; Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::cbegin()const Chris@16: const_iterator cbegin() const; Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::end() Chris@16: iterator end(); Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::end()const Chris@16: const_iterator end() const; Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::cend()const Chris@16: const_iterator cend() const; Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::rbegin() Chris@16: reverse_iterator rbegin(); Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::rbegin()const Chris@16: const_reverse_iterator rbegin() const; Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::crbegin()const Chris@16: const_reverse_iterator crbegin() const; Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::rend() Chris@16: reverse_iterator rend(); Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::rend()const Chris@16: const_reverse_iterator rend() const; Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::crend()const Chris@16: const_reverse_iterator crend() const; Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::container_from_end_iterator(iterator) Chris@16: static sgtree_impl &container_from_end_iterator(iterator end_iterator); Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::container_from_end_iterator(const_iterator) Chris@16: static const sgtree_impl &container_from_end_iterator(const_iterator end_iterator); Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::container_from_iterator(iterator) Chris@16: static sgtree_impl &container_from_iterator(iterator it); Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::container_from_iterator(const_iterator) Chris@16: static const sgtree_impl &container_from_iterator(const_iterator it); Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::key_comp()const Chris@16: key_compare key_comp() const; Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::value_comp()const Chris@16: value_compare value_comp() const; Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::empty()const Chris@16: bool empty() const; Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::size()const Chris@16: size_type size() const; Chris@16: Chris@16: #endif //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::swap Chris@16: void swap(sgtree_impl& other) Chris@16: { Chris@16: //This can throw Chris@16: this->tree_type::swap(static_cast(other)); Chris@101: ::boost::adl_move_swap(this->get_alpha_traits(), other.get_alpha_traits()); Chris@16: } Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::clone_from Chris@16: //! Additional notes: it also copies the alpha factor from the source container. Chris@16: template Chris@16: void clone_from(const sgtree_impl &src, Cloner cloner, Disposer disposer) Chris@16: { Chris@16: this->tree_type::clone_from(src, cloner, disposer); Chris@16: this->get_alpha_traits() = src.get_alpha_traits(); Chris@16: } Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::insert_equal(reference) Chris@16: iterator insert_equal(reference value) Chris@16: { Chris@101: detail::key_nodeptr_comp Chris@101: key_node_comp(this->value_comp(), &this->get_value_traits()); Chris@101: node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); Chris@16: if(safemode_or_autounlink) Chris@16: BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(node_algorithms::unique(to_insert)); Chris@16: std::size_t max_tree_size = (std::size_t)this->max_tree_size_; Chris@16: node_ptr p = node_algorithms::insert_equal_upper_bound Chris@16: (this->tree_type::header_ptr(), to_insert, key_node_comp Chris@16: , (size_type)this->size(), this->get_h_alpha_func(), max_tree_size); Chris@16: this->tree_type::sz_traits().increment(); Chris@16: this->max_tree_size_ = (size_type)max_tree_size; Chris@101: return iterator(p, this->priv_value_traits_ptr()); Chris@16: } Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::insert_equal(const_iterator,reference) Chris@16: iterator insert_equal(const_iterator hint, reference value) Chris@16: { Chris@101: detail::key_nodeptr_comp Chris@101: key_node_comp(this->value_comp(), &this->get_value_traits()); Chris@101: node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); Chris@16: if(safemode_or_autounlink) Chris@16: BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(node_algorithms::unique(to_insert)); Chris@16: std::size_t max_tree_size = (std::size_t)this->max_tree_size_; Chris@16: node_ptr p = node_algorithms::insert_equal Chris@16: (this->tree_type::header_ptr(), hint.pointed_node(), to_insert, key_node_comp Chris@16: , (std::size_t)this->size(), this->get_h_alpha_func(), max_tree_size); Chris@16: this->tree_type::sz_traits().increment(); Chris@16: this->max_tree_size_ = (size_type)max_tree_size; Chris@101: return iterator(p, this->priv_value_traits_ptr()); Chris@16: } Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::insert_equal(Iterator,Iterator) Chris@16: template Chris@16: void insert_equal(Iterator b, Iterator e) Chris@16: { Chris@16: iterator iend(this->end()); Chris@16: for (; b != e; ++b) Chris@16: this->insert_equal(iend, *b); Chris@16: } Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::insert_unique(reference) Chris@16: std::pair insert_unique(reference value) Chris@16: { Chris@16: insert_commit_data commit_data; Chris@16: std::pair ret = insert_unique_check(value, this->value_comp(), commit_data); Chris@16: if(!ret.second) Chris@16: return ret; Chris@16: return std::pair (insert_unique_commit(value, commit_data), true); Chris@16: } Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::insert_unique(const_iterator,reference) Chris@16: iterator insert_unique(const_iterator hint, reference value) Chris@16: { Chris@16: insert_commit_data commit_data; Chris@16: std::pair ret = insert_unique_check(hint, value, this->value_comp(), commit_data); Chris@16: if(!ret.second) Chris@16: return ret.first; Chris@16: return insert_unique_commit(value, commit_data); Chris@16: } Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::insert_unique_check(const KeyType&,KeyValueCompare,insert_commit_data&) Chris@16: template Chris@16: std::pair insert_unique_check Chris@16: (const KeyType &key, KeyValueCompare key_value_comp, insert_commit_data &commit_data) Chris@16: { Chris@101: detail::key_nodeptr_comp Chris@101: comp(key_value_comp, &this->get_value_traits()); Chris@16: std::pair ret = Chris@16: (node_algorithms::insert_unique_check Chris@16: (this->tree_type::header_ptr(), key, comp, commit_data)); Chris@101: return std::pair(iterator(ret.first, this->priv_value_traits_ptr()), ret.second); Chris@16: } Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::insert_unique_check(const_iterator,const KeyType&,KeyValueCompare,insert_commit_data&) Chris@16: template Chris@16: std::pair insert_unique_check Chris@16: (const_iterator hint, const KeyType &key Chris@16: ,KeyValueCompare key_value_comp, insert_commit_data &commit_data) Chris@16: { Chris@101: detail::key_nodeptr_comp Chris@101: comp(key_value_comp, &this->get_value_traits()); Chris@16: std::pair ret = Chris@16: (node_algorithms::insert_unique_check Chris@16: (this->tree_type::header_ptr(), hint.pointed_node(), key, comp, commit_data)); Chris@101: return std::pair(iterator(ret.first, this->priv_value_traits_ptr()), ret.second); Chris@16: } Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::insert_unique_commit Chris@16: iterator insert_unique_commit(reference value, const insert_commit_data &commit_data) Chris@16: { Chris@101: node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); Chris@16: if(safemode_or_autounlink) Chris@16: BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(node_algorithms::unique(to_insert)); Chris@16: std::size_t max_tree_size = (std::size_t)this->max_tree_size_; Chris@16: node_algorithms::insert_unique_commit Chris@16: ( this->tree_type::header_ptr(), to_insert, commit_data Chris@16: , (std::size_t)this->size(), this->get_h_alpha_func(), max_tree_size); Chris@16: this->tree_type::sz_traits().increment(); Chris@16: this->max_tree_size_ = (size_type)max_tree_size; Chris@101: return iterator(to_insert, this->priv_value_traits_ptr()); Chris@16: } Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::insert_unique(Iterator,Iterator) Chris@16: template Chris@16: void insert_unique(Iterator b, Iterator e) Chris@16: { Chris@16: if(this->empty()){ Chris@16: iterator iend(this->end()); Chris@16: for (; b != e; ++b) Chris@16: this->insert_unique(iend, *b); Chris@16: } Chris@16: else{ Chris@16: for (; b != e; ++b) Chris@16: this->insert_unique(*b); Chris@16: } Chris@16: } Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::insert_before Chris@16: iterator insert_before(const_iterator pos, reference value) Chris@16: { Chris@101: node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); Chris@16: if(safemode_or_autounlink) Chris@16: BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(node_algorithms::unique(to_insert)); Chris@16: std::size_t max_tree_size = (std::size_t)this->max_tree_size_; Chris@16: node_ptr p = node_algorithms::insert_before Chris@16: ( this->tree_type::header_ptr(), pos.pointed_node(), to_insert Chris@16: , (size_type)this->size(), this->get_h_alpha_func(), max_tree_size); Chris@16: this->tree_type::sz_traits().increment(); Chris@16: this->max_tree_size_ = (size_type)max_tree_size; Chris@101: return iterator(p, this->priv_value_traits_ptr()); Chris@16: } Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::push_back Chris@16: void push_back(reference value) Chris@16: { Chris@101: node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); Chris@16: if(safemode_or_autounlink) Chris@16: BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(node_algorithms::unique(to_insert)); Chris@16: std::size_t max_tree_size = (std::size_t)this->max_tree_size_; Chris@16: node_algorithms::push_back Chris@16: ( this->tree_type::header_ptr(), to_insert Chris@16: , (size_type)this->size(), this->get_h_alpha_func(), max_tree_size); Chris@16: this->tree_type::sz_traits().increment(); Chris@16: this->max_tree_size_ = (size_type)max_tree_size; Chris@16: } Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::push_front Chris@16: void push_front(reference value) Chris@16: { Chris@101: node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); Chris@16: if(safemode_or_autounlink) Chris@16: BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(node_algorithms::unique(to_insert)); Chris@16: std::size_t max_tree_size = (std::size_t)this->max_tree_size_; Chris@16: node_algorithms::push_front Chris@16: ( this->tree_type::header_ptr(), to_insert Chris@16: , (size_type)this->size(), this->get_h_alpha_func(), max_tree_size); Chris@16: this->tree_type::sz_traits().increment(); Chris@16: this->max_tree_size_ = (size_type)max_tree_size; Chris@16: } Chris@16: Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::erase(const_iterator) Chris@16: iterator erase(const_iterator i) Chris@16: { Chris@16: const_iterator ret(i); Chris@16: ++ret; Chris@16: node_ptr to_erase(i.pointed_node()); Chris@16: if(safemode_or_autounlink) Chris@16: BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!node_algorithms::unique(to_erase)); Chris@16: std::size_t max_tree_size = this->max_tree_size_; Chris@16: node_algorithms::erase Chris@16: ( this->tree_type::header_ptr(), to_erase, (std::size_t)this->size() Chris@16: , max_tree_size, this->get_alpha_by_max_size_func()); Chris@16: this->max_tree_size_ = (size_type)max_tree_size; Chris@16: this->tree_type::sz_traits().decrement(); Chris@16: if(safemode_or_autounlink) Chris@16: node_algorithms::init(to_erase); Chris@16: return ret.unconst(); Chris@16: } Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::erase(const_iterator,const_iterator) Chris@16: iterator erase(const_iterator b, const_iterator e) Chris@16: { size_type n; return private_erase(b, e, n); } Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::erase(const_reference) Chris@16: size_type erase(const_reference value) Chris@16: { return this->erase(value, this->value_comp()); } Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::erase(const KeyType&,KeyValueCompare) Chris@16: template Chris@16: size_type erase(const KeyType& key, KeyValueCompare comp Chris@16: /// @cond Chris@16: , typename detail::enable_if_c::value >::type * = 0 Chris@16: /// @endcond Chris@16: ) Chris@16: { Chris@16: std::pair p = this->equal_range(key, comp); Chris@16: size_type n; Chris@16: private_erase(p.first, p.second, n); Chris@16: return n; Chris@16: } Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::erase_and_dispose(const_iterator,Disposer) Chris@16: template Chris@16: iterator erase_and_dispose(const_iterator i, Disposer disposer) Chris@16: { Chris@16: node_ptr to_erase(i.pointed_node()); Chris@16: iterator ret(this->erase(i)); Chris@101: disposer(this->get_value_traits().to_value_ptr(to_erase)); Chris@16: return ret; Chris@16: } Chris@16: Chris@16: #if !defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) Chris@16: template Chris@16: iterator erase_and_dispose(iterator i, Disposer disposer) Chris@16: { return this->erase_and_dispose(const_iterator(i), disposer); } Chris@16: #endif Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::erase_and_dispose(const_iterator,const_iterator,Disposer) Chris@16: template Chris@16: iterator erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer) Chris@16: { size_type n; return private_erase(b, e, n, disposer); } Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::erase_and_dispose(const_reference, Disposer) Chris@16: template Chris@16: size_type erase_and_dispose(const_reference value, Disposer disposer) Chris@16: { Chris@16: std::pair p = this->equal_range(value); Chris@16: size_type n; Chris@16: private_erase(p.first, p.second, n, disposer); Chris@16: return n; Chris@16: } Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::erase_and_dispose(const KeyType&,KeyValueCompare,Disposer) Chris@16: template Chris@16: size_type erase_and_dispose(const KeyType& key, KeyValueCompare comp, Disposer disposer Chris@16: /// @cond Chris@16: , typename detail::enable_if_c::value >::type * = 0 Chris@16: /// @endcond Chris@16: ) Chris@16: { Chris@16: std::pair p = this->equal_range(key, comp); Chris@16: size_type n; Chris@16: private_erase(p.first, p.second, n, disposer); Chris@16: return n; Chris@16: } Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::clear Chris@16: void clear() Chris@16: { Chris@16: tree_type::clear(); Chris@16: this->max_tree_size_ = 0; Chris@16: } Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::clear_and_dispose Chris@16: template Chris@16: void clear_and_dispose(Disposer disposer) Chris@16: { Chris@16: tree_type::clear_and_dispose(disposer); Chris@16: this->max_tree_size_ = 0; Chris@16: } Chris@16: Chris@16: #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED Chris@16: //! @copydoc ::boost::intrusive::bstree::count(const_reference)const Chris@16: size_type count(const_reference value) const; Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::count(const KeyType&,KeyValueCompare)const Chris@16: template Chris@16: size_type count(const KeyType& key, KeyValueCompare comp) const; Chris@101: Chris@16: //! @copydoc ::boost::intrusive::bstree::lower_bound(const_reference) Chris@16: iterator lower_bound(const_reference value); Chris@101: Chris@16: //! @copydoc ::boost::intrusive::bstree::lower_bound(const KeyType&,KeyValueCompare) Chris@16: template Chris@16: iterator lower_bound(const KeyType& key, KeyValueCompare comp); Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::lower_bound(const_reference)const Chris@16: const_iterator lower_bound(const_reference value) const; Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::lower_bound(const KeyType&,KeyValueCompare)const Chris@16: template Chris@16: const_iterator lower_bound(const KeyType& key, KeyValueCompare comp) const; Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::upper_bound(const_reference) Chris@16: iterator upper_bound(const_reference value); Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::upper_bound(const KeyType&,KeyValueCompare) Chris@16: template Chris@16: iterator upper_bound(const KeyType& key, KeyValueCompare comp); Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::upper_bound(const_reference)const Chris@16: const_iterator upper_bound(const_reference value) const; Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::upper_bound(const KeyType&,KeyValueCompare)const Chris@16: template Chris@16: const_iterator upper_bound(const KeyType& key, KeyValueCompare comp) const; Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::find(const_reference) Chris@16: iterator find(const_reference value); Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::find(const KeyType&,KeyValueCompare) Chris@16: template Chris@16: iterator find(const KeyType& key, KeyValueCompare comp); Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::find(const_reference)const Chris@16: const_iterator find(const_reference value) const; Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::find(const KeyType&,KeyValueCompare)const Chris@16: template Chris@16: const_iterator find(const KeyType& key, KeyValueCompare comp) const; Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::equal_range(const_reference) Chris@16: std::pair equal_range(const_reference value); Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::equal_range(const KeyType&,KeyValueCompare) Chris@16: template Chris@16: std::pair equal_range(const KeyType& key, KeyValueCompare comp); Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::equal_range(const_reference)const Chris@16: std::pair Chris@16: equal_range(const_reference value) const; Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::equal_range(const KeyType&,KeyValueCompare)const Chris@16: template Chris@16: std::pair Chris@16: equal_range(const KeyType& key, KeyValueCompare comp) const; Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::bounded_range(const_reference,const_reference,bool,bool) Chris@16: std::pair bounded_range Chris@16: (const_reference lower_value, const_reference upper_value, bool left_closed, bool right_closed); Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::bounded_range(const KeyType&,const KeyType&,KeyValueCompare,bool,bool) Chris@16: template Chris@16: std::pair bounded_range Chris@16: (const KeyType& lower_key, const KeyType& upper_key, KeyValueCompare comp, bool left_closed, bool right_closed); Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::bounded_range(const_reference,const_reference,bool,bool)const Chris@16: std::pair Chris@16: bounded_range(const_reference lower_value, const_reference upper_value, bool left_closed, bool right_closed) const; Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::bounded_range(const KeyType&,const KeyType&,KeyValueCompare,bool,bool)const Chris@16: template Chris@16: std::pair bounded_range Chris@16: (const KeyType& lower_key, const KeyType& upper_key, KeyValueCompare comp, bool left_closed, bool right_closed) const; Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::s_iterator_to(reference) Chris@16: static iterator s_iterator_to(reference value); Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::s_iterator_to(const_reference) Chris@16: static const_iterator s_iterator_to(const_reference value); Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::iterator_to(reference) Chris@16: iterator iterator_to(reference value); Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::iterator_to(const_reference)const Chris@16: const_iterator iterator_to(const_reference value) const; Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::init_node(reference) Chris@16: static void init_node(reference value); Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::unlink_leftmost_without_rebalance Chris@16: pointer unlink_leftmost_without_rebalance(); Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::replace_node Chris@16: void replace_node(iterator replace_this, reference with_this); Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::remove_node Chris@16: void remove_node(reference value); Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::rebalance Chris@16: void rebalance(); Chris@16: Chris@16: //! @copydoc ::boost::intrusive::bstree::rebalance_subtree Chris@16: iterator rebalance_subtree(iterator root); Chris@16: Chris@16: #endif //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED Chris@16: Chris@16: //! Returns: The balance factor (alpha) used in this tree Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@16: float balance_factor() const Chris@16: { return this->get_alpha_traits().get_alpha(); } Chris@16: Chris@16: //! Requires: new_alpha must be a value between 0.5 and 1.0 Chris@16: //! Chris@16: //! Effects: Establishes a new balance factor (alpha) and rebalances Chris@16: //! the tree if the new balance factor is stricter (less) than the old factor. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Linear to the elements in the subtree. Chris@16: void balance_factor(float new_alpha) Chris@16: { Chris@16: BOOST_INTRUSIVE_INVARIANT_ASSERT((new_alpha > 0.5f && new_alpha < 1.0f)); Chris@16: if(new_alpha < 0.5f && new_alpha >= 1.0f) return; Chris@16: Chris@16: //The alpha factor CAN't be changed if the fixed, floating operation-less Chris@16: //1/sqrt(2) alpha factor option is activated Chris@16: BOOST_STATIC_ASSERT((floating_point)); Chris@16: float old_alpha = this->get_alpha_traits().get_alpha(); Chris@16: this->get_alpha_traits().set_alpha(new_alpha); Chris@16: Chris@16: if(new_alpha < old_alpha){ Chris@16: this->max_tree_size_ = this->size(); Chris@16: this->rebalance(); Chris@16: } Chris@16: } Chris@16: Chris@16: /// @cond Chris@16: private: Chris@16: template Chris@16: iterator private_erase(const_iterator b, const_iterator e, size_type &n, Disposer disposer) Chris@16: { Chris@16: for(n = 0; b != e; ++n) Chris@16: this->erase_and_dispose(b++, disposer); Chris@16: return b.unconst(); Chris@16: } Chris@16: Chris@16: iterator private_erase(const_iterator b, const_iterator e, size_type &n) Chris@16: { Chris@16: for(n = 0; b != e; ++n) Chris@16: this->erase(b++); Chris@16: return b.unconst(); Chris@16: } Chris@16: /// @endcond Chris@16: }; Chris@16: Chris@16: #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) Chris@16: Chris@16: template Chris@16: bool operator< (const sgtree_impl &x, const sgtree_impl &y); Chris@16: Chris@16: template Chris@16: bool operator==(const sgtree_impl &x, const sgtree_impl &y); Chris@16: Chris@16: template Chris@16: bool operator!= (const sgtree_impl &x, const sgtree_impl &y); Chris@16: Chris@16: template Chris@16: bool operator>(const sgtree_impl &x, const sgtree_impl &y); Chris@16: Chris@16: template Chris@16: bool operator<=(const sgtree_impl &x, const sgtree_impl &y); Chris@16: Chris@16: template Chris@16: bool operator>=(const sgtree_impl &x, const sgtree_impl &y); Chris@16: Chris@16: template Chris@16: void swap(sgtree_impl &x, sgtree_impl &y); Chris@16: Chris@16: #endif //#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) Chris@16: Chris@16: //! Helper metafunction to define a \c sgtree that yields to the same type when the Chris@16: //! same options (either explicitly or implicitly) are used. Chris@16: #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) Chris@16: template Chris@16: #else Chris@16: template Chris@16: #endif Chris@16: struct make_sgtree Chris@16: { Chris@16: /// @cond Chris@16: typedef typename pack_options Chris@16: < sgtree_defaults, Chris@16: #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) Chris@101: O1, O2, O3, O4, O5 Chris@16: #else Chris@16: Options... Chris@16: #endif Chris@16: >::type packed_options; Chris@16: Chris@16: typedef typename detail::get_value_traits Chris@16: ::type value_traits; Chris@16: Chris@16: typedef sgtree_impl Chris@16: < value_traits Chris@16: , typename packed_options::compare Chris@16: , typename packed_options::size_type Chris@16: , packed_options::floating_point Chris@101: , typename packed_options::header_holder_type Chris@16: > implementation_defined; Chris@16: /// @endcond Chris@16: typedef implementation_defined type; Chris@16: }; Chris@16: Chris@16: Chris@16: #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED Chris@16: Chris@16: #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) Chris@101: template Chris@16: #else Chris@16: template Chris@16: #endif Chris@16: class sgtree Chris@16: : public make_sgtree::type Chris@16: { Chris@16: typedef typename make_sgtree Chris@16: ::type Base; Chris@16: BOOST_MOVABLE_BUT_NOT_COPYABLE(sgtree) Chris@16: Chris@16: public: Chris@16: typedef typename Base::value_compare value_compare; Chris@16: typedef typename Base::value_traits value_traits; Chris@16: typedef typename Base::iterator iterator; Chris@16: typedef typename Base::const_iterator const_iterator; Chris@16: typedef typename Base::reverse_iterator reverse_iterator; Chris@16: typedef typename Base::const_reverse_iterator const_reverse_iterator; Chris@16: Chris@16: //Assert if passed value traits are compatible with the type Chris@101: BOOST_STATIC_ASSERT((detail::is_same::value)); Chris@16: Chris@16: explicit sgtree( const value_compare &cmp = value_compare() Chris@16: , const value_traits &v_traits = value_traits()) Chris@16: : Base(cmp, v_traits) Chris@16: {} Chris@16: Chris@16: template Chris@16: sgtree( bool unique, Iterator b, Iterator e Chris@16: , const value_compare &cmp = value_compare() Chris@16: , const value_traits &v_traits = value_traits()) Chris@16: : Base(unique, b, e, cmp, v_traits) Chris@16: {} Chris@16: Chris@16: sgtree(BOOST_RV_REF(sgtree) x) Chris@101: : Base(BOOST_MOVE_BASE(Base, x)) Chris@16: {} Chris@16: Chris@16: sgtree& operator=(BOOST_RV_REF(sgtree) x) Chris@101: { return static_cast(this->Base::operator=(BOOST_MOVE_BASE(Base, x))); } Chris@16: Chris@16: static sgtree &container_from_end_iterator(iterator end_iterator) Chris@16: { return static_cast(Base::container_from_end_iterator(end_iterator)); } Chris@16: Chris@16: static const sgtree &container_from_end_iterator(const_iterator end_iterator) Chris@16: { return static_cast(Base::container_from_end_iterator(end_iterator)); } Chris@16: Chris@16: static sgtree &container_from_iterator(iterator it) Chris@16: { return static_cast(Base::container_from_iterator(it)); } Chris@16: Chris@16: static const sgtree &container_from_iterator(const_iterator it) Chris@16: { return static_cast(Base::container_from_iterator(it)); } Chris@16: }; Chris@16: Chris@16: #endif Chris@16: Chris@16: } //namespace intrusive Chris@16: } //namespace boost Chris@16: Chris@16: #include Chris@16: Chris@16: #endif //BOOST_INTRUSIVE_SGTREE_HPP