boost-react-native-bundle

<html> <head> <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> <title>Class template bstree</title> <link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css"> <meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> <link rel="home" href="../../index.html" title="The Boost C++ Libraries BoostBook Documentation Subset"> <link rel="up" href="../../intrusive/reference.html#header.boost.intrusive.bstree_hpp" title="Header <boost/intrusive/bstree.hpp>"> <link rel="prev" href="bs_set_member_hook.html" title="Class template bs_set_member_hook"> <link rel="next" href="make_bstree.html" title="Struct template make_bstree"> </head> <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> <table cellpadding="2" width="100%"><tr> <td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td> <td align="center"><a href="../../../../index.html">Home</a></td> <td align="center"><a href="../../../../libs/libraries.htm">Libraries</a></td> <td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> <td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> <td align="center"><a href="../../../../more/index.htm">More</a></td> </tr></table> <hr> <div class="spirit-nav"> <a accesskey="p" href="bs_set_member_hook.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../intrusive/reference.html#header.boost.intrusive.bstree_hpp"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="make_bstree.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a> </div> <div class="refentry"> <a name="boost.intrusive.bstree"></a><div class="titlepage"></div> <div class="refnamediv"> <h2>Class template bstree</h2> boost::intrusive::bstree </div> <h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> <div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <<a class="link" href="../../intrusive/reference.html#header.boost.intrusive.bstree_hpp" title="Header <boost/intrusive/bstree.hpp>">boost/intrusive/bstree.hpp</a>> template<typename T, class... Options> class <a class="link" href="bstree.html" title="Class template bstree">bstree</a> : public bstbase< ValueTraits, VoidKeyComp, ConstantTimeSize, SizeType, AlgoType, HeaderHolder > { public: // types typedef implementation_defined <a name="boost.intrusive.bstree.value_traits"></a>value_traits; typedef implementation_defined <a name="boost.intrusive.bstree.pointer"></a>pointer; typedef implementation_defined <a name="boost.intrusive.bstree.const_pointer"></a>const_pointer; typedef implementation_defined <a name="boost.intrusive.bstree.value_type"></a>value_type; typedef implementation_defined <a name="boost.intrusive.bstree.key_type"></a>key_type; typedef implementation_defined <a name="boost.intrusive.bstree.reference"></a>reference; typedef implementation_defined <a name="boost.intrusive.bstree.const_reference"></a>const_reference; typedef implementation_defined <a name="boost.intrusive.bstree.difference_type"></a>difference_type; typedef implementation_defined <a name="boost.intrusive.bstree.size_type"></a>size_type; typedef implementation_defined <a name="boost.intrusive.bstree.value_compare"></a>value_compare; typedef implementation_defined <a name="boost.intrusive.bstree.key_compare"></a>key_compare; typedef implementation_defined <a name="boost.intrusive.bstree.iterator"></a>iterator; typedef implementation_defined <a name="boost.intrusive.bstree.const_iterator"></a>const_iterator; typedef implementation_defined <a name="boost.intrusive.bstree.reverse_iterator"></a>reverse_iterator; typedef implementation_defined <a name="boost.intrusive.bstree.const_reverse_iterator"></a>const_reverse_iterator; typedef implementation_defined <a name="boost.intrusive.bstree.node_traits"></a>node_traits; typedef implementation_defined <a name="boost.intrusive.bstree.node"></a>node; typedef implementation_defined <a name="boost.intrusive.bstree.node_ptr"></a>node_ptr; typedef implementation_defined <a name="boost.intrusive.bstree.const_node_ptr"></a>const_node_ptr; typedef implementation_defined <a name="boost.intrusive.bstree.node_algorithms"></a>node_algorithms; typedef node_algorithms::insert_commit_data <a name="boost.intrusive.bstree.insert_commit_data"></a>insert_commit_data; // <a class="link" href="bstree.html#boost.intrusive.bstreeconstruct-copy-destruct">construct/copy/destruct</a> explicit <a class="link" href="bstree.html#idp61911328-bb">bstree</a>(const value_compare & = value_compare(), const value_traits & = value_traits()); template<typename Iterator> <a class="link" href="bstree.html#idp61916704-bb">bstree</a>(bool, Iterator, Iterator, const value_compare & = value_compare(), const value_traits & = value_traits()); <a class="link" href="bstree.html#idp61925856-bb">bstree</a>(<a class="link" href="bstree.html" title="Class template bstree">bstree</a> &&); <a class="link" href="bstree.html" title="Class template bstree">bstree</a> & <a class="link" href="bstree.html#idp61928096-bb">operator=</a>(<a class="link" href="bstree.html" title="Class template bstree">bstree</a> &&); <a class="link" href="bstree.html#idp61930912-bb">~bstree</a>(); // <a class="link" href="bstree.html#idp61477296-bb">public member functions</a> iterator <a class="link" href="bstree.html#idp61477856-bb">begin</a>(); const_iterator <a class="link" href="bstree.html#idp61481424-bb">begin</a>() const; const_iterator <a class="link" href="bstree.html#idp61485264-bb">cbegin</a>() const; iterator <a class="link" href="bstree.html#idp61489104-bb">end</a>(); const_iterator <a class="link" href="bstree.html#idp61492672-bb">end</a>() const; const_iterator <a class="link" href="bstree.html#idp61496512-bb">cend</a>() const; reverse_iterator <a class="link" href="bstree.html#idp61500352-bb">rbegin</a>(); const_reverse_iterator <a class="link" href="bstree.html#idp61503936-bb">rbegin</a>() const; const_reverse_iterator <a class="link" href="bstree.html#idp61507792-bb">crbegin</a>() const; reverse_iterator <a class="link" href="bstree.html#idp61511648-bb">rend</a>(); const_reverse_iterator <a class="link" href="bstree.html#idp61515232-bb">rend</a>() const; const_reverse_iterator <a class="link" href="bstree.html#idp61519088-bb">crend</a>() const; key_compare <a class="link" href="bstree.html#idp61522944-bb">key_comp</a>() const; value_compare <a class="link" href="bstree.html#idp61526800-bb">value_comp</a>() const; bool <a class="link" href="bstree.html#idp61530672-bb">empty</a>() const; size_type <a class="link" href="bstree.html#idp61534496-bb">size</a>() const; void <a class="link" href="bstree.html#idp61538432-bb">swap</a>(<a class="link" href="bstree.html" title="Class template bstree">bstree</a> &); template<typename Cloner, typename Disposer> void <a class="link" href="bstree.html#idp61542976-bb">clone_from</a>(const <a class="link" href="bstree.html" title="Class template bstree">bstree</a> &, Cloner, Disposer); iterator <a class="link" href="bstree.html#idp61552032-bb">insert_equal</a>(reference); iterator <a class="link" href="bstree.html#idp61558192-bb">insert_equal</a>(const_iterator, reference); template<typename Iterator> void <a class="link" href="bstree.html#idp61565216-bb">insert_equal</a>(Iterator, Iterator); std::pair< iterator, bool > <a class="link" href="bstree.html#idp61573024-bb">insert_unique</a>(reference); iterator <a class="link" href="bstree.html#idp61579136-bb">insert_unique</a>(const_iterator, reference); template<typename Iterator> void <a class="link" href="bstree.html#idp61586064-bb">insert_unique</a>(Iterator, Iterator); template<typename KeyType, typename KeyValueCompare> std::pair< iterator, bool > <a class="link" href="bstree.html#idp61593824-bb">insert_unique_check</a>(const KeyType &, KeyValueCompare, insert_commit_data &); template<typename KeyType, typename KeyValueCompare> std::pair< iterator, bool > <a class="link" href="bstree.html#idp61605248-bb">insert_unique_check</a>(const_iterator, const KeyType &, KeyValueCompare, insert_commit_data &); iterator <a class="link" href="bstree.html#idp61617456-bb">insert_unique_commit</a>(reference, const insert_commit_data &); iterator <a class="link" href="bstree.html#idp61625488-bb">insert_before</a>(const_iterator, reference); void <a class="link" href="bstree.html#idp61632448-bb">push_back</a>(reference); void <a class="link" href="bstree.html#idp61638736-bb">push_front</a>(reference); iterator <a class="link" href="bstree.html#idp61645024-bb">erase</a>(const_iterator); iterator <a class="link" href="bstree.html#idp61650240-bb">erase</a>(const_iterator, const_iterator); size_type <a class="link" href="bstree.html#idp61656208-bb">erase</a>(const_reference); template<typename KeyType, typename KeyValueCompare> size_type <a class="link" href="bstree.html#idp61662256-bb">erase</a>(const KeyType &, KeyValueCompare); template<typename Disposer> iterator <a class="link" href="bstree.html#idp61670448-bb">erase_and_dispose</a>(const_iterator, Disposer); template<typename Disposer> size_type <a class="link" href="bstree.html#idp61678096-bb">erase_and_dispose</a>(const_reference, Disposer); template<typename Disposer> iterator <a class="link" href="bstree.html#idp61686624-bb">erase_and_dispose</a>(const_iterator, const_iterator, Disposer); template<typename KeyType, typename KeyValueCompare, typename Disposer> size_type <a class="link" href="bstree.html#idp61695008-bb">erase_and_dispose</a>(const KeyType &, KeyValueCompare, Disposer); void <a class="link" href="bstree.html#idp61705328-bb">clear</a>(); template<typename Disposer> void <a class="link" href="bstree.html#idp61709920-bb">clear_and_dispose</a>(Disposer); size_type <a class="link" href="bstree.html#idp61715952-bb">count</a>(const_reference) const; template<typename KeyType, typename KeyValueCompare> size_type <a class="link" href="bstree.html#idp61721024-bb">count</a>(const KeyType &, KeyValueCompare) const; iterator <a class="link" href="bstree.html#idp61728176-bb">lower_bound</a>(const_reference); const_iterator <a class="link" href="bstree.html#idp61732928-bb">lower_bound</a>(const_reference) const; template<typename KeyType, typename KeyValueCompare> iterator <a class="link" href="bstree.html#idp61737952-bb">lower_bound</a>(const KeyType &, KeyValueCompare); template<typename KeyType, typename KeyValueCompare> const_iterator <a class="link" href="bstree.html#idp61744800-bb">lower_bound</a>(const KeyType &, KeyValueCompare) const; iterator <a class="link" href="bstree.html#idp61751920-bb">upper_bound</a>(const_reference); template<typename KeyType, typename KeyValueCompare> iterator <a class="link" href="bstree.html#idp61756672-bb">upper_bound</a>(const KeyType &, KeyValueCompare); const_iterator <a class="link" href="bstree.html#idp61763536-bb">upper_bound</a>(const_reference) const; template<typename KeyType, typename KeyValueCompare> const_iterator <a class="link" href="bstree.html#idp61768560-bb">upper_bound</a>(const KeyType &, KeyValueCompare) const; iterator <a class="link" href="bstree.html#idp61775696-bb">find</a>(const_reference); template<typename KeyType, typename KeyValueCompare> iterator <a class="link" href="bstree.html#idp61780432-bb">find</a>(const KeyType &, KeyValueCompare); const_iterator <a class="link" href="bstree.html#idp61787264-bb">find</a>(const_reference) const; template<typename KeyType, typename KeyValueCompare> const_iterator <a class="link" href="bstree.html#idp61792272-bb">find</a>(const KeyType &, KeyValueCompare) const; std::pair< iterator, iterator > <a class="link" href="bstree.html#idp61799376-bb">equal_range</a>(const_reference); template<typename KeyType, typename KeyValueCompare> std::pair< iterator, iterator > <a class="link" href="bstree.html#idp61804208-bb">equal_range</a>(const KeyType &, KeyValueCompare); std::pair< const_iterator, const_iterator > <a class="link" href="bstree.html#idp61811136-bb">equal_range</a>(const_reference) const; template<typename KeyType, typename KeyValueCompare> std::pair< const_iterator, const_iterator > <a class="link" href="bstree.html#idp61816256-bb">equal_range</a>(const KeyType &, KeyValueCompare) const; std::pair< iterator, iterator > <a class="link" href="bstree.html#idp61823472-bb">bounded_range</a>(const_reference, const_reference, bool, bool); template<typename KeyType, typename KeyValueCompare> std::pair< iterator, iterator > <a class="link" href="bstree.html#idp61833776-bb">bounded_range</a>(const KeyType &, const KeyType &, KeyValueCompare, bool, bool); std::pair< const_iterator, const_iterator > <a class="link" href="bstree.html#idp61846368-bb">bounded_range</a>(const_reference, const_reference, bool, bool) const; template<typename KeyType, typename KeyValueCompare> std::pair< const_iterator, const_iterator > <a class="link" href="bstree.html#idp61856960-bb">bounded_range</a>(const KeyType &, const KeyType &, KeyValueCompare, bool, bool) const; iterator <a class="link" href="bstree.html#idp61869840-bb">iterator_to</a>(reference); const_iterator <a class="link" href="bstree.html#idp61875056-bb">iterator_to</a>(const_reference) const; pointer <a class="link" href="bstree.html#idp61880544-bb">unlink_leftmost_without_rebalance</a>(); void <a class="link" href="bstree.html#idp61885184-bb">replace_node</a>(iterator, reference); void <a class="link" href="bstree.html#idp61892176-bb">rebalance</a>(); iterator <a class="link" href="bstree.html#idp61895696-bb">rebalance_subtree</a>(iterator); template<typename ExtraChecker> void <a class="link" href="bstree.html#idp61901696-bb">check</a>(ExtraChecker) const; void <a class="link" href="bstree.html#idp61907216-bb">check</a>() const; // <a class="link" href="bstree.html#idp61934816-bb">public static functions</a> static <a class="link" href="bstree.html" title="Class template bstree">bstree</a> & <a class="link" href="bstree.html#idp61935376-bb">container_from_end_iterator</a>(iterator); static const <a class="link" href="bstree.html" title="Class template bstree">bstree</a> & <a class="link" href="bstree.html#idp61941120-bb">container_from_end_iterator</a>(const_iterator); static <a class="link" href="bstree.html" title="Class template bstree">bstree</a> & <a class="link" href="bstree.html#idp61947008-bb">container_from_iterator</a>(iterator); static const <a class="link" href="bstree.html" title="Class template bstree">bstree</a> & <a class="link" href="bstree.html#idp61952704-bb">container_from_iterator</a>(const_iterator); static iterator <a class="link" href="bstree.html#idp61958576-bb">s_iterator_to</a>(reference); static const_iterator <a class="link" href="bstree.html#idp61965392-bb">s_iterator_to</a>(const_reference); static void <a class="link" href="bstree.html#idp61972208-bb">init_node</a>(reference); static void <a class="link" href="bstree.html#idp61978528-bb">remove_node</a>(reference); // public data members static const bool constant_time_size; static const bool stateful_value_traits; };</pre></div> <div class="refsect1"> <a name="idp278793360"></a><h2>Description</h2> The class template bstree is an unbalanced intrusive binary search tree container. The no-throw guarantee holds only, if the value_compare object doesn't throw. The complexity guarantees only hold if the tree is balanced, logarithmic complexity would increase to linear if the tree is totally unbalanced. The template parameter <code class="computeroutput">T</code> is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used. The container supports the following options: <code class="computeroutput">base_hook<>/member_hook<>/value_traits<></code>, <code class="computeroutput">constant_time_size<></code>, <code class="computeroutput">size_type<></code> and <code class="computeroutput">compare<></code>. <div class="refsect2"> <a name="idp278798896"></a><h3> <a name="boost.intrusive.bstreeconstruct-copy-destruct"></a><code class="computeroutput">bstree</code> public construct/copy/destruct</h3> <div class="orderedlist"><ol class="orderedlist" type="1"> <li class="listitem"> <pre class="literallayout">explicit <a name="idp61911328-bb"></a>bstree(const value_compare & cmp = value_compare(), const value_traits & v_traits = value_traits());</pre> Effects: Constructs an empty container. Complexity: Constant. Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor of the value_compare object throws. Basic guarantee. </li> <li class="listitem"> <pre class="literallayout">template<typename Iterator> <a name="idp61916704-bb"></a>bstree(bool unique, Iterator b, Iterator e, const value_compare & cmp = value_compare(), const value_traits <span class="special"