1<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> 2<html> 3<head> 4<meta http-equiv="Content-Type" content="text/html; charset=UTF-8"> 5<title>Intrusive treap based associative containers: treap_set, treap_multiset and treap</title> 6<link rel="stylesheet" href="../../../doc/src/boostbook.css" type="text/css"> 7<meta name="generator" content="DocBook XSL Stylesheets V1.79.1"> 8<link rel="home" href="../index.html" title="The Boost C++ Libraries BoostBook Documentation Subset"> 9<link rel="up" href="../intrusive.html" title="Chapter 19. Boost.Intrusive"> 10<link rel="prev" href="sg_set_multiset.html" title="Intrusive scapegoat tree based associative containers: sg_set, sg_multiset and sgtree"> 11<link rel="next" href="bst_hooks.html" title="Binary search tree hooks: bs_set_base_hook and bs_set_member_hook"> 12</head> 13<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> 14<table cellpadding="2" width="100%"><tr> 15<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../boost.png"></td> 16<td align="center"><a href="../../../index.html">Home</a></td> 17<td align="center"><a href="../../../libs/libraries.htm">Libraries</a></td> 18<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> 19<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> 20<td align="center"><a href="../../../more/index.htm">More</a></td> 21</tr></table> 22<hr> 23<div class="spirit-nav"> 24<a accesskey="p" href="sg_set_multiset.html"><img src="../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../intrusive.html"><img src="../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="bst_hooks.html"><img src="../../../doc/src/images/next.png" alt="Next"></a> 25</div> 26<div class="section"> 27<div class="titlepage"><div><div><h2 class="title" style="clear: both"> 28<a name="intrusive.treap_set_multiset"></a><a class="link" href="treap_set_multiset.html" title="Intrusive treap based associative containers: treap_set, treap_multiset and treap">Intrusive treap based associative 29 containers: treap_set, treap_multiset and treap</a> 30</h2></div></div></div> 31<div class="toc"><dl class="toc"> 32<dt><span class="section"><a href="treap_set_multiset.html#intrusive.treap_set_multiset.treap_set_multiset_containers">treap_set, 33 treap_multiset and treap containers</a></span></dt> 34<dt><span class="section"><a href="treap_set_multiset.html#intrusive.treap_set_multiset.treap_set_exceptions">Exception 35 safety of treap-based intrusive containers</a></span></dt> 36<dt><span class="section"><a href="treap_set_multiset.html#intrusive.treap_set_multiset.treap_set_multiset_example">Example</a></span></dt> 37</dl></div> 38<p> 39 The name <span class="emphasis"><em>treap</em></span> is a mixture of <span class="emphasis"><em>tree</em></span> 40 and <span class="emphasis"><em>heap</em></span> indicating that Treaps exhibit the properties 41 of both binary search trees and heaps. A treap is a binary search tree that 42 orders the nodes by a key but also by a priority attribute. The nodes are ordered 43 so that the keys form a binary search tree and the priorities obey the max 44 heap order property. 45 </p> 46<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "> 47<li class="listitem"> 48 If v is a left descendant of u, then key[v] < key[u]; 49 </li> 50<li class="listitem"> 51 If v is a right descendant of u, then key[v] > key[u]; 52 </li> 53<li class="listitem"> 54 If v is a child of u, then priority[v] <= priority[u]; 55 </li> 56</ul></div> 57<p> 58 If priorities are non-random, the tree will usually be unbalanced; this worse 59 theoretical average-case behavior may be outweighed by better expected-case 60 behavior, as the most important items will be near the root. This means most 61 important objects will be retrieved faster than less important items and for 62 items keys with equal keys most important objects will be found first. These 63 properties are important for some applications. 64 </p> 65<p> 66 The priority comparison will be provided just like the key comparison, via 67 a function object that will be stored in the intrusive container. This means 68 that the priority can be stored in the value to be introduced in the treap 69 or computed on flight (via hashing or similar). 70 </p> 71<p> 72 <span class="bold"><strong>Boost.Intrusive</strong></span> offers 3 containers based 73 on treaps: <code class="computeroutput"><a class="link" href="../boost/intrusive/treap_set.html" title="Class template treap_set">treap_set</a></code>, 74 <code class="computeroutput"><a class="link" href="../boost/intrusive/treap_multiset.html" title="Class template treap_multiset">treap_multiset</a></code> 75 and <code class="computeroutput"><a class="link" href="../boost/intrusive/treap.html" title="Class template treap">treap</a></code>. The first two 76 are similar to <code class="computeroutput"><a class="link" href="../boost/intrusive/set.html" title="Class template set">set</a></code> or <code class="computeroutput"><a class="link" href="../boost/intrusive/multiset.html" title="Class template multiset">multiset</a></code> and the latter is a generalization 77 that offers functions both to insert unique and multiple keys. 78 </p> 79<p> 80 The memory overhead of these containers with Boost.Intrusive hooks is 3 pointers. 81 </p> 82<p> 83 An empty, <code class="computeroutput"><a class="link" href="../boost/intrusive/treap_set.html" title="Class template treap_set">treap_set</a></code>, 84 <code class="computeroutput"><a class="link" href="../boost/intrusive/treap_multiset.html" title="Class template treap_multiset">treap_multiset</a></code> 85 or <code class="computeroutput"><a class="link" href="../boost/intrusive/treap.html" title="Class template treap">treap</a></code> has also the 86 size of 3 pointers and an integer (supposing empty function objects for key 87 and priority comparison and constant-time size). 88 </p> 89<p> 90 <span class="bold"><strong>Boost.Intrusive</strong></span> treap associative containers 91 don't use their own hook types but plain Binary search tree hooks. See <a class="link" href="bst_hooks.html" title="Binary search tree hooks: bs_set_base_hook and bs_set_member_hook">Binary search tree hooks: bs_set_base_hook and 92 bs_set_member_hook</a> section for more information about these hooks. 93 </p> 94<div class="section"> 95<div class="titlepage"><div><div><h3 class="title"> 96<a name="intrusive.treap_set_multiset.treap_set_multiset_containers"></a><a class="link" href="treap_set_multiset.html#intrusive.treap_set_multiset.treap_set_multiset_containers" title="treap_set, treap_multiset and treap containers">treap_set, 97 treap_multiset and treap containers</a> 98</h3></div></div></div> 99<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="special">...</span><span class="identifier">Options</span><span class="special">></span> 100<span class="keyword">class</span> <span class="identifier">treap_set</span><span class="special">;</span> 101 102<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="special">...</span><span class="identifier">Options</span><span class="special">></span> 103<span class="keyword">class</span> <span class="identifier">treap_multiset</span><span class="special">;</span> 104 105<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="special">...</span><span class="identifier">Options</span><span class="special">></span> 106<span class="keyword">class</span> <span class="identifier">treap</span><span class="special">;</span> 107</pre> 108<p> 109 These containers receive the same options explained in the section <a class="link" href="usage.html" title="How to use Boost.Intrusive">How to use Boost.Intrusive</a>: 110 </p> 111<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "> 112<li class="listitem"> 113 <span class="bold"><strong><code class="computeroutput"><span class="identifier">base_hook</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">Hook</span><span class="special">></span></code></strong></span> 114 / <span class="bold"><strong><code class="computeroutput"><span class="identifier">member_hook</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Hook</span><span class="special">,</span> <span class="identifier">Hook</span> <span class="identifier">T</span><span class="special">::*</span> <span class="identifier">PtrToMember</span><span class="special">></span></code></strong></span> 115 / <span class="bold"><strong><code class="computeroutput"><span class="identifier">value_traits</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ValueTraits</span><span class="special">></span></code></strong></span>: 116 To specify the hook type or value traits used to configure the container. 117 (To learn about value traits go to the section <a class="link" href="value_traits.html" title="Containers with custom ValueTraits">Containers 118 with custom ValueTraits</a>.) 119 </li> 120<li class="listitem"> 121 <span class="bold"><strong><code class="computeroutput"><span class="identifier">constant_time_size</span><span class="special"><</span><span class="keyword">bool</span> <span class="identifier">Enabled</span><span class="special">></span></code></strong></span>: 122 To activate the constant-time <code class="computeroutput"><span class="identifier">size</span><span class="special">()</span></code> operation. Default: <code class="computeroutput"><span class="identifier">constant_time_size</span><span class="special"><</span><span class="keyword">true</span><span class="special">></span></code> 123 </li> 124<li class="listitem"> 125 <span class="bold"><strong><code class="computeroutput"><span class="identifier">size_type</span><span class="special"><</span><span class="keyword">typename</span> 126 <span class="identifier">SizeType</span><span class="special">></span></code></strong></span>: 127 To specify the type that will be used to store the size of the container. 128 Default: <code class="computeroutput"><span class="identifier">size_type</span><span class="special"><</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span><span class="special">></span></code> 129 </li> 130</ul></div> 131<p> 132 And they also can receive additional options: 133 </p> 134<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "> 135<li class="listitem"> 136 <span class="bold"><strong><code class="computeroutput"><span class="identifier">compare</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">></span></code></strong></span>: 137 Comparison function for the objects to be inserted in containers. The 138 comparison functor must induce a strict weak ordering. Default: <code class="computeroutput"><span class="identifier">compare</span><span class="special"><</span> 139 <span class="identifier">std</span><span class="special">::</span><span class="identifier">less</span><span class="special"><</span><span class="identifier">key_type</span><span class="special">></span> 140 <span class="special">></span></code> 141 </li> 142<li class="listitem"> 143 <span class="bold"><strong><code class="computeroutput"><span class="identifier">priority_of_value</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">PriorityOfValue</span><span class="special">></span></code></strong></span>: 144 A function object that specifies the type of the priority (<code class="computeroutput"><span class="identifier">priority_type</span></code>) of a treap container 145 and an operator to obtain it from a value type. Default: <code class="computeroutput"><span class="identifier">priority_type</span></code> is equal to <code class="computeroutput"><span class="identifier">value_type</span></code> (set-like interface). 146 </li> 147<li class="listitem"> 148 <span class="bold"><strong><code class="computeroutput"><span class="identifier">priority</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">PriorityCompare</span><span class="special">></span></code></strong></span>: 149 Priority Comparison function for the objects to be inserted in containers. 150 The comparison functor must induce a strict weak ordering. Default: 151 <code class="computeroutput"><span class="identifier">priority</span><span class="special"><</span> 152 <span class="identifier">priority_compare</span><span class="special"><</span><span class="identifier">priority_type</span><span class="special">></span> 153 <span class="special">></span></code> 154 </li> 155<li class="listitem"> 156 <span class="bold"><strong><code class="computeroutput"><span class="identifier">key_of_value</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">KeyOfValueFunctionObject</span><span class="special">></span></code></strong></span>: 157 A function object that will define the <code class="computeroutput"><span class="identifier">key_type</span></code> 158 of the value type to be stored. This type will allow a map-like interface. 159 See <a class="link" href="map_multimap.html" title="Map and multimap-like interface for associative containers">Map and multimap-like interface 160 with set and multiset</a> for details. Default: <code class="computeroutput"><span class="identifier">key_type</span></code> 161 is equal to <code class="computeroutput"><span class="identifier">value_type</span></code> 162 (set-like interface). 163 </li> 164</ul></div> 165<p> 166 The default <code class="computeroutput"><span class="identifier">priority_compare</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span></code> 167 object function will call an unqualified function <code class="computeroutput"><span class="identifier">priority_order</span></code> 168 passing two constant <code class="computeroutput"><span class="identifier">T</span></code> references 169 as arguments and should return true if the first argument has higher priority 170 (it will be searched faster), inducing strict weak ordering. The function 171 will be found using ADL lookup so that the user just needs to define a <code class="computeroutput"><span class="identifier">priority_order</span></code> function in the same namespace 172 as the class: 173 </p> 174<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">MyType</span> 175<span class="special">{</span> 176 <span class="keyword">friend</span> <span class="keyword">bool</span> <span class="identifier">priority_order</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">MyType</span> <span class="special">&</span><span class="identifier">a</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">MyType</span> <span class="special">&</span><span class="identifier">b</span><span class="special">)</span> 177 <span class="special">{...}</span> 178<span class="special">};</span> 179</pre> 180<p> 181 or 182 </p> 183<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">mytype</span> <span class="special">{</span> 184 185<span class="keyword">struct</span> <span class="identifier">MyType</span><span class="special">{</span> <span class="special">...</span> <span class="special">};</span> 186 187<span class="keyword">bool</span> <span class="identifier">priority_order</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">MyType</span> <span class="special">&</span><span class="identifier">a</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">MyType</span> <span class="special">&</span><span class="identifier">b</span><span class="special">)</span> 188<span class="special">{...}</span> 189 190<span class="special">}</span> <span class="comment">//namespace mytype {</span> 191</pre> 192</div> 193<div class="section"> 194<div class="titlepage"><div><div><h3 class="title"> 195<a name="intrusive.treap_set_multiset.treap_set_exceptions"></a><a class="link" href="treap_set_multiset.html#intrusive.treap_set_multiset.treap_set_exceptions" title="Exception safety of treap-based intrusive containers">Exception 196 safety of treap-based intrusive containers</a> 197</h3></div></div></div> 198<p> 199 In general, intrusive containers offer strong safety guarantees, but treap 200 containers must deal with two possibly throwing functors (one for value ordering, 201 another for priority ordering). Moreover, treap erasure operations require 202 rotations based on the priority order function and this issue degrades usual 203 <code class="computeroutput"><span class="identifier">erase</span><span class="special">(</span><span class="identifier">const_iterator</span><span class="special">)</span></code> 204 no-throw guarantee. However, intrusive offers the strongest possible behaviour 205 in these situations. In summary: 206 </p> 207<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "> 208<li class="listitem"> 209 If the priority order functor does not throw, treap-based containers, 210 offer exactly the same guarantees as other tree-based containers. 211 </li> 212<li class="listitem"> 213 If the priority order functor throws, treap-based containers offer strong 214 guarantee. 215 </li> 216</ul></div> 217</div> 218<div class="section"> 219<div class="titlepage"><div><div><h3 class="title"> 220<a name="intrusive.treap_set_multiset.treap_set_multiset_example"></a><a class="link" href="treap_set_multiset.html#intrusive.treap_set_multiset.treap_set_multiset_example" title="Example">Example</a> 221</h3></div></div></div> 222<p> 223 Now let's see a small example using binary search tree hooks and <code class="computeroutput"><a class="link" href="../boost/intrusive/treap_set.html" title="Class template treap_set">treap_set</a></code>/ <code class="computeroutput"><a class="link" href="../boost/intrusive/treap_multiset.html" title="Class template treap_multiset">treap_multiset</a></code> 224 containers: 225 </p> 226<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">intrusive</span><span class="special">/</span><span class="identifier">treap_set</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span> 227<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">vector</span><span class="special">></span> 228<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">functional</span><span class="special">></span> 229<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">cassert</span><span class="special">></span> 230 231<span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">intrusive</span><span class="special">;</span> 232 233<span class="keyword">class</span> <span class="identifier">MyClass</span> <span class="special">:</span> <span class="keyword">public</span> <span class="identifier">bs_set_base_hook</span><span class="special"><></span> <span class="comment">//This is a base hook</span> 234<span class="special">{</span> 235 <span class="keyword">int</span> <span class="identifier">int_</span><span class="special">;</span> 236 <span class="keyword">unsigned</span> <span class="keyword">int</span> <span class="identifier">prio_</span><span class="special">;</span> 237 238 <span class="keyword">public</span><span class="special">:</span> 239 <span class="comment">//This is a member hook</span> 240 <span class="identifier">bs_set_member_hook</span><span class="special"><></span> <span class="identifier">member_hook_</span><span class="special">;</span> 241 242 <span class="identifier">MyClass</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">i</span><span class="special">,</span> <span class="keyword">unsigned</span> <span class="keyword">int</span> <span class="identifier">prio</span><span class="special">)</span> <span class="special">:</span> <span class="identifier">int_</span><span class="special">(</span><span class="identifier">i</span><span class="special">),</span> <span class="identifier">prio_</span><span class="special">(</span><span class="identifier">prio</span><span class="special">)</span> 243 <span class="special">{}</span> 244 245 <span class="keyword">unsigned</span> <span class="keyword">int</span> <span class="identifier">get_priority</span><span class="special">()</span> <span class="keyword">const</span> 246 <span class="special">{</span> <span class="keyword">return</span> <span class="keyword">this</span><span class="special">-></span><span class="identifier">prio_</span><span class="special">;</span> <span class="special">}</span> 247 248 <span class="comment">//Less and greater operators</span> 249 <span class="keyword">friend</span> <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special"><</span> <span class="special">(</span><span class="keyword">const</span> <span class="identifier">MyClass</span> <span class="special">&</span><span class="identifier">a</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">MyClass</span> <span class="special">&</span><span class="identifier">b</span><span class="special">)</span> 250 <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">a</span><span class="special">.</span><span class="identifier">int_</span> <span class="special"><</span> <span class="identifier">b</span><span class="special">.</span><span class="identifier">int_</span><span class="special">;</span> <span class="special">}</span> 251 <span class="keyword">friend</span> <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">></span> <span class="special">(</span><span class="keyword">const</span> <span class="identifier">MyClass</span> <span class="special">&</span><span class="identifier">a</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">MyClass</span> <span class="special">&</span><span class="identifier">b</span><span class="special">)</span> 252 <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">a</span><span class="special">.</span><span class="identifier">int_</span> <span class="special">></span> <span class="identifier">b</span><span class="special">.</span><span class="identifier">int_</span><span class="special">;</span> <span class="special">}</span> 253 <span class="comment">//Default priority compare</span> 254 <span class="keyword">friend</span> <span class="keyword">bool</span> <span class="identifier">priority_order</span> <span class="special">(</span><span class="keyword">const</span> <span class="identifier">MyClass</span> <span class="special">&</span><span class="identifier">a</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">MyClass</span> <span class="special">&</span><span class="identifier">b</span><span class="special">)</span> 255 <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">a</span><span class="special">.</span><span class="identifier">prio_</span> <span class="special"><</span> <span class="identifier">b</span><span class="special">.</span><span class="identifier">prio_</span><span class="special">;</span> <span class="special">}</span> <span class="comment">//Lower value means higher priority</span> 256 <span class="comment">//Inverse priority compare</span> 257 <span class="keyword">friend</span> <span class="keyword">bool</span> <span class="identifier">priority_inverse_order</span> <span class="special">(</span><span class="keyword">const</span> <span class="identifier">MyClass</span> <span class="special">&</span><span class="identifier">a</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">MyClass</span> <span class="special">&</span><span class="identifier">b</span><span class="special">)</span> 258 <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">a</span><span class="special">.</span><span class="identifier">prio_</span> <span class="special">></span> <span class="identifier">b</span><span class="special">.</span><span class="identifier">prio_</span><span class="special">;</span> <span class="special">}</span> <span class="comment">//Higher value means higher priority</span> 259<span class="special">};</span> 260 261<span class="keyword">struct</span> <span class="identifier">inverse_priority</span> 262<span class="special">{</span> 263 <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">()(</span><span class="keyword">const</span> <span class="identifier">MyClass</span> <span class="special">&</span><span class="identifier">a</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">MyClass</span> <span class="special">&</span><span class="identifier">b</span><span class="special">)</span> <span class="keyword">const</span> 264 <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">priority_inverse_order</span><span class="special">(</span><span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">);</span> <span class="special">}</span> 265<span class="special">};</span> 266 267 268<span class="comment">//Define an treap_set using the base hook that will store values in reverse order</span> 269<span class="keyword">typedef</span> <span class="identifier">treap_set</span><span class="special"><</span> <span class="identifier">MyClass</span><span class="special">,</span> <span class="identifier">compare</span><span class="special"><</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">greater</span><span class="special"><</span><span class="identifier">MyClass</span><span class="special">></span> <span class="special">></span> <span class="special">></span> <span class="identifier">BaseSet</span><span class="special">;</span> 270 271<span class="comment">//Define an multiset using the member hook that will store</span> 272<span class="keyword">typedef</span> <span class="identifier">member_hook</span><span class="special"><</span><span class="identifier">MyClass</span><span class="special">,</span> <span class="identifier">bs_set_member_hook</span><span class="special"><>,</span> <span class="special">&</span><span class="identifier">MyClass</span><span class="special">::</span><span class="identifier">member_hook_</span><span class="special">></span> <span class="identifier">MemberOption</span><span class="special">;</span> 273<span class="keyword">typedef</span> <span class="identifier">treap_multiset</span> 274 <span class="special"><</span> <span class="identifier">MyClass</span><span class="special">,</span> <span class="identifier">MemberOption</span><span class="special">,</span> <span class="identifier">priority</span><span class="special"><</span><span class="identifier">inverse_priority</span><span class="special">></span> <span class="special">></span> <span class="identifier">MemberMultiset</span><span class="special">;</span> 275 276<span class="keyword">int</span> <span class="identifier">main</span><span class="special">()</span> 277<span class="special">{</span> 278 <span class="keyword">typedef</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special"><</span><span class="identifier">MyClass</span><span class="special">>::</span><span class="identifier">iterator</span> <span class="identifier">VectIt</span><span class="special">;</span> 279 280 <span class="comment">//Create several MyClass objects, each one with a different value</span> 281 <span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special"><</span><span class="identifier">MyClass</span><span class="special">></span> <span class="identifier">values</span><span class="special">;</span> 282 <span class="keyword">for</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">0</span><span class="special">;</span> <span class="identifier">i</span> <span class="special"><</span> <span class="number">100</span><span class="special">;</span> <span class="special">++</span><span class="identifier">i</span><span class="special">)</span> <span class="identifier">values</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">MyClass</span><span class="special">(</span><span class="identifier">i</span><span class="special">,</span> <span class="special">(</span><span class="identifier">i</span> <span class="special">%</span> <span class="number">10</span><span class="special">)));</span> 283 284 <span class="identifier">BaseSet</span> <span class="identifier">baseset</span><span class="special">;</span> 285 <span class="identifier">MemberMultiset</span> <span class="identifier">membermultiset</span><span class="special">;</span> 286 287 <span class="comment">//Now insert them in the sets</span> 288 <span class="keyword">for</span><span class="special">(</span><span class="identifier">VectIt</span> <span class="identifier">it</span><span class="special">(</span><span class="identifier">values</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()),</span> <span class="identifier">itend</span><span class="special">(</span><span class="identifier">values</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span> <span class="identifier">it</span> <span class="special">!=</span> <span class="identifier">itend</span><span class="special">;</span> <span class="special">++</span><span class="identifier">it</span><span class="special">){</span> 289 <span class="identifier">baseset</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(*</span><span class="identifier">it</span><span class="special">);</span> 290 <span class="identifier">membermultiset</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(*</span><span class="identifier">it</span><span class="special">);</span> 291 <span class="special">}</span> 292 293 <span class="comment">//Now test treap_sets</span> 294 <span class="special">{</span> 295 <span class="identifier">BaseSet</span><span class="special">::</span><span class="identifier">reverse_iterator</span> <span class="identifier">rbit</span><span class="special">(</span><span class="identifier">baseset</span><span class="special">.</span><span class="identifier">rbegin</span><span class="special">());</span> 296 <span class="identifier">MemberMultiset</span><span class="special">::</span><span class="identifier">iterator</span> <span class="identifier">mit</span><span class="special">(</span><span class="identifier">membermultiset</span><span class="special">.</span><span class="identifier">begin</span><span class="special">());</span> 297 <span class="identifier">VectIt</span> <span class="identifier">it</span><span class="special">(</span><span class="identifier">values</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()),</span> <span class="identifier">itend</span><span class="special">(</span><span class="identifier">values</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span> 298 299 <span class="comment">//Test the objects inserted in the base hook treap_set</span> 300 <span class="keyword">for</span><span class="special">(;</span> <span class="identifier">it</span> <span class="special">!=</span> <span class="identifier">itend</span><span class="special">;</span> <span class="special">++</span><span class="identifier">it</span><span class="special">,</span> <span class="special">++</span><span class="identifier">rbit</span><span class="special">)</span> 301 <span class="keyword">if</span><span class="special">(&*</span><span class="identifier">rbit</span> <span class="special">!=</span> <span class="special">&*</span><span class="identifier">it</span><span class="special">)</span> <span class="keyword">return</span> <span class="number">1</span><span class="special">;</span> 302 303 <span class="comment">//Test the objects inserted in the member hook treap_set</span> 304 <span class="keyword">for</span><span class="special">(</span><span class="identifier">it</span> <span class="special">=</span> <span class="identifier">values</span><span class="special">.</span><span class="identifier">begin</span><span class="special">();</span> <span class="identifier">it</span> <span class="special">!=</span> <span class="identifier">itend</span><span class="special">;</span> <span class="special">++</span><span class="identifier">it</span><span class="special">,</span> <span class="special">++</span><span class="identifier">mit</span><span class="special">)</span> 305 <span class="keyword">if</span><span class="special">(&*</span><span class="identifier">mit</span> <span class="special">!=</span> <span class="special">&*</span><span class="identifier">it</span><span class="special">)</span> <span class="keyword">return</span> <span class="number">1</span><span class="special">;</span> 306 307 <span class="comment">//Test priority order</span> 308 <span class="keyword">for</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">0</span><span class="special">;</span> <span class="identifier">i</span> <span class="special"><</span> <span class="number">100</span><span class="special">;</span> <span class="special">++</span><span class="identifier">i</span><span class="special">){</span> 309 <span class="keyword">if</span><span class="special">(</span><span class="identifier">baseset</span><span class="special">.</span><span class="identifier">top</span><span class="special">()-></span><span class="identifier">get_priority</span><span class="special">()</span> <span class="special">!=</span> <span class="keyword">static_cast</span><span class="special"><</span><span class="keyword">unsigned</span> <span class="keyword">int</span><span class="special">>(</span><span class="identifier">i</span><span class="special">/</span><span class="number">10</span><span class="special">))</span> 310 <span class="keyword">return</span> <span class="number">1</span><span class="special">;</span> 311 <span class="keyword">if</span><span class="special">(</span><span class="identifier">membermultiset</span><span class="special">.</span><span class="identifier">top</span><span class="special">()-></span><span class="identifier">get_priority</span><span class="special">()</span> <span class="special">!=</span> <span class="number">9u</span> <span class="special">-</span> <span class="keyword">static_cast</span><span class="special"><</span><span class="keyword">unsigned</span> <span class="keyword">int</span><span class="special">>(</span><span class="identifier">i</span><span class="special">/</span><span class="number">10</span><span class="special">))</span> 312 <span class="keyword">return</span> <span class="number">1</span><span class="special">;</span> 313 <span class="identifier">baseset</span><span class="special">.</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">baseset</span><span class="special">.</span><span class="identifier">top</span><span class="special">());</span> 314 <span class="identifier">membermultiset</span><span class="special">.</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">membermultiset</span><span class="special">.</span><span class="identifier">top</span><span class="special">());</span> 315 <span class="special">}</span> 316 <span class="special">}</span> 317 <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span> 318<span class="special">}</span> 319</pre> 320</div> 321</div> 322<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> 323<td align="left"></td> 324<td align="right"><div class="copyright-footer">Copyright © 2005 Olaf Krzikalla<br>Copyright © 2006-2015 Ion Gaztanaga<p> 325 Distributed under the Boost Software License, Version 1.0. (See accompanying 326 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>) 327 </p> 328</div></td> 329</tr></table> 330<hr> 331<div class="spirit-nav"> 332<a accesskey="p" href="sg_set_multiset.html"><img src="../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../intrusive.html"><img src="../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="bst_hooks.html"><img src="../../../doc/src/images/next.png" alt="Next"></a> 333</div> 334</body> 335</html> 336
