| <html> |
| <head> |
| <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> |
| <title>Class template treap_multiset</title> |
| <link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css"> |
| <meta name="generator" content="DocBook XSL Stylesheets V1.75.2"> |
| <link rel="home" href="../../index.html" title="The Boost C++ Libraries BoostBook Documentation Subset"> |
| <link rel="up" href="../../intrusive/reference.html#header.boost.intrusive.treap_set_hpp" title="Header <boost/intrusive/treap_set.hpp>"> |
| <link rel="prev" href="make_treap_set.html" title="Struct template make_treap_set"> |
| <link rel="next" href="make_treap_multiset.html" title="Struct template make_treap_multiset"> |
| </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="make_treap_set.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../intrusive/reference.html#header.boost.intrusive.treap_set_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_treap_multiset.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a> |
| </div> |
| <div class="refentry"> |
| <a name="boost.intrusive.treap_multiset"></a><div class="titlepage"></div> |
| <div class="refnamediv"> |
| <h2><span class="refentrytitle">Class template treap_multiset</span></h2> |
| <p>boost::intrusive::treap_multiset</p> |
| </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"><span class="comment">// In header: <<a class="link" href="../../intrusive/reference.html#header.boost.intrusive.treap_set_hpp" title="Header <boost/intrusive/treap_set.hpp>">boost/intrusive/treap_set.hpp</a>> |
| |
| </span><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="keyword">class</span><span class="special">...</span> Options<span class="special">></span> |
| <span class="keyword">class</span> <a class="link" href="treap_multiset.html" title="Class template treap_multiset">treap_multiset</a> <span class="special">{</span> |
| <span class="keyword">public</span><span class="special">:</span> |
| <span class="comment">// types</span> |
| <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">value_type</span> <a name="boost.intrusive.treap_multiset.value_type"></a><span class="identifier">value_type</span><span class="special">;</span> |
| <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">value_traits</span> <a name="boost.intrusive.treap_multiset.value_traits"></a><span class="identifier">value_traits</span><span class="special">;</span> |
| <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">pointer</span> <a name="boost.intrusive.treap_multiset.pointer"></a><span class="identifier">pointer</span><span class="special">;</span> |
| <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">const_pointer</span> <a name="boost.intrusive.treap_multiset.const_pointer"></a><span class="identifier">const_pointer</span><span class="special">;</span> |
| <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">reference</span> <a name="boost.intrusive.treap_multiset.reference"></a><span class="identifier">reference</span><span class="special">;</span> |
| <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">const_reference</span> <a name="boost.intrusive.treap_multiset.const_reference"></a><span class="identifier">const_reference</span><span class="special">;</span> |
| <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">difference_type</span> <a name="boost.intrusive.treap_multiset.difference_type"></a><span class="identifier">difference_type</span><span class="special">;</span> |
| <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">size_type</span> <a name="boost.intrusive.treap_multiset.size_type"></a><span class="identifier">size_type</span><span class="special">;</span> |
| <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">value_compare</span> <a name="boost.intrusive.treap_multiset.value_compare"></a><span class="identifier">value_compare</span><span class="special">;</span> |
| <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">priority_compare</span> <a name="boost.intrusive.treap_multiset.priority_compare"></a><span class="identifier">priority_compare</span><span class="special">;</span> |
| <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">key_compare</span> <a name="boost.intrusive.treap_multiset.key_compare"></a><span class="identifier">key_compare</span><span class="special">;</span> |
| <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">iterator</span> <a name="boost.intrusive.treap_multiset.iterator"></a><span class="identifier">iterator</span><span class="special">;</span> |
| <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">const_iterator</span> <a name="boost.intrusive.treap_multiset.const_iterator"></a><span class="identifier">const_iterator</span><span class="special">;</span> |
| <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">reverse_iterator</span> <a name="boost.intrusive.treap_multiset.reverse_iterator"></a><span class="identifier">reverse_iterator</span><span class="special">;</span> |
| <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">const_reverse_iterator</span> <a name="boost.intrusive.treap_multiset.const_reverse_iterator"></a><span class="identifier">const_reverse_iterator</span><span class="special">;</span> |
| <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">insert_commit_data</span> <a name="boost.intrusive.treap_multiset.insert_commit_data"></a><span class="identifier">insert_commit_data</span><span class="special">;</span> |
| <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">node_traits</span> <a name="boost.intrusive.treap_multiset.node_traits"></a><span class="identifier">node_traits</span><span class="special">;</span> |
| <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">node</span> <a name="boost.intrusive.treap_multiset.node"></a><span class="identifier">node</span><span class="special">;</span> |
| <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">node_ptr</span> <a name="boost.intrusive.treap_multiset.node_ptr"></a><span class="identifier">node_ptr</span><span class="special">;</span> |
| <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">const_node_ptr</span> <a name="boost.intrusive.treap_multiset.const_node_ptr"></a><span class="identifier">const_node_ptr</span><span class="special">;</span> |
| <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">node_algorithms</span> <a name="boost.intrusive.treap_multiset.node_algorithms"></a><span class="identifier">node_algorithms</span><span class="special">;</span> |
| |
| <span class="comment">// <a class="link" href="treap_multiset.html#boost.intrusive.treap_multisetconstruct-copy-destruct">construct/copy/destruct</a></span> |
| <a class="link" href="treap_multiset.html#id1086373-bb"><span class="identifier">treap_multiset</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">value_compare</span> <span class="special">&</span> <span class="special">=</span> <span class="identifier">value_compare</span><span class="special">(</span><span class="special">)</span><span class="special">,</span> |
| <span class="keyword">const</span> <span class="identifier">priority_compare</span> <span class="special">&</span> <span class="special">=</span> <span class="identifier">priority_compare</span><span class="special">(</span><span class="special">)</span><span class="special">,</span> |
| <span class="keyword">const</span> <a class="link" href="value_traits.html" title="Struct template value_traits">value_traits</a> <span class="special">&</span> <span class="special">=</span> <span class="identifier">value_traits</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span> |
| <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Iterator<span class="special">></span> |
| <a class="link" href="treap_multiset.html#id1086429-bb"><span class="identifier">treap_multiset</span></a><span class="special">(</span><span class="identifier">Iterator</span><span class="special">,</span> <span class="identifier">Iterator</span><span class="special">,</span> |
| <span class="keyword">const</span> <span class="identifier">value_compare</span> <span class="special">&</span> <span class="special">=</span> <span class="identifier">value_compare</span><span class="special">(</span><span class="special">)</span><span class="special">,</span> |
| <span class="keyword">const</span> <span class="identifier">priority_compare</span> <span class="special">&</span> <span class="special">=</span> <span class="identifier">priority_compare</span><span class="special">(</span><span class="special">)</span><span class="special">,</span> |
| <span class="keyword">const</span> <a class="link" href="value_traits.html" title="Struct template value_traits">value_traits</a> <span class="special">&</span> <span class="special">=</span> <span class="identifier">value_traits</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span> |
| <a class="link" href="treap_multiset.html#id1086513-bb"><span class="special">~</span><span class="identifier">treap_multiset</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span> |
| |
| <span class="comment">// <a class="link" href="treap_multiset.html#id1082873-bb">public member functions</a></span> |
| <span class="identifier">iterator</span> <a class="link" href="treap_multiset.html#id1082876-bb"><span class="identifier">begin</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span> |
| <span class="identifier">const_iterator</span> <a class="link" href="treap_multiset.html#id1082907-bb"><span class="identifier">begin</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="identifier">const_iterator</span> <a class="link" href="treap_multiset.html#id1082938-bb"><span class="identifier">cbegin</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="identifier">iterator</span> <a class="link" href="treap_multiset.html#id1082968-bb"><span class="identifier">end</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span> |
| <span class="identifier">const_iterator</span> <a class="link" href="treap_multiset.html#id1082999-bb"><span class="identifier">end</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="identifier">const_iterator</span> <a class="link" href="treap_multiset.html#id1083030-bb"><span class="identifier">cend</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="identifier">iterator</span> <a class="link" href="treap_multiset.html#id1083060-bb"><span class="identifier">top</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span> |
| <span class="identifier">const_iterator</span> <a class="link" href="treap_multiset.html#id1083091-bb"><span class="identifier">top</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="identifier">const_iterator</span> <a class="link" href="treap_multiset.html#id1083122-bb"><span class="identifier">ctop</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="identifier">reverse_iterator</span> <a class="link" href="treap_multiset.html#id1083153-bb"><span class="identifier">rbegin</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span> |
| <span class="identifier">const_reverse_iterator</span> <a class="link" href="treap_multiset.html#id1083184-bb"><span class="identifier">rbegin</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="identifier">const_reverse_iterator</span> <a class="link" href="treap_multiset.html#id1083215-bb"><span class="identifier">crbegin</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="identifier">reverse_iterator</span> <a class="link" href="treap_multiset.html#id1083246-bb"><span class="identifier">rend</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span> |
| <span class="identifier">const_reverse_iterator</span> <a class="link" href="treap_multiset.html#id1083549-bb"><span class="identifier">rend</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="identifier">const_reverse_iterator</span> <a class="link" href="treap_multiset.html#id1083580-bb"><span class="identifier">crend</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="identifier">reverse_iterator</span> <a class="link" href="treap_multiset.html#id1083611-bb"><span class="identifier">rtop</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span> |
| <span class="identifier">const_reverse_iterator</span> <a class="link" href="treap_multiset.html#id1083642-bb"><span class="identifier">rtop</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="identifier">const_reverse_iterator</span> <a class="link" href="treap_multiset.html#id1083673-bb"><span class="identifier">crtop</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="identifier">key_compare</span> <a class="link" href="treap_multiset.html#id1083705-bb"><span class="identifier">key_comp</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="identifier">value_compare</span> <a class="link" href="treap_multiset.html#id1083736-bb"><span class="identifier">value_comp</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="identifier">priority_compare</span> <a class="link" href="treap_multiset.html#id1083767-bb"><span class="identifier">priority_comp</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="keyword">bool</span> <a class="link" href="treap_multiset.html#id1083798-bb"><span class="identifier">empty</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <a class="link" href="size_type.html" title="Struct template size_type">size_type</a> <a class="link" href="treap_multiset.html#id1083828-bb"><span class="identifier">size</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="keyword">void</span> <a class="link" href="treap_multiset.html#id1083861-bb"><span class="identifier">swap</span></a><span class="special">(</span><a class="link" href="treap_multiset.html" title="Class template treap_multiset">treap_multiset</a> <span class="special">&</span><span class="special">)</span><span class="special">;</span> |
| <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Cloner<span class="special">,</span> <span class="keyword">typename</span> Disposer<span class="special">></span> |
| <span class="keyword">void</span> <a class="link" href="treap_multiset.html#id1083901-bb"><span class="identifier">clone_from</span></a><span class="special">(</span><span class="keyword">const</span> <a class="link" href="treap_multiset.html" title="Class template treap_multiset">treap_multiset</a> <span class="special">&</span><span class="special">,</span> <span class="identifier">Cloner</span><span class="special">,</span> <span class="identifier">Disposer</span><span class="special">)</span><span class="special">;</span> |
| <span class="identifier">iterator</span> <a class="link" href="treap_multiset.html#id1083980-bb"><span class="identifier">insert</span></a><span class="special">(</span><span class="identifier">reference</span><span class="special">)</span><span class="special">;</span> |
| <span class="identifier">iterator</span> <a class="link" href="treap_multiset.html#id1084042-bb"><span class="identifier">insert</span></a><span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">reference</span><span class="special">)</span><span class="special">;</span> |
| <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Iterator<span class="special">></span> <span class="keyword">void</span> <a class="link" href="treap_multiset.html#id1084110-bb"><span class="identifier">insert</span></a><span class="special">(</span><span class="identifier">Iterator</span><span class="special">,</span> <span class="identifier">Iterator</span><span class="special">)</span><span class="special">;</span> |
| <span class="identifier">iterator</span> <a class="link" href="treap_multiset.html#id1084186-bb"><span class="identifier">insert_before</span></a><span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">reference</span><span class="special">)</span><span class="special">;</span> |
| <span class="keyword">void</span> <a class="link" href="treap_multiset.html#id1084249-bb"><span class="identifier">push_back</span></a><span class="special">(</span><span class="identifier">reference</span><span class="special">)</span><span class="special">;</span> |
| <span class="keyword">void</span> <a class="link" href="treap_multiset.html#id1084306-bb"><span class="identifier">push_front</span></a><span class="special">(</span><span class="identifier">reference</span><span class="special">)</span><span class="special">;</span> |
| <span class="identifier">iterator</span> <a class="link" href="treap_multiset.html#id1084363-bb"><span class="identifier">erase</span></a><span class="special">(</span><span class="identifier">const_iterator</span><span class="special">)</span><span class="special">;</span> |
| <span class="identifier">iterator</span> <a class="link" href="treap_multiset.html#id1084417-bb"><span class="identifier">erase</span></a><span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">const_iterator</span><span class="special">)</span><span class="special">;</span> |
| <a class="link" href="size_type.html" title="Struct template size_type">size_type</a> <a class="link" href="treap_multiset.html#id1084477-bb"><span class="identifier">erase</span></a><span class="special">(</span><span class="identifier">const_reference</span><span class="special">)</span><span class="special">;</span> |
| <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> KeyType<span class="special">,</span> <span class="keyword">typename</span> KeyValueCompare<span class="special">></span> |
| <a class="link" href="size_type.html" title="Struct template size_type">size_type</a> <a class="link" href="treap_multiset.html#id1084532-bb"><span class="identifier">erase</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">KeyType</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">KeyValueCompare</span><span class="special">)</span><span class="special">;</span> |
| <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Disposer<span class="special">></span> |
| <span class="identifier">iterator</span> <a class="link" href="treap_multiset.html#id1084605-bb"><span class="identifier">erase_and_dispose</span></a><span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">Disposer</span><span class="special">)</span><span class="special">;</span> |
| <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Disposer<span class="special">></span> |
| <span class="identifier">iterator</span> <a class="link" href="treap_multiset.html#id1084680-bb"><span class="identifier">erase_and_dispose</span></a><span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">Disposer</span><span class="special">)</span><span class="special">;</span> |
| <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Disposer<span class="special">></span> |
| <a class="link" href="size_type.html" title="Struct template size_type">size_type</a> <a class="link" href="treap_multiset.html#id1084761-bb"><span class="identifier">erase_and_dispose</span></a><span class="special">(</span><span class="identifier">const_reference</span><span class="special">,</span> <span class="identifier">Disposer</span><span class="special">)</span><span class="special">;</span> |
| <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> KeyType<span class="special">,</span> <span class="keyword">typename</span> KeyValueCompare<span class="special">,</span> <span class="keyword">typename</span> Disposer<span class="special">></span> |
| <a class="link" href="size_type.html" title="Struct template size_type">size_type</a> <a class="link" href="treap_multiset.html#id1084837-bb"><span class="identifier">erase_and_dispose</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">KeyType</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">KeyValueCompare</span><span class="special">,</span> <span class="identifier">Disposer</span><span class="special">)</span><span class="special">;</span> |
| <span class="keyword">void</span> <a class="link" href="treap_multiset.html#id1084928-bb"><span class="identifier">clear</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span> |
| <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Disposer<span class="special">></span> <span class="keyword">void</span> <a class="link" href="treap_multiset.html#id1084969-bb"><span class="identifier">clear_and_dispose</span></a><span class="special">(</span><span class="identifier">Disposer</span><span class="special">)</span><span class="special">;</span> |
| <a class="link" href="size_type.html" title="Struct template size_type">size_type</a> <a class="link" href="treap_multiset.html#id1085030-bb"><span class="identifier">count</span></a><span class="special">(</span><span class="identifier">const_reference</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> KeyType<span class="special">,</span> <span class="keyword">typename</span> KeyValueCompare<span class="special">></span> |
| <a class="link" href="size_type.html" title="Struct template size_type">size_type</a> <a class="link" href="treap_multiset.html#id1085069-bb"><span class="identifier">count</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">KeyType</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">KeyValueCompare</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="identifier">iterator</span> <a class="link" href="treap_multiset.html#id1085126-bb"><span class="identifier">lower_bound</span></a><span class="special">(</span><span class="identifier">const_reference</span><span class="special">)</span><span class="special">;</span> |
| <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> KeyType<span class="special">,</span> <span class="keyword">typename</span> KeyValueCompare<span class="special">></span> |
| <span class="identifier">iterator</span> <a class="link" href="treap_multiset.html#id1085164-bb"><span class="identifier">lower_bound</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">KeyType</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">KeyValueCompare</span><span class="special">)</span><span class="special">;</span> |
| <span class="identifier">const_iterator</span> <a class="link" href="treap_multiset.html#id1085238-bb"><span class="identifier">lower_bound</span></a><span class="special">(</span><span class="identifier">const_reference</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> KeyType<span class="special">,</span> <span class="keyword">typename</span> KeyValueCompare<span class="special">></span> |
| <span class="identifier">const_iterator</span> <a class="link" href="treap_multiset.html#id1085276-bb"><span class="identifier">lower_bound</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">KeyType</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">KeyValueCompare</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="identifier">iterator</span> <a class="link" href="treap_multiset.html#id1085350-bb"><span class="identifier">upper_bound</span></a><span class="special">(</span><span class="identifier">const_reference</span><span class="special">)</span><span class="special">;</span> |
| <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> KeyType<span class="special">,</span> <span class="keyword">typename</span> KeyValueCompare<span class="special">></span> |
| <span class="identifier">iterator</span> <a class="link" href="treap_multiset.html#id1085387-bb"><span class="identifier">upper_bound</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">KeyType</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">KeyValueCompare</span><span class="special">)</span><span class="special">;</span> |
| <span class="identifier">const_iterator</span> <a class="link" href="treap_multiset.html#id1085461-bb"><span class="identifier">upper_bound</span></a><span class="special">(</span><span class="identifier">const_reference</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> KeyType<span class="special">,</span> <span class="keyword">typename</span> KeyValueCompare<span class="special">></span> |
| <span class="identifier">const_iterator</span> <a class="link" href="treap_multiset.html#id1085499-bb"><span class="identifier">upper_bound</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">KeyType</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">KeyValueCompare</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="identifier">iterator</span> <a class="link" href="treap_multiset.html#id1085573-bb"><span class="identifier">find</span></a><span class="special">(</span><span class="identifier">const_reference</span><span class="special">)</span><span class="special">;</span> |
| <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> KeyType<span class="special">,</span> <span class="keyword">typename</span> KeyValueCompare<span class="special">></span> |
| <span class="identifier">iterator</span> <a class="link" href="treap_multiset.html#id1085610-bb"><span class="identifier">find</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">KeyType</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">KeyValueCompare</span><span class="special">)</span><span class="special">;</span> |
| <span class="identifier">const_iterator</span> <a class="link" href="treap_multiset.html#id1085684-bb"><span class="identifier">find</span></a><span class="special">(</span><span class="identifier">const_reference</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> KeyType<span class="special">,</span> <span class="keyword">typename</span> KeyValueCompare<span class="special">></span> |
| <span class="identifier">const_iterator</span> <a class="link" href="treap_multiset.html#id1085721-bb"><span class="identifier">find</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">KeyType</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">KeyValueCompare</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="special">></span> <a class="link" href="treap_multiset.html#id1085795-bb"><span class="identifier">equal_range</span></a><span class="special">(</span><span class="identifier">const_reference</span><span class="special">)</span><span class="special">;</span> |
| <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> KeyType<span class="special">,</span> <span class="keyword">typename</span> KeyValueCompare<span class="special">></span> |
| <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="special">></span> |
| <a class="link" href="treap_multiset.html#id1085834-bb"><span class="identifier">equal_range</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">KeyType</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">KeyValueCompare</span><span class="special">)</span><span class="special">;</span> |
| <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">const_iterator</span> <span class="special">></span> |
| <a class="link" href="treap_multiset.html#id1085909-bb"><span class="identifier">equal_range</span></a><span class="special">(</span><span class="identifier">const_reference</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> KeyType<span class="special">,</span> <span class="keyword">typename</span> KeyValueCompare<span class="special">></span> |
| <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">const_iterator</span> <span class="special">></span> |
| <a class="link" href="treap_multiset.html#id1085948-bb"><span class="identifier">equal_range</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">KeyType</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">KeyValueCompare</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="identifier">iterator</span> <a class="link" href="treap_multiset.html#id1086023-bb"><span class="identifier">iterator_to</span></a><span class="special">(</span><span class="identifier">reference</span><span class="special">)</span><span class="special">;</span> |
| <span class="identifier">const_iterator</span> <a class="link" href="treap_multiset.html#id1086069-bb"><span class="identifier">iterator_to</span></a><span class="special">(</span><span class="identifier">const_reference</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="identifier">pointer</span> <a class="link" href="treap_multiset.html#id1086114-bb"><span class="identifier">unlink_leftmost_without_rebalance</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span> |
| <span class="keyword">void</span> <a class="link" href="treap_multiset.html#id1086155-bb"><span class="identifier">replace_node</span></a><span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">reference</span><span class="special">)</span><span class="special">;</span> |
| <span class="keyword">void</span> <a class="link" href="treap_multiset.html#id1086217-bb"><span class="identifier">rebalance</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span> |
| <span class="identifier">iterator</span> <a class="link" href="treap_multiset.html#id1086247-bb"><span class="identifier">rebalance_subtree</span></a><span class="special">(</span><span class="identifier">iterator</span><span class="special">)</span><span class="special">;</span> |
| <span class="keyword">float</span> <a class="link" href="treap_multiset.html#id1086298-bb"><span class="identifier">balance_factor</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> |
| <span class="keyword">void</span> <a class="link" href="treap_multiset.html#id1086328-bb"><span class="identifier">balance_factor</span></a><span class="special">(</span><span class="keyword">float</span><span class="special">)</span><span class="special">;</span> |
| |
| <span class="comment">// <a class="link" href="treap_multiset.html#id1086540-bb">public static functions</a></span> |
| <span class="keyword">static</span> <a class="link" href="treap_multiset.html" title="Class template treap_multiset">treap_multiset</a> <span class="special">&</span> <a class="link" href="treap_multiset.html#id1086544-bb"><span class="identifier">container_from_end_iterator</span></a><span class="special">(</span><span class="identifier">iterator</span><span class="special">)</span><span class="special">;</span> |
| <span class="keyword">static</span> <span class="keyword">const</span> <a class="link" href="treap_multiset.html" title="Class template treap_multiset">treap_multiset</a> <span class="special">&</span> <a class="link" href="treap_multiset.html#id1086592-bb"><span class="identifier">container_from_end_iterator</span></a><span class="special">(</span><span class="identifier">const_iterator</span><span class="special">)</span><span class="special">;</span> |
| <span class="keyword">static</span> <a class="link" href="treap_multiset.html" title="Class template treap_multiset">treap_multiset</a> <span class="special">&</span> <a class="link" href="treap_multiset.html#id1086640-bb"><span class="identifier">container_from_iterator</span></a><span class="special">(</span><span class="identifier">iterator</span><span class="special">)</span><span class="special">;</span> |
| <span class="keyword">static</span> <span class="keyword">const</span> <a class="link" href="treap_multiset.html" title="Class template treap_multiset">treap_multiset</a> <span class="special">&</span> <a class="link" href="treap_multiset.html#id1086688-bb"><span class="identifier">container_from_iterator</span></a><span class="special">(</span><span class="identifier">const_iterator</span><span class="special">)</span><span class="special">;</span> |
| <span class="keyword">static</span> <span class="identifier">iterator</span> <a class="link" href="treap_multiset.html#id1086736-bb"><span class="identifier">s_iterator_to</span></a><span class="special">(</span><span class="identifier">reference</span><span class="special">)</span><span class="special">;</span> |
| <span class="keyword">static</span> <span class="identifier">const_iterator</span> <a class="link" href="treap_multiset.html#id1086793-bb"><span class="identifier">s_iterator_to</span></a><span class="special">(</span><span class="identifier">const_reference</span><span class="special">)</span><span class="special">;</span> |
| <span class="keyword">static</span> <span class="keyword">void</span> <a class="link" href="treap_multiset.html#id1086850-bb"><span class="identifier">init_node</span></a><span class="special">(</span><span class="identifier">reference</span><span class="special">)</span><span class="special">;</span> |
| <span class="keyword">static</span> <span class="keyword">const</span> <span class="keyword">bool</span> constant_time_size<span class="special">;</span> |
| <span class="special">}</span><span class="special">;</span></pre></div> |
| <div class="refsect1"> |
| <a name="id1958446"></a><h2>Description</h2> |
| <p>The class template treap_multiset is an intrusive container, that mimics most of the interface of std::treap_multiset as described in the C++ standard.</p> |
| <p>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.</p> |
| <p>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>, <code class="computeroutput">compare<></code> and <code class="computeroutput">priority_compare<></code> </p> |
| <div class="refsect2"> |
| <a name="id1958500"></a><h3> |
| <a name="boost.intrusive.treap_multisetconstruct-copy-destruct"></a><code class="computeroutput">treap_multiset</code> |
| public |
| construct/copy/destruct</h3> |
| <div class="orderedlist"><ol class="orderedlist" type="1"> |
| <li class="listitem"> |
| <pre class="literallayout"><a name="id1086373-bb"></a><span class="identifier">treap_multiset</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">value_compare</span> <span class="special">&</span> cmp <span class="special">=</span> <span class="identifier">value_compare</span><span class="special">(</span><span class="special">)</span><span class="special">,</span> |
| <span class="keyword">const</span> <span class="identifier">priority_compare</span> <span class="special">&</span> pcmp <span class="special">=</span> <span class="identifier">priority_compare</span><span class="special">(</span><span class="special">)</span><span class="special">,</span> |
| <span class="keyword">const</span> <a class="link" href="value_traits.html" title="Struct template value_traits">value_traits</a> <span class="special">&</span> v_traits <span class="special">=</span> <span class="identifier">value_traits</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Constructs an empty treap_multiset.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: 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/priority_compare objects throw. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Iterator<span class="special">></span> |
| <a name="id1086429-bb"></a><span class="identifier">treap_multiset</span><span class="special">(</span><span class="identifier">Iterator</span> b<span class="special">,</span> <span class="identifier">Iterator</span> e<span class="special">,</span> |
| <span class="keyword">const</span> <span class="identifier">value_compare</span> <span class="special">&</span> cmp <span class="special">=</span> <span class="identifier">value_compare</span><span class="special">(</span><span class="special">)</span><span class="special">,</span> |
| <span class="keyword">const</span> <span class="identifier">priority_compare</span> <span class="special">&</span> pcmp <span class="special">=</span> <span class="identifier">priority_compare</span><span class="special">(</span><span class="special">)</span><span class="special">,</span> |
| <span class="keyword">const</span> <a class="link" href="value_traits.html" title="Struct template value_traits">value_traits</a> <span class="special">&</span> v_traits <span class="special">=</span> <span class="identifier">value_traits</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Constructs an empty treap_multiset and inserts elements from [b, e).</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Linear in N if [b, e) is already sorted using comp and otherwise N * log N, where N is the distance between first and last</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the value_compare/priority_compare objects throw. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><a name="id1086513-bb"></a><span class="special">~</span><span class="identifier">treap_multiset</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Detaches all elements from this. The objects in the treap_multiset are not deleted (i.e. no destructors are called).</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> |
| </li> |
| </ol></div> |
| </div> |
| <div class="refsect2"> |
| <a name="id1958976"></a><h3> |
| <a name="id1082873-bb"></a><code class="computeroutput">treap_multiset</code> public member functions</h3> |
| <div class="orderedlist"><ol class="orderedlist" type="1"> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">iterator</span> <a name="id1082876-bb"></a><span class="identifier">begin</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns an iterator pointing to the beginning of the treap_multiset.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id1082907-bb"></a><span class="identifier">begin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator pointing to the beginning of the treap_multiset.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id1082938-bb"></a><span class="identifier">cbegin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator pointing to the beginning of the treap_multiset.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">iterator</span> <a name="id1082968-bb"></a><span class="identifier">end</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns an iterator pointing to the end of the treap_multiset.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id1082999-bb"></a><span class="identifier">end</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator pointing to the end of the treap_multiset.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id1083030-bb"></a><span class="identifier">cend</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator pointing to the end of the treap_multiset.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">iterator</span> <a name="id1083060-bb"></a><span class="identifier">top</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns an iterator pointing to the highest priority object of the tree.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id1083091-bb"></a><span class="identifier">top</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator pointing to the highest priority object of the tree..</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id1083122-bb"></a><span class="identifier">ctop</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator pointing to the highest priority object of the tree..</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">reverse_iterator</span> <a name="id1083153-bb"></a><span class="identifier">rbegin</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns a reverse_iterator pointing to the beginning of the reversed treap_multiset.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="id1083184-bb"></a><span class="identifier">rbegin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns a const_reverse_iterator pointing to the beginning of the reversed treap_multiset.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="id1083215-bb"></a><span class="identifier">crbegin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns a const_reverse_iterator pointing to the beginning of the reversed treap_multiset.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">reverse_iterator</span> <a name="id1083246-bb"></a><span class="identifier">rend</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns a reverse_iterator pointing to the end of the reversed treap_multiset.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="id1083549-bb"></a><span class="identifier">rend</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns a const_reverse_iterator pointing to the end of the reversed treap_multiset.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="id1083580-bb"></a><span class="identifier">crend</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns a const_reverse_iterator pointing to the end of the reversed treap_multiset.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">reverse_iterator</span> <a name="id1083611-bb"></a><span class="identifier">rtop</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns a reverse_iterator pointing to the highest priority object of the reversed tree.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="id1083642-bb"></a><span class="identifier">rtop</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns a const_reverse_iterator pointing to the highest priority objec of the reversed tree.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="id1083673-bb"></a><span class="identifier">crtop</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns a const_reverse_iterator pointing to the highest priority object of the reversed tree.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">key_compare</span> <a name="id1083705-bb"></a><span class="identifier">key_comp</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns the key_compare object used by the treap_multiset.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If key_compare copy-constructor throws. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">value_compare</span> <a name="id1083736-bb"></a><span class="identifier">value_comp</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns the value_compare object used by the treap_multiset.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If value_compare copy-constructor throws. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">priority_compare</span> <a name="id1083767-bb"></a><span class="identifier">priority_comp</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns the priority_compare object used by the treap_multiset.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If priority_compare copy-constructor throws. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">bool</span> <a name="id1083798-bb"></a><span class="identifier">empty</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns true if the container is empty.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><a class="link" href="size_type.html" title="Struct template size_type">size_type</a> <a name="id1083828-bb"></a><span class="identifier">size</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns the number of elements stored in the treap_multiset.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Linear to elements contained in *this if, constant-time size option is enabled. Constant-time otherwise.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">void</span> <a name="id1083861-bb"></a><span class="identifier">swap</span><span class="special">(</span><a class="link" href="treap_multiset.html" title="Class template treap_multiset">treap_multiset</a> <span class="special">&</span> other<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Swaps the contents of two treap_multisets.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If the swap() call for the comparison functor found using ADL throws. Strong guarantee. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Cloner<span class="special">,</span> <span class="keyword">typename</span> Disposer<span class="special">></span> |
| <span class="keyword">void</span> <a name="id1083901-bb"></a><span class="identifier">clone_from</span><span class="special">(</span><span class="keyword">const</span> <a class="link" href="treap_multiset.html" title="Class template treap_multiset">treap_multiset</a> <span class="special">&</span> src<span class="special">,</span> <span class="identifier">Cloner</span> cloner<span class="special">,</span> |
| <span class="identifier">Disposer</span> disposer<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.</p> |
| <p>If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Linear to erased plus inserted elements.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If cloner throws or predicate copy assignment throws. Basic guarantee. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">iterator</span> <a name="id1083980-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">reference</span> value<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: value must be an lvalue</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Inserts value into the treap_multiset.</p> |
| <p><span class="bold"><strong>Returns</strong></span>: An iterator that points to the position where the new element was inserted.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Average complexity for insert element is at most logarithmic.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If the internal value_compare or priority_compare ordering function throws. Strong guarantee.</p> |
| <p><span class="bold"><strong>Note</strong></span>: Does not affect the validity of iterators and references. No copy-constructors are called. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">iterator</span> <a name="id1084042-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">const_iterator</span> hint<span class="special">,</span> <span class="identifier">reference</span> value<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: value must be an lvalue</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Inserts x into the treap_multiset, using pos as a hint to where it will be inserted.</p> |
| <p><span class="bold"><strong>Returns</strong></span>: An iterator that points to the position where the new element was inserted.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic in general, but it is amortized constant time if t is inserted immediately before hint.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If internal value_compare or priority_compare ordering functions throw. Strong guarantee.</p> |
| <p><span class="bold"><strong>Note</strong></span>: Does not affect the validity of iterators and references. No copy-constructors are called. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Iterator<span class="special">></span> <span class="keyword">void</span> <a name="id1084110-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">Iterator</span> b<span class="special">,</span> <span class="identifier">Iterator</span> e<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: Dereferencing iterator must yield an lvalue of type value_type.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Inserts a range into the treap_multiset.</p> |
| <p><span class="bold"><strong>Returns</strong></span>: An iterator that points to the position where the new element was inserted.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If internal value_compare or priority_compare ordering functions throw. Basic guarantee.</p> |
| <p><span class="bold"><strong>Note</strong></span>: Does not affect the validity of iterators and references. No copy-constructors are called. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">iterator</span> <a name="id1084186-bb"></a><span class="identifier">insert_before</span><span class="special">(</span><span class="identifier">const_iterator</span> pos<span class="special">,</span> <span class="identifier">reference</span> value<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Inserts x into the treap before "pos".</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant time.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If the internal priority_compare function throws. Strong guarantee.</p> |
| <p><span class="bold"><strong>Note</strong></span>: This function does not check preconditions so if "pos" is not the successor of "value" treap ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">void</span> <a name="id1084249-bb"></a><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">reference</span> value<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: value must be an lvalue, and it must be no less than the greatest inserted key.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Inserts x into the treap in the last position.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant time.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If the internal priority_compare function throws. Strong guarantee.</p> |
| <p><span class="bold"><strong>Note</strong></span>: This function does not check preconditions so if value is less than the greatest inserted key treap ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">void</span> <a name="id1084306-bb"></a><span class="identifier">push_front</span><span class="special">(</span><span class="identifier">reference</span> value<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: value must be an lvalue, and it must be no greater than the minimum inserted key</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Inserts x into the treap in the first position.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant time.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If the internal priority_compare function throws. Strong guarantee.</p> |
| <p><span class="bold"><strong>Note</strong></span>: This function does not check preconditions so if value is greater than the minimum inserted key treap ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">iterator</span> <a name="id1084363-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="identifier">const_iterator</span> i<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Erases the element pointed to by pos.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Average complexity is constant time.</p> |
| <p><span class="bold"><strong>Returns</strong></span>: An iterator to the element after the erased element.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If the internal priority_compare function throws. Strong guarantee.</p> |
| <p><span class="bold"><strong>Note</strong></span>: Invalidates the iterators (but not the references) to the erased elements. No destructors are called. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">iterator</span> <a name="id1084417-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="identifier">const_iterator</span> b<span class="special">,</span> <span class="identifier">const_iterator</span> e<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Erases the range pointed to by b end e.</p> |
| <p><span class="bold"><strong>Returns</strong></span>: An iterator to the element after the erased elements.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If the internal priority_compare function throws. Basic guarantee.</p> |
| <p><span class="bold"><strong>Note</strong></span>: Invalidates the iterators (but not the references) to the erased elements. No destructors are called. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><a class="link" href="size_type.html" title="Struct template size_type">size_type</a> <a name="id1084477-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="identifier">const_reference</span> value<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Erases all the elements with the given value.</p> |
| <p><span class="bold"><strong>Returns</strong></span>: The number of erased elements.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: O(log(size() + this->count(value)).</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If the internal value_compare or priority_compare ordering functiona throw. Basic guarantee.</p> |
| <p><span class="bold"><strong>Note</strong></span>: Invalidates the iterators (but not the references) to the erased elements. No destructors are called. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> KeyType<span class="special">,</span> <span class="keyword">typename</span> KeyValueCompare<span class="special">></span> |
| <a class="link" href="size_type.html" title="Struct template size_type">size_type</a> <a name="id1084532-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">KeyType</span> <span class="special">&</span> key<span class="special">,</span> <span class="identifier">KeyValueCompare</span> comp<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Erases all the elements that compare equal with the given key and the given comparison functor.</p> |
| <p><span class="bold"><strong>Returns</strong></span>: The number of erased elements.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: O(log(size() + this->count(key, comp)).</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If comp or internal priority_compare ordering functions throw. Basic guarantee.</p> |
| <p><span class="bold"><strong>Note</strong></span>: Invalidates the iterators (but not the references) to the erased elements. No destructors are called. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Disposer<span class="special">></span> |
| <span class="identifier">iterator</span> <a name="id1084605-bb"></a><span class="identifier">erase_and_dispose</span><span class="special">(</span><span class="identifier">const_iterator</span> i<span class="special">,</span> <span class="identifier">Disposer</span> disposer<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: Disposer::operator()(pointer) shouldn't throw.</p> |
| <p><span class="bold"><strong>Returns</strong></span>: An iterator to the element after the erased element.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Erases the element pointed to by pos. Disposer::operator()(pointer) is called for the removed element.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Average complexity for erase element is constant time.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If the internal priority_compare function throws. Strong guarantee.</p> |
| <p><span class="bold"><strong>Note</strong></span>: Invalidates the iterators to the erased elements. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Disposer<span class="special">></span> |
| <span class="identifier">iterator</span> <a name="id1084680-bb"></a><span class="identifier">erase_and_dispose</span><span class="special">(</span><span class="identifier">const_iterator</span> b<span class="special">,</span> <span class="identifier">const_iterator</span> e<span class="special">,</span> |
| <span class="identifier">Disposer</span> disposer<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: Disposer::operator()(pointer) shouldn't throw.</p> |
| <p><span class="bold"><strong>Returns</strong></span>: An iterator to the element after the erased elements.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If the internal priority_compare function throws. Basic guarantee.</p> |
| <p><span class="bold"><strong>Note</strong></span>: Invalidates the iterators to the erased elements. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Disposer<span class="special">></span> |
| <a class="link" href="size_type.html" title="Struct template size_type">size_type</a> <a name="id1084761-bb"></a><span class="identifier">erase_and_dispose</span><span class="special">(</span><span class="identifier">const_reference</span> value<span class="special">,</span> <span class="identifier">Disposer</span> disposer<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: Disposer::operator()(pointer) shouldn't throw.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.</p> |
| <p><span class="bold"><strong>Returns</strong></span>: The number of erased elements.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: O(log(size() + this->count(value)).</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If the internal value_compare ordering function throws. Basic guarantee.</p> |
| <p><span class="bold"><strong>Note</strong></span>: Invalidates the iterators (but not the references) to the erased elements. No destructors are called. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> KeyType<span class="special">,</span> <span class="keyword">typename</span> KeyValueCompare<span class="special">,</span> <span class="keyword">typename</span> Disposer<span class="special">></span> |
| <a class="link" href="size_type.html" title="Struct template size_type">size_type</a> <a name="id1084837-bb"></a><span class="identifier">erase_and_dispose</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">KeyType</span> <span class="special">&</span> key<span class="special">,</span> <span class="identifier">KeyValueCompare</span> comp<span class="special">,</span> |
| <span class="identifier">Disposer</span> disposer<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: Disposer::operator()(pointer) shouldn't throw.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Erases all the elements with the given key. according to the comparison functor "comp". Disposer::operator()(pointer) is called for the removed elements.</p> |
| <p><span class="bold"><strong>Returns</strong></span>: The number of erased elements.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: O(log(size() + this->count(key, comp)).</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If comp or internal priority_compare ordering functions throw. Basic guarantee.</p> |
| <p><span class="bold"><strong>Note</strong></span>: Invalidates the iterators to the erased elements. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">void</span> <a name="id1084928-bb"></a><span class="identifier">clear</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Erases all the elements of the container.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p> |
| <p><span class="bold"><strong>Note</strong></span>: Invalidates the iterators (but not the references) to the erased elements. No destructors are called. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Disposer<span class="special">></span> <span class="keyword">void</span> <a name="id1084969-bb"></a><span class="identifier">clear_and_dispose</span><span class="special">(</span><span class="identifier">Disposer</span> disposer<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: Disposer::operator()(pointer) shouldn't throw.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Erases all the elements of the container.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Linear to the number of elements on the container. Disposer::operator()(pointer) is called for the removed elements.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p> |
| <p><span class="bold"><strong>Note</strong></span>: Invalidates the iterators (but not the references) to the erased elements. No destructors are called. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><a class="link" href="size_type.html" title="Struct template size_type">size_type</a> <a name="id1085030-bb"></a><span class="identifier">count</span><span class="special">(</span><span class="identifier">const_reference</span> value<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns the number of contained elements with the given key</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If the internal value_compare ordering function throws. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> KeyType<span class="special">,</span> <span class="keyword">typename</span> KeyValueCompare<span class="special">></span> |
| <a class="link" href="size_type.html" title="Struct template size_type">size_type</a> <a name="id1085069-bb"></a><span class="identifier">count</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">KeyType</span> <span class="special">&</span> key<span class="special">,</span> <span class="identifier">KeyValueCompare</span> comp<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns the number of contained elements with the same key compared with the given comparison functor.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If comp ordering function throws. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">iterator</span> <a name="id1085126-bb"></a><span class="identifier">lower_bound</span><span class="special">(</span><span class="identifier">const_reference</span> value<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If the internal value_compare ordering function throws. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> KeyType<span class="special">,</span> <span class="keyword">typename</span> KeyValueCompare<span class="special">></span> |
| <span class="identifier">iterator</span> <a name="id1085164-bb"></a><span class="identifier">lower_bound</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">KeyType</span> <span class="special">&</span> key<span class="special">,</span> <span class="identifier">KeyValueCompare</span> comp<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: comp must imply the same element order as value_compare. Usually key is the part of the value_type that is used in the ordering functor.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns an iterator to the first element whose key according to the comparison functor is not less than k or end() if that element does not exist.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If comp ordering function throws.</p> |
| <p><span class="bold"><strong>Note</strong></span>: This function is used when constructing a value_type is expensive and the value_type can be compared with a cheaper key type. Usually this key is part of the value_type. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id1085238-bb"></a><span class="identifier">lower_bound</span><span class="special">(</span><span class="identifier">const_reference</span> value<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns a const iterator to the first element whose key is not less than k or end() if that element does not exist.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If the internal value_compare ordering function throws. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> KeyType<span class="special">,</span> <span class="keyword">typename</span> KeyValueCompare<span class="special">></span> |
| <span class="identifier">const_iterator</span> <a name="id1085276-bb"></a><span class="identifier">lower_bound</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">KeyType</span> <span class="special">&</span> key<span class="special">,</span> <span class="identifier">KeyValueCompare</span> comp<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: comp must imply the same element order as value_compare. Usually key is the part of the value_type that is used in the ordering functor.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator to the first element whose key according to the comparison functor is not less than k or end() if that element does not exist.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If comp ordering function throws.</p> |
| <p><span class="bold"><strong>Note</strong></span>: This function is used when constructing a value_type is expensive and the value_type can be compared with a cheaper key type. Usually this key is part of the value_type. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">iterator</span> <a name="id1085350-bb"></a><span class="identifier">upper_bound</span><span class="special">(</span><span class="identifier">const_reference</span> value<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If the internal value_compare ordering function throws. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> KeyType<span class="special">,</span> <span class="keyword">typename</span> KeyValueCompare<span class="special">></span> |
| <span class="identifier">iterator</span> <a name="id1085387-bb"></a><span class="identifier">upper_bound</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">KeyType</span> <span class="special">&</span> key<span class="special">,</span> <span class="identifier">KeyValueCompare</span> comp<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: comp must imply the same element order as value_compare. Usually key is the part of the value_type that is used in the ordering functor.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns an iterator to the first element whose key according to the comparison functor is greater than key or end() if that element does not exist.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If comp ordering function throws.</p> |
| <p><span class="bold"><strong>Note</strong></span>: This function is used when constructing a value_type is expensive and the value_type can be compared with a cheaper key type. Usually this key is part of the value_type. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id1085461-bb"></a><span class="identifier">upper_bound</span><span class="special">(</span><span class="identifier">const_reference</span> value<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If the internal value_compare ordering function throws. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> KeyType<span class="special">,</span> <span class="keyword">typename</span> KeyValueCompare<span class="special">></span> |
| <span class="identifier">const_iterator</span> <a name="id1085499-bb"></a><span class="identifier">upper_bound</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">KeyType</span> <span class="special">&</span> key<span class="special">,</span> <span class="identifier">KeyValueCompare</span> comp<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: comp must imply the same element order as value_compare. Usually key is the part of the value_type that is used in the ordering functor.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator to the first element whose key according to the comparison functor is greater than key or end() if that element does not exist.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If comp ordering function throws.</p> |
| <p><span class="bold"><strong>Note</strong></span>: This function is used when constructing a value_type is expensive and the value_type can be compared with a cheaper key type. Usually this key is part of the value_type. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">iterator</span> <a name="id1085573-bb"></a><span class="identifier">find</span><span class="special">(</span><span class="identifier">const_reference</span> value<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Finds an iterator to the first element whose value is "value" or end() if that element does not exist.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If the internal value_compare ordering function throws. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> KeyType<span class="special">,</span> <span class="keyword">typename</span> KeyValueCompare<span class="special">></span> |
| <span class="identifier">iterator</span> <a name="id1085610-bb"></a><span class="identifier">find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">KeyType</span> <span class="special">&</span> key<span class="special">,</span> <span class="identifier">KeyValueCompare</span> comp<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: comp must imply the same element order as value_compare. Usually key is the part of the value_type that is used in the ordering functor.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Finds an iterator to the first element whose key is "key" according to the comparison functor or end() if that element does not exist.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If comp ordering function throws.</p> |
| <p><span class="bold"><strong>Note</strong></span>: This function is used when constructing a value_type is expensive and the value_type can be compared with a cheaper key type. Usually this key is part of the value_type. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id1085684-bb"></a><span class="identifier">find</span><span class="special">(</span><span class="identifier">const_reference</span> value<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Finds a const_iterator to the first element whose value is "value" or end() if that element does not exist.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If the internal value_compare ordering function throws. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> KeyType<span class="special">,</span> <span class="keyword">typename</span> KeyValueCompare<span class="special">></span> |
| <span class="identifier">const_iterator</span> <a name="id1085721-bb"></a><span class="identifier">find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">KeyType</span> <span class="special">&</span> key<span class="special">,</span> <span class="identifier">KeyValueCompare</span> comp<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: comp must imply the same element order as value_compare. Usually key is the part of the value_type that is used in the ordering functor.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Finds a const_iterator to the first element whose key is "key" according to the comparison functor or end() if that element does not exist.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If comp ordering function throws.</p> |
| <p><span class="bold"><strong>Note</strong></span>: This function is used when constructing a value_type is expensive and the value_type can be compared with a cheaper key type. Usually this key is part of the value_type. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="special">></span> <a name="id1085795-bb"></a><span class="identifier">equal_range</span><span class="special">(</span><span class="identifier">const_reference</span> value<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If the internal value_compare ordering function throws. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> KeyType<span class="special">,</span> <span class="keyword">typename</span> KeyValueCompare<span class="special">></span> |
| <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="special">></span> |
| <a name="id1085834-bb"></a><span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">KeyType</span> <span class="special">&</span> key<span class="special">,</span> <span class="identifier">KeyValueCompare</span> comp<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: comp must imply the same element order as value_compare. Usually key is the part of the value_type that is used in the ordering functor.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Finds a range containing all elements whose key is k according to the comparison functor or an empty range that indicates the position where those elements would be if they there is no elements with key k.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If comp ordering function throws.</p> |
| <p><span class="bold"><strong>Note</strong></span>: This function is used when constructing a value_type is expensive and the value_type can be compared with a cheaper key type. Usually this key is part of the value_type. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">const_iterator</span> <span class="special">></span> |
| <a name="id1085909-bb"></a><span class="identifier">equal_range</span><span class="special">(</span><span class="identifier">const_reference</span> value<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If the internal value_compare ordering function throws. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> KeyType<span class="special">,</span> <span class="keyword">typename</span> KeyValueCompare<span class="special">></span> |
| <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">const_iterator</span> <span class="special">></span> |
| <a name="id1085948-bb"></a><span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">KeyType</span> <span class="special">&</span> key<span class="special">,</span> <span class="identifier">KeyValueCompare</span> comp<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: comp must imply the same element order as value_compare. Usually key is the part of the value_type that is used in the ordering functor.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Finds a range containing all elements whose key is k according to the comparison functor or an empty range that indicates the position where those elements would be if they there is no elements with key k.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: If comp ordering function throws.</p> |
| <p><span class="bold"><strong>Note</strong></span>: This function is used when constructing a value_type is expensive and the value_type can be compared with a cheaper key type. Usually this key is part of the value_type. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">iterator</span> <a name="id1086023-bb"></a><span class="identifier">iterator_to</span><span class="special">(</span><span class="identifier">reference</span> value<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: value must be an lvalue and shall be in a treap_multiset of appropriate type. Otherwise the behavior is undefined.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns: a valid iterator i belonging to the treap_multiset that points to the value</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id1086069-bb"></a><span class="identifier">iterator_to</span><span class="special">(</span><span class="identifier">const_reference</span> value<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: value must be an lvalue and shall be in a treap_multiset of appropriate type. Otherwise the behavior is undefined.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns: a valid const_iterator i belonging to the treap_multiset that points to the value</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">pointer</span> <a name="id1086114-bb"></a><span class="identifier">unlink_leftmost_without_rebalance</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Unlinks the leftmost node from the tree.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Average complexity is constant time.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p> |
| <p><span class="bold"><strong>Notes</strong></span>: This function breaks the tree and the tree can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the tree. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">void</span> <a name="id1086155-bb"></a><span class="identifier">replace_node</span><span class="special">(</span><span class="identifier">iterator</span> replace_this<span class="special">,</span> <span class="identifier">reference</span> with_this<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: replace_this must be a valid iterator of *this and with_this must not be inserted in any tree.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Replaces replace_this in its position in the tree with with_this. The tree does not need to be rebalanced.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p> |
| <p><span class="bold"><strong>Note</strong></span>: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">void</span> <a name="id1086217-bb"></a><span class="identifier">rebalance</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Effects</strong></span>: Rebalances the tree.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Linear. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="identifier">iterator</span> <a name="id1086247-bb"></a><span class="identifier">rebalance_subtree</span><span class="special">(</span><span class="identifier">iterator</span> root<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: old_root is a node of a tree.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Rebalances the subtree rooted at old_root.</p> |
| <p><span class="bold"><strong>Returns</strong></span>: The new root of the subtree.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Linear to the elements in the subtree. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">float</span> <a name="id1086298-bb"></a><span class="identifier">balance_factor</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Returns</strong></span>: The balance factor (alpha) used in this tree</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">void</span> <a name="id1086328-bb"></a><span class="identifier">balance_factor</span><span class="special">(</span><span class="keyword">float</span> new_alpha<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: new_alpha must be a value between 0.5 and 1.0</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Establishes a new balance factor (alpha) and rebalances the tree if the new balance factor is stricter (less) than the old factor.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Linear to the elements in the subtree. </p> |
| </li> |
| </ol></div> |
| </div> |
| <div class="refsect2"> |
| <a name="id1964845"></a><h3> |
| <a name="id1086540-bb"></a><code class="computeroutput">treap_multiset</code> public static functions</h3> |
| <div class="orderedlist"><ol class="orderedlist" type="1"> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">static</span> <a class="link" href="treap_multiset.html" title="Class template treap_multiset">treap_multiset</a> <span class="special">&</span> <a name="id1086544-bb"></a><span class="identifier">container_from_end_iterator</span><span class="special">(</span><span class="identifier">iterator</span> end_iterator<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Precondition</strong></span>: end_iterator must be a valid end iterator of treap_multiset.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns a const reference to the treap_multiset associated to the end iterator</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">static</span> <span class="keyword">const</span> <a class="link" href="treap_multiset.html" title="Class template treap_multiset">treap_multiset</a> <span class="special">&</span> |
| <a name="id1086592-bb"></a><span class="identifier">container_from_end_iterator</span><span class="special">(</span><span class="identifier">const_iterator</span> end_iterator<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Precondition</strong></span>: end_iterator must be a valid end const_iterator of treap_multiset.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns a const reference to the treap_multiset associated to the end iterator</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">static</span> <a class="link" href="treap_multiset.html" title="Class template treap_multiset">treap_multiset</a> <span class="special">&</span> <a name="id1086640-bb"></a><span class="identifier">container_from_iterator</span><span class="special">(</span><span class="identifier">iterator</span> it<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Precondition</strong></span>: it must be a valid iterator of multiset.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns a const reference to the multiset associated to the iterator</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">static</span> <span class="keyword">const</span> <a class="link" href="treap_multiset.html" title="Class template treap_multiset">treap_multiset</a> <span class="special">&</span> <a name="id1086688-bb"></a><span class="identifier">container_from_iterator</span><span class="special">(</span><span class="identifier">const_iterator</span> it<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Precondition</strong></span>: it must be a valid const_iterator of multiset.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns a const reference to the multiset associated to the iterator</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">static</span> <span class="identifier">iterator</span> <a name="id1086736-bb"></a><span class="identifier">s_iterator_to</span><span class="special">(</span><span class="identifier">reference</span> value<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: value must be an lvalue and shall be in a treap_multiset of appropriate type. Otherwise the behavior is undefined.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns: a valid iterator i belonging to the treap_multiset that points to the value</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p> |
| <p><span class="bold"><strong>Note</strong></span>: This static function is available only if the <span class="emphasis"><em>value traits</em></span> is stateless. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">static</span> <span class="identifier">const_iterator</span> <a name="id1086793-bb"></a><span class="identifier">s_iterator_to</span><span class="special">(</span><span class="identifier">const_reference</span> value<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: value must be an lvalue and shall be in a treap_multiset of appropriate type. Otherwise the behavior is undefined.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: Returns: a valid const_iterator i belonging to the treap_multiset that points to the value</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p> |
| <p><span class="bold"><strong>Note</strong></span>: This static function is available only if the <span class="emphasis"><em>value traits</em></span> is stateless. </p> |
| </li> |
| <li class="listitem"> |
| <pre class="literallayout"><span class="keyword">static</span> <span class="keyword">void</span> <a name="id1086850-bb"></a><span class="identifier">init_node</span><span class="special">(</span><span class="identifier">reference</span> value<span class="special">)</span><span class="special">;</span></pre> |
| <p><span class="bold"><strong>Requires</strong></span>: value shall not be in a treap_multiset/treap_multiset.</p> |
| <p><span class="bold"><strong>Effects</strong></span>: init_node puts the hook of a value in a well-known default state.</p> |
| <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p> |
| <p><span class="bold"><strong>Complexity</strong></span>: Constant time.</p> |
| <p><span class="bold"><strong>Note</strong></span>: This function puts the hook in the well-known default state used by auto_unlink and safe hooks. </p> |
| </li> |
| </ol></div> |
| </div> |
| </div> |
| </div> |
| <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> |
| <td align="left"></td> |
| <td align="right"><div class="copyright-footer">Copyright © 2005 Olaf Krzikalla, 2006-2010 Ion Gaztanaga<p> |
| Distributed under the Boost Software License, Version 1.0. (See accompanying |
| file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) |
| </p> |
| </div></td> |
| </tr></table> |
| <hr> |
| <div class="spirit-nav"> |
| <a accesskey="p" href="make_treap_set.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../intrusive/reference.html#header.boost.intrusive.treap_set_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_treap_multiset.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a> |
| </div> |
| </body> |
| </html> |
