[boost-doc-zh commit] r219 - 转换至1.38.0，第4次，包含以下库：
- From: codesite-noreply@xxxxxxxxxx
- To: boost-doc-zh-notify@xxxxxxxxxxxxx
- Date: Tue, 17 Mar 2009 06:18:05 +0000
Author: alai04
Date: Mon Mar 16 23:11:29 2009
New Revision: 219
Added:
trunk/doc/html/boost/intrusive/make_treap_multiset.html
trunk/doc/html/boost/intrusive/make_treap_set.html
trunk/doc/html/boost/intrusive/make_trie.html
trunk/doc/html/boost/intrusive/priority.html
trunk/doc/html/boost/intrusive/priority_compare.html
trunk/doc/html/boost/intrusive/treap.html
trunk/doc/html/boost/intrusive/treap_algorithms/
trunk/doc/html/boost/intrusive/treap_algorithms.html
trunk/doc/html/boost/intrusive/treap_algorithms/insert_commit_data.html
trunk/doc/html/boost/intrusive/treap_multiset.html
trunk/doc/html/boost/intrusive/treap_set.html
trunk/doc/html/boost/mpi/allocator_void_id2813114/
trunk/doc/html/boost/mpi/allocator_void_id2813114.html
trunk/doc/html/boost/mpi/allocator_void_id2813114/rebind.html
trunk/doc/html/boost/mpi/get_id2780176.html
trunk/doc/html/boost/mpi/get_id2780206.html
trunk/doc/html/boost/mpi/is_mpi_floating_point_d_id3037864.html
trunk/doc/html/boost/mpi/operator-_id2840445.html
trunk/doc/html/boost/mpi/operator___id2780718.html
trunk/doc/html/boost/mpi/operator___id2780764.html
trunk/doc/html/boost/mpi/operator___id2843681.html
trunk/doc/html/boost/mpi/operator___id2998741.html
trunk/doc/html/boost/mpi/operator___id2998793.html
trunk/doc/html/boost/mpi/operator___id3037705.html
trunk/doc/html/boost/mpi/operator__id2780873.html
trunk/doc/html/boost/mpi/operator_id2780810.html
trunk/doc/html/boost/mpi/python/register_skeleton_and_c_id3039210.html
trunk/doc/html/intrusive/acknowledgements.html
trunk/doc/html/intrusive/treap_set_multiset.html
Removed:
trunk/doc/html/boost/mpi/allocator_void_id2345663/
trunk/doc/html/boost/mpi/allocator_void_id2345663.html
trunk/doc/html/boost/mpi/get_id2661331.html
trunk/doc/html/boost/mpi/get_id2661361.html
trunk/doc/html/boost/mpi/is_mpi_floating_point_d_id2462521.html
trunk/doc/html/boost/mpi/operator-_id2494855.html
trunk/doc/html/boost/mpi/operator___id2346134.html
trunk/doc/html/boost/mpi/operator___id2462315.html
trunk/doc/html/boost/mpi/operator___id2462362.html
trunk/doc/html/boost/mpi/operator___id2493953.html
trunk/doc/html/boost/mpi/operator___id2494694.html
trunk/doc/html/boost/mpi/operator___id2661873.html
trunk/doc/html/boost/mpi/operator__id2494802.html
trunk/doc/html/boost/mpi/operator_id2494739.html
trunk/doc/html/boost/mpi/python/register_skeleton_and_c_id2694991.html
Modified:
trunk/doc/html/boost/intrusive/splaytree_algorithms.html
trunk/doc/html/boost/intrusive/trivial_value_traits.html
trunk/doc/html/boost/mpi/all_gather.html
trunk/doc/html/boost/mpi/all_reduce.html
trunk/doc/html/boost/mpi/all_to_all.html
trunk/doc/html/boost/mpi/allocator.html
trunk/doc/html/boost/mpi/allocator/rebind.html
trunk/doc/html/boost/mpi/any_source.html
trunk/doc/html/boost/mpi/any_tag.html
trunk/doc/html/boost/mpi/bitwise_and.html
trunk/doc/html/boost/mpi/bitwise_or.html
trunk/doc/html/boost/mpi/bitwise_xor.html
trunk/doc/html/boost/mpi/broadcast.html
trunk/doc/html/boost/mpi/comm_create_kind.html
trunk/doc/html/boost/mpi/communicator.html
trunk/doc/html/boost/mpi/content.html
trunk/doc/html/boost/mpi/environment.html
trunk/doc/html/boost/mpi/exception.html
trunk/doc/html/boost/mpi/gather.html
trunk/doc/html/boost/mpi/get_content.html
trunk/doc/html/boost/mpi/get_mpi_datatype.html
trunk/doc/html/boost/mpi/graph_communicator.html
trunk/doc/html/boost/mpi/group.html
trunk/doc/html/boost/mpi/intercommunicator.html
trunk/doc/html/boost/mpi/is_commutative.html
trunk/doc/html/boost/mpi/is_mpi_builtin_datatype.html
trunk/doc/html/boost/mpi/is_mpi_byte_datatype.html
trunk/doc/html/boost/mpi/is_mpi_complex_datatype.html
trunk/doc/html/boost/mpi/is_mpi_datatype.html
trunk/doc/html/boost/mpi/is_mpi_integer_datatype.html
trunk/doc/html/boost/mpi/is_mpi_logical_datatype.html
trunk/doc/html/boost/mpi/is_mpi_op.html
trunk/doc/html/boost/mpi/logical_xor.html
trunk/doc/html/boost/mpi/maximum.html
trunk/doc/html/boost/mpi/minimum.html
trunk/doc/html/boost/mpi/packed.html
trunk/doc/html/boost/mpi/packed_iarchive.html
trunk/doc/html/boost/mpi/packed_oarchive.html
trunk/doc/html/boost/mpi/packed_skeleton_iarchive.html
trunk/doc/html/boost/mpi/packed_skeleton_oarchive.html
trunk/doc/html/boost/mpi/python/register_serialized.html
trunk/doc/html/boost/mpi/reduce.html
trunk/doc/html/boost/mpi/request.html
trunk/doc/html/boost/mpi/scan.html
trunk/doc/html/boost/mpi/scatter.html
trunk/doc/html/boost/mpi/skeleton.html
trunk/doc/html/boost/mpi/skeleton_proxy.html
trunk/doc/html/boost/mpi/status.html
trunk/doc/html/boost/mpi/test_all.html
trunk/doc/html/boost/mpi/test_any.html
trunk/doc/html/boost/mpi/test_some.html
trunk/doc/html/boost/mpi/timer.html
trunk/doc/html/boost/mpi/wait_all.html
trunk/doc/html/boost/mpi/wait_any.html
trunk/doc/html/boost/mpi/wait_some.html
trunk/doc/html/intrusive.html
trunk/doc/html/intrusive/advanced_lookups_insertions.html
trunk/doc/html/intrusive/node_algorithms.html
trunk/doc/html/intrusive/reference.html
trunk/doc/html/intrusive/release_notes.html
trunk/doc/html/intrusive/sg_set_multiset.html
trunk/doc/html/lambda.html
trunk/doc/html/mpi.html
trunk/doc/html/mpi/python.html
trunk/doc/html/mpi/reference.html
trunk/doc/html/mpi/tutorial.html
Log:
转换至1.38.0，第4次，包含以下库：
intrusive
lambda
mpi
Added: trunk/doc/html/boost/intrusive/make_treap_multiset.html
==============================================================================
--- (empty file)
+++ trunk/doc/html/boost/intrusive/make_treap_multiset.html Mon Mar 16
23:11:29 2009
@@ -0,0 +1,50 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html><head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+
+<title>Struct template make_treap_multiset</title><link rel="stylesheet"
href="../../boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
+<link rel="start" 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="treap_multiset.html" title="Class template
treap_multiset">
+<link rel="next" href="trivial_value_traits.html" title="Struct template
trivial_value_traits"></head>
+<body alink="#0000ff" bgcolor="white" link="#0000ff" text="black"
vlink="#840084">
+<table cellpadding="2" width="100%"><tbody><tr>
+<td valign="top"><img alt="Boost C++ Libraries"
src="../../../../boost.png" height="86" width="277"></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></tbody></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="treap_multiset.html"><img
src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u"
href="../../intrusive/reference.html#header.boost.intrusive.treap_set_hpp"><img
src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h"
href="../../index.html"><img src="../../../../doc/html/images/home.png"
alt="Home"></a><a accesskey="n" href="trivial_value_traits.html"><img
src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="refentry" lang="en">
+<a name="boost.intrusive.make_treap_multiset"></a><div
class="titlepage"></div>
+<div class="refnamediv">
+<h2><span class="refentrytitle">Struct template
make_treap_multiset</span></h2>
+<p>boost::intrusive::make_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="emphasis"><em>//
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>><br><br></em></span><span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> T, <span
class="bold"><strong>class</strong></span>... Options> <br><span
class="bold"><strong>struct</strong></span> <a class="link"
href="make_treap_multiset.html" title="Struct template
make_treap_multiset">make_treap_multiset</a> {<br> <span
class="emphasis"><em>// types</em></span>
+ <span class="bold"><strong>typedef</strong></span>
implementation_defined <a
name="boost.intrusive.make_treap_multiset.type"></a>type;<br>};</pre></div>
+<div class="refsect1" lang="en">
+<a name="id3684500"></a><h2>Description</h2>
+<p>Helper metafunction to define a <code
class="computeroutput">treap_multiset</code> that yields to the same type
when the same options (either explicitly or implicitly) are used.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br>辅助元函数，用于定义
一个<span class="Apple-converted-space"> </span><code
class="computeroutput"><code
class="computeroutput"></code></code></span><code
class="computeroutput">treap</code><code
class="computeroutput">_</code><code
class="computeroutput">multiset</code><span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><code class="computeroutput"><code
class="computeroutput"></code></code>，在使用相同选项(显式或隐式)时产生相同
的类型。</span> </p>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision";
width="100%"><tbody><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2005 Olaf
Krzikalla, 2006-2008 Ion Gaztañaga<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></tbody></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="treap_multiset.html"><img
src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u"
href="../../intrusive/reference.html#header.boost.intrusive.treap_set_hpp"><img
src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h"
href="../../index.html"><img src="../../../../doc/html/images/home.png"
alt="Home"></a><a accesskey="n" href="trivial_value_traits.html"><img
src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body></html>
\ No newline at end of file
Added: trunk/doc/html/boost/intrusive/make_treap_set.html
==============================================================================
--- (empty file)
+++ trunk/doc/html/boost/intrusive/make_treap_set.html Mon Mar 16 23:11:29
2009
@@ -0,0 +1,50 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html><head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+
+<title>Struct template make_treap_set</title><link rel="stylesheet"
href="../../boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
+<link rel="start" 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="treap_set.html" title="Class template treap_set">
+<link rel="next" href="treap_multiset.html" title="Class template
treap_multiset"></head>
+<body alink="#0000ff" bgcolor="white" link="#0000ff" text="black"
vlink="#840084">
+<table cellpadding="2" width="100%"><tbody><tr>
+<td valign="top"><img alt="Boost C++ Libraries"
src="../../../../boost.png" height="86" width="277"></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></tbody></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="treap_set.html"><img
src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u"
href="../../intrusive/reference.html#header.boost.intrusive.treap_set_hpp"><img
src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h"
href="../../index.html"><img src="../../../../doc/html/images/home.png"
alt="Home"></a><a accesskey="n" href="treap_multiset.html"><img
src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="refentry" lang="en">
+<a name="boost.intrusive.make_treap_set"></a><div class="titlepage"></div>
+<div class="refnamediv">
+<h2><span class="refentrytitle">Struct template make_treap_set</span></h2>
+<p>boost::intrusive::make_treap_set</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="emphasis"><em>//
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>><br><br></em></span><span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> T, <span
class="bold"><strong>class</strong></span>... Options> <br><span
class="bold"><strong>struct</strong></span> <a class="link"
href="make_treap_set.html" title="Struct template
make_treap_set">make_treap_set</a> {<br> <span class="emphasis"><em>//
types</em></span>
+ <span class="bold"><strong>typedef</strong></span>
implementation_defined <a
name="boost.intrusive.make_treap_set.type"></a>type;<br>};</pre></div>
+<div class="refsect1" lang="en">
+<a name="id3677886"></a><h2>Description</h2>
+<p>Helper metafunction to define a <code
class="computeroutput">treap_set</code> that yields to the same type when
the same options (either explicitly or implicitly) are used.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br>辅助元函数，用于定义
一个<span class="Apple-converted-space"> </span><code
class="computeroutput"><code
class="computeroutput"></code></code></span><code
class="computeroutput">treap_</code><code
class="computeroutput">set</code><span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><code class="computeroutput"><code
class="computeroutput"></code></code>，在使用相同选项(显式或隐式)时产生相同
的类型。</span> </p>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision";
width="100%"><tbody><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2005 Olaf
Krzikalla, 2006-2008 Ion Gaztañaga<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></tbody></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="treap_set.html"><img
src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u"
href="../../intrusive/reference.html#header.boost.intrusive.treap_set_hpp"><img
src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h"
href="../../index.html"><img src="../../../../doc/html/images/home.png"
alt="Home"></a><a accesskey="n" href="treap_multiset.html"><img
src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body></html>
\ No newline at end of file
Added: trunk/doc/html/boost/intrusive/make_trie.html
==============================================================================
--- (empty file)
+++ trunk/doc/html/boost/intrusive/make_trie.html Mon Mar 16 23:11:29 2009
@@ -0,0 +1,50 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html><head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+
+<title>Struct template make_trie</title><link rel="stylesheet"
href="../../boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
+<link rel="start" href="../../index.html" title="The Boost C++ Libraries
BoostBook Documentation Subset">
+<link rel="up"
href="../../intrusive/reference.html#header.boost.intrusive.treap_hpp"
title="Header <boost/intrusive/treap.hpp>">
+<link rel="prev" href="treap.html" title="Class template treap">
+<link rel="next" href="treap_algorithms.html" title="Class template
treap_algorithms"></head>
+<body alink="#0000ff" bgcolor="white" link="#0000ff" text="black"
vlink="#840084">
+<table cellpadding="2" width="100%"><tbody><tr>
+<td valign="top"><img alt="Boost C++ Libraries"
src="../../../../boost.png" height="86" width="277"></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></tbody></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="treap.html"><img
src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u"
href="../../intrusive/reference.html#header.boost.intrusive.treap_hpp"><img
src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h"
href="../../index.html"><img src="../../../../doc/html/images/home.png"
alt="Home"></a><a accesskey="n" href="treap_algorithms.html"><img
src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="refentry" lang="en">
+<a name="boost.intrusive.make_trie"></a><div class="titlepage"></div>
+<div class="refnamediv">
+<h2><span class="refentrytitle">Struct template make_trie</span></h2>
+<p>boost::intrusive::make_trie</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="emphasis"><em>//
In header: <<a class="link"
href="../../intrusive/reference.html#header.boost.intrusive.treap_hpp"
title="Header
<boost/intrusive/treap.hpp>">boost/intrusive/treap.hpp</a>><br><br></em></span><span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> T, <span
class="bold"><strong>class</strong></span>... Options> <br><span
class="bold"><strong>struct</strong></span> <a class="link"
href="make_trie.html" title="Struct template make_trie">make_trie</a>
{<br> <span class="emphasis"><em>// types</em></span>
+ <span class="bold"><strong>typedef</strong></span>
implementation_defined <a
name="boost.intrusive.make_trie.type"></a>type;<br>};</pre></div>
+<div class="refsect1" lang="en">
+<a name="id3666610"></a><h2>Description</h2>
+<p>Helper metafunction to define a <code
class="computeroutput">treap</code> that yields to the same type when the
same options (either explicitly or implicitly) are used.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br>辅助元函数，用于定义
一个<span class="Apple-converted-space"> </span><code
class="computeroutput"><code
class="computeroutput"></code></code></span><code
class="computeroutput">treap</code><code
class="computeroutput"></code><span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><code class="computeroutput"><code
class="computeroutput"></code></code>，在使用相同选项(显式或隐式)时产生相同
的类型。</span> </p>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision";
width="100%"><tbody><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2005 Olaf
Krzikalla, 2006-2008 Ion Gaztañaga<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></tbody></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="treap.html"><img
src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u"
href="../../intrusive/reference.html#header.boost.intrusive.treap_hpp"><img
src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h"
href="../../index.html"><img src="../../../../doc/html/images/home.png"
alt="Home"></a><a accesskey="n" href="treap_algorithms.html"><img
src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body></html>
\ No newline at end of file
Added: trunk/doc/html/boost/intrusive/priority.html
==============================================================================
--- (empty file)
+++ trunk/doc/html/boost/intrusive/priority.html Mon Mar 16 23:11:29 2009
@@ -0,0 +1,55 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Struct template priority</title>
+<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
+<link rel="start" href="../../index.html" title="The Boost C++ Libraries
BoostBook Documentation Subset">
+<link rel="up"
href="../../intrusive/reference.html#header.boost.intrusive.options_hpp"
title="Header <boost/intrusive/options.hpp>">
+<link rel="prev" href="equal.html" title="Struct template equal">
+<link rel="next" href="hash.html" title="Struct template hash">
+</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="equal.html"><img
src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u"
href="../../intrusive/reference.html#header.boost.intrusive.options_hpp"><img
src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h"
href="../../index.html"><img src="../../../../doc/html/images/home.png"
alt="Home"></a><a accesskey="n" href="hash.html"><img
src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="refentry" lang="en">
+<a name="boost.intrusive.priority"></a><div class="titlepage"></div>
+<div class="refnamediv">
+<h2><span class="refentrytitle">Struct template priority</span></h2>
+<p>boost::intrusive::priority</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="emphasis"><em>//
In header: <<a class="link"
href="../../intrusive/reference.html#header.boost.intrusive.options_hpp"
title="Header
<boost/intrusive/options.hpp>">boost/intrusive/options.hpp</a>>
+
+</em></span><span class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> Priority>
+<span class="bold"><strong>struct</strong></span> <a class="link"
href="priority.html" title="Struct template priority">priority</a> {
+};</pre></div>
+<div class="refsect1" lang="en">
+<a name="id3572076"></a><h2>Description</h2>
+<p>This option setter specifies the equality functor for the value type
</p>
+</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-2008 Ion Gazta�aga<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="equal.html"><img
src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u"
href="../../intrusive/reference.html#header.boost.intrusive.options_hpp"><img
src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h"
href="../../index.html"><img src="../../../../doc/html/images/home.png"
alt="Home"></a><a accesskey="n" href="hash.html"><img
src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>
Added: trunk/doc/html/boost/intrusive/priority_compare.html
==============================================================================
--- (empty file)
+++ trunk/doc/html/boost/intrusive/priority_compare.html Mon Mar 16
23:11:29 2009
@@ -0,0 +1,62 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Struct template priority_compare</title>
+<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
+<link rel="start" href="../../index.html" title="The Boost C++ Libraries
BoostBook Documentation Subset">
+<link rel="up"
href="../../intrusive/reference.html#header.boost.intrusive.priority_compare_hpp"
title="Header <boost/intrusive/priority_compare.hpp>">
+<link rel="prev" href="pointer_plus_bits_T___N_id3431774.html"
title="Struct template pointer_plus_bits<T *, NumBits>">
+<link rel="next" href="rbtree.html" title="Class template rbtree">
+</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="pointer_plus_bits_T___N_id3431774.html"><img
src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u"
href="../../intrusive/reference.html#header.boost.intrusive.priority_compare_hpp"><img
src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h"
href="../../index.html"><img src="../../../../doc/html/images/home.png"
alt="Home"></a><a accesskey="n" href="rbtree.html"><img
src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="refentry" lang="en">
+<a name="boost.intrusive.priority_compare"></a><div
class="titlepage"></div>
+<div class="refnamediv">
+<h2><span class="refentrytitle">Struct template
priority_compare</span></h2>
+<p>boost::intrusive::priority_compare</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="emphasis"><em>//
In header: <<a class="link"
href="../../intrusive/reference.html#header.boost.intrusive.priority_compare_hpp"
title="Header
<boost/intrusive/priority_compare.hpp>">boost/intrusive/priority_compare.hpp</a>>
+
+</em></span><span class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> T>
+<span class="bold"><strong>struct</strong></span> <a class="link"
href="priority_compare.html" title="Struct template
priority_compare">priority_compare</a> {
+
+ <span class="emphasis"><em>// <a class="link"
href="priority_compare.html#id3431908-bb">public member
functions</a></em></span>
+ <span class="type"><span
class="bold"><strong>bool</strong></span></span> <a class="link"
href="priority_compare.html#id3431912-bb"><span
class="bold"><strong>operator</strong></span>()</a>(<span
class="bold"><strong>const</strong></span> T &, <span
class="bold"><strong>const</strong></span> T &) <span
class="bold"><strong>const</strong></span>;
+};</pre></div>
+<div class="refsect1" lang="en">
+<a name="id3573969"></a><h2>Description</h2>
+<div class="refsect2" lang="en">
+<a name="id3573972"></a><h3>
+<a name="id3431908-bb"></a><code
class="computeroutput">priority_compare</code> public member functions</h3>
+<div class="orderedlist"><ol type="1"><li><pre class="literallayout"><span
class="type"><span class="bold"><strong>bool</strong></span></span> <a
name="id3431912-bb"></a><span
class="bold"><strong>operator</strong></span>()(<span
class="bold"><strong>const</strong></span> T & val, <span
class="bold"><strong>const</strong></span> T & val2) <span
class="bold"><strong>const</strong></span>;</pre></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-2008 Ion Gazta�aga<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="pointer_plus_bits_T___N_id3431774.html"><img
src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u"
href="../../intrusive/reference.html#header.boost.intrusive.priority_compare_hpp"><img
src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h"
href="../../index.html"><img src="../../../../doc/html/images/home.png"
alt="Home"></a><a accesskey="n" href="rbtree.html"><img
src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>
Modified: trunk/doc/html/boost/intrusive/splaytree_algorithms.html
==============================================================================
--- trunk/doc/html/boost/intrusive/splaytree_algorithms.html (original)
+++ trunk/doc/html/boost/intrusive/splaytree_algorithms.html Mon Mar 16
23:11:29 2009
@@ -19,7 +19,7 @@
</tr></tbody></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="make_splaytree.html"><img
src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u"
href="../../intrusive/reference.html#header.boost.intrusive.splaytree_algorithms.hpp"><img
src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h"
href="../../index.html"><img src="../../../../doc/html/images/home.png"
alt="Home"></a><a accesskey="n" href="trivial_value_traits.html"><img
src="../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="make_splaytree.html"><img
src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u"
href="../../intrusive/reference.html#header.boost.intrusive.splaytree_algorithms.hpp"><img
src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h"
href="../../index.html"><img src="../../../../doc/html/images/home.png"
alt="Home"></a><a accesskey="n" href="treap.html"><img style="border: 0px
solid ; width: 19px; height: 19px;"
src="../../../../doc/html/images/next.png" alt="Next"></a>
</div>
<div class="refentry" lang="en">
<a name="boost.intrusive.splaytree_algorithms"></a><div
class="titlepage"></div>
@@ -464,6 +464,6 @@
</tr></tbody></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="make_splaytree.html"><img
src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u"
href="../../intrusive/reference.html#header.boost.intrusive.splaytree_algorithms.hpp"><img
src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h"
href="../../index.html"><img src="../../../../doc/html/images/home.png"
alt="Home"></a><a accesskey="n" href="trivial_value_traits.html"><img
src="../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="make_splaytree.html"><img
src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u"
href="../../intrusive/reference.html#header.boost.intrusive.splaytree_algorithms.hpp"><img
src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h"
href="../../index.html"><img src="../../../../doc/html/images/home.png"
alt="Home"></a><a accesskey="n" href="treap.html"><img style="border: 0px
solid ; width: 19px; height: 19px;"
src="../../../../doc/html/images/next.png" alt="Next"></a>
</div>
</body></html>
Added: trunk/doc/html/boost/intrusive/treap.html
==============================================================================
--- (empty file)
+++ trunk/doc/html/boost/intrusive/treap.html Mon Mar 16 23:11:29 2009
@@ -0,0 +1,903 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html><head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+
+<title>Class template treap</title><link rel="stylesheet"
href="../../boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
+<link rel="start" href="../../index.html" title="The Boost C++ Libraries
BoostBook Documentation Subset">
+<link rel="up"
href="../../intrusive/reference.html#header.boost.intrusive.treap_hpp"
title="Header <boost/intrusive/treap.hpp>">
+<link rel="prev" href="splaytree_algorithms.html" title="Class template
splaytree_algorithms">
+<link rel="next" href="make_trie.html" title="Struct template
make_trie"></head>
+<body alink="#0000ff" bgcolor="white" link="#0000ff" text="black"
vlink="#840084">
+<table cellpadding="2" width="100%"><tbody><tr>
+<td valign="top"><img alt="Boost C++ Libraries"
src="../../../../boost.png" height="86" width="277"></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></tbody></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="splaytree_algorithms.html"><img
src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u"
href="../../intrusive/reference.html#header.boost.intrusive.treap_hpp"><img
src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h"
href="../../index.html"><img src="../../../../doc/html/images/home.png"
alt="Home"></a><a accesskey="n" href="make_trie.html"><img
src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="refentry" lang="en">
+<a name="boost.intrusive.treap"></a><div class="titlepage"></div>
+<div class="refnamediv">
+<h2><span class="refentrytitle">Class template treap</span></h2>
+<p>boost::intrusive::treap</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="emphasis"><em>//
In header: <<a class="link"
href="../../intrusive/reference.html#header.boost.intrusive.treap_hpp"
title="Header
<boost/intrusive/treap.hpp>">boost/intrusive/treap.hpp</a>><br><br></em></span><span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> T, <span
class="bold"><strong>class</strong></span>... Options> <br><span
class="bold"><strong>class</strong></span> <a class="link"
href="treap.html" title="Class template treap">treap</a> {<br><span
class="bold"><strong>public</strong></span>:<br> <span
class="emphasis"><em>// types</em></span>
+ <span class="bold"><strong>typedef</strong></span>
Config::value_traits <a
name="boost.intrusive.treap.value_traits"></a>value_traits; <br>
<span class="bold"><strong>typedef</strong></span>
real_value_traits::pointer <a
name="boost.intrusive.treap.pointer"></a>pointer; <br> <span
class="bold"><strong>typedef</strong></span>
real_value_traits::const_pointer <a
name="boost.intrusive.treap.const_pointer"></a>const_pointer; <br>
<span class="bold"><strong>typedef</strong></span> std::iterator_traits<
pointer >::value_type <a
name="boost.intrusive.treap.value_type"></a>value_type; <br>
<span class="bold"><strong>typedef</strong></span>
value_type <a
name="boost.intrusive.treap.key_type"></a>key_type; <br>
<span class="bold"><strong>typedef</strong></span> std::iterator_traits<
pointer >::reference <a
name="boost.intrusive.treap.reference"></a>reference; <br>
<span class="bold"><strong>typedef</strong></span> std::iterator_traits<
const_pointer >::reference <a
name="boost.intrusive.treap.const_reference"></a>const_reference;
<br> <span class="bold"><strong>typedef</strong></span>
std::iterator_traits< pointer >::difference_type <a
name="boost.intrusive.treap.difference_type"></a>difference_type;
<br> <span class="bold"><strong>typedef</strong></span>
Config::size_type <a
name="boost.intrusive.treap.size_type"></a>size_type; <br>
<span class="bold"><strong>typedef</strong></span>
Config::compare <a
name="boost.intrusive.treap.value_compare"></a>value_compare; <br>
<span class="bold"><strong>typedef</strong></span>
Config::priority_compare <a
name="boost.intrusive.treap.priority_compare"></a>priority_compare;
<br> <span class="bold"><strong>typedef</strong></span>
value_compare <a
name="boost.intrusive.treap.key_compare"></a>key_compare; <br>
<span class="bold"><strong>typedef</strong></span> tree_iterator< <a
class="link" href="treap.html" title="Class template treap">treap</a>,
<span class="bold"><strong>false</strong></span>
> <a
name="boost.intrusive.treap.iterator"></a>iterator; <br>
<span class="bold"><strong>typedef</strong></span> tree_iterator< <a
class="link" href="treap.html" title="Class template treap">treap</a>,
<span class="bold"><strong>true</strong></span>
> <a
name="boost.intrusive.treap.const_iterator"></a>const_iterator;
<br> <span class="bold"><strong>typedef</strong></span>
std::reverse_iterator< iterator > <a
name="boost.intrusive.treap.reverse_iterator"></a>reverse_iterator;
<br> <span class="bold"><strong>typedef</strong></span>
std::reverse_iterator< const_iterator > <a
name="boost.intrusive.treap.const_reverse_iterator"></a>const_reverse_iterator;<br>
<span class="bold"><strong>typedef</strong></span>
real_value_traits::node_traits <a
name="boost.intrusive.treap.node_traits"></a>node_traits; <br>
<span class="bold"><strong>typedef</strong></span>
node_traits::node <a
name="boost.intrusive.treap.node"></a>node; <br> <span
class="bold"><strong>typedef</strong></span> boost::pointer_to_other<
pointer, node >::type <a
name="boost.intrusive.treap.node_ptr"></a>node_ptr; <br>
<span class="bold"><strong>typedef</strong></span>
boost::pointer_to_other< node_ptr, <span
class="bold"><strong>const</strong></span> node >::type <a
name="boost.intrusive.treap.const_node_ptr"></a>const_node_ptr;
<br> <span class="bold"><strong>typedef</strong></span> <a class="link"
href="treap_algorithms.html" title="Class template
treap_algorithms">treap_algorithms</a>< node_traits
> <a
name="boost.intrusive.treap.node_algorithms"></a>node_algorithms;
<br> <span class="bold"><strong>typedef</strong></span>
node_algorithms::insert_commit_data <a
name="boost.intrusive.treap.insert_commit_data"></a>insert_commit_data;
<br><br> <span class="emphasis"><em>// <a class="link"
href="treap.html#boost.intrusive.treapconstruct-copy-destruct">construct/copy/destruct</a></em></span>
+ <a class="link" href="treap.html#id3485311-bb">treap</a>(<span
class="bold"><strong>const</strong></span> value_compare & =
value_compare(), <br> <span
class="bold"><strong>const</strong></span> priority_compare & =
priority_compare(), <br> <span
class="bold"><strong>const</strong></span> <a class="link"
href="value_traits.html" title="Struct template
value_traits">value_traits</a> & = value_traits());<br> <span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> Iterator> <br> <a
class="link" href="treap.html#id3485367-bb">treap</a>(<span
class="bold"><strong>bool</strong></span>, Iterator, Iterator, <span
class="bold"><strong>const</strong></span> value_compare & =
value_compare(), <br> <span
class="bold"><strong>const</strong></span> priority_compare & =
priority_compare(), <br> <span
class="bold"><strong>const</strong></span> <a class="link"
href="value_traits.html" title="Struct template
value_traits">value_traits</a> & = value_traits());<br> <a
class="link" href="treap.html#id3485460-bb">~treap</a>();<br><br> <span
class="emphasis"><em>// <a class="link"
href="treap.html#id3482075-bb">public member functions</a></em></span>
+ <span class="type"><span class="bold"><strong>const</strong></span>
real_value_traits &</span> <a class="link"
href="treap.html#id3482078-bb">get_real_value_traits</a>() <span
class="bold"><strong>const</strong></span>;<br> <span
class="type">real_value_traits &</span> <a class="link"
href="treap.html#id3482087-bb">get_real_value_traits</a>() ;<br> <span
class="type">iterator</span> <a class="link"
href="treap.html#id3482095-bb">begin</a>() ;<br> <span
class="type">const_iterator</span> <a class="link"
href="treap.html#id3482126-bb">begin</a>() <span
class="bold"><strong>const</strong></span>;<br> <span
class="type">const_iterator</span> <a class="link"
href="treap.html#id3482158-bb">cbegin</a>() <span
class="bold"><strong>const</strong></span>;<br> <span
class="type">iterator</span> <a class="link"
href="treap.html#id3482189-bb">end</a>() ;<br> <span
class="type">const_iterator</span> <a class="link"
href="treap.html#id3482220-bb">end</a>() <span
class="bold"><strong>const</strong></span>;<br> <span
class="type">const_iterator</span> <a class="link"
href="treap.html#id3482251-bb">cend</a>() <span
class="bold"><strong>const</strong></span>;<br> <span
class="type">iterator</span> <a class="link"
href="treap.html#id3482283-bb">top</a>() ;<br> <span
class="type">const_iterator</span> <a class="link"
href="treap.html#id3482314-bb">top</a>() <span
class="bold"><strong>const</strong></span>;<br> <span
class="type">const_iterator</span> <a class="link"
href="treap.html#id3482346-bb">ctop</a>() <span
class="bold"><strong>const</strong></span>;<br> <span
class="type">reverse_iterator</span> <a class="link"
href="treap.html#id3482377-bb">rbegin</a>() ;<br> <span
class="type">const_reverse_iterator</span> <a class="link"
href="treap.html#id3482409-bb">rbegin</a>() <span
class="bold"><strong>const</strong></span>;<br> <span
class="type">const_reverse_iterator</span> <a class="link"
href="treap.html#id3482440-bb">crbegin</a>() <span
class="bold"><strong>const</strong></span>;<br> <span
class="type">reverse_iterator</span> <a class="link"
href="treap.html#id3482472-bb">rend</a>() ;<br> <span
class="type">const_reverse_iterator</span> <a class="link"
href="treap.html#id3482504-bb">rend</a>() <span
class="bold"><strong>const</strong></span>;<br> <span
class="type">const_reverse_iterator</span> <a class="link"
href="treap.html#id3482535-bb">crend</a>() <span
class="bold"><strong>const</strong></span>;<br> <span
class="type">reverse_iterator</span> <a class="link"
href="treap.html#id3482567-bb">rtop</a>() ;<br> <span
class="type">const_reverse_iterator</span> <a class="link"
href="treap.html#id3482599-bb">rtop</a>() <span
class="bold"><strong>const</strong></span>;<br> <span
class="type">const_reverse_iterator</span> <a class="link"
href="treap.html#id3482631-bb">crtop</a>() <span
class="bold"><strong>const</strong></span>;<br> <span
class="type">value_compare</span> <a class="link"
href="treap.html#id3482663-bb">value_comp</a>() <span
class="bold"><strong>const</strong></span>;<br> <span
class="type">priority_compare</span> <a class="link"
href="treap.html#id3482695-bb">priority_comp</a>() <span
class="bold"><strong>const</strong></span>;<br> <span class="type"><span
class="bold"><strong>bool</strong></span></span> <a class="link"
href="treap.html#id3482727-bb">empty</a>() <span
class="bold"><strong>const</strong></span>;<br> <span class="type"><a
class="link" href="size_type.html" title="Struct template
size_type">size_type</a></span> <a class="link"
href="treap.html#id3482758-bb">size</a>() <span
class="bold"><strong>const</strong></span>;<br> <span class="type"><span
class="bold"><strong>void</strong></span></span> <a class="link"
href="treap.html#id3482791-bb">swap</a>(<a class="link" href="treap.html"
title="Class template treap">treap</a> &) ;<br> <span
class="type">iterator</span> <a class="link"
href="treap.html#id3482831-bb">insert_equal</a>(reference) ;<br> <span
class="type">iterator</span> <a class="link"
href="treap.html#id3482886-bb">insert_equal</a>(const_iterator,
reference) ;<br> <span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> Iterator> <span
class="type"><span class="bold"><strong>void</strong></span></span> <a
class="link" href="treap.html#id3482950-bb">insert_equal</a>(Iterator,
Iterator) ;<br> <span class="type">std::pair< iterator, <span
class="bold"><strong>bool</strong></span> ></span> <a class="link"
href="treap.html#id3483021-bb">insert_unique</a>(reference) ;<br> <span
class="type">iterator</span> <a class="link"
href="treap.html#id3483076-bb">insert_unique</a>(const_iterator,
reference) ;<br> <span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> Iterator> <span
class="type"><span class="bold"><strong>void</strong></span></span> <a
class="link" href="treap.html#id3483140-bb">insert_unique</a>(Iterator,
Iterator) ;<br> <span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> KeyType, <span
class="bold"><strong>typename</strong></span> KeyValueCompare,
<br> <span class="bold"><strong>typename</strong></span>
KeyValuePrioCompare> <br> <span class="type">std::pair< iterator,
<span class="bold"><strong>bool</strong></span> ></span> <br> <a
class="link" href="treap.html#id3483210-bb">insert_unique_check</a>(<span
class="bold"><strong>const</strong></span> KeyType &, KeyValueCompare,
KeyValuePrioCompare, <br> <a class="link"
href="treap.html#boost.intrusive.treap.insert_commit_data">insert_commit_data</a>
&) ;<br> <span class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> KeyType, <span
class="bold"><strong>typename</strong></span> KeyValueCompare,
<br> <span class="bold"><strong>typename</strong></span>
KeyValuePrioCompare> <br> <span class="type">std::pair< iterator,
<span class="bold"><strong>bool</strong></span> ></span> <br> <a
class="link"
href="treap.html#id3483332-bb">insert_unique_check</a>(const_iterator,
<span class="bold"><strong>const</strong></span> KeyType &,
KeyValueCompare, <br> KeyValuePrioCompare, <a
class="link"
href="treap.html#boost.intrusive.treap.insert_commit_data">insert_commit_data</a>
&) ;<br> <span class="type">iterator</span> <a class="link"
href="treap.html#id3483462-bb">insert_unique_commit</a>(reference, <span
class="bold"><strong>const</strong></span> <a class="link"
href="treap.html#boost.intrusive.treap.insert_commit_data">insert_commit_data</a>
&) ;<br> <span class="type">iterator</span> <a class="link"
href="treap.html#id3483539-bb">erase</a>(const_iterator) ;<br> <span
class="type">iterator</span> <a class="link"
href="treap.html#id3483586-bb">erase</a>(const_iterator,
const_iterator) ;<br> <span class="type"><a class="link"
href="size_type.html" title="Struct template
size_type">size_type</a></span> <a class="link"
href="treap.html#id3483640-bb">erase</a>(const_reference) ;<br> <span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> KeyType, <span
class="bold"><strong>typename</strong></span> KeyValueCompare> <br>
<span class="type"><a class="link" href="size_type.html" title="Struct
template size_type">size_type</a></span> <a class="link"
href="treap.html#id3483695-bb">erase</a>(<span
class="bold"><strong>const</strong></span> KeyType &,
KeyValueCompare) ;<br> <span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> Disposer> <br> <span
class="type">iterator</span> <a class="link"
href="treap.html#id3483769-bb">erase_and_dispose</a>(const_iterator,
Disposer) ;<br> <span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> Disposer> <br> <span
class="type">iterator</span> <a class="link"
href="treap.html#id3483837-bb">erase_and_dispose</a>(const_iterator,
const_iterator, Disposer) ;<br> <span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> Disposer> <br> <span
class="type"><a class="link" href="size_type.html" title="Struct template
size_type">size_type</a></span> <a class="link"
href="treap.html#id3483912-bb">erase_and_dispose</a>(const_reference,
Disposer) ;<br> <span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> KeyType, <span
class="bold"><strong>typename</strong></span> KeyValueCompare, <span
class="bold"><strong>typename</strong></span> Disposer> <br> <span
class="type"><a class="link" href="size_type.html" title="Struct template
size_type">size_type</a></span> <a class="link"
href="treap.html#id3483991-bb">erase_and_dispose</a>(<span
class="bold"><strong>const</strong></span> KeyType &, KeyValueCompare,
Disposer) ;<br> <span class="type"><span
class="bold"><strong>void</strong></span></span> <a class="link"
href="treap.html#id3484084-bb">clear</a>() ;<br> <span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> Disposer> <span
class="type"><span class="bold"><strong>void</strong></span></span> <a
class="link"
href="treap.html#id3484126-bb">clear_and_dispose</a>(Disposer) ;<br> <span
class="type"><a class="link" href="size_type.html" title="Struct template
size_type">size_type</a></span> <a class="link"
href="treap.html#id3484179-bb">count</a>(const_reference) <span
class="bold"><strong>const</strong></span>;<br> <span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> KeyType, <span
class="bold"><strong>typename</strong></span> KeyValueCompare> <br>
<span class="type"><a class="link" href="size_type.html" title="Struct
template size_type">size_type</a></span> <a class="link"
href="treap.html#id3484219-bb">count</a>(<span
class="bold"><strong>const</strong></span> KeyType &, KeyValueCompare)
<span class="bold"><strong>const</strong></span>;<br> <span
class="type">iterator</span> <a class="link"
href="treap.html#id3484276-bb">lower_bound</a>(const_reference) ;<br>
<span class="type">const_iterator</span> <a class="link"
href="treap.html#id3484314-bb">lower_bound</a>(const_reference) <span
class="bold"><strong>const</strong></span>;<br> <span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> KeyType, <span
class="bold"><strong>typename</strong></span> KeyValueCompare> <br>
<span class="type">iterator</span> <a class="link"
href="treap.html#id3484353-bb">lower_bound</a>(<span
class="bold"><strong>const</strong></span> KeyType &,
KeyValueCompare) ;<br> <span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> KeyType, <span
class="bold"><strong>typename</strong></span> KeyValueCompare> <br>
<span class="type">const_iterator</span> <a class="link"
href="treap.html#id3484408-bb">lower_bound</a>(<span
class="bold"><strong>const</strong></span> KeyType &, KeyValueCompare)
<span class="bold"><strong>const</strong></span>;<br> <span
class="type">iterator</span> <a class="link"
href="treap.html#id3484464-bb">upper_bound</a>(const_reference) ;<br>
<span class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> KeyType, <span
class="bold"><strong>typename</strong></span> KeyValueCompare> <br>
<span class="type">iterator</span> <a class="link"
href="treap.html#id3484502-bb">upper_bound</a>(<span
class="bold"><strong>const</strong></span> KeyType &,
KeyValueCompare) ;<br> <span class="type">const_iterator</span> <a
class="link"
href="treap.html#id3484558-bb">upper_bound</a>(const_reference) <span
class="bold"><strong>const</strong></span>;<br> <span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> KeyType, <span
class="bold"><strong>typename</strong></span> KeyValueCompare> <br>
<span class="type">const_iterator</span> <a class="link"
href="treap.html#id3484596-bb">upper_bound</a>(<span
class="bold"><strong>const</strong></span> KeyType &, KeyValueCompare)
<span class="bold"><strong>const</strong></span>;<br> <span
class="type">iterator</span> <a class="link"
href="treap.html#id3484653-bb">find</a>(const_reference) ;<br> <span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> KeyType, <span
class="bold"><strong>typename</strong></span> KeyValueCompare> <br>
<span class="type">iterator</span> <a class="link"
href="treap.html#id3484690-bb">find</a>(<span
class="bold"><strong>const</strong></span> KeyType &,
KeyValueCompare) ;<br> <span class="type">const_iterator</span> <a
class="link" href="treap.html#id3484746-bb">find</a>(const_reference) <span
class="bold"><strong>const</strong></span>;<br> <span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> KeyType, <span
class="bold"><strong>typename</strong></span> KeyValueCompare> <br>
<span class="type">const_iterator</span> <a class="link"
href="treap.html#id3484784-bb">find</a>(<span
class="bold"><strong>const</strong></span> KeyType &, KeyValueCompare)
<span class="bold"><strong>const</strong></span>;<br> <span
class="type">std::pair< iterator, iterator ></span> <a class="link"
href="treap.html#id3484840-bb">equal_range</a>(const_reference) ;<br>
<span class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> KeyType, <span
class="bold"><strong>typename</strong></span> KeyValueCompare> <br>
<span class="type">std::pair< iterator, iterator ></span> <br> <a
class="link" href="treap.html#id3484879-bb">equal_range</a>(<span
class="bold"><strong>const</strong></span> KeyType &,
KeyValueCompare) ;<br> <span class="type">std::pair< const_iterator,
const_iterator ></span> <br> <a class="link"
href="treap.html#id3484936-bb">equal_range</a>(const_reference) <span
class="bold"><strong>const</strong></span>;<br> <span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> KeyType, <span
class="bold"><strong>typename</strong></span> KeyValueCompare> <br>
<span class="type">std::pair< const_iterator, const_iterator ></span>
<br> <a class="link"
href="treap.html#id3484975-bb">equal_range</a>(<span
class="bold"><strong>const</strong></span> KeyType &, KeyValueCompare)
<span class="bold"><strong>const</strong></span>;<br> <span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> Cloner, <span
class="bold"><strong>typename</strong></span> Disposer> <br> <span
class="type"><span class="bold"><strong>void</strong></span></span> <a
class="link" href="treap.html#id3485033-bb">clone_from</a>(<span
class="bold"><strong>const</strong></span> <a class="link"
href="treap.html" title="Class template treap">treap</a> &, Cloner,
Disposer) ;<br> <span class="type">pointer</span> <a class="link"
href="treap.html#id3485114-bb">unlink_leftmost_without_rebalance</a>() ;<br>
<span class="type"><span class="bold"><strong>void</strong></span></span>
<a class="link" href="treap.html#id3485156-bb">replace_node</a>(iterator,
reference) ;<br> <span class="type">iterator</span> <a class="link"
href="treap.html#id3485219-bb">iterator_to</a>(reference) ;<br> <span
class="type">const_iterator</span> <a class="link"
href="treap.html#id3485265-bb">iterator_to</a>(const_reference) <span
class="bold"><strong>const</strong></span>;<br><br> <span
class="emphasis"><em>// <a class="link"
href="treap.html#id3485488-bb">public static functions</a></em></span>
+ <span class="type"><span class="bold"><strong>static</strong></span> <a
class="link" href="treap.html" title="Class template treap">treap</a>
&</span> <a class="link"
href="treap.html#id3485492-bb">container_from_end_iterator</a>(iterator) ;<br>
<span class="type"><span class="bold"><strong>static</strong></span> <span
class="bold"><strong>const</strong></span> <a class="link"
href="treap.html" title="Class template treap">treap</a> &</span> <a
class="link"
href="treap.html#id3485541-bb">container_from_end_iterator</a>(const_iterator) ;<br>
<span class="type"><span class="bold"><strong>static</strong></span> <a
class="link" href="treap.html" title="Class template treap">treap</a>
&</span> <a class="link"
href="treap.html#id3485591-bb">container_from_iterator</a>(iterator) ;<br>
<span class="type"><span class="bold"><strong>static</strong></span> <span
class="bold"><strong>const</strong></span> <a class="link"
href="treap.html" title="Class template treap">treap</a> &</span> <a
class="link"
href="treap.html#id3485639-bb">container_from_iterator</a>(const_iterator) ;<br>
<span class="type"><span class="bold"><strong>static</strong></span>
iterator</span> <a class="link"
href="treap.html#id3485689-bb">s_iterator_to</a>(reference) ;<br> <span
class="type"><span class="bold"><strong>static</strong></span>
const_iterator</span> <a class="link"
href="treap.html#id3485743-bb">s_iterator_to</a>(const_reference) ;<br>
<span class="type"><span class="bold"><strong>static</strong></span> <span
class="bold"><strong>void</strong></span></span> <a class="link"
href="treap.html#id3485797-bb">init_node</a>(reference) ;<br><br> <span
class="emphasis"><em>// <a class="link"
href="treap.html#id3485850-bb">private static functions</a></em></span>
+ <span class="type"><span class="bold"><strong>static</strong></span> <a
class="link" href="treap.html" title="Class template treap">treap</a>
&</span> <a class="link"
href="treap.html#id3485854-bb">priv_container_from_end_iterator</a>(<span
class="bold"><strong>const</strong></span> const_iterator &) ;<br>
<span class="type"><span class="bold"><strong>static</strong></span> <a
class="link" href="treap.html" title="Class template treap">treap</a>
&</span> <a class="link"
href="treap.html#id3485872-bb">priv_container_from_iterator</a>(<span
class="bold"><strong>const</strong></span> const_iterator &) ;<br>
<span class="bold"><strong>static</strong></span> <span class="type"><span
class="bold"><strong>const</strong></span> <span
class="bold"><strong>bool</strong></span></span> constant_time_size;<br>
<span class="bold"><strong>static</strong></span> <span class="type"><span
class="bold"><strong>const</strong></span> <span
class="bold"><strong>bool</strong></span></span>
stateful_value_traits;<br>};</pre></div>
+<div class="refsect1" lang="en">
+<a name="id3661984"></a><h2>Description</h2>
+<p>The class template treap is an intrusive treap container that is used
+to construct intrusive set and multiset containers. The no-throw
+guarantee holds only, if the value_compare object and priority_compare
+object don't throw.<br>类模板 treap 是一个介入式 treap 容器，用于构造介入
式 set 和 multiset 容器。仅当 value_compare 对象和 priority_compare 对象无抛
出时具有无抛出保证。</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.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br>模板参数<span
class="Apple-converted-space"> </span><code
class="computeroutput">T</code><span
class="Apple-converted-space"> </span>为由该容器管理的类型。用户可以指
定其它选项，如果未提供其它选项，则使用缺省选项。</span></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><span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br>该容器支持以下选
项：<code
class="computeroutput">base_hook<>/member_hook<>/value_traits<></code>,<span
class="Apple-converted-space"> </span><code
class="computeroutput">constant_time_size<></code>,<span
class="Apple-converted-space"> </span><code
class="computeroutput">size_type<></code><span
class="Apple-converted-space"></span>,<span class="Apple-converted-space">
</span><code class="computeroutput">compare<></code> </span>和 <code
class="computeroutput">priority_compare<></code><span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;">.</span> </p>
+<div class="refsect2" lang="en">
+<a name="id3662035"></a><h3>
+<a name="boost.intrusive.treapconstruct-copy-destruct"></a><code
class="computeroutput">treap</code>
+ public
+ construct/copy/destruct</h3>
+<div class="orderedlist"><ol type="1">
+<li>
+<pre class="literallayout"><a name="id3485311-bb"></a>treap(<span
class="bold"><strong>const</strong></span> value_compare & cmp =
value_compare(), <br> <span class="bold"><strong>const</strong></span>
priority_compare & pcmp = priority_compare(), <br> <span
class="bold"><strong>const</strong></span> <a class="link"
href="value_traits.html" title="Struct template
value_traits">value_traits</a> & v_traits = value_traits());</pre>
+<p><span class="bold"><strong>Effects</strong></span>: Constructs an empty
+tree.<span class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><span
class="Apple-style-span" style="word-spacing: 0px;
font-family: '-webkit-sans-serif'; font-style: normal; font-variant:
normal; font-weight: normal; font-size: 13px; line-height: 15px;
text-transform: none; color: rgb(0, 0, 0); text-indent: 0px; white-space:
normal; letter-spacing: normal; border-collapse: separate; text-align:
left; font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>作用</strong></span>:<span
class="Apple-converted-space"> </span></span>构造一个空的树。
</span></p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+常量。</span></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. Basic guarantee.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: </span>如
+果 value_traits::node_traits::node
+的构造函数抛出(对于预定义的Boost.Intrusive钩子，不会发生这种情况)，或者
+value_compare/priority_compare 对象的复制构造函数抛出。基本异常安全性保
证。 </p>
+</li>
+<li>
+<pre class="literallayout"><span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> Iterator> <br> <a
name="id3485367-bb"></a>treap(<span
class="bold"><strong>bool</strong></span> unique, Iterator b, Iterator e,
<br> <span class="bold"><strong>const</strong></span> value_compare
& cmp = value_compare(), <br> <span
class="bold"><strong>const</strong></span> priority_compare & pcmp =
priority_compare(), <br> <span
class="bold"><strong>const</strong></span> <a class="link"
href="value_traits.html" title="Struct template
value_traits">value_traits</a> & v_traits = value_traits());</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.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>要求</strong></span><span
class="bold"><strong></strong></span>: 对迭代器的解引用必须一个类型为
</span> value_type<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows: 2;"> 的左
值</span>。cmp <span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows: 2;">必须是
一个实现严格弱序的比较函数。</span></p>
+<p><span class="bold"><strong>Effects</strong></span>: Constructs an empty
tree and inserts elements from [b, e).<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><span class="Apple-style-span" style="word-spacing:
0px; font-family: '-webkit-sans-serif'; font-style: normal; font-variant:
normal; font-weight: normal; font-size: 13px; line-height: 15px;
text-transform: none; color: rgb(0, 0, 0); text-indent: 0px; white-space:
normal; letter-spacing: normal; border-collapse: separate; text-align:
left; font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>作用</strong></span>:<span
class="Apple-converted-space"> </span></span>构造一个空的树，并插入
</span> [b, e)<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows: 2;"> 的元
素。</span></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.<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><br><span class="bold"><strong>复杂度
</strong></span><span class="bold"><strong></strong></span>: </span>与N成线
性，如果 [b, e) 已经以 comp 排序，否则为 N * log N，其中N为 first 与 last 间
的距离<span class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;">。</span></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. Basic guarantee.<span class="Apple-style-span" style="word-spacing:
0px; font-family: -webkit-sans-serif; font-style: normal; font-variant:
normal; font-weight: normal; font-size: 13px; line-height: 15px;
text-transform: none; color: rgb(0, 0, 0); text-indent: 0px; white-space:
normal; letter-spacing: normal; border-collapse: separate; text-align:
left; font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>抛出</strong></span>: </span>如
+果 value_traits::node_traits::node
+的构造函数抛出(对于预定义的Boost.Intrusive钩子，不会发生这种情况)，或者
+value_compare/priority_compare 对象的复制构造函数抛出。基本异常安全性保
证。 </p>
+</li>
+<li>
+<pre class="literallayout"><a name="id3485460-bb"></a>~treap();</pre>
+<p><span class="bold"><strong>Effects</strong></span>: Detaches all
+elements from this. The objects in the set are not deleted (i.e. no
+destructors are called), but the nodes according to the value_traits
+template parameter are reinitialized and thus can be reused.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><span
class="Apple-style-span" style="word-spacing: 0px;
font-family: '-webkit-sans-serif'; font-style: normal; font-variant:
normal; font-weight: normal; font-size: 13px; line-height: 15px;
text-transform: none; color: rgb(0, 0, 0); text-indent: 0px; white-space:
normal; letter-spacing: normal; border-collapse: separate; text-align:
left; font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>作用</strong></span>:<span
class="Apple-converted-space"> </span></span>将所有元素从
</span>this<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows: 2;"> 中分
离出去。集合中的对象并不会被删除(即不会调用析构函数)，但会根据
</span>value_traits<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"> 模板参数将节点重新初始化，以便于重用。</span><span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"></span></p>
+<p><span class="bold"><strong>Complexity</strong></span>: Linear to
elements contained in *this if constant-time size option is disabled.
Constant time otherwise.<span class="Apple-style-span" style="word-spacing:
0px; font-family: -webkit-sans-serif; font-style: normal; font-variant:
normal; font-weight: normal; font-size: 13px; line-height: 15px;
text-transform: none; color: rgb(0, 0, 0); text-indent: 0px; white-space:
normal; letter-spacing: normal; border-collapse: separate; text-align:
left; font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>: </span>与 *this 中包含的元素数量
成线性，如果常量时间 size 函数选项被禁止。否则为常量时间。<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"></span></p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: </span>无。 </p>
+</li>
+</ol></div>
+</div>
+<div class="refsect2" lang="en">
+<a name="id3662243"></a><h3>
+<a name="id3482075-bb"></a><code class="computeroutput">treap</code>
public member functions</h3>
+<div class="orderedlist"><ol type="1">
+<li><pre class="literallayout"><span class="type"><span
class="bold"><strong>const</strong></span> real_value_traits &</span>
<a name="id3482078-bb"></a>get_real_value_traits() <span
class="bold"><strong>const</strong></span>;</pre></li>
+<li><pre class="literallayout"><span class="type">real_value_traits
&</span> <a name="id3482087-bb"></a>get_real_value_traits() ;</pre></li>
+<li>
+<pre class="literallayout"><span class="type">iterator</span> <a
name="id3482095-bb"></a>begin() ;</pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns an iterator
+pointing to the beginning of the tree.<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><br><span class="bold"><strong>作用
</strong></span>: </span>返回指向树的开头的迭代器。</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+常量。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 无。</span></p></li>
+<li>
+<pre class="literallayout"><span class="type">const_iterator</span> <a
name="id3482126-bb"></a>begin() <span
class="bold"><strong>const</strong></span>;</pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a
const_iterator
+pointing to the beginning of the tree.<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><br><span class="bold"><strong>作用
</strong></span>: </span>返回指向树的开头的常量迭代器。</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+常量。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 无。</span></p></li>
+<li>
+<pre class="literallayout"><span class="type">const_iterator</span> <a
name="id3482158-bb"></a>cbegin() <span
class="bold"><strong>const</strong></span>;</pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a
const_iterator
+pointing to the beginning of the tree.<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><br><span class="bold"><strong>作用
</strong></span>: </span>返回指向树的开头的常量迭代器。</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+常量。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 无。</span></p></li>
+<li>
+<pre class="literallayout"><span class="type">iterator</span> <a
name="id3482189-bb"></a>end() ;</pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns an iterator
+pointing to the end of the tree.<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><br><span class="bold"><strong>作用
</strong></span>: </span>返回指向树的末尾的迭代器。</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+常量。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 无。</span></p></li>
+<li>
+<pre class="literallayout"><span class="type">const_iterator</span> <a
name="id3482220-bb"></a>end() <span
class="bold"><strong>const</strong></span>;</pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a
const_iterator
+pointing to the end of the tree.<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><br><span class="bold"><strong>作用
</strong></span>: </span>返回指向树的末尾的常量迭代器。</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+常量。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 无。</span></p></li>
+<li>
+<pre class="literallayout"><span class="type">const_iterator</span> <a
name="id3482251-bb"></a>cend() <span
class="bold"><strong>const</strong></span>;</pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a
const_iterator
+pointing to the end of the tree.<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><br><span class="bold"><strong>作用
</strong></span>: </span>返回指向树的末尾的常量迭代器。</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+常量。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 无。</span></p></li>
+<li>
+<pre class="literallayout"><span class="type">iterator</span> <a
name="id3482283-bb"></a>top() ;</pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns an iterator
pointing to the highest priority object of the tree.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>作用</strong></span>: </span>返回指向树的最高优先
级对象的迭代器。</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+常量。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 无。</span></p></li>
+<li>
+<pre class="literallayout"><span class="type">const_iterator</span> <a
name="id3482314-bb"></a>top() <span
class="bold"><strong>const</strong></span>;</pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a
const_iterator pointing to the highest priority object of the tree..<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>作用</strong></span>: </span>返回指向树的最高优先
级对象的常量迭代器。</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+常量。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 无。</span></p></li>
+<li>
+<pre class="literallayout"><span class="type">const_iterator</span> <a
name="id3482346-bb"></a>ctop() <span
class="bold"><strong>const</strong></span>;</pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a
const_iterator pointing to the highest priority object of the tree..<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>作用</strong></span>: </span>返回指向树的最高优先
级对象的常量迭代器。
+</p><p><span class="bold"><strong>Complexity</strong></span>:
Constant.<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+常量。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 无。</span></p></li>
+<li>
+<pre class="literallayout"><span class="type">reverse_iterator</span> <a
name="id3482377-bb"></a>rbegin() ;</pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a
reverse_iterator
+pointing to the beginning of the reversed tree.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>作用</strong></span>: </span>返回指向反向树的开头
的反向迭代器。</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+常量。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 无。</span></p></li>
+<li>
+<pre class="literallayout"><span
class="type">const_reverse_iterator</span> <a
name="id3482409-bb"></a>rbegin() <span
class="bold"><strong>const</strong></span>;</pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a
+const_reverse_iterator pointing to the beginning of the reversed
tree.<span class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>作用</strong></span>: </span>返回指向反向树的开头
的常量反向迭代器。</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+常量。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 无。</span></p></li>
+<li>
+<pre class="literallayout"><span
class="type">const_reverse_iterator</span> <a
name="id3482440-bb"></a>crbegin() <span
class="bold"><strong>const</strong></span>;</pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a
+const_reverse_iterator pointing to the beginning of the reversed
tree.<span class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>作用</strong></span>: </span>返回指向反向树的开头
的常量反向迭代器。</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+常量。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 无。</span></p></li>
+<li>
+<pre class="literallayout"><span class="type">reverse_iterator</span> <a
name="id3482472-bb"></a>rend() ;</pre><p><span
class="bold"><strong>Effects</strong></span>: Returns a reverse_iterator
+pointing to the end of the reversed tree.<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><br><span class="bold"><strong>作用
</strong></span>: </span>返回指向反向树的末尾的反向迭代器。</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+常量。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 无。</span> </p></li>
+<li>
+<pre class="literallayout"><span
class="type">const_reverse_iterator</span> <a
name="id3482504-bb"></a>rend() <span
class="bold"><strong>const</strong></span>;</pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a
+const_reverse_iterator pointing to the end of the reversed tree.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>作用</strong></span>: </span>返回指向反向树的末尾
的常量反向迭代器。</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+常量。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 无。</span></p></li>
+<li>
+<pre class="literallayout"><span
class="type">const_reverse_iterator</span> <a
name="id3482535-bb"></a>crend() <span
class="bold"><strong>const</strong></span>;</pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a
+const_reverse_iterator pointing to the end of the reversed tree.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>作用</strong></span>: </span>返回指向反向树的末尾
的常量反向迭代器。</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+常量。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 无。</span></p></li>
+<li>
+<pre class="literallayout"><span class="type">reverse_iterator</span> <a
name="id3482567-bb"></a>rtop() ;</pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a
reverse_iterator pointing to the highest priority object of the reversed
tree.<span class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>作用</strong></span>: </span>返回指向反向树的最高
优先级对象的反向迭代器。</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+常量。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 无。</span></p></li>
+<li>
+<pre class="literallayout"><span
class="type">const_reverse_iterator</span> <a
name="id3482599-bb"></a>rtop() <span
class="bold"><strong>const</strong></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.<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>作用</strong></span>: </span>返回指
向反向树的最高优先级对象的常量反向迭代器。
+</p><p><span class="bold"><strong>Complexity</strong></span>:
Constant.<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+常量。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 无。</span></p></li>
+<li>
+<pre class="literallayout"><span
class="type">const_reverse_iterator</span> <a
name="id3482631-bb"></a>crtop() <span
class="bold"><strong>const</strong></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.<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>作用</strong></span>: </span>返回指
向反向树的最高优先级对象的常量反向迭代器。
+</p><p><span class="bold"><strong>Complexity</strong></span>:
Constant.<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+常量。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 无。</span></p></li>
+<li>
+<pre class="literallayout"><span class="type">value_compare</span> <a
name="id3482663-bb"></a>value_comp() <span
class="bold"><strong>const</strong></span>;</pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns the
value_compare
+object used by the tree.<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><br><span class="bold"><strong>作用
</strong></span>: </span>返回树所用的 value_compare 对象。</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+常量。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: If value_compare
+copy-constructor throws.<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><br><span class="bold"><strong>抛出
</strong></span>: 如果 </span>value_compare 的构造函数抛出<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;">。</span></p></li>
+<li>
+<pre class="literallayout"><span class="type">priority_compare</span> <a
name="id3482695-bb"></a>priority_comp() <span
class="bold"><strong>const</strong></span>;</pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns the
priority_compare object used by the tree.<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><br><span class="bold"><strong>作用
</strong></span>: </span>返回树所用的 priority_compare 对象。</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+常量。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>:
If priority_compare
+copy-constructor throws.<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><br><span class="bold"><strong>抛出
</strong></span>: 如果 </span>priority_compare 的构造函数抛出<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;">。</span></p></li>
+<li>
+<pre class="literallayout"><span class="type"><span
class="bold"><strong>bool</strong></span></span> <a
name="id3482727-bb"></a>empty() <span
class="bold"><strong>const</strong></span>;</pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns true is the
+container is empty.<span class="Apple-style-span" style="word-spacing:
0px; font-family: -webkit-sans-serif; font-style: normal; font-variant:
normal; font-weight: normal; font-size: 13px; line-height: 15px;
text-transform: none; color: rgb(0, 0, 0); text-indent: 0px; white-space:
normal; letter-spacing: normal; border-collapse: separate; text-align:
left; font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>作用</strong></span>: </span>如果容器为
空，则返回 true。</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+常量。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 无。</span></p></li>
+<li>
+<pre class="literallayout"><span class="type"><a class="link"
href="size_type.html" title="Struct template
size_type">size_type</a></span> <a name="id3482758-bb"></a>size() <span
class="bold"><strong>const</strong></span>;</pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns the number
of
+elements stored in the tree.<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><br><span class="bold"><strong>作用
</strong></span>: </span>返回保存在树中的元素数量。</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Linear to
elements contained in *this if constant-time size option is disabled.
Constant time otherwise.<span class="Apple-style-span" style="word-spacing:
0px; font-family: -webkit-sans-serif; font-style: normal; font-variant:
normal; font-weight: normal; font-size: 13px; line-height: 15px;
text-transform: none; color: rgb(0, 0, 0); text-indent: 0px; white-space:
normal; letter-spacing: normal; border-collapse: separate; text-align:
left; font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>: 与 *this 中的元素数量成线性比
例，如果常量 size 函数选项被禁止。否则为常量时间。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 无。</span></p></li>
+<li>
+<pre class="literallayout"><span class="type"><span
class="bold"><strong>void</strong></span></span> <a
name="id3482791-bb"></a>swap(<a class="link" href="treap.html" title="Class
template treap">treap</a> & other) ;</pre>
+<p><span class="bold"><strong>Effects</strong></span>: Swaps the contents
of two treaps.<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>作用</strong></span>: </span>交换两棵
treap 的内容。</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+常量。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: If the comparison
functor's
+swap call throws.<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>抛出</strong></span>: 如果</span><span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;">比较函数的
+swap 调用有抛出</span><span class="Apple-style-span" style="word-spacing:
0px; font-family: -webkit-sans-serif; font-style: normal; font-variant:
normal; font-weight: normal; font-size: 13px; line-height: 15px;
text-transform: none; color: rgb(0, 0, 0); text-indent: 0px; white-space:
normal; letter-spacing: normal; border-collapse: separate; text-align:
left; font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;">。</span></p></li>
+<li>
+<pre class="literallayout"><span class="type">iterator</span> <a
name="id3482831-bb"></a>insert_equal(reference value) ;</pre>
+<p><span class="bold"><strong>Requires</strong></span>: value must be an
+lvalue<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>要求</strong></span>: </span>value
必须为左值<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows: 2;">。
</span></p>
+<p><span class="bold"><strong>Effects</strong></span>: Inserts value into
the tree
+before the upper bound.<span class="Apple-style-span" style="word-spacing:
0px; font-family: -webkit-sans-serif; font-style: normal; font-variant:
normal; font-weight: normal; font-size: 13px; line-height: 15px;
text-transform: none; color: rgb(0, 0, 0); text-indent: 0px; white-space:
normal; letter-spacing: normal; border-collapse: separate; text-align:
left; font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>作用</strong></span>: </span>将
value 插入到树中，位于该值的上界之前。</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Average
complexity for
+insert element is at most logarithmic.<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><br><span class="bold"><strong>复杂度
</strong></span><span class="bold"><strong></strong></span>:
+插入元素的平均复杂度最多为对数复杂度。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: If the internal
value_compare or priority_compare funcstions throw. Strong guarantee.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 如果内部的
</span>value_compare 或 priority_compare<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"> 函数有抛出。强异常
安全保证。</span></p>
+<p><span class="bold"><strong>Note</strong></span>: Does not affect the
validity
+of iterators and references. No copy-constructors are called.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>备注</strong></span>: 不影响迭代器和引用的有效性。不调
用复制构造函数。</span></p></li>
+<li>
+<pre class="literallayout"><span class="type">iterator</span> <a
name="id3482886-bb"></a>insert_equal(const_iterator hint, reference
value) ;</pre>
+<p><span class="bold"><strong>Requires</strong></span>: value must be an
lvalue,
+and "hint" must be a valid iterator.<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><br><span class="bold"><strong>要求
</strong></span>: </span>value 必须为左值<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;">，且 </span>"hint"
+必须是有效迭代器<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows: 2;">。
</span></p>
+<p><span class="bold"><strong>Effects</strong></span>: Inserts x into the
tree,
+using "hint" as a hint to where it will be inserted. If "hint" is the
+upper_bound the insertion takes constant time (two comparisons in the worst
+case)<span class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>作用</strong></span>: </span>将 value 插入到树
中，将 "hint"
+用作在何处插入的提示。如果 "hint" 为 upper_bound，则插入操作为常量时间(最坏
情况下为两次比较)</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.<span class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+通常为对数，但如果恰好在 hint 之前插入，则为分期常量时间。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: If the internal
value_compare or priority_compare funcstions throw. Strong guarantee.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 如果内部的
</span>value_compare 或 priority_compare<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"> 函数有抛出。强异常
安全保证。</span></p>
+<p><span class="bold"><strong>Note</strong></span>: Does not affect the
validity
+of iterators and references. No copy-constructors are called.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>备注</strong></span>: 不影响迭代器和引用的有效性。不调
用复制构造函数。</span></p></li>
+<li>
+<pre class="literallayout"><span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> Iterator> <span
class="type"><span class="bold"><strong>void</strong></span></span> <a
name="id3482950-bb"></a>insert_equal(Iterator b, Iterator e) ;</pre>
+<p><span class="bold"><strong>Requires</strong></span>: Dereferencing
iterator
+must yield an lvalue of type value_type.<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><br><span class="bold"><strong>要求
</strong></span>: 对迭代器的解引用必须产生一个类型为</span> value_type
+的左值。</p>
+<p><span class="bold"><strong>Effects</strong></span>: Inserts a each
element of a
+range into the tree before the upper bound of the key of each
element.<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows: 2;"><span
class="Apple-style-span" style="word-spacing: 0px;
font-family: '-webkit-sans-serif'; font-style: normal; font-variant:
normal; font-weight: normal; font-size: 13px; line-height: 15px;
text-transform: none; color: rgb(0, 0, 0); text-indent: 0px; white-space:
normal; letter-spacing: normal; border-collapse: separate; text-align:
left; font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>作用</strong></span>:<span
class="Apple-converted-space">
+将一个区间中的各个元素插入到树</span></span></span>中，位于各个元素的键值的
上界之前。</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().<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>: 区间插入的复杂度通常为</span>
O(N * log(N))，其中 N
+为区间的大小。但是，如果区间已经按 value_comp() 排序则为 N 的线性。<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"></span></p>
+<p><span class="bold"><strong>Throws</strong></span>: If the internal
value_compare or priority_compare funcstions throw. Strong guarantee.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 如果内部的
</span>value_compare 或 priority_compare<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"> 函数有抛出。强异常
安全保证。</span></p>
+<p><span class="bold"><strong>Note</strong></span>: Does not affect the
validity
+of iterators and references. No copy-constructors are called.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>备注</strong></span>: 不影响迭代器和引用的有效性。不调
用复制构造函数。</span></p></li>
+<li>
+<pre class="literallayout"><span class="type">std::pair< iterator,
<span class="bold"><strong>bool</strong></span> ></span> <a
name="id3483021-bb"></a>insert_unique(reference value) ;</pre>
+<p><span class="bold"><strong>Requires</strong></span>: value must be an
+lvalue<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>要求</strong></span>: </span>value
必须为左值<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows: 2;">。
</span></p>
+<p><span class="bold"><strong>Effects</strong></span>: Inserts value into
the tree
+if the value is not already present.<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><span class="Apple-style-span" style="word-spacing:
0px; font-family: '-webkit-sans-serif'; font-style: normal; font-variant:
normal; font-weight: normal; font-size: 13px; line-height: 15px;
text-transform: none; color: rgb(0, 0, 0); text-indent: 0px; white-space:
normal; letter-spacing: normal; border-collapse: separate; text-align:
left; font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>作用</strong></span>:<span
class="Apple-converted-space"> 如果
+</span></span></span>value 未在树中，则<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><span class="Apple-style-span" style="word-spacing:
0px; font-family: '-webkit-sans-serif'; font-style: normal; font-variant:
normal; font-weight: normal; font-size: 13px; line-height: 15px;
text-transform: none; color: rgb(0, 0, 0); text-indent: 0px; white-space:
normal; letter-spacing: normal; border-collapse: separate; text-align:
left; font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><span class="Apple-converted-space">将</span></span></span> value<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><span
class="Apple-style-span" style="word-spacing: 0px;
font-family: '-webkit-sans-serif'; font-style: normal; font-variant:
normal; font-weight: normal; font-size: 13px; line-height: 15px;
text-transform: none; color: rgb(0, 0, 0); text-indent: 0px; white-space:
normal; letter-spacing: normal; border-collapse: separate; text-align:
left; font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><span class="Apple-converted-space"> 插入到树</span></span></span>中。
</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Average
complexity for
+insert element is at most logarithmic.<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><br><span class="bold"><strong>复杂度
</strong></span><span class="bold"><strong></strong></span>:
+插入元素的平均复杂度最多为对数复杂度。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: If the internal
value_compare or priority_compare funcstions throw. Strong guarantee.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 如果内部的
</span>value_compare 或 priority_compare<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"> 函数有抛出。强异常
安全保证。</span></p><p><span class="bold"><strong>Note</strong></span>:
Does not affect the validity
+of iterators and references. No copy-constructors are called.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>备注</strong></span>: 不影响迭代器和引用的有效性。不调
用复制构造函数。</span></p></li>
+<li>
+<pre class="literallayout"><span class="type">iterator</span> <a
name="id3483076-bb"></a>insert_unique(const_iterator hint, reference
value) ;</pre>
+<p><span class="bold"><strong>Requires</strong></span>: value must be an
lvalue,
+and "hint" must be a valid iterator<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><br><span class="bold"><strong>要求
</strong></span>: </span>value 必须为左值<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;">，且 </span>"hint"
+必须是有效迭代器<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows: 2;">。
</span></p>
+<p><span class="bold"><strong>Effects</strong></span>: Tries to insert x
into the
+tree, using "hint" as a hint to where it will be inserted.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>作用</strong></span>: </span>尝试将 value 插入到树
中，将 "hint"
+用作在何处插入的提示。</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Logarithmic in
general,
+but it is amortized constant time (two comparisons in the worst case) if t
is
+inserted immediately before hint.<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><br><span class="bold"><strong>复杂度
</strong></span><span class="bold"><strong></strong></span>:
+通常为对数，但如果恰好在 hint 之前插入，则为分期常量时间</span>(最坏情况下
为两次比较)<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows: 2;">。
</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: If the internal
value_compare or priority_compare funcstions throw. Strong guarantee.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 如果内部的
</span>value_compare 或 priority_compare<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"> 函数有抛出。强异常
安全保证。</span></p>
+<p><span class="bold"><strong>Note</strong></span>: Does not affect the
validity
+of iterators and references. No copy-constructors are called.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>备注</strong></span>: 不影响迭代器和引用的有效性。不调
用复制构造函数。</span></p></li>
+<li>
+<pre class="literallayout"><span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> Iterator> <span
class="type"><span class="bold"><strong>void</strong></span></span> <a
name="id3483140-bb"></a>insert_unique(Iterator b, Iterator e) ;</pre>
+<p><span class="bold"><strong>Requires</strong></span>: Dereferencing
iterator
+must yield an lvalue of type value_type.<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><br><span class="bold"><strong>要求
</strong></span>: 对迭代器的解引用必须产生一个类型为</span> value_type
+的左值。</p>
+<p><span class="bold"><strong>Effects</strong></span>: Tries to insert each
+element of a range into the tree.<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><span class="Apple-style-span" style="word-spacing:
0px; font-family: '-webkit-sans-serif'; font-style: normal; font-variant:
normal; font-weight: normal; font-size: 13px; line-height: 15px;
text-transform: none; color: rgb(0, 0, 0); text-indent: 0px; white-space:
normal; letter-spacing: normal; border-collapse: separate; text-align:
left; font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>作用</strong></span>:<span
class="Apple-converted-space">
+尝试将一个区间中的各个元素插入到树</span></span></span>中。</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().<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>: 区间插入的复杂度通常为</span>
O(N * log(N))，其中 N
+为区间的大小。但是，如果区间已经按 value_comp() 排序则为 N 的线性。</p>
+<p><span class="bold"><strong>Throws</strong></span>: If the internal
value_compare or priority_compare funcstions throw. Strong guarantee.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 如果内部的
</span>value_compare 或 priority_compare<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"> 函数有抛出。强异常
安全保证。</span></p><p><span class="bold"><strong>Note</strong></span>:
Does not affect the validity
+of iterators and references. No copy-constructors are called.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>备注</strong></span>: 不影响迭代器和引用的有效性。不调
用复制构造函数。</span></p></li>
+<li>
+<pre class="literallayout"><span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> KeyType, <span
class="bold"><strong>typename</strong></span> KeyValueCompare, <br>
<span class="bold"><strong>typename</strong></span> KeyValuePrioCompare>
<br> <span class="type">std::pair< iterator, <span
class="bold"><strong>bool</strong></span> ></span> <br> <a
name="id3483210-bb"></a>insert_unique_check(<span
class="bold"><strong>const</strong></span> KeyType & key,
KeyValueCompare key_value_comp, <br>
KeyValuePrioCompare key_value_pcomp, <br> <a
class="link"
href="treap.html#boost.intrusive.treap.insert_commit_data">insert_commit_data</a>
& commit_data) ;</pre><p><span
class="bold"><strong>Requires</strong></span>: key_value_comp must be a
+comparison function that induces the same strict weak ordering as
value_compare.
+The difference is that key_value_comp compares an ascapegoatitrary key
with the
+contained values.<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>要求
</strong></span>: </span>key_value_comp 必须是与 value_compare
+一样的严格弱序的比较函数。差别仅在于 key_value_comp 是将一个键值与一个容器
中的值相比较。</p>
+<p><span class="bold"><strong>Effects</strong></span>: Checks if a value
can be
+inserted in the container, using a user provided key instead of the
value
+itself.<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>作用</strong></span>: </span>检查一个值是
否可以插入到容器中，使用用户提供的键值而不是值本身。</p>
+<p><span class="bold"><strong>Returns</strong></span>: If there is an
equivalent
+value returns a pair containing an iterator to the already present value
and
+false. If the value can be inserted returns true in the returned pair
boolean
+and fills "commit_data" that is meant to be used with the "insert_commit"
+function.<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>返回</strong></span>: </span>如果容
器中已有一个相等的值，则返回一个含有指向已有值的迭代器与
+false 的 pair。如果该值可以插入，则在 pair 中返回 true 并且填
充 "commit_data" 以用于 "insert_commit"
+函数。</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Average
complexity is at
+most logarithmic.<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+平均复杂度最多为对数复杂度。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: If the key_value_comp
+ordering function throws. Strong guarantee.<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><br><span class="bold"><strong>抛出
</strong></span>: 如果内部的</span> key_value_comp 比较函数抛出<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"></span>。强异常安全保
证。</p>
+<p><span class="bold"><strong>Notes</strong></span>: This function is used
to
+improve performance when constructing a value_type is expensive: if there
is an
+equivalent value the constructed object must be discarded. Many times, the
part
+of the node that is used to impose the order is much cheaper to construct
than
+the value_type and this function offers the possibility to use that part to
+check if the insertion will be successful.<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><br><span class="bold"><strong>备注
</strong></span>: 该函数在</span> value_type<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;">
+的构造非常昂贵时用于提升性能：如果容器中已经有一个相等的值，那么已构造好的
对象必须被销毁。多数时候，节点中只有一部分是用于排序的，这部分的构造代价要比
整个</span>
+value_type 的构造代价低得多，这个函数提供了用部分对象来检查插入操作是否成功
的可能性。</p>
+<p>If the check is successful, the user can construct the value_type and
use
+"insert_commit" to insert the object in constant-time. This gives a total
+logarithmic complexity to the insertion: check(O(log(N)) +
commit(O(1)).<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong></strong></span>如果检查是成功的，则用户
可以构造</span> value_type 并使用
+"insert_commit" 来以常量时间将对象插入。这种插入给出了一个总的对数复杂
度：检查(O(log(N)) + 提交(O(1))。 </p>
+<p>"commit_data" remains valid for a subsequent "insert_commit" only if no
more
+objects are inserted or erased from the containert.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong></strong></span></span>"commit_data" 对于后续
的 "insert_commit"
+保持有效当且仅当容器中没有插入或删除元素。</p></li>
+<li>
+<pre class="literallayout"><span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> KeyType, <span
class="bold"><strong>typename</strong></span> KeyValueCompare, <br>
<span class="bold"><strong>typename</strong></span> KeyValuePrioCompare>
<br> <span class="type">std::pair< iterator, <span
class="bold"><strong>bool</strong></span> ></span> <br> <a
name="id3483332-bb"></a>insert_unique_check(const_iterator hint, <span
class="bold"><strong>const</strong></span> KeyType & key,
<br> KeyValueCompare key_value_comp,
<br> KeyValuePrioCompare key_value_pcomp,
<br> <a class="link"
href="treap.html#boost.intrusive.treap.insert_commit_data">insert_commit_data</a>
& commit_data) ;</pre>
+<p><span class="bold"><strong>Requires</strong></span>: key_value_comp
must be a
+comparison function that induces the same strict weak ordering as
value_compare.
+The difference is that key_value_comp compares an ascapegoatitrary key
with the
+contained values.<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>要求
</strong></span>: </span>key_value_comp 必须是与 value_compare
+一样的严格弱序的比较函数。差别仅在于 key_value_comp 是将一个键值与一个容器
中的值相比较。</p>
+<p><span class="bold"><strong>Effects</strong></span>: Checks if a value
can be
+inserted in the container, using a user provided key instead of the
value itself,
+using "hint" as a hint to where it will be inserted.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><span
class="Apple-style-span" style="word-spacing: 0px;
font-family: '-webkit-sans-serif'; font-style: normal; font-variant:
normal; font-weight: normal; font-size: 13px; line-height: 15px;
text-transform: none; color: rgb(0, 0, 0); text-indent: 0px; white-space:
normal; letter-spacing: normal; border-collapse: separate; text-align:
left; font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>作用</strong></span>:<span
class="Apple-converted-space"> </span></span>检查一个值是否可以插入到容
器中，使用用户提供的键值而不是值本身</span><span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;">，将
+"hint" 用作在何处插入的提示</span><span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;">。</span></p>
+<p><span class="bold"><strong>Returns</strong></span>: If there is an
equivalent
+value returns a pair containing an iterator to the already present value
and
+false. If the value can be inserted returns true in the returned pair
boolean
+and fills "commit_data" that is meant to be used with the "insert_commit"
+function.<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>返回</strong></span>: </span>如果容
器中已有一个相等的值，则返回一个含有指向已有值的迭代器与
+false 的 pair。如果该值可以插入，则在 pair 中返回 true 并且填
充 "commit_data" 以用于 "insert_commit"
+函数。</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Logarithmic in
general,
+but it's amortized constant time if t is inserted immediately before
hint.<span class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+通常为对数，但如果恰好在 hint 之前插入，则为分期常量时间。</span><span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"></span></p>
+<p><span class="bold"><strong>Throws</strong></span>: If the key_value_comp
+ordering function throws. Strong guarantee.<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><br><span class="bold"><strong>抛出
</strong></span>: 如果内部的</span> key_value_comp 比较函数抛出<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"></span>。强异常安全保
证。</p>
+<p><span class="bold"><strong>Notes</strong></span>: This function is used
to
+improve performance when constructing a value_type is expensive: if there
is an
+equivalent value the constructed object must be discarded. Many times, the
part
+of the constructing that is used to impose the order is much cheaper to
+construct than the value_type and this function offers the possibility to
use
+that key to check if the insertion will be successful.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>备注</strong></span>: 该函数在</span> value_type<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;">
+的构造非常昂贵时用于提升性能：如果容器中已经有一个相等的值，那么已构造好的
对象必须被销毁。多数时候，节点中只有一部分是用于排序的，这部分的构造代价要比
整个</span>
+value_type 的构造代价低得多，这个函数提供了用部分对象来检查插入操作是否成功
的可能性。</p>
+<p>If the check is successful, the user can construct the value_type and
use
+"insert_commit" to insert the object in constant-time. This can give a
total
+constant-time complexity to the insertion: check(O(1)) +
commit(O(1)).<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong></strong></span>如果检查是成功的，则用户
可以构造</span> value_type 并使用
+"insert_commit" 来以常量时间将对象插入。这种插入给出了一个总的对数复杂
度：检查(O(1) + 提交(O(1))。 </p>
+<p>"commit_data" remains valid for a subsequent "insert_commit" only if no
more
+objects are inserted or erased from the container.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong></strong></span></span>"commit_data" 对于后续
的 "insert_commit"
+保持有效当且仅当容器中没有插入或删除元素。</p></li>
+<li>
+<pre class="literallayout"><span class="type">iterator</span> <a
name="id3483462-bb"></a>insert_unique_commit(reference value,
<br> <span
class="bold"><strong>const</strong></span> <a class="link"
href="treap.html#boost.intrusive.treap.insert_commit_data">insert_commit_data</a>
& commit_data) ;</pre>
+<p><span class="bold"><strong>Requires</strong></span>: value must be an
lvalue of
+type value_type. commit_data must have been obtained from a previous call
to
+"insert_check". No objects should have been inserted or erased from
the container
+between the "insert_check" that filled "commit_data" and the call to
+"insert_commit".<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>要求</strong></span>: </span>value
必须是类型为 value_type
+的左值。commit_data 必须是从前一个 "insert_check" 调用所返回的。
在 "insert_check" 填充了 "commit_data"
+到调用 "insert_commit" 之间，容器<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;">中不能插入或删除元素</span>。</p>
+<p><span class="bold"><strong>Effects</strong></span>: Inserts the value
in the avl_set using the information obtained from the "commit_data" that a
previous
+"insert_check" filled.<span class="Apple-style-span" style="word-spacing:
0px; font-family: -webkit-sans-serif; font-style: normal; font-variant:
normal; font-weight: normal; font-size: 13px; line-height: 15px;
text-transform: none; color: rgb(0, 0, 0); text-indent: 0px; white-space:
normal; letter-spacing: normal; border-collapse: separate; text-align:
left; font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><span class="Apple-style-span" style="word-spacing: 0px;
font-family: '-webkit-sans-serif'; font-style: normal; font-variant:
normal; font-weight: normal; font-size: 13px; line-height: 15px;
text-transform: none; color: rgb(0, 0, 0); text-indent: 0px; white-space:
normal; letter-spacing: normal; border-collapse: separate; text-align:
left; font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>作用</strong></span>:<span
class="Apple-converted-space">
+利用前一个</span></span></span> "insert_check" 所填充的 "commit_data" 中的
信息，<span class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;">将</span>
+value<span class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;">
+插入到 </span>avl_set <span class="Apple-style-span" style="word-spacing:
0px; font-family: -webkit-sans-serif; font-style: normal; font-variant:
normal; font-weight: normal; font-size: 13px; line-height: 15px;
text-transform: none; color: rgb(0, 0, 0); text-indent: 0px; white-space:
normal; letter-spacing: normal; border-collapse: separate; text-align:
left; font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;">中。</span></p>
+<p><span class="bold"><strong>Returns</strong></span>: An iterator to the
newly
+inserted object.<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows: 2;"><span
class="Apple-style-span" style="word-spacing: 0px;
font-family: '-webkit-sans-serif'; font-style: normal; font-variant:
normal; font-weight: normal; font-size: 13px; line-height: 15px;
text-transform: none; color: rgb(0, 0, 0); text-indent: 0px; white-space:
normal; letter-spacing: normal; border-collapse: separate; text-align:
left; font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>返回</strong></span>: </span>指向新
插入对象的迭代器。</span></p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant
time.<span class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+常量。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 无。</span></p>
+<p><span class="bold"><strong>Notes</strong></span>: This function has
only sense
+if a "insert_check" has been previously executed to fill "commit_data". No
value
+should be inserted or erased between the "insert_check" and "insert_commit"
+calls.<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows: 2;"><span
class="Apple-style-span" style="word-spacing: 0px;
font-family: '-webkit-sans-serif'; font-style: normal; font-variant:
normal; font-weight: normal; font-size: 13px; line-height: 15px;
text-transform: none; color: rgb(0, 0, 0); text-indent: 0px; white-space:
normal; letter-spacing: normal; border-collapse: separate; text-align:
left; font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>备注</strong></span>: 该</span></span>函
数仅当前面已经调用了 "insert_check"
+来填充 "commit_data" 时才有意义。在 "insert_check" 和 "insert_commit" 的调
用之间不能插入或删除任何元素。</p></li>
+<li>
+<pre class="literallayout"><span class="type">iterator</span> <a
name="id3483539-bb"></a>erase(const_iterator i) ;</pre>
+<p><span class="bold"><strong>Effects</strong></span>: Erases the element
pointed
+to by pos.<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows: 2;"><span
class="Apple-style-span" style="word-spacing: 0px;
font-family: '-webkit-sans-serif'; font-style: normal; font-variant:
normal; font-weight: normal; font-size: 13px; line-height: 15px;
text-transform: none; color: rgb(0, 0, 0); text-indent: 0px; white-space:
normal; letter-spacing: normal; border-collapse: separate; text-align:
left; font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>作用</strong></span>:<span
class="Apple-converted-space"> 删除由
+i</span></span></span> 指向的元素。</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Average
complexity for
+erase element is constant time.<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"><br><span class="bold"><strong>复杂度
</strong></span><span class="bold"><strong></strong></span>:
+平均复杂度为常数复杂度。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: If the internal
priority_compare funcstions throw. Strong guarantee.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 如果内部的
</span>priority_compare<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"> 函数有抛出。强异常安全保证。
</span></p><p><span class="bold"><strong>Note</strong></span>: Invalidates
the iterators (but
+not the references) to the erased elements. No destructors are
called.<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>备注</strong></span>: 指向被删除元素的迭
代器(但不是引用)失效。不调用析构函数。</span></p></li>
+<li>
+<pre class="literallayout"><span class="type">iterator</span> <a
name="id3483586-bb"></a>erase(const_iterator b, const_iterator e) ;</pre>
+<p><span class="bold"><strong>Effects</strong></span>: Erases the range
pointed to
+by b end e.<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows: 2;"><span
class="Apple-style-span" style="word-spacing: 0px;
font-family: '-webkit-sans-serif'; font-style: normal; font-variant:
normal; font-weight: normal; font-size: 13px; line-height: 15px;
text-transform: none; color: rgb(0, 0, 0); text-indent: 0px; white-space:
normal; letter-spacing: normal; border-collapse: separate; text-align:
left; font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>作用</strong></span>:<span
class="Apple-converted-space">
+删除</span></span></span>从 b 到 e 区间的元素。</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.<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>:
+区间删除的平均复杂度最多为</span> O(log(size() + N))，其中 N 为区间中的元素
数量<span class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;">。</span></p>
+<p><span class="bold"><strong>Throws</strong></span>: If the internal
priority_compare funcstions throw. Strong guarantee.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 如果内部的
</span>priority_compare<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"> 函数有抛出。强异常安全保证。
</span></p><p><span class="bold"><strong>Note</strong></span>: Invalidates
the iterators (but
+not the references) to the erased elements. No destructors are
called.<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>备注</strong></span>: 指向被删除元素的迭
代器(但不是引用)失效。不调用析构函数。</span></p></li>
+<li>
+<pre class="literallayout"><span class="type"><a class="link"
href="size_type.html" title="Struct template
size_type">size_type</a></span> <a
name="id3483640-bb"></a>erase(const_reference value) ;</pre>
+<p><span class="bold"><strong>Effects</strong></span>: Erases all the
elements
+with the given value.<span class="Apple-style-span" style="word-spacing:
0px; font-family: -webkit-sans-serif; font-style: normal; font-variant:
normal; font-weight: normal; font-size: 13px; line-height: 15px;
text-transform: none; color: rgb(0, 0, 0); text-indent: 0px; white-space:
normal; letter-spacing: normal; border-collapse: separate; text-align:
left; font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><span class="Apple-style-span" style="word-spacing: 0px;
font-family: '-webkit-sans-serif'; font-style: normal; font-variant:
normal; font-weight: normal; font-size: 13px; line-height: 15px;
text-transform: none; color: rgb(0, 0, 0); text-indent: 0px; white-space:
normal; letter-spacing: normal; border-collapse: separate; text-align:
left; font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>作用</strong></span>:<span
class="Apple-converted-space">
+删除</span></span></span>给定值的所有元素。</p>
+<p><span class="bold"><strong>Returns</strong></span>: The number of erased
+elements.<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>返回</strong></span><span
class="bold"><strong></strong></span>:
+被删元素数量。</span></p>
+<p><span class="bold"><strong>Complexity</strong></span>: O(log(size() +
N).<span class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>: </span>O(log(size()) + N).</p>
+<p><span class="bold"><strong>Throws</strong></span>: If the internal
priority_compare funcstions throw. Strong guarantee.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 如果内部的
</span>priority_compare<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"> 函数有抛出。强异常安全保证。
</span></p><p><span class="bold"><strong>Note</strong></span>: Invalidates
the iterators (but
+not the references) to the erased elements. No destructors are
called.<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>备注</strong></span>: 指向被删除元素的迭
代器(但不是引用)失效。不调用析构函数。</span></p></li>
+<li>
+<pre class="literallayout"><span
class="bold"><strong>template</strong></span><<span
class="bold"><strong>typename</strong></span> KeyType, <span
class="bold"><strong>typename</strong></span> KeyValueCompare> <br>
<span class="type"><a class="link" href="size_type.html" title="Struct
template size_type">size_type</a></span> <a
name="id3483695-bb"></a>erase(<span
class="bold"><strong>const</strong></span> KeyType & key,
KeyValueCompare comp) ;</pre>
+<p><span class="bold"><strong>Effects</strong></span>: Erases all the
elements
+with the given key. according to the comparison functor "comp".<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><span
class="Apple-style-span" style="word-spacing: 0px;
font-family: '-webkit-sans-serif'; font-style: normal; font-variant:
normal; font-weight: normal; font-size: 13px; line-height: 15px;
text-transform: none; color: rgb(0, 0, 0); text-indent: 0px; white-space:
normal; letter-spacing: normal; border-collapse: separate; text-align:
left; font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>作用</strong></span>:<span
class="Apple-converted-space">
+删除</span></span></span>以给定比较函数 "comp" 与给定键值比较相等的所有元
素。</p>
+<p><span class="bold"><strong>Returns</strong></span>: The number of erased
+elements.<span class="Apple-style-span" style="word-spacing: 0px;
font-family: -webkit-sans-serif; font-style: normal; font-variant: normal;
font-weight: normal; font-size: 13px; line-height: 15px; text-transform:
none; color: rgb(0, 0, 0); text-indent: 0px; white-space: normal;
letter-spacing: normal; border-collapse: separate; text-align: left;
font-size-adjust: none; font-stretch: normal; orphans: 2; widows:
2;"><br><span class="bold"><strong>返回</strong></span><span
class="bold"><strong></strong></span>:
+被删元素数量。</span></p>
+<p><span class="bold"><strong>Complexity</strong></span>: O(log(size() +
N).<span class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>复杂度</strong></span><span
class="bold"><strong></strong></span>: </span>O(log(size()) + N).</p>
+<p><span class="bold"><strong>Throws</strong></span>: If the internal
priority_compare funcstions throw. Strong guarantee.<span
class="Apple-style-span" style="word-spacing: 0px; font-family:
-webkit-sans-serif; font-style: normal; font-variant: normal; font-weight:
normal; font-size: 13px; line-height: 15px; text-transform: none; color:
rgb(0, 0, 0); text-indent: 0px; white-space: normal; letter-spacing:
normal; border-collapse: separate; text-align: left; font-size-adjust:
none; font-stretch: normal; orphans: 2; widows: 2;"><br><span
class="bold"><strong>抛出</strong></span>: 如果内部的
</span>priority_compare<span class="Apple-style-span"
style="word-spacing: 0px; font-family: -webkit-sans-serif; font-style:
normal; font-variant: normal; font-weight: normal; font-size: 13px;
line-height: 15px; text-transform: none; color: rgb(0, 0, 0); text-indent:
0px; white-space: normal; letter-spacing: normal; border-collapse:
separate; text-align: left; font-size-adjust: none; font-stretch: normal;
orphans: 2; widows: 2;"> 函数有抛出。强异常安全保证。
</span></p><p><span class="bold"><strong>Note</strong></span>: Invalidates
the iterators (but
+not the references) to the e
==============================================================================
Diff truncated at 200k characters
Other related posts:
- » [boost-doc-zh commit] r219 - 转换至1.38.0，第4次，包含以下库： - codesite-noreply
