splay_set.hpp 48 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118
  1. /////////////////////////////////////////////////////////////////////////////
  2. //
  3. // (C) Copyright Ion Gaztanaga 2007-2014
  4. //
  5. // Distributed under the Boost Software License, Version 1.0.
  6. // (See accompanying file LICENSE_1_0.txt or copy at
  7. // http://www.boost.org/LICENSE_1_0.txt)
  8. //
  9. // See http://www.boost.org/libs/intrusive for documentation.
  10. //
  11. /////////////////////////////////////////////////////////////////////////////
  12. #ifndef BOOST_INTRUSIVE_SPLAY_SET_HPP
  13. #define BOOST_INTRUSIVE_SPLAY_SET_HPP
  14. #include <boost/intrusive/detail/config_begin.hpp>
  15. #include <boost/intrusive/intrusive_fwd.hpp>
  16. #include <boost/intrusive/splaytree.hpp>
  17. #include <boost/intrusive/detail/mpl.hpp>
  18. #include <boost/move/utility_core.hpp>
  19. #if defined(BOOST_HAS_PRAGMA_ONCE)
  20. # pragma once
  21. #endif
  22. #if !defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
  23. template<class ValueTraits, class VoidOrKeyOfValue, class Compare, class SizeType, bool ConstantTimeSize, typename HeaderHolder>
  24. class splay_multiset_impl;
  25. #endif
  26. namespace boost {
  27. namespace intrusive {
  28. //! The class template splay_set is an intrusive container, that mimics most of
  29. //! the interface of std::set as described in the C++ standard.
  30. //!
  31. //! The template parameter \c T is the type to be managed by the container.
  32. //! The user can specify additional options and if no options are provided
  33. //! default options are used.
  34. //!
  35. //! The container supports the following options:
  36. //! \c base_hook<>/member_hook<>/value_traits<>,
  37. //! \c constant_time_size<>, \c size_type<> and
  38. //! \c compare<>.
  39. #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
  40. template<class T, class ...Options>
  41. #else
  42. template<class ValueTraits, class VoidOrKeyOfValue, class Compare, class SizeType, bool ConstantTimeSize, typename HeaderHolder>
  43. #endif
  44. class splay_set_impl
  45. #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
  46. : public splaytree_impl<ValueTraits, VoidOrKeyOfValue, Compare, SizeType, ConstantTimeSize, HeaderHolder>
  47. #endif
  48. {
  49. /// @cond
  50. typedef splaytree_impl<ValueTraits, VoidOrKeyOfValue, Compare, SizeType, ConstantTimeSize, HeaderHolder> tree_type;
  51. BOOST_MOVABLE_BUT_NOT_COPYABLE(splay_set_impl)
  52. typedef tree_type implementation_defined;
  53. /// @endcond
  54. public:
  55. typedef typename implementation_defined::value_type value_type;
  56. typedef typename implementation_defined::key_type key_type;
  57. typedef typename implementation_defined::key_of_value key_of_value;
  58. typedef typename implementation_defined::value_traits value_traits;
  59. typedef typename implementation_defined::pointer pointer;
  60. typedef typename implementation_defined::const_pointer const_pointer;
  61. typedef typename implementation_defined::reference reference;
  62. typedef typename implementation_defined::const_reference const_reference;
  63. typedef typename implementation_defined::difference_type difference_type;
  64. typedef typename implementation_defined::size_type size_type;
  65. typedef typename implementation_defined::value_compare value_compare;
  66. typedef typename implementation_defined::key_compare key_compare;
  67. typedef typename implementation_defined::iterator iterator;
  68. typedef typename implementation_defined::const_iterator const_iterator;
  69. typedef typename implementation_defined::reverse_iterator reverse_iterator;
  70. typedef typename implementation_defined::const_reverse_iterator const_reverse_iterator;
  71. typedef typename implementation_defined::insert_commit_data insert_commit_data;
  72. typedef typename implementation_defined::node_traits node_traits;
  73. typedef typename implementation_defined::node node;
  74. typedef typename implementation_defined::node_ptr node_ptr;
  75. typedef typename implementation_defined::const_node_ptr const_node_ptr;
  76. typedef typename implementation_defined::node_algorithms node_algorithms;
  77. static const bool constant_time_size = tree_type::constant_time_size;
  78. public:
  79. //! @copydoc ::boost::intrusive::splaytree::splaytree()
  80. splay_set_impl()
  81. : tree_type()
  82. {}
  83. //! @copydoc ::boost::intrusive::splaytree::splaytree(const key_compare &,const value_traits &)
  84. explicit splay_set_impl( const key_compare &cmp, const value_traits &v_traits = value_traits())
  85. : tree_type(cmp, v_traits)
  86. {}
  87. //! @copydoc ::boost::intrusive::splaytree::splaytree(bool,Iterator,Iterator,const key_compare &,const value_traits &)
  88. template<class Iterator>
  89. splay_set_impl( Iterator b, Iterator e
  90. , const key_compare &cmp = key_compare()
  91. , const value_traits &v_traits = value_traits())
  92. : tree_type(true, b, e, cmp, v_traits)
  93. {}
  94. //! @copydoc ::boost::intrusive::splaytree::splaytree(splaytree &&)
  95. splay_set_impl(BOOST_RV_REF(splay_set_impl) x)
  96. : tree_type(BOOST_MOVE_BASE(tree_type, x))
  97. {}
  98. //! @copydoc ::boost::intrusive::splaytree::operator=(splaytree &&)
  99. splay_set_impl& operator=(BOOST_RV_REF(splay_set_impl) x)
  100. { return static_cast<splay_set_impl&>(tree_type::operator=(BOOST_MOVE_BASE(tree_type, x))); }
  101. #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
  102. //! @copydoc ::boost::intrusive::splaytree::~splaytree()
  103. ~splay_set_impl();
  104. //! @copydoc ::boost::intrusive::splaytree::begin()
  105. iterator begin() BOOST_NOEXCEPT;
  106. //! @copydoc ::boost::intrusive::splaytree::begin()const
  107. const_iterator begin() const BOOST_NOEXCEPT;
  108. //! @copydoc ::boost::intrusive::splaytree::cbegin()const
  109. const_iterator cbegin() const BOOST_NOEXCEPT;
  110. //! @copydoc ::boost::intrusive::splaytree::end()
  111. iterator end() BOOST_NOEXCEPT;
  112. //! @copydoc ::boost::intrusive::splaytree::end()const
  113. const_iterator end() const BOOST_NOEXCEPT;
  114. //! @copydoc ::boost::intrusive::splaytree::cend()const
  115. const_iterator cend() const BOOST_NOEXCEPT;
  116. //! @copydoc ::boost::intrusive::splaytree::rbegin()
  117. reverse_iterator rbegin() BOOST_NOEXCEPT;
  118. //! @copydoc ::boost::intrusive::splaytree::rbegin()const
  119. const_reverse_iterator rbegin() const BOOST_NOEXCEPT;
  120. //! @copydoc ::boost::intrusive::splaytree::crbegin()const
  121. const_reverse_iterator crbegin() const BOOST_NOEXCEPT;
  122. //! @copydoc ::boost::intrusive::splaytree::rend()
  123. reverse_iterator rend() BOOST_NOEXCEPT;
  124. //! @copydoc ::boost::intrusive::splaytree::rend()const
  125. const_reverse_iterator rend() const BOOST_NOEXCEPT;
  126. //! @copydoc ::boost::intrusive::splaytree::crend()const
  127. const_reverse_iterator crend() const BOOST_NOEXCEPT;
  128. //! @copydoc ::boost::intrusive::splaytree::root()
  129. iterator root() BOOST_NOEXCEPT;
  130. //! @copydoc ::boost::intrusive::splaytree::root()const
  131. const_iterator root() const BOOST_NOEXCEPT;
  132. //! @copydoc ::boost::intrusive::splaytree::croot()const
  133. const_iterator croot() const BOOST_NOEXCEPT;
  134. //! @copydoc ::boost::intrusive::splaytree::container_from_end_iterator(iterator)
  135. static splay_set_impl &container_from_end_iterator(iterator end_iterator) BOOST_NOEXCEPT;
  136. //! @copydoc ::boost::intrusive::splaytree::container_from_end_iterator(const_iterator)
  137. static const splay_set_impl &container_from_end_iterator(const_iterator end_iterator) BOOST_NOEXCEPT;
  138. //! @copydoc ::boost::intrusive::splaytree::container_from_iterator(iterator)
  139. static splay_set_impl &container_from_iterator(iterator it) BOOST_NOEXCEPT;
  140. //! @copydoc ::boost::intrusive::splaytree::container_from_iterator(const_iterator)
  141. static const splay_set_impl &container_from_iterator(const_iterator it) BOOST_NOEXCEPT;
  142. //! @copydoc ::boost::intrusive::splaytree::key_comp()const
  143. key_compare key_comp() const;
  144. //! @copydoc ::boost::intrusive::splaytree::value_comp()const
  145. value_compare value_comp() const;
  146. //! @copydoc ::boost::intrusive::splaytree::empty()const
  147. bool empty() const BOOST_NOEXCEPT;
  148. //! @copydoc ::boost::intrusive::splaytree::size()const
  149. size_type size() const BOOST_NOEXCEPT;
  150. //! @copydoc ::boost::intrusive::splaytree::swap
  151. void swap(splay_set_impl& other);
  152. //! @copydoc ::boost::intrusive::splaytree::clone_from(const splaytree&,Cloner,Disposer)
  153. template <class Cloner, class Disposer>
  154. void clone_from(const splay_set_impl &src, Cloner cloner, Disposer disposer);
  155. #else
  156. using tree_type::clone_from;
  157. #endif //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
  158. //! @copydoc ::boost::intrusive::splaytree::clone_from(splaytree&&,Cloner,Disposer)
  159. template <class Cloner, class Disposer>
  160. void clone_from(BOOST_RV_REF(splay_set_impl) src, Cloner cloner, Disposer disposer)
  161. { tree_type::clone_from(BOOST_MOVE_BASE(tree_type, src), cloner, disposer); }
  162. //! @copydoc ::boost::intrusive::splaytree::insert_unique(reference)
  163. std::pair<iterator, bool> insert(reference value)
  164. { return tree_type::insert_unique(value); }
  165. //! @copydoc ::boost::intrusive::splaytree::insert_unique(const_iterator,reference)
  166. iterator insert(const_iterator hint, reference value)
  167. { return tree_type::insert_unique(hint, value); }
  168. //! @copydoc ::boost::intrusive::rbtree::insert_unique_check(const key_type&,insert_commit_data&)
  169. std::pair<iterator, bool> insert_check
  170. (const key_type &key, insert_commit_data &commit_data)
  171. { return tree_type::insert_unique_check(key, commit_data); }
  172. //! @copydoc ::boost::intrusive::rbtree::insert_unique_check(const_iterator,const key_type&,insert_commit_data&)
  173. std::pair<iterator, bool> insert_check
  174. (const_iterator hint, const key_type &key
  175. ,insert_commit_data &commit_data)
  176. { return tree_type::insert_unique_check(hint, key, commit_data); }
  177. //! @copydoc ::boost::intrusive::splaytree::insert_unique_check(const KeyType&,KeyTypeKeyCompare,insert_commit_data&)
  178. template<class KeyType, class KeyTypeKeyCompare>
  179. std::pair<iterator, bool> insert_check
  180. (const KeyType &key, KeyTypeKeyCompare comp, insert_commit_data &commit_data)
  181. { return tree_type::insert_unique_check(key, comp, commit_data); }
  182. //! @copydoc ::boost::intrusive::splaytree::insert_unique_check(const_iterator,const KeyType&,KeyTypeKeyCompare,insert_commit_data&)
  183. template<class KeyType, class KeyTypeKeyCompare>
  184. std::pair<iterator, bool> insert_check
  185. (const_iterator hint, const KeyType &key
  186. ,KeyTypeKeyCompare comp, insert_commit_data &commit_data)
  187. { return tree_type::insert_unique_check(hint, key, comp, commit_data); }
  188. //! @copydoc ::boost::intrusive::splaytree::insert_unique(Iterator,Iterator)
  189. template<class Iterator>
  190. void insert(Iterator b, Iterator e)
  191. { tree_type::insert_unique(b, e); }
  192. //! @copydoc ::boost::intrusive::splaytree::insert_unique_commit
  193. iterator insert_commit(reference value, const insert_commit_data &commit_data) BOOST_NOEXCEPT
  194. { return tree_type::insert_unique_commit(value, commit_data); }
  195. #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
  196. //! @copydoc ::boost::intrusive::splaytree::insert_before
  197. iterator insert_before(const_iterator pos, reference value) BOOST_NOEXCEPT;
  198. //! @copydoc ::boost::intrusive::splaytree::push_back
  199. void push_back(reference value) BOOST_NOEXCEPT;
  200. //! @copydoc ::boost::intrusive::splaytree::push_front
  201. void push_front(reference value) BOOST_NOEXCEPT;
  202. //! @copydoc ::boost::intrusive::splaytree::erase(const_iterator)
  203. iterator erase(const_iterator i) BOOST_NOEXCEPT;
  204. //! @copydoc ::boost::intrusive::splaytree::erase(const_iterator,const_iterator)
  205. iterator erase(const_iterator b, const_iterator e) BOOST_NOEXCEPT;
  206. //! @copydoc ::boost::intrusive::splaytree::erase(const key_type &)
  207. size_type erase(const key_type &key);
  208. //! @copydoc ::boost::intrusive::splaytree::erase(const KeyType&,KeyTypeKeyCompare)
  209. template<class KeyType, class KeyTypeKeyCompare>
  210. size_type erase(const KeyType& key, KeyTypeKeyCompare comp);
  211. //! @copydoc ::boost::intrusive::splaytree::erase_and_dispose(const_iterator,Disposer)
  212. template<class Disposer>
  213. iterator erase_and_dispose(const_iterator i, Disposer disposer) BOOST_NOEXCEPT;
  214. //! @copydoc ::boost::intrusive::splaytree::erase_and_dispose(const_iterator,const_iterator,Disposer)
  215. template<class Disposer>
  216. iterator erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer) BOOST_NOEXCEPT;
  217. //! @copydoc ::boost::intrusive::splaytree::erase_and_dispose(const key_type &, Disposer)
  218. template<class Disposer>
  219. size_type erase_and_dispose(const key_type &key, Disposer disposer);
  220. //! @copydoc ::boost::intrusive::splaytree::erase_and_dispose(const KeyType&,KeyTypeKeyCompare,Disposer)
  221. template<class KeyType, class KeyTypeKeyCompare, class Disposer>
  222. size_type erase_and_dispose(const KeyType& key, KeyTypeKeyCompare comp, Disposer disposer);
  223. //! @copydoc ::boost::intrusive::splaytree::clear
  224. void clear() BOOST_NOEXCEPT;
  225. //! @copydoc ::boost::intrusive::splaytree::clear_and_dispose
  226. template<class Disposer>
  227. void clear_and_dispose(Disposer disposer) BOOST_NOEXCEPT;
  228. #endif // #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
  229. //! @copydoc ::boost::intrusive::splaytree::count(const key_type &)const
  230. size_type count(const key_type &key) const
  231. { return static_cast<size_type>(this->tree_type::find(key) != this->tree_type::cend()); }
  232. //! @copydoc ::boost::intrusive::splaytree::count(const KeyType&,KeyTypeKeyCompare)const
  233. template<class KeyType, class KeyTypeKeyCompare>
  234. size_type count(const KeyType& key, KeyTypeKeyCompare comp) const
  235. { return static_cast<size_type>(this->tree_type::find(key, comp) != this->tree_type::cend()); }
  236. #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
  237. //! @copydoc ::boost::intrusive::splaytree::count(const key_type &)const
  238. size_type count(const key_type &key) const;
  239. //! @copydoc ::boost::intrusive::splaytree::count(const KeyType&,KeyTypeKeyCompare)const
  240. template<class KeyType, class KeyTypeKeyCompare>
  241. size_type count(const KeyType& key, KeyTypeKeyCompare comp) const;
  242. //! @copydoc ::boost::intrusive::splaytree::lower_bound(const key_type &)
  243. iterator lower_bound(const key_type &key);
  244. //! @copydoc ::boost::intrusive::splaytree::lower_bound(const KeyType&,KeyTypeKeyCompare)
  245. template<class KeyType, class KeyTypeKeyCompare>
  246. iterator lower_bound(const KeyType& key, KeyTypeKeyCompare comp);
  247. //! @copydoc ::boost::intrusive::splaytree::lower_bound(const key_type &)const
  248. const_iterator lower_bound(const key_type &key) const;
  249. //! @copydoc ::boost::intrusive::splaytree::lower_bound(const KeyType&,KeyTypeKeyCompare)const
  250. template<class KeyType, class KeyTypeKeyCompare>
  251. const_iterator lower_bound(const KeyType& key, KeyTypeKeyCompare comp) const;
  252. //! @copydoc ::boost::intrusive::splaytree::upper_bound(const key_type &)
  253. iterator upper_bound(const key_type &key);
  254. //! @copydoc ::boost::intrusive::splaytree::upper_bound(const KeyType&,KeyTypeKeyCompare)
  255. template<class KeyType, class KeyTypeKeyCompare>
  256. iterator upper_bound(const KeyType& key, KeyTypeKeyCompare comp);
  257. //! @copydoc ::boost::intrusive::splaytree::upper_bound(const key_type &)const
  258. const_iterator upper_bound(const key_type &key) const;
  259. //! @copydoc ::boost::intrusive::splaytree::upper_bound(const KeyType&,KeyTypeKeyCompare)const
  260. template<class KeyType, class KeyTypeKeyCompare>
  261. const_iterator upper_bound(const KeyType& key, KeyTypeKeyCompare comp) const;
  262. //! @copydoc ::boost::intrusive::splaytree::find(const key_type &)
  263. iterator find(const key_type &key);
  264. //! @copydoc ::boost::intrusive::splaytree::find(const KeyType&,KeyTypeKeyCompare)
  265. template<class KeyType, class KeyTypeKeyCompare>
  266. iterator find(const KeyType& key, KeyTypeKeyCompare comp);
  267. //! @copydoc ::boost::intrusive::splaytree::find(const key_type &)const
  268. const_iterator find(const key_type &key) const;
  269. //! @copydoc ::boost::intrusive::splaytree::find(const KeyType&,KeyTypeKeyCompare)const
  270. template<class KeyType, class KeyTypeKeyCompare>
  271. const_iterator find(const KeyType& key, KeyTypeKeyCompare comp) const;
  272. #endif // #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
  273. //! @copydoc ::boost::intrusive::rbtree::equal_range(const key_type &)
  274. std::pair<iterator,iterator> equal_range(const key_type &key)
  275. { return this->tree_type::lower_bound_range(key); }
  276. //! @copydoc ::boost::intrusive::rbtree::equal_range(const KeyType&,KeyTypeKeyCompare)
  277. template<class KeyType, class KeyTypeKeyCompare>
  278. std::pair<iterator,iterator> equal_range(const KeyType& key, KeyTypeKeyCompare comp)
  279. { return this->tree_type::equal_range(key, comp); }
  280. //! @copydoc ::boost::intrusive::rbtree::equal_range(const key_type &)const
  281. std::pair<const_iterator, const_iterator>
  282. equal_range(const key_type &key) const
  283. { return this->tree_type::lower_bound_range(key); }
  284. //! @copydoc ::boost::intrusive::rbtree::equal_range(const KeyType&,KeyTypeKeyCompare)const
  285. template<class KeyType, class KeyTypeKeyCompare>
  286. std::pair<const_iterator, const_iterator>
  287. equal_range(const KeyType& key, KeyTypeKeyCompare comp) const
  288. { return this->tree_type::equal_range(key, comp); }
  289. #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
  290. //! @copydoc ::boost::intrusive::splaytree::bounded_range(const key_type&,const key_type&,bool,bool)
  291. std::pair<iterator,iterator> bounded_range
  292. (const key_type &lower_key, const key_type &upper_key, bool left_closed, bool right_closed);
  293. //! @copydoc ::boost::intrusive::splaytree::bounded_range(const KeyType&,const KeyType&,KeyTypeKeyCompare,bool,bool)
  294. template<class KeyType, class KeyTypeKeyCompare>
  295. std::pair<iterator,iterator> bounded_range
  296. (const KeyType& lower_key, const KeyType& upper_key, KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
  297. //! @copydoc ::boost::intrusive::splaytree::bounded_range(const key_type&,const key_type&,bool,bool)const
  298. std::pair<const_iterator, const_iterator> bounded_range
  299. (const key_type &lower_key, const key_type &upper_key, bool left_closed, bool right_closed) const;
  300. //! @copydoc ::boost::intrusive::splaytree::bounded_range(const KeyType&,const KeyType&,KeyTypeKeyCompare,bool,bool)const
  301. template<class KeyType, class KeyTypeKeyCompare>
  302. std::pair<const_iterator, const_iterator> bounded_range
  303. (const KeyType& lower_key, const KeyType& upper_key, KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
  304. //! @copydoc ::boost::intrusive::splaytree::s_iterator_to(reference)
  305. static iterator s_iterator_to(reference value) BOOST_NOEXCEPT;
  306. //! @copydoc ::boost::intrusive::splaytree::s_iterator_to(const_reference)
  307. static const_iterator s_iterator_to(const_reference value) BOOST_NOEXCEPT;
  308. //! @copydoc ::boost::intrusive::splaytree::iterator_to(reference)
  309. iterator iterator_to(reference value) BOOST_NOEXCEPT;
  310. //! @copydoc ::boost::intrusive::splaytree::iterator_to(const_reference)const
  311. const_iterator iterator_to(const_reference value) const BOOST_NOEXCEPT;
  312. //! @copydoc ::boost::intrusive::splaytree::init_node(reference)
  313. static void init_node(reference value) BOOST_NOEXCEPT;
  314. //! @copydoc ::boost::intrusive::splaytree::unlink_leftmost_without_rebalance
  315. pointer unlink_leftmost_without_rebalance() BOOST_NOEXCEPT;
  316. //! @copydoc ::boost::intrusive::splaytree::replace_node
  317. void replace_node(iterator replace_this, reference with_this) BOOST_NOEXCEPT;
  318. //! @copydoc ::boost::intrusive::splaytree::remove_node
  319. void remove_node(reference value) BOOST_NOEXCEPT;
  320. //! @copydoc ::boost::intrusive::splaytree::splay_up(iterator)
  321. void splay_up(iterator i) BOOST_NOEXCEPT;
  322. //! @copydoc ::boost::intrusive::splaytree::splay_down(const KeyType&,KeyTypeKeyCompare)
  323. template<class KeyType, class KeyTypeKeyCompare>
  324. iterator splay_down(const KeyType &key, KeyTypeKeyCompare comp);
  325. //! @copydoc ::boost::intrusive::splaytree::splay_down(const key_type &key)
  326. iterator splay_down(const key_type &key);
  327. //! @copydoc ::boost::intrusive::splaytree::rebalance
  328. void rebalance() BOOST_NOEXCEPT;
  329. //! @copydoc ::boost::intrusive::splaytree::rebalance_subtree
  330. iterator rebalance_subtree(iterator root) BOOST_NOEXCEPT;
  331. //! @copydoc ::boost::intrusive::splaytree::merge_unique
  332. template<class ...Options2>
  333. void merge(splay_set<T, Options2...> &source);
  334. //! @copydoc ::boost::intrusive::splaytree::merge_unique
  335. template<class ...Options2>
  336. void merge(splay_multiset<T, Options2...> &source);
  337. #else
  338. template<class Compare2>
  339. void merge(splay_set_impl<ValueTraits, VoidOrKeyOfValue, Compare2, SizeType, ConstantTimeSize, HeaderHolder> &source)
  340. { return tree_type::merge_unique(source); }
  341. template<class Compare2>
  342. void merge(splay_multiset_impl<ValueTraits, VoidOrKeyOfValue, Compare2, SizeType, ConstantTimeSize, HeaderHolder> &source)
  343. { return tree_type::merge_unique(source); }
  344. #endif //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
  345. };
  346. #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
  347. template<class T, class ...Options>
  348. bool operator!= (const splay_set_impl<T, Options...> &x, const splay_set_impl<T, Options...> &y);
  349. template<class T, class ...Options>
  350. bool operator>(const splay_set_impl<T, Options...> &x, const splay_set_impl<T, Options...> &y);
  351. template<class T, class ...Options>
  352. bool operator<=(const splay_set_impl<T, Options...> &x, const splay_set_impl<T, Options...> &y);
  353. template<class T, class ...Options>
  354. bool operator>=(const splay_set_impl<T, Options...> &x, const splay_set_impl<T, Options...> &y);
  355. template<class T, class ...Options>
  356. void swap(splay_set_impl<T, Options...> &x, splay_set_impl<T, Options...> &y);
  357. #endif //#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
  358. //! Helper metafunction to define a \c splay_set that yields to the same type when the
  359. //! same options (either explicitly or implicitly) are used.
  360. #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
  361. template<class T, class ...Options>
  362. #else
  363. template<class T, class O1 = void, class O2 = void
  364. , class O3 = void, class O4 = void
  365. , class O5 = void, class O6 = void>
  366. #endif
  367. struct make_splay_set
  368. {
  369. /// @cond
  370. typedef typename pack_options
  371. < splaytree_defaults,
  372. #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
  373. O1, O2, O3, O4, O5, O6
  374. #else
  375. Options...
  376. #endif
  377. >::type packed_options;
  378. typedef typename detail::get_value_traits
  379. <T, typename packed_options::proto_value_traits>::type value_traits;
  380. typedef splay_set_impl
  381. < value_traits
  382. , typename packed_options::key_of_value
  383. , typename packed_options::compare
  384. , typename packed_options::size_type
  385. , packed_options::constant_time_size
  386. , typename packed_options::header_holder_type
  387. > implementation_defined;
  388. /// @endcond
  389. typedef implementation_defined type;
  390. };
  391. #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
  392. #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
  393. template<class T, class O1, class O2, class O3, class O4, class O5, class O6>
  394. #else
  395. template<class T, class ...Options>
  396. #endif
  397. class splay_set
  398. : public make_splay_set<T,
  399. #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
  400. O1, O2, O3, O4, O5, O6
  401. #else
  402. Options...
  403. #endif
  404. >::type
  405. {
  406. typedef typename make_splay_set
  407. <T,
  408. #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
  409. O1, O2, O3, O4, O5, O6
  410. #else
  411. Options...
  412. #endif
  413. >::type Base;
  414. BOOST_MOVABLE_BUT_NOT_COPYABLE(splay_set)
  415. public:
  416. typedef typename Base::key_compare key_compare;
  417. typedef typename Base::value_traits value_traits;
  418. typedef typename Base::iterator iterator;
  419. typedef typename Base::const_iterator const_iterator;
  420. //Assert if passed value traits are compatible with the type
  421. BOOST_INTRUSIVE_STATIC_ASSERT((detail::is_same<typename value_traits::value_type, T>::value));
  422. inline splay_set()
  423. : Base()
  424. {}
  425. inline explicit splay_set( const key_compare &cmp, const value_traits &v_traits = value_traits())
  426. : Base(cmp, v_traits)
  427. {}
  428. template<class Iterator>
  429. inline splay_set( Iterator b, Iterator e
  430. , const key_compare &cmp = key_compare()
  431. , const value_traits &v_traits = value_traits())
  432. : Base(b, e, cmp, v_traits)
  433. {}
  434. inline splay_set(BOOST_RV_REF(splay_set) x)
  435. : Base(::boost::move(static_cast<Base&>(x)))
  436. {}
  437. inline splay_set& operator=(BOOST_RV_REF(splay_set) x)
  438. { return static_cast<splay_set &>(this->Base::operator=(::boost::move(static_cast<Base&>(x)))); }
  439. template <class Cloner, class Disposer>
  440. inline void clone_from(const splay_set &src, Cloner cloner, Disposer disposer)
  441. { Base::clone_from(src, cloner, disposer); }
  442. template <class Cloner, class Disposer>
  443. inline void clone_from(BOOST_RV_REF(splay_set) src, Cloner cloner, Disposer disposer)
  444. { Base::clone_from(BOOST_MOVE_BASE(Base, src), cloner, disposer); }
  445. BOOST_INTRUSIVE_NO_DANGLING
  446. inline static splay_set &container_from_end_iterator(iterator end_iterator) BOOST_NOEXCEPT
  447. { return static_cast<splay_set &>(Base::container_from_end_iterator(end_iterator)); }
  448. BOOST_INTRUSIVE_NO_DANGLING
  449. inline static const splay_set &container_from_end_iterator(const_iterator end_iterator) BOOST_NOEXCEPT
  450. { return static_cast<const splay_set &>(Base::container_from_end_iterator(end_iterator)); }
  451. BOOST_INTRUSIVE_NO_DANGLING
  452. inline static splay_set &container_from_iterator(iterator it) BOOST_NOEXCEPT
  453. { return static_cast<splay_set &>(Base::container_from_iterator(it)); }
  454. BOOST_INTRUSIVE_NO_DANGLING
  455. inline static const splay_set &container_from_iterator(const_iterator it) BOOST_NOEXCEPT
  456. { return static_cast<const splay_set &>(Base::container_from_iterator(it)); }
  457. };
  458. #endif
  459. //! The class template splay_multiset is an intrusive container, that mimics most of
  460. //! the interface of std::multiset as described in the C++ standard.
  461. //!
  462. //! The template parameter \c T is the type to be managed by the container.
  463. //! The user can specify additional options and if no options are provided
  464. //! default options are used.
  465. //!
  466. //! The container supports the following options:
  467. //! \c base_hook<>/member_hook<>/value_traits<>,
  468. //! \c constant_time_size<>, \c size_type<> and
  469. //! \c compare<>.
  470. #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
  471. template<class T, class ...Options>
  472. #else
  473. template<class ValueTraits, class VoidOrKeyOfValue, class Compare, class SizeType, bool ConstantTimeSize, typename HeaderHolder>
  474. #endif
  475. class splay_multiset_impl
  476. #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
  477. : public splaytree_impl<ValueTraits, VoidOrKeyOfValue, Compare, SizeType, ConstantTimeSize, HeaderHolder>
  478. #endif
  479. {
  480. /// @cond
  481. typedef splaytree_impl<ValueTraits, VoidOrKeyOfValue, Compare, SizeType, ConstantTimeSize, HeaderHolder> tree_type;
  482. BOOST_MOVABLE_BUT_NOT_COPYABLE(splay_multiset_impl)
  483. typedef tree_type implementation_defined;
  484. /// @endcond
  485. public:
  486. typedef typename implementation_defined::value_type value_type;
  487. typedef typename implementation_defined::key_type key_type;
  488. typedef typename implementation_defined::key_of_value key_of_value;
  489. typedef typename implementation_defined::value_traits value_traits;
  490. typedef typename implementation_defined::pointer pointer;
  491. typedef typename implementation_defined::const_pointer const_pointer;
  492. typedef typename implementation_defined::reference reference;
  493. typedef typename implementation_defined::const_reference const_reference;
  494. typedef typename implementation_defined::difference_type difference_type;
  495. typedef typename implementation_defined::size_type size_type;
  496. typedef typename implementation_defined::value_compare value_compare;
  497. typedef typename implementation_defined::key_compare key_compare;
  498. typedef typename implementation_defined::iterator iterator;
  499. typedef typename implementation_defined::const_iterator const_iterator;
  500. typedef typename implementation_defined::reverse_iterator reverse_iterator;
  501. typedef typename implementation_defined::const_reverse_iterator const_reverse_iterator;
  502. typedef typename implementation_defined::insert_commit_data insert_commit_data;
  503. typedef typename implementation_defined::node_traits node_traits;
  504. typedef typename implementation_defined::node node;
  505. typedef typename implementation_defined::node_ptr node_ptr;
  506. typedef typename implementation_defined::const_node_ptr const_node_ptr;
  507. typedef typename implementation_defined::node_algorithms node_algorithms;
  508. static const bool constant_time_size = tree_type::constant_time_size;
  509. public:
  510. //! @copydoc ::boost::intrusive::splaytree::splaytree()
  511. splay_multiset_impl()
  512. : tree_type()
  513. {}
  514. //! @copydoc ::boost::intrusive::splaytree::splaytree(const key_compare &,const value_traits &)
  515. explicit splay_multiset_impl(const key_compare &cmp, const value_traits &v_traits = value_traits())
  516. : tree_type(cmp, v_traits)
  517. {}
  518. //! @copydoc ::boost::intrusive::splaytree::splaytree(bool,Iterator,Iterator,const key_compare &,const value_traits &)
  519. template<class Iterator>
  520. splay_multiset_impl( Iterator b, Iterator e
  521. , const key_compare &cmp = key_compare()
  522. , const value_traits &v_traits = value_traits())
  523. : tree_type(false, b, e, cmp, v_traits)
  524. {}
  525. //! @copydoc ::boost::intrusive::splaytree::splaytree(splaytree &&)
  526. splay_multiset_impl(BOOST_RV_REF(splay_multiset_impl) x)
  527. : tree_type(::boost::move(static_cast<tree_type&>(x)))
  528. {}
  529. //! @copydoc ::boost::intrusive::splaytree::operator=(splaytree &&)
  530. splay_multiset_impl& operator=(BOOST_RV_REF(splay_multiset_impl) x)
  531. { return static_cast<splay_multiset_impl&>(tree_type::operator=(::boost::move(static_cast<tree_type&>(x)))); }
  532. #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
  533. //! @copydoc ::boost::intrusive::splaytree::~splaytree()
  534. ~splay_multiset_impl();
  535. //! @copydoc ::boost::intrusive::splaytree::begin()
  536. iterator begin() BOOST_NOEXCEPT;
  537. //! @copydoc ::boost::intrusive::splaytree::begin()const
  538. const_iterator begin() const BOOST_NOEXCEPT;
  539. //! @copydoc ::boost::intrusive::splaytree::cbegin()const
  540. const_iterator cbegin() const BOOST_NOEXCEPT;
  541. //! @copydoc ::boost::intrusive::splaytree::end()
  542. iterator end() BOOST_NOEXCEPT;
  543. //! @copydoc ::boost::intrusive::splaytree::end()const
  544. const_iterator end() const BOOST_NOEXCEPT;
  545. //! @copydoc ::boost::intrusive::splaytree::cend()const
  546. const_iterator cend() const BOOST_NOEXCEPT;
  547. //! @copydoc ::boost::intrusive::splaytree::rbegin()
  548. reverse_iterator rbegin() BOOST_NOEXCEPT;
  549. //! @copydoc ::boost::intrusive::splaytree::rbegin()const
  550. const_reverse_iterator rbegin() const BOOST_NOEXCEPT;
  551. //! @copydoc ::boost::intrusive::splaytree::crbegin()const
  552. const_reverse_iterator crbegin() const BOOST_NOEXCEPT;
  553. //! @copydoc ::boost::intrusive::splaytree::rend()
  554. reverse_iterator rend() BOOST_NOEXCEPT;
  555. //! @copydoc ::boost::intrusive::splaytree::rend()const
  556. const_reverse_iterator rend() const BOOST_NOEXCEPT;
  557. //! @copydoc ::boost::intrusive::splaytree::crend()const
  558. const_reverse_iterator crend() const BOOST_NOEXCEPT;
  559. //! @copydoc ::boost::intrusive::splaytree::root()
  560. iterator root() BOOST_NOEXCEPT;
  561. //! @copydoc ::boost::intrusive::splaytree::root()const
  562. const_iterator root() const BOOST_NOEXCEPT;
  563. //! @copydoc ::boost::intrusive::splaytree::croot()const
  564. const_iterator croot() const BOOST_NOEXCEPT;
  565. //! @copydoc ::boost::intrusive::splaytree::container_from_end_iterator(iterator)
  566. static splay_multiset_impl &container_from_end_iterator(iterator end_iterator) BOOST_NOEXCEPT;
  567. //! @copydoc ::boost::intrusive::splaytree::container_from_end_iterator(const_iterator)
  568. static const splay_multiset_impl &container_from_end_iterator(const_iterator end_iterator) BOOST_NOEXCEPT;
  569. //! @copydoc ::boost::intrusive::splaytree::container_from_iterator(iterator)
  570. static splay_multiset_impl &container_from_iterator(iterator it) BOOST_NOEXCEPT;
  571. //! @copydoc ::boost::intrusive::splaytree::container_from_iterator(const_iterator)
  572. static const splay_multiset_impl &container_from_iterator(const_iterator it) BOOST_NOEXCEPT;
  573. //! @copydoc ::boost::intrusive::splaytree::key_comp()const
  574. key_compare key_comp() const;
  575. //! @copydoc ::boost::intrusive::splaytree::value_comp()const
  576. value_compare value_comp() const;
  577. //! @copydoc ::boost::intrusive::splaytree::empty()const
  578. bool empty() const BOOST_NOEXCEPT;
  579. //! @copydoc ::boost::intrusive::splaytree::size()const
  580. size_type size() const BOOST_NOEXCEPT;
  581. //! @copydoc ::boost::intrusive::splaytree::swap
  582. void swap(splay_multiset_impl& other);
  583. //! @copydoc ::boost::intrusive::splaytree::clone_from(const splaytree&,Cloner,Disposer)
  584. template <class Cloner, class Disposer>
  585. void clone_from(const splay_multiset_impl &src, Cloner cloner, Disposer disposer);
  586. #else
  587. using tree_type::clone_from;
  588. #endif //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
  589. //! @copydoc ::boost::intrusive::splaytree::clone_from(splaytree&&,Cloner,Disposer)
  590. template <class Cloner, class Disposer>
  591. void clone_from(BOOST_RV_REF(splay_multiset_impl) src, Cloner cloner, Disposer disposer)
  592. { tree_type::clone_from(BOOST_MOVE_BASE(tree_type, src), cloner, disposer); }
  593. //! @copydoc ::boost::intrusive::splaytree::insert_equal(reference)
  594. iterator insert(reference value)
  595. { return tree_type::insert_equal(value); }
  596. //! @copydoc ::boost::intrusive::splaytree::insert_equal(const_iterator,reference)
  597. iterator insert(const_iterator hint, reference value)
  598. { return tree_type::insert_equal(hint, value); }
  599. //! @copydoc ::boost::intrusive::splaytree::insert_equal(Iterator,Iterator)
  600. template<class Iterator>
  601. void insert(Iterator b, Iterator e)
  602. { tree_type::insert_equal(b, e); }
  603. #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
  604. //! @copydoc ::boost::intrusive::splaytree::insert_before
  605. iterator insert_before(const_iterator pos, reference value) BOOST_NOEXCEPT;
  606. //! @copydoc ::boost::intrusive::splaytree::push_back
  607. void push_back(reference value) BOOST_NOEXCEPT;
  608. //! @copydoc ::boost::intrusive::splaytree::push_front
  609. void push_front(reference value) BOOST_NOEXCEPT;
  610. //! @copydoc ::boost::intrusive::splaytree::erase(const_iterator)
  611. iterator erase(const_iterator i) BOOST_NOEXCEPT;
  612. //! @copydoc ::boost::intrusive::splaytree::erase(const_iterator,const_iterator)
  613. iterator erase(const_iterator b, const_iterator e) BOOST_NOEXCEPT;
  614. //! @copydoc ::boost::intrusive::splaytree::erase(const key_type&)
  615. size_type erase(const key_type &key);
  616. //! @copydoc ::boost::intrusive::splaytree::erase(const KeyType&,KeyTypeKeyCompare)
  617. template<class KeyType, class KeyTypeKeyCompare>
  618. size_type erase(const KeyType& key, KeyTypeKeyCompare comp);
  619. //! @copydoc ::boost::intrusive::splaytree::erase_and_dispose(const_iterator,Disposer)
  620. template<class Disposer>
  621. iterator erase_and_dispose(const_iterator i, Disposer disposer) BOOST_NOEXCEPT;
  622. //! @copydoc ::boost::intrusive::splaytree::erase_and_dispose(const_iterator,const_iterator,Disposer)
  623. template<class Disposer>
  624. iterator erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer) BOOST_NOEXCEPT;
  625. //! @copydoc ::boost::intrusive::splaytree::erase_and_dispose(const key_type&, Disposer)
  626. template<class Disposer>
  627. size_type erase_and_dispose(const key_type &key, Disposer disposer);
  628. //! @copydoc ::boost::intrusive::splaytree::erase_and_dispose(const KeyType&,KeyTypeKeyCompare,Disposer)
  629. template<class KeyType, class KeyTypeKeyCompare, class Disposer>
  630. size_type erase_and_dispose(const KeyType& key, KeyTypeKeyCompare comp, Disposer disposer);
  631. //! @copydoc ::boost::intrusive::splaytree::clear
  632. void clear() BOOST_NOEXCEPT;
  633. //! @copydoc ::boost::intrusive::splaytree::clear_and_dispose
  634. template<class Disposer>
  635. void clear_and_dispose(Disposer disposer) BOOST_NOEXCEPT;
  636. //! @copydoc ::boost::intrusive::splaytree::count(const key_type&)
  637. size_type count(const key_type&);
  638. //! @copydoc ::boost::intrusive::splaytree::count(const KeyType&,KeyTypeKeyCompare)const
  639. template<class KeyType, class KeyTypeKeyCompare>
  640. size_type count(const KeyType& key, KeyTypeKeyCompare comp);
  641. //! @copydoc ::boost::intrusive::splaytree::lower_bound(const key_type&)
  642. iterator lower_bound(const key_type &key);
  643. //! @copydoc ::boost::intrusive::splaytree::lower_bound(const KeyType&,KeyTypeKeyCompare)
  644. template<class KeyType, class KeyTypeKeyCompare>
  645. iterator lower_bound(const KeyType& key, KeyTypeKeyCompare comp);
  646. //! @copydoc ::boost::intrusive::splaytree::lower_bound(const key_type&)const
  647. const_iterator lower_bound(const key_type &key) const;
  648. //! @copydoc ::boost::intrusive::splaytree::lower_bound(const KeyType&,KeyTypeKeyCompare)const
  649. template<class KeyType, class KeyTypeKeyCompare>
  650. const_iterator lower_bound(const KeyType& key, KeyTypeKeyCompare comp) const;
  651. //! @copydoc ::boost::intrusive::splaytree::upper_bound(const key_type&)
  652. iterator upper_bound(const key_type &key);
  653. //! @copydoc ::boost::intrusive::splaytree::upper_bound(const KeyType&,KeyTypeKeyCompare)
  654. template<class KeyType, class KeyTypeKeyCompare>
  655. iterator upper_bound(const KeyType& key, KeyTypeKeyCompare comp);
  656. //! @copydoc ::boost::intrusive::splaytree::upper_bound(const key_type&)const
  657. const_iterator upper_bound(const key_type &key) const;
  658. //! @copydoc ::boost::intrusive::splaytree::upper_bound(const KeyType&,KeyTypeKeyCompare)const
  659. template<class KeyType, class KeyTypeKeyCompare>
  660. const_iterator upper_bound(const KeyType& key, KeyTypeKeyCompare comp) const;
  661. //! @copydoc ::boost::intrusive::splaytree::find(const key_type&)
  662. iterator find(const key_type &key);
  663. //! @copydoc ::boost::intrusive::splaytree::find(const KeyType&,KeyTypeKeyCompare)
  664. template<class KeyType, class KeyTypeKeyCompare>
  665. iterator find(const KeyType& key, KeyTypeKeyCompare comp);
  666. //! @copydoc ::boost::intrusive::splaytree::find(const key_type&)const
  667. const_iterator find(const key_type &key) const;
  668. //! @copydoc ::boost::intrusive::splaytree::find(const KeyType&,KeyTypeKeyCompare)const
  669. template<class KeyType, class KeyTypeKeyCompare>
  670. const_iterator find(const KeyType& key, KeyTypeKeyCompare comp) const;
  671. //! @copydoc ::boost::intrusive::splaytree::equal_range(const key_type&)
  672. std::pair<iterator,iterator> equal_range(const key_type &key);
  673. //! @copydoc ::boost::intrusive::splaytree::equal_range(const KeyType&,KeyTypeKeyCompare)
  674. template<class KeyType, class KeyTypeKeyCompare>
  675. std::pair<iterator,iterator> equal_range(const KeyType& key, KeyTypeKeyCompare comp);
  676. //! @copydoc ::boost::intrusive::splaytree::equal_range(const key_type&)const
  677. std::pair<const_iterator, const_iterator>
  678. equal_range(const key_type &key) const;
  679. //! @copydoc ::boost::intrusive::splaytree::equal_range(const KeyType&,KeyTypeKeyCompare)const
  680. template<class KeyType, class KeyTypeKeyCompare>
  681. std::pair<const_iterator, const_iterator>
  682. equal_range(const KeyType& key, KeyTypeKeyCompare comp) const;
  683. //! @copydoc ::boost::intrusive::splaytree::bounded_range(const key_type&, const key_type&,bool,bool)
  684. std::pair<iterator,iterator> bounded_range
  685. (const_reference lower_value, const_reference upper_value, bool left_closed, bool right_closed);
  686. //! @copydoc ::boost::intrusive::splaytree::bounded_range(const KeyType&,const KeyType&,KeyTypeKeyCompare,bool,bool)
  687. template<class KeyType, class KeyTypeKeyCompare>
  688. std::pair<iterator,iterator> bounded_range
  689. (const KeyType& lower_key, const KeyType& upper_key, KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
  690. //! @copydoc ::boost::intrusive::splaytree::bounded_range(const key_type&, const key_type&,bool,bool)const
  691. std::pair<const_iterator, const_iterator> bounded_range
  692. (const_reference lower_value, const_reference upper_value, bool left_closed, bool right_closed) const;
  693. //! @copydoc ::boost::intrusive::splaytree::bounded_range(const KeyType&,const KeyType&,KeyTypeKeyCompare,bool,bool)const
  694. template<class KeyType, class KeyTypeKeyCompare>
  695. std::pair<const_iterator, const_iterator> bounded_range
  696. (const KeyType& lower_key, const KeyType& upper_key, KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
  697. //! @copydoc ::boost::intrusive::splaytree::s_iterator_to(reference)
  698. static iterator s_iterator_to(reference value) BOOST_NOEXCEPT;
  699. //! @copydoc ::boost::intrusive::splaytree::s_iterator_to(const_reference)
  700. static const_iterator s_iterator_to(const_reference value) BOOST_NOEXCEPT;
  701. //! @copydoc ::boost::intrusive::splaytree::iterator_to(reference)
  702. iterator iterator_to(reference value) BOOST_NOEXCEPT;
  703. //! @copydoc ::boost::intrusive::splaytree::iterator_to(const_reference)const
  704. const_iterator iterator_to(const_reference value) const BOOST_NOEXCEPT;
  705. //! @copydoc ::boost::intrusive::splaytree::init_node(reference)
  706. static void init_node(reference value) BOOST_NOEXCEPT;
  707. //! @copydoc ::boost::intrusive::splaytree::unlink_leftmost_without_rebalance
  708. pointer unlink_leftmost_without_rebalance() BOOST_NOEXCEPT;
  709. //! @copydoc ::boost::intrusive::splaytree::replace_node
  710. void replace_node(iterator replace_this, reference with_this) BOOST_NOEXCEPT;
  711. //! @copydoc ::boost::intrusive::splaytree::remove_node
  712. void remove_node(reference value) BOOST_NOEXCEPT;
  713. //! @copydoc ::boost::intrusive::splaytree::splay_up(iterator)
  714. void splay_up(iterator i) BOOST_NOEXCEPT;
  715. //! @copydoc ::boost::intrusive::splaytree::splay_down(const KeyType&,KeyTypeKeyCompare)
  716. template<class KeyType, class KeyTypeKeyCompare>
  717. iterator splay_down(const KeyType &key, KeyTypeKeyCompare comp);
  718. //! @copydoc ::boost::intrusive::splaytree::splay_down(const key_type &key)
  719. iterator splay_down(const key_type &key);
  720. //! @copydoc ::boost::intrusive::splaytree::rebalance
  721. void rebalance() BOOST_NOEXCEPT;
  722. //! @copydoc ::boost::intrusive::splaytree::rebalance_subtree
  723. iterator rebalance_subtree(iterator root) BOOST_NOEXCEPT;
  724. //! @copydoc ::boost::intrusive::splaytree::merge_equal
  725. template<class ...Options2>
  726. void merge(splay_multiset<T, Options2...> &source);
  727. //! @copydoc ::boost::intrusive::splaytree::merge_equal
  728. template<class ...Options2>
  729. void merge(splay_set<T, Options2...> &source);
  730. #else
  731. template<class Compare2>
  732. void merge(splay_multiset_impl<ValueTraits, VoidOrKeyOfValue, Compare2, SizeType, ConstantTimeSize, HeaderHolder> &source)
  733. { return tree_type::merge_equal(source); }
  734. template<class Compare2>
  735. void merge(splay_set_impl<ValueTraits, VoidOrKeyOfValue, Compare2, SizeType, ConstantTimeSize, HeaderHolder> &source)
  736. { return tree_type::merge_equal(source); }
  737. #endif //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
  738. };
  739. #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
  740. template<class T, class ...Options>
  741. bool operator!= (const splay_multiset_impl<T, Options...> &x, const splay_multiset_impl<T, Options...> &y);
  742. template<class T, class ...Options>
  743. bool operator>(const splay_multiset_impl<T, Options...> &x, const splay_multiset_impl<T, Options...> &y);
  744. template<class T, class ...Options>
  745. bool operator<=(const splay_multiset_impl<T, Options...> &x, const splay_multiset_impl<T, Options...> &y);
  746. template<class T, class ...Options>
  747. bool operator>=(const splay_multiset_impl<T, Options...> &x, const splay_multiset_impl<T, Options...> &y);
  748. template<class T, class ...Options>
  749. void swap(splay_multiset_impl<T, Options...> &x, splay_multiset_impl<T, Options...> &y);
  750. #endif //#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
  751. //! Helper metafunction to define a \c splay_multiset that yields to the same type when the
  752. //! same options (either explicitly or implicitly) are used.
  753. #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
  754. template<class T, class ...Options>
  755. #else
  756. template<class T, class O1 = void, class O2 = void
  757. , class O3 = void, class O4 = void
  758. , class O5 = void, class O6 = void>
  759. #endif
  760. struct make_splay_multiset
  761. {
  762. /// @cond
  763. typedef typename pack_options
  764. < splaytree_defaults,
  765. #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
  766. O1, O2, O3, O4, O5, O6
  767. #else
  768. Options...
  769. #endif
  770. >::type packed_options;
  771. typedef typename detail::get_value_traits
  772. <T, typename packed_options::proto_value_traits>::type value_traits;
  773. typedef splay_multiset_impl
  774. < value_traits
  775. , typename packed_options::key_of_value
  776. , typename packed_options::compare
  777. , typename packed_options::size_type
  778. , packed_options::constant_time_size
  779. , typename packed_options::header_holder_type
  780. > implementation_defined;
  781. /// @endcond
  782. typedef implementation_defined type;
  783. };
  784. #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
  785. #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
  786. template<class T, class O1, class O2, class O3, class O4, class O5, class O6>
  787. #else
  788. template<class T, class ...Options>
  789. #endif
  790. class splay_multiset
  791. : public make_splay_multiset<T,
  792. #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
  793. O1, O2, O3, O4, O5, O6
  794. #else
  795. Options...
  796. #endif
  797. >::type
  798. {
  799. typedef typename make_splay_multiset<T,
  800. #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
  801. O1, O2, O3, O4, O5, O6
  802. #else
  803. Options...
  804. #endif
  805. >::type Base;
  806. BOOST_MOVABLE_BUT_NOT_COPYABLE(splay_multiset)
  807. public:
  808. typedef typename Base::key_compare key_compare;
  809. typedef typename Base::value_traits value_traits;
  810. typedef typename Base::iterator iterator;
  811. typedef typename Base::const_iterator const_iterator;
  812. //Assert if passed value traits are compatible with the type
  813. BOOST_INTRUSIVE_STATIC_ASSERT((detail::is_same<typename value_traits::value_type, T>::value));
  814. inline splay_multiset()
  815. : Base()
  816. {}
  817. inline explicit splay_multiset( const key_compare &cmp, const value_traits &v_traits = value_traits())
  818. : Base(cmp, v_traits)
  819. {}
  820. template<class Iterator>
  821. inline splay_multiset( Iterator b, Iterator e
  822. , const key_compare &cmp = key_compare()
  823. , const value_traits &v_traits = value_traits())
  824. : Base(b, e, cmp, v_traits)
  825. {}
  826. inline splay_multiset(BOOST_RV_REF(splay_multiset) x)
  827. : Base(::boost::move(static_cast<Base&>(x)))
  828. {}
  829. inline splay_multiset& operator=(BOOST_RV_REF(splay_multiset) x)
  830. { return static_cast<splay_multiset &>(this->Base::operator=(::boost::move(static_cast<Base&>(x)))); }
  831. template <class Cloner, class Disposer>
  832. inline void clone_from(const splay_multiset &src, Cloner cloner, Disposer disposer)
  833. { Base::clone_from(src, cloner, disposer); }
  834. template <class Cloner, class Disposer>
  835. inline void clone_from(BOOST_RV_REF(splay_multiset) src, Cloner cloner, Disposer disposer)
  836. { Base::clone_from(BOOST_MOVE_BASE(Base, src), cloner, disposer); }
  837. BOOST_INTRUSIVE_NO_DANGLING
  838. inline static splay_multiset &container_from_end_iterator(iterator end_iterator) BOOST_NOEXCEPT
  839. { return static_cast<splay_multiset &>(Base::container_from_end_iterator(end_iterator)); }
  840. BOOST_INTRUSIVE_NO_DANGLING
  841. inline static const splay_multiset &container_from_end_iterator(const_iterator end_iterator) BOOST_NOEXCEPT
  842. { return static_cast<const splay_multiset &>(Base::container_from_end_iterator(end_iterator)); }
  843. BOOST_INTRUSIVE_NO_DANGLING
  844. inline static splay_multiset &container_from_iterator(iterator it) BOOST_NOEXCEPT
  845. { return static_cast<splay_multiset &>(Base::container_from_iterator(it)); }
  846. BOOST_INTRUSIVE_NO_DANGLING
  847. inline static const splay_multiset &container_from_iterator(const_iterator it) BOOST_NOEXCEPT
  848. { return static_cast<const splay_multiset &>(Base::container_from_iterator(it)); }
  849. };
  850. #endif
  851. } //namespace intrusive
  852. } //namespace boost
  853. #include <boost/intrusive/detail/config_end.hpp>
  854. #endif //BOOST_INTRUSIVE_SPLAY_SET_HPP