<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
<title>STX B+ Tree Template Classes: stx/btree_multiset.h Source File</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.5.6 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<h1>stx/btree_multiset.h</h1><a href="btree__multiset_8h.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// $Id: btree_multiset.h 113 2008-09-07 15:25:51Z tb $</span>
<a name="l00006"></a>00006 <span class="comment"></span><span class="comment">/*</span>
<a name="l00007"></a>00007 <span class="comment"> * STX B+ Tree Template Classes v0.8.3</span>
<a name="l00008"></a>00008 <span class="comment"> * Copyright (C) 2008 Timo Bingmann</span>
<a name="l00009"></a>00009 <span class="comment"> *</span>
<a name="l00010"></a>00010 <span class="comment"> * This library is free software; you can redistribute it and/or modify it</span>
<a name="l00011"></a>00011 <span class="comment"> * under the terms of the GNU Lesser General Public License as published by the</span>
<a name="l00012"></a>00012 <span class="comment"> * Free Software Foundation; either version 2.1 of the License, or (at your</span>
<a name="l00013"></a>00013 <span class="comment"> * option) any later version.</span>
<a name="l00014"></a>00014 <span class="comment"> *</span>
<a name="l00015"></a>00015 <span class="comment"> * This library is distributed in the hope that it will be useful, but WITHOUT</span>
<a name="l00016"></a>00016 <span class="comment"> * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or</span>
<a name="l00017"></a>00017 <span class="comment"> * FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License</span>
<a name="l00018"></a>00018 <span class="comment"> * for more details.</span>
<a name="l00019"></a>00019 <span class="comment"> *</span>
<a name="l00020"></a>00020 <span class="comment"> * You should have received a copy of the GNU Lesser General Public License</span>
<a name="l00021"></a>00021 <span class="comment"> * along with this library; if not, write to the Free Software Foundation,</span>
<a name="l00022"></a>00022 <span class="comment"> * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA</span>
<a name="l00023"></a>00023 <span class="comment"> */</span>
<a name="l00024"></a>00024
<a name="l00025"></a>00025 <span class="preprocessor">#ifndef _STX_BTREE_MULTISET_H_</span>
<a name="l00026"></a>00026 <span class="preprocessor"></span><span class="preprocessor">#define _STX_BTREE_MULTISET_H_</span>
<a name="l00027"></a>00027 <span class="preprocessor"></span>
<a name="l00028"></a>00028 <span class="preprocessor">#include <<a class="code" href="btree_8h.html" title="Contains the main B+ tree implementation template class btree.">stx/btree.h</a>></span>
<a name="l00029"></a>00029
<a name="l00030"></a>00030 <span class="keyword">namespace </span>stx {
<a name="l00031"></a>00031
<a name="l00050"></a>00050 <span class="keyword">template</span> <<span class="keyword">typename</span> _Key,
<a name="l00051"></a>00051 <span class="keyword">typename</span> _Compare = std::less<_Key>,
<a name="l00052"></a>00052 <span class="keyword">typename</span> _Traits = btree_default_set_traits<_Key> >
<a name="l00053"></a><a class="code" href="classstx_1_1btree__multiset.html">00053</a> <span class="keyword">class </span><a class="code" href="classstx_1_1btree__multiset.html" title="Specialized B+ tree template class implementing STL&#39;s multiset container.">btree_multiset</a>
<a name="l00054"></a>00054 {
<a name="l00055"></a>00055 <span class="keyword">public</span>:
<a name="l00056"></a>00056 <span class="comment">// *** Template Parameter Types</span>
<a name="l00057"></a>00057
<a name="l00060"></a><a class="code" href="classstx_1_1btree__multiset.html#70ce8aefc4ca681bd1aee899d261f9f2">00060</a> <span class="keyword">typedef</span> _Key <a class="code" href="classstx_1_1btree__multiset.html#70ce8aefc4ca681bd1aee899d261f9f2" title="First template parameter: The key type of the btree.">key_type</a>;
<a name="l00061"></a>00061
<a name="l00063"></a><a class="code" href="classstx_1_1btree__multiset.html#f891648d4688fac7c9a3e734608e926b">00063</a> <span class="keyword">typedef</span> _Compare <a class="code" href="classstx_1_1btree__multiset.html#f891648d4688fac7c9a3e734608e926b" title="Second template parameter: Key comparison function object.">key_compare</a>;
<a name="l00064"></a>00064
<a name="l00067"></a><a class="code" href="classstx_1_1btree__multiset.html#4605accf55721a656ff3d9bb318d8ec8">00067</a> <span class="keyword">typedef</span> _Traits <a class="code" href="classstx_1_1btree__multiset.html#4605accf55721a656ff3d9bb318d8ec8" title="Third template parameter: Traits object used to define more parameters of the B+...">traits</a>;
<a name="l00068"></a>00068
<a name="l00069"></a>00069 <span class="comment">// The macro BTREE_FRIENDS can be used by outside class to access the B+</span>
<a name="l00070"></a>00070 <span class="comment">// tree internals. This was added for wxBTreeDemo to be able to draw the</span>
<a name="l00071"></a>00071 <span class="comment">// tree.</span>
<a name="l00072"></a>00072 <a class="code" href="btree_8h.html#ec07a93b351ce398f789007a441a4320" title="The macro BTREE_FRIENDS can be used by outside class to access the B+ tree internals...">BTREE_FRIENDS</a>
<a name="l00073"></a>00073
<a name="l00074"></a>00074 <span class="keyword">private</span>:
<a name="l00075"></a>00075 <span class="comment">// *** The Data_Type</span>
<a name="l00076"></a>00076
<a name="l00078"></a>00078 <span class="keyword">struct </span>empty_struct
<a name="l00079"></a>00079 {
<a name="l00080"></a>00080 };
<a name="l00081"></a>00081
<a name="l00082"></a>00082 <span class="keyword">public</span>:
<a name="l00083"></a>00083 <span class="comment">// *** Constructed Types</span>
<a name="l00084"></a>00084
<a name="l00086"></a><a class="code" href="classstx_1_1btree__multiset.html#f2b19c009eb7141f3a1de96f2a3895ab">00086</a> <span class="keyword">typedef</span> <span class="keyword">struct </span>empty_struct <a class="code" href="classstx_1_1btree__multiset.html#f2b19c009eb7141f3a1de96f2a3895ab" title="The empty data_type.">data_type</a>;
<a name="l00087"></a>00087
<a name="l00089"></a><a class="code" href="classstx_1_1btree__multiset.html#6f16ce3d4836c24c2d0917d3cd3a91c6">00089</a> <span class="keyword">typedef</span> <a class="code" href="classstx_1_1btree__multiset.html#70ce8aefc4ca681bd1aee899d261f9f2" title="First template parameter: The key type of the btree.">key_type</a> <a class="code" href="classstx_1_1btree__multiset.html#6f16ce3d4836c24c2d0917d3cd3a91c6" title="Construct the set value_type: the key_type.">value_type</a>;
<a name="l00090"></a>00090
<a name="l00092"></a><a class="code" href="classstx_1_1btree__multiset.html#742abd5c979ee4d129d58bb418a59fa6">00092</a> <span class="keyword">typedef</span> <a class="code" href="classstx_1_1btree__multiset.html" title="Specialized B+ tree template class implementing STL&#39;s multiset container.">btree_multiset<key_type, key_compare, traits></a> <span class="keyword">self</span>;
<a name="l00093"></a>00093
<a name="l00095"></a><a class="code" href="classstx_1_1btree__multiset.html#10f03dd25afdee220fb07565feec92d7">00095</a> <span class="keyword">typedef</span> <a class="code" href="classstx_1_1btree.html" title="Basic class implementing a base B+ tree data structure in memory.">stx::btree<key_type, data_type, value_type, key_compare, traits, true></a> <a class="code" href="classstx_1_1btree.html" title="Basic class implementing a base B+ tree data structure in memory.">btree_impl</a>;
<a name="l00096"></a>00096
<a name="l00098"></a><a class="code" href="classstx_1_1btree__multiset.html#a3cf824ee430e7c0276ad20e33a98146">00098</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="classstx_1_1btree_1_1value__compare.html" title="Function class to compare value_type objects. Required by the STL.">btree_impl::value_compare</a> <a class="code" href="classstx_1_1btree_1_1value__compare.html" title="Function class to compare value_type objects. Required by the STL.">value_compare</a>;
<a name="l00099"></a>00099
<a name="l00101"></a><a class="code" href="classstx_1_1btree__multiset.html#ac25b0bd4faefca3c6f938fca0d15405">00101</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="classstx_1_1btree.html#973470864b67129983ea4e1aa2132ac5" title="Size type used to count keys.">btree_impl::size_type</a> <a class="code" href="classstx_1_1btree__multiset.html#ac25b0bd4faefca3c6f938fca0d15405" title="Size type used to count keys.">size_type</a>;
<a name="l00102"></a>00102
<a name="l00104"></a><a class="code" href="classstx_1_1btree__multiset.html#4510bbeef2fc1c50c909aba4196bfc2c">00104</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="structstx_1_1btree_1_1tree__stats.html" title="A small struct containing basic statistics about the B+ tree.">btree_impl::tree_stats</a> <a class="code" href="structstx_1_1btree_1_1tree__stats.html" title="A small struct containing basic statistics about the B+ tree.">tree_stats</a>;
<a name="l00105"></a>00105
<a name="l00106"></a>00106 <span class="keyword">public</span>:
<a name="l00107"></a>00107 <span class="comment">// *** Static Constant Options and Values of the B+ Tree</span>
<a name="l00108"></a>00108
<a name="l00110"></a><a class="code" href="classstx_1_1btree__multiset.html#c1e2446e6053244d6b464a1a3e6e8b36">00110</a> <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> <a class="code" href="classstx_1_1btree__multiset.html#c1e2446e6053244d6b464a1a3e6e8b36" title="Base B+ tree parameter: The number of key/data slots in each leaf.">leafslotmax</a> = <a class="code" href="classstx_1_1btree.html#12a39ca671e962924f4acf879a44eafc" title="Base B+ tree parameter: The number of key/data slots in each leaf.">btree_impl::leafslotmax</a>;
<a name="l00111"></a>00111
<a name="l00114"></a><a class="code" href="classstx_1_1btree__multiset.html#8597ce01722e6ac17098ef95f80e0a42">00114</a> <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> <a class="code" href="classstx_1_1btree__multiset.html#8597ce01722e6ac17098ef95f80e0a42" title="Base B+ tree parameter: The number of key slots in each inner node, this can differ...">innerslotmax</a> = <a class="code" href="classstx_1_1btree.html#83a18c2fb7f4e9cfd47ce7545d004324" title="Base B+ tree parameter: The number of key slots in each inner node, this can differ...">btree_impl::innerslotmax</a>;
<a name="l00115"></a>00115
<a name="l00119"></a><a class="code" href="classstx_1_1btree__multiset.html#7e2ab3e6ad0d13a34656d3cf32ce04f8">00119</a> <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> <a class="code" href="classstx_1_1btree__multiset.html#7e2ab3e6ad0d13a34656d3cf32ce04f8" title="Computed B+ tree parameter: The minimum number of key slots used in a leaf.">minleafslots</a> = <a class="code" href="classstx_1_1btree.html#c53c2fe18cd06916a25c3b2a6e0486eb" title="Computed B+ tree parameter: The minimum number of key/data slots used in a leaf.">btree_impl::minleafslots</a>;
<a name="l00120"></a>00120
<a name="l00124"></a><a class="code" href="classstx_1_1btree__multiset.html#54663fd64ab92e32d68005b21cceeca6">00124</a> <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> <a class="code" href="classstx_1_1btree__multiset.html#54663fd64ab92e32d68005b21cceeca6" title="Computed B+ tree parameter: The minimum number of key slots used in an inner node...">mininnerslots</a> = <a class="code" href="classstx_1_1btree.html#14312352a7289cee65f1793b0183f60e" title="Computed B+ tree parameter: The minimum number of key slots used in an inner node...">btree_impl::mininnerslots</a>;
<a name="l00125"></a>00125
<a name="l00128"></a><a class="code" href="classstx_1_1btree__multiset.html#9cb3240eea74483e07331928b27da49e">00128</a> <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__multiset.html#9cb3240eea74483e07331928b27da49e" title="Debug parameter: Enables expensive and thorough checking of the B+ tree invariants...">selfverify</a> = <a class="code" href="classstx_1_1btree.html#ee2e25b0fccc7147fd8be0bcf8630b5b" title="Debug parameter: Enables expensive and thorough checking of the B+ tree invariants...">btree_impl::selfverify</a>;
<a name="l00129"></a>00129
<a name="l00133"></a><a class="code" href="classstx_1_1btree__multiset.html#e020fc9ea2886a04e077e4d719ca59af">00133</a> <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__multiset.html#e020fc9ea2886a04e077e4d719ca59af" title="Debug parameter: Prints out lots of debug information about how the algorithms change...">debug</a> = <a class="code" href="classstx_1_1btree.html#ac6ff74fe9fb9e87958d73c28cb9eef4" title="Debug parameter: Prints out lots of debug information about how the algorithms change...">btree_impl::debug</a>;
<a name="l00134"></a>00134
<a name="l00136"></a><a class="code" href="classstx_1_1btree__multiset.html#7f1e473a796e72a331920189055ba7bf">00136</a> <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__multiset.html#7f1e473a796e72a331920189055ba7bf" title="Operational parameter: Allow duplicate keys in the btree.">allow_duplicates</a> = <a class="code" href="classstx_1_1btree.html#35378979c13861883affefda9ad95df7" title="Sixth template parameter: Allow duplicate keys in the B+ tree.">btree_impl::allow_duplicates</a>;
<a name="l00137"></a>00137
<a name="l00138"></a>00138 <span class="keyword">public</span>:
<a name="l00139"></a>00139 <span class="comment">// *** Iterators and Reverse Iterators</span>
<a name="l00140"></a>00140
<a name="l00143"></a><a class="code" href="classstx_1_1btree__multiset.html#8ab2b881783b721baddc90bf55d28ca0">00143</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">btree_impl::iterator</a> <a class="code" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a>;
<a name="l00144"></a>00144
<a name="l00147"></a><a class="code" href="classstx_1_1btree__multiset.html#35a391f3d01ba0c40866ae997fba530f">00147</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="classstx_1_1btree_1_1const__iterator.html" title="STL-like read-only iterator object for B+ tree items.">btree_impl::const_iterator</a> <a class="code" href="classstx_1_1btree_1_1const__iterator.html" title="STL-like read-only iterator object for B+ tree items.">const_iterator</a>;
<a name="l00148"></a>00148
<a name="l00150"></a><a class="code" href="classstx_1_1btree__multiset.html#c357ec97c32753380d1937413d94bcfc">00150</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="classstx_1_1btree_1_1reverse__iterator.html" title="STL-like mutable reverse iterator object for B+ tree items.">btree_impl::reverse_iterator</a> <a class="code" href="classstx_1_1btree_1_1reverse__iterator.html" title="STL-like mutable reverse iterator object for B+ tree items.">reverse_iterator</a>;
<a name="l00151"></a>00151
<a name="l00153"></a><a class="code" href="classstx_1_1btree__multiset.html#e21618cd7b08c5c3430a0a2d2e859c8d">00153</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="classstx_1_1btree_1_1const__reverse__iterator.html" title="STL-like read-only reverse iterator object for B+ tree items.">btree_impl::const_reverse_iterator</a> <a class="code" href="classstx_1_1btree_1_1const__reverse__iterator.html" title="STL-like read-only reverse iterator object for B+ tree items.">const_reverse_iterator</a>;
<a name="l00154"></a>00154
<a name="l00155"></a>00155 <span class="keyword">private</span>:
<a name="l00156"></a>00156 <span class="comment">// *** Tree Implementation Object</span>
<a name="l00157"></a>00157
<a name="l00159"></a><a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6">00159</a> <a class="code" href="classstx_1_1btree.html" title="Basic class implementing a base B+ tree data structure in memory.">btree_impl</a> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>;
<a name="l00160"></a>00160
<a name="l00161"></a>00161 <span class="keyword">public</span>:
<a name="l00162"></a>00162 <span class="comment">// *** Constructors and Destructor</span>
<a name="l00163"></a>00163
<a name="l00166"></a><a class="code" href="classstx_1_1btree__multiset.html#bd58492292a36010f9460563b3ef10ab">00166</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__multiset.html#bd58492292a36010f9460563b3ef10ab" title="Default constructor initializing an empty B+ tree with the standard key comparison...">btree_multiset</a>()
<a name="l00167"></a>00167 : <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>()
<a name="l00168"></a>00168 {
<a name="l00169"></a>00169 }
<a name="l00170"></a>00170
<a name="l00173"></a><a class="code" href="classstx_1_1btree__multiset.html#bc698f264d78b0d0d2cb998de5401954">00173</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__multiset.html#bd58492292a36010f9460563b3ef10ab" title="Default constructor initializing an empty B+ tree with the standard key comparison...">btree_multiset</a>(<span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multiset.html#f891648d4688fac7c9a3e734608e926b" title="Second template parameter: Key comparison function object.">key_compare</a> &kcf)
<a name="l00174"></a>00174 : <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>(kcf)
<a name="l00175"></a>00175 {
<a name="l00176"></a>00176 }
<a name="l00177"></a>00177
<a name="l00179"></a>00179 <span class="keyword">template</span> <<span class="keyword">class</span> InputIterator>
<a name="l00180"></a><a class="code" href="classstx_1_1btree__multiset.html#a88a97f592defdb222a2172b875f6d7e">00180</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__multiset.html#bd58492292a36010f9460563b3ef10ab" title="Default constructor initializing an empty B+ tree with the standard key comparison...">btree_multiset</a>(InputIterator first, InputIterator last)
<a name="l00181"></a>00181 : <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>()
<a name="l00182"></a>00182 {
<a name="l00183"></a>00183 <a class="code" href="classstx_1_1btree__multiset.html#365fc6b6e68b3f2673b2f1f717f6457d" title="Attempt to insert a key into the B+ tree.">insert</a>(first, last);
<a name="l00184"></a>00184 }
<a name="l00185"></a>00185
<a name="l00188"></a>00188 <span class="keyword">template</span> <<span class="keyword">class</span> InputIterator>
<a name="l00189"></a><a class="code" href="classstx_1_1btree__multiset.html#29adec1f86d9005f9084e75a40275438">00189</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__multiset.html#bd58492292a36010f9460563b3ef10ab" title="Default constructor initializing an empty B+ tree with the standard key comparison...">btree_multiset</a>(InputIterator first, InputIterator last, <span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multiset.html#f891648d4688fac7c9a3e734608e926b" title="Second template parameter: Key comparison function object.">key_compare</a> &kcf)
<a name="l00190"></a>00190 : <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>(kcf)
<a name="l00191"></a>00191 {
<a name="l00192"></a>00192 <a class="code" href="classstx_1_1btree__multiset.html#365fc6b6e68b3f2673b2f1f717f6457d" title="Attempt to insert a key into the B+ tree.">insert</a>(first, last);
<a name="l00193"></a>00193 }
<a name="l00194"></a>00194
<a name="l00196"></a><a class="code" href="classstx_1_1btree__multiset.html#f2afcf9802b658e0968fc2c342a373c3">00196</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__multiset.html#f2afcf9802b658e0968fc2c342a373c3" title="Frees up all used B+ tree memory pages.">~btree_multiset</a>()
<a name="l00197"></a>00197 {
<a name="l00198"></a>00198 }
<a name="l00199"></a>00199
<a name="l00201"></a><a class="code" href="classstx_1_1btree__multiset.html#ef7070a27a64a4d0a0c1b811d7c1f2e9">00201</a> <span class="keywordtype">void</span> <a class="code" href="classstx_1_1btree__multiset.html#ef7070a27a64a4d0a0c1b811d7c1f2e9" title="Fast swapping of two identical B+ tree objects.">swap</a>(<span class="keyword">self</span>& from)
<a name="l00202"></a>00202 {
<a name="l00203"></a>00203 std::swap(<a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>, from.tree);
<a name="l00204"></a>00204 }
<a name="l00205"></a>00205
<a name="l00206"></a>00206 <span class="keyword">public</span>:
<a name="l00207"></a>00207 <span class="comment">// *** Key and Value Comparison Function Objects</span>
<a name="l00208"></a>00208
<a name="l00210"></a><a class="code" href="classstx_1_1btree__multiset.html#cb13fe838c316f532431ec43eaa16add">00210</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__multiset.html#f891648d4688fac7c9a3e734608e926b" title="Second template parameter: Key comparison function object.">key_compare</a> <a class="code" href="classstx_1_1btree__multiset.html#cb13fe838c316f532431ec43eaa16add" title="Constant access to the key comparison object sorting the B+ tree.">key_comp</a>()<span class="keyword"> const</span>
<a name="l00211"></a>00211 <span class="keyword"> </span>{
<a name="l00212"></a>00212 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#43d1c2683f2dc078aa25e49820e9c237" title="Constant access to the key comparison object sorting the B+ tree.">key_comp</a>();
<a name="l00213"></a>00213 }
<a name="l00214"></a>00214
<a name="l00217"></a><a class="code" href="classstx_1_1btree__multiset.html#2e7f89eaf20e3fc7e801bced2c8b9af6">00217</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree_1_1value__compare.html" title="Function class to compare value_type objects. Required by the STL.">value_compare</a> <a class="code" href="classstx_1_1btree__multiset.html#2e7f89eaf20e3fc7e801bced2c8b9af6" title="Constant access to a constructed value_type comparison object.">value_comp</a>()<span class="keyword"> const</span>
<a name="l00218"></a>00218 <span class="keyword"> </span>{
<a name="l00219"></a>00219 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#94273af1fe4b9e2e0c0b6daeaa5f5950" title="Constant access to a constructed value_type comparison object.">value_comp</a>();
<a name="l00220"></a>00220 }
<a name="l00221"></a>00221
<a name="l00222"></a>00222 <span class="keyword">public</span>:
<a name="l00223"></a>00223 <span class="comment">// *** Fast Destruction of the B+ Tree</span>
<a name="l00224"></a>00224
<a name="l00226"></a><a class="code" href="classstx_1_1btree__multiset.html#1ea800e072cc8c67b030598bf04028b4">00226</a> <span class="keywordtype">void</span> <a class="code" href="classstx_1_1btree__multiset.html#1ea800e072cc8c67b030598bf04028b4" title="Frees all keys and all nodes of the tree.">clear</a>()
<a name="l00227"></a>00227 {
<a name="l00228"></a>00228 <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#cf6ccb1acc05ef2845dfa97c81b1be9f" title="Frees all key/data pairs and all nodes of the tree.">clear</a>();
<a name="l00229"></a>00229 }
<a name="l00230"></a>00230
<a name="l00231"></a>00231 <span class="keyword">public</span>:
<a name="l00232"></a>00232 <span class="comment">// *** STL Iterator Construction Functions</span>
<a name="l00233"></a>00233
<a name="l00236"></a><a class="code" href="classstx_1_1btree__multiset.html#3440bd4aee2ddebc80386a3e3655c405">00236</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a> <a class="code" href="classstx_1_1btree__multiset.html#3440bd4aee2ddebc80386a3e3655c405" title="Constructs a read/data-write iterator that points to the first slot in the first...">begin</a>()
<a name="l00237"></a>00237 {
<a name="l00238"></a>00238 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#6551b60cb8a2f717555ceac61f34b957" title="Constructs a read/data-write iterator that points to the first slot in the first...">begin</a>();
<a name="l00239"></a>00239 }
<a name="l00240"></a>00240
<a name="l00243"></a><a class="code" href="classstx_1_1btree__multiset.html#59bab95c02bfeb444174934240747d2f">00243</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a> <a class="code" href="classstx_1_1btree__multiset.html#59bab95c02bfeb444174934240747d2f" title="Constructs a read/data-write iterator that points to the first invalid slot in the...">end</a>()
<a name="l00244"></a>00244 {
<a name="l00245"></a>00245 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#14f8bf63680c8950aab8c5d54e580a14" title="Constructs a read/data-write iterator that points to the first invalid slot in the...">end</a>();
<a name="l00246"></a>00246 }
<a name="l00247"></a>00247
<a name="l00250"></a><a class="code" href="classstx_1_1btree__multiset.html#19f65197c78cda6568a53a414d148a52">00250</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree_1_1const__iterator.html" title="STL-like read-only iterator object for B+ tree items.">const_iterator</a> <a class="code" href="classstx_1_1btree__multiset.html#3440bd4aee2ddebc80386a3e3655c405" title="Constructs a read/data-write iterator that points to the first slot in the first...">begin</a>()<span class="keyword"> const</span>
<a name="l00251"></a>00251 <span class="keyword"> </span>{
<a name="l00252"></a>00252 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#6551b60cb8a2f717555ceac61f34b957" title="Constructs a read/data-write iterator that points to the first slot in the first...">begin</a>();
<a name="l00253"></a>00253 }
<a name="l00254"></a>00254
<a name="l00257"></a><a class="code" href="classstx_1_1btree__multiset.html#c80c6974fae711429d8660cb6692c78f">00257</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree_1_1const__iterator.html" title="STL-like read-only iterator object for B+ tree items.">const_iterator</a> <a class="code" href="classstx_1_1btree__multiset.html#59bab95c02bfeb444174934240747d2f" title="Constructs a read/data-write iterator that points to the first invalid slot in the...">end</a>()<span class="keyword"> const</span>
<a name="l00258"></a>00258 <span class="keyword"> </span>{
<a name="l00259"></a>00259 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#14f8bf63680c8950aab8c5d54e580a14" title="Constructs a read/data-write iterator that points to the first invalid slot in the...">end</a>();
<a name="l00260"></a>00260 }
<a name="l00261"></a>00261
<a name="l00264"></a><a class="code" href="classstx_1_1btree__multiset.html#7eca5974eb54c6a0a4807fd4581301b7">00264</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree_1_1reverse__iterator.html" title="STL-like mutable reverse iterator object for B+ tree items.">reverse_iterator</a> <a class="code" href="classstx_1_1btree__multiset.html#7eca5974eb54c6a0a4807fd4581301b7" title="Constructs a read/data-write reverse iterator that points to the first invalid slot...">rbegin</a>()
<a name="l00265"></a>00265 {
<a name="l00266"></a>00266 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#4d3a4b24d8cc56c589800655cf83c806" title="Constructs a read/data-write reverse iterator that points to the first invalid slot...">rbegin</a>();
<a name="l00267"></a>00267 }
<a name="l00268"></a>00268
<a name="l00271"></a><a class="code" href="classstx_1_1btree__multiset.html#c8807d5587424f0932fc20eb39a90b66">00271</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree_1_1reverse__iterator.html" title="STL-like mutable reverse iterator object for B+ tree items.">reverse_iterator</a> <a class="code" href="classstx_1_1btree__multiset.html#c8807d5587424f0932fc20eb39a90b66" title="Constructs a read/data-write reverse iterator that points to the first slot in the...">rend</a>()
<a name="l00272"></a>00272 {
<a name="l00273"></a>00273 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#6d9e5a5b0ec598a76e602aa6a19900ff" title="Constructs a read/data-write reverse iterator that points to the first slot in the...">rend</a>();
<a name="l00274"></a>00274 }
<a name="l00275"></a>00275
<a name="l00278"></a><a class="code" href="classstx_1_1btree__multiset.html#6fc116d6238e21a21d32e54b70d146da">00278</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree_1_1const__reverse__iterator.html" title="STL-like read-only reverse iterator object for B+ tree items.">const_reverse_iterator</a> <a class="code" href="classstx_1_1btree__multiset.html#7eca5974eb54c6a0a4807fd4581301b7" title="Constructs a read/data-write reverse iterator that points to the first invalid slot...">rbegin</a>()<span class="keyword"> const</span>
<a name="l00279"></a>00279 <span class="keyword"> </span>{
<a name="l00280"></a>00280 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#4d3a4b24d8cc56c589800655cf83c806" title="Constructs a read/data-write reverse iterator that points to the first invalid slot...">rbegin</a>();
<a name="l00281"></a>00281 }
<a name="l00282"></a>00282
<a name="l00285"></a><a class="code" href="classstx_1_1btree__multiset.html#bb3d387ad96025a583959bb997c339ba">00285</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree_1_1const__reverse__iterator.html" title="STL-like read-only reverse iterator object for B+ tree items.">const_reverse_iterator</a> <a class="code" href="classstx_1_1btree__multiset.html#c8807d5587424f0932fc20eb39a90b66" title="Constructs a read/data-write reverse iterator that points to the first slot in the...">rend</a>()<span class="keyword"> const</span>
<a name="l00286"></a>00286 <span class="keyword"> </span>{
<a name="l00287"></a>00287 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#6d9e5a5b0ec598a76e602aa6a19900ff" title="Constructs a read/data-write reverse iterator that points to the first slot in the...">rend</a>();
<a name="l00288"></a>00288 }
<a name="l00289"></a>00289
<a name="l00290"></a>00290 <span class="keyword">public</span>:
<a name="l00291"></a>00291 <span class="comment">// *** Access Functions to the Item Count</span>
<a name="l00292"></a>00292
<a name="l00294"></a><a class="code" href="classstx_1_1btree__multiset.html#0bb7751df8f3878ea26a0dd39a3b7820">00294</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__multiset.html#ac25b0bd4faefca3c6f938fca0d15405" title="Size type used to count keys.">size_type</a> <a class="code" href="classstx_1_1btree__multiset.html#0bb7751df8f3878ea26a0dd39a3b7820" title="Return the number of keys in the B+ tree.">size</a>()<span class="keyword"> const</span>
<a name="l00295"></a>00295 <span class="keyword"> </span>{
<a name="l00296"></a>00296 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#5e32032d192795a5f25b49e23e3ef1a1" title="Return the number of key/data pairs in the B+ tree.">size</a>();
<a name="l00297"></a>00297 }
<a name="l00298"></a>00298
<a name="l00300"></a><a class="code" href="classstx_1_1btree__multiset.html#9a58e8b35c872fcff55d873abe39dc08">00300</a> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__multiset.html#9a58e8b35c872fcff55d873abe39dc08" title="Returns true if there is at least one key in the B+ tree.">empty</a>()<span class="keyword"> const</span>
<a name="l00301"></a>00301 <span class="keyword"> </span>{
<a name="l00302"></a>00302 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#ee6ae1b8d5832d3cd829a3962b776cd5" title="Returns true if there is at least one key/data pair in the B+ tree.">empty</a>();
<a name="l00303"></a>00303 }
<a name="l00304"></a>00304
<a name="l00307"></a><a class="code" href="classstx_1_1btree__multiset.html#a52e753a02b3083838aa55802ce067c5">00307</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__multiset.html#ac25b0bd4faefca3c6f938fca0d15405" title="Size type used to count keys.">size_type</a> <a class="code" href="classstx_1_1btree__multiset.html#a52e753a02b3083838aa55802ce067c5" title="Returns the largest possible size of the B+ Tree.">max_size</a>()<span class="keyword"> const</span>
<a name="l00308"></a>00308 <span class="keyword"> </span>{
<a name="l00309"></a>00309 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#ae330348c9f4b6051864da4ebd157662" title="Returns the largest possible size of the B+ Tree.">max_size</a>();
<a name="l00310"></a>00310 }
<a name="l00311"></a>00311
<a name="l00313"></a><a class="code" href="classstx_1_1btree__multiset.html#10eefe6b2c8a04dc2118a95ccafb9beb">00313</a> <span class="keyword">inline</span> <span class="keyword">const</span> <a class="code" href="structstx_1_1btree_1_1tree__stats.html" title="A small struct containing basic statistics about the B+ tree.">tree_stats</a>& <a class="code" href="classstx_1_1btree__multiset.html#10eefe6b2c8a04dc2118a95ccafb9beb" title="Return a const reference to the current statistics.">get_stats</a>()<span class="keyword"> const</span>
<a name="l00314"></a>00314 <span class="keyword"> </span>{
<a name="l00315"></a>00315 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#8748bb3788c1e1d65dbfe9500d33a134" title="Return a const reference to the current statistics.">get_stats</a>();
<a name="l00316"></a>00316 }
<a name="l00317"></a>00317
<a name="l00318"></a>00318 <span class="keyword">public</span>:
<a name="l00319"></a>00319 <span class="comment">// *** Standard Access Functions Querying the Tree by Descending to a Leaf</span>
<a name="l00320"></a>00320
<a name="l00323"></a><a class="code" href="classstx_1_1btree__multiset.html#0d28d31a1eec3bef7a595fa1694d32c6">00323</a> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__multiset.html#0d28d31a1eec3bef7a595fa1694d32c6" title="Non-STL function checking whether a key is in the B+ tree.">exists</a>(<span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multiset.html#70ce8aefc4ca681bd1aee899d261f9f2" title="First template parameter: The key type of the btree.">key_type</a> &key)<span class="keyword"> const</span>
<a name="l00324"></a>00324 <span class="keyword"> </span>{
<a name="l00325"></a>00325 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#9405c7a274bcc76f27b4e84c49fcaa0d" title="Non-STL function checking whether a key is in the B+ tree.">exists</a>(key);
<a name="l00326"></a>00326 }
<a name="l00327"></a>00327
<a name="l00330"></a><a class="code" href="classstx_1_1btree__multiset.html#e2c1c633cc882f58c196fffb463418ec">00330</a> <a class="code" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a> <a class="code" href="classstx_1_1btree__multiset.html#e2c1c633cc882f58c196fffb463418ec" title="Tries to locate a key in the B+ tree and returns an iterator to the key slot if found...">find</a>(<span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multiset.html#70ce8aefc4ca681bd1aee899d261f9f2" title="First template parameter: The key type of the btree.">key_type</a> &key)
<a name="l00331"></a>00331 {
<a name="l00332"></a>00332 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#2be7e3a978a71f86e433a0244c7414c6" title="Tries to locate a key in the B+ tree and returns an iterator to the key/data slot...">find</a>(key);
<a name="l00333"></a>00333 }
<a name="l00334"></a>00334
<a name="l00337"></a><a class="code" href="classstx_1_1btree__multiset.html#897cd3d36c10536db7dad344668aebf0">00337</a> <a class="code" href="classstx_1_1btree_1_1const__iterator.html" title="STL-like read-only iterator object for B+ tree items.">const_iterator</a> <a class="code" href="classstx_1_1btree__multiset.html#e2c1c633cc882f58c196fffb463418ec" title="Tries to locate a key in the B+ tree and returns an iterator to the key slot if found...">find</a>(<span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multiset.html#70ce8aefc4ca681bd1aee899d261f9f2" title="First template parameter: The key type of the btree.">key_type</a> &key)<span class="keyword"> const</span>
<a name="l00338"></a>00338 <span class="keyword"> </span>{
<a name="l00339"></a>00339 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#2be7e3a978a71f86e433a0244c7414c6" title="Tries to locate a key in the B+ tree and returns an iterator to the key/data slot...">find</a>(key);
<a name="l00340"></a>00340 }
<a name="l00341"></a>00341
<a name="l00344"></a><a class="code" href="classstx_1_1btree__multiset.html#089b0f61bce121db02be0532657aee74">00344</a> <a class="code" href="classstx_1_1btree__multiset.html#ac25b0bd4faefca3c6f938fca0d15405" title="Size type used to count keys.">size_type</a> <a class="code" href="classstx_1_1btree__multiset.html#089b0f61bce121db02be0532657aee74" title="Tries to locate a key in the B+ tree and returns the number of identical key entries...">count</a>(<span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multiset.html#70ce8aefc4ca681bd1aee899d261f9f2" title="First template parameter: The key type of the btree.">key_type</a> &key)<span class="keyword"> const</span>
<a name="l00345"></a>00345 <span class="keyword"> </span>{
<a name="l00346"></a>00346 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#36754fc4a90de86806a91cc22eafbe78" title="Tries to locate a key in the B+ tree and returns the number of identical key entries...">count</a>(key);
<a name="l00347"></a>00347 }
<a name="l00348"></a>00348
<a name="l00351"></a><a class="code" href="classstx_1_1btree__multiset.html#b27540157e55c618cafdae9b3e555202">00351</a> <a class="code" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a> <a class="code" href="classstx_1_1btree__multiset.html#b27540157e55c618cafdae9b3e555202" title="Searches the B+ tree and returns an iterator to the first key less or equal to the...">lower_bound</a>(<span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multiset.html#70ce8aefc4ca681bd1aee899d261f9f2" title="First template parameter: The key type of the btree.">key_type</a>& key)
<a name="l00352"></a>00352 {
<a name="l00353"></a>00353 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#74e859adf01a516a382579a614f12673" title="Searches the B+ tree and returns an iterator to the first key less or equal to the...">lower_bound</a>(key);
<a name="l00354"></a>00354 }
<a name="l00355"></a>00355
<a name="l00358"></a><a class="code" href="classstx_1_1btree__multiset.html#07cd0d4237a1491b20b59b997d11f4f2">00358</a> <a class="code" href="classstx_1_1btree_1_1const__iterator.html" title="STL-like read-only iterator object for B+ tree items.">const_iterator</a> <a class="code" href="classstx_1_1btree__multiset.html#b27540157e55c618cafdae9b3e555202" title="Searches the B+ tree and returns an iterator to the first key less or equal to the...">lower_bound</a>(<span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multiset.html#70ce8aefc4ca681bd1aee899d261f9f2" title="First template parameter: The key type of the btree.">key_type</a>& key)<span class="keyword"> const</span>
<a name="l00359"></a>00359 <span class="keyword"> </span>{
<a name="l00360"></a>00360 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#74e859adf01a516a382579a614f12673" title="Searches the B+ tree and returns an iterator to the first key less or equal to the...">lower_bound</a>(key);
<a name="l00361"></a>00361 }
<a name="l00362"></a>00362
<a name="l00365"></a><a class="code" href="classstx_1_1btree__multiset.html#005fd19a0c88f0471144f6b2005f688d">00365</a> <a class="code" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a> <a class="code" href="classstx_1_1btree__multiset.html#005fd19a0c88f0471144f6b2005f688d" title="Searches the B+ tree and returns an iterator to the first key greater than the parameter...">upper_bound</a>(<span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multiset.html#70ce8aefc4ca681bd1aee899d261f9f2" title="First template parameter: The key type of the btree.">key_type</a>& key)
<a name="l00366"></a>00366 {
<a name="l00367"></a>00367 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#789cbe4a94251e756041c5504127ac50" title="Searches the B+ tree and returns an iterator to the first key greater than the parameter...">upper_bound</a>(key);
<a name="l00368"></a>00368 }
<a name="l00369"></a>00369
<a name="l00372"></a><a class="code" href="classstx_1_1btree__multiset.html#11b2aa05f1e4d23ea2c96bceb85491ca">00372</a> <a class="code" href="classstx_1_1btree_1_1const__iterator.html" title="STL-like read-only iterator object for B+ tree items.">const_iterator</a> <a class="code" href="classstx_1_1btree__multiset.html#005fd19a0c88f0471144f6b2005f688d" title="Searches the B+ tree and returns an iterator to the first key greater than the parameter...">upper_bound</a>(<span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multiset.html#70ce8aefc4ca681bd1aee899d261f9f2" title="First template parameter: The key type of the btree.">key_type</a>& key)<span class="keyword"> const</span>
<a name="l00373"></a>00373 <span class="keyword"> </span>{
<a name="l00374"></a>00374 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#789cbe4a94251e756041c5504127ac50" title="Searches the B+ tree and returns an iterator to the first key greater than the parameter...">upper_bound</a>(key);
<a name="l00375"></a>00375 }
<a name="l00376"></a>00376
<a name="l00378"></a><a class="code" href="classstx_1_1btree__multiset.html#346def6f22ef02e1159901c4886c1f5f">00378</a> <span class="keyword">inline</span> std::pair<iterator, iterator> <a class="code" href="classstx_1_1btree__multiset.html#346def6f22ef02e1159901c4886c1f5f" title="Searches the B+ tree and returns both lower_bound() and upper_bound().">equal_range</a>(<span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multiset.html#70ce8aefc4ca681bd1aee899d261f9f2" title="First template parameter: The key type of the btree.">key_type</a>& key)
<a name="l00379"></a>00379 {
<a name="l00380"></a>00380 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#598ffaab5e27bf4e10de0f757938744c" title="Searches the B+ tree and returns both lower_bound() and upper_bound().">equal_range</a>(key);
<a name="l00381"></a>00381 }
<a name="l00382"></a>00382
<a name="l00384"></a><a class="code" href="classstx_1_1btree__multiset.html#19cecbd206b607805f3fc2ca6ae8b37a">00384</a> <span class="keyword">inline</span> std::pair<const_iterator, const_iterator> <a class="code" href="classstx_1_1btree__multiset.html#346def6f22ef02e1159901c4886c1f5f" title="Searches the B+ tree and returns both lower_bound() and upper_bound().">equal_range</a>(<span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multiset.html#70ce8aefc4ca681bd1aee899d261f9f2" title="First template parameter: The key type of the btree.">key_type</a>& key)<span class="keyword"> const</span>
<a name="l00385"></a>00385 <span class="keyword"> </span>{
<a name="l00386"></a>00386 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#598ffaab5e27bf4e10de0f757938744c" title="Searches the B+ tree and returns both lower_bound() and upper_bound().">equal_range</a>(key);
<a name="l00387"></a>00387 }
<a name="l00388"></a>00388
<a name="l00389"></a>00389 <span class="keyword">public</span>:
<a name="l00390"></a>00390 <span class="comment">// *** B+ Tree Object Comparison Functions</span>
<a name="l00391"></a>00391
<a name="l00394"></a><a class="code" href="classstx_1_1btree__multiset.html#d4f93c672138aa2e950bb9e07f8eb053">00394</a> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__multiset.html#d4f93c672138aa2e950bb9e07f8eb053" title="Equality relation of B+ trees of the same type.">operator==</a>(<span class="keyword">const</span> <span class="keyword">self</span> &other)<span class="keyword"> const</span>
<a name="l00395"></a>00395 <span class="keyword"> </span>{
<a name="l00396"></a>00396 <span class="keywordflow">return</span> (<a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a> == other.tree);
<a name="l00397"></a>00397 }
<a name="l00398"></a>00398
<a name="l00400"></a><a class="code" href="classstx_1_1btree__multiset.html#e94198b3cc3456eca0b67c06ae4e6345">00400</a> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__multiset.html#e94198b3cc3456eca0b67c06ae4e6345" title="Inequality relation. Based on operator==.">operator!=</a>(<span class="keyword">const</span> <span class="keyword">self</span> &other)<span class="keyword"> const</span>
<a name="l00401"></a>00401 <span class="keyword"> </span>{
<a name="l00402"></a>00402 <span class="keywordflow">return</span> (<a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a> != other.tree);
<a name="l00403"></a>00403 }
<a name="l00404"></a>00404
<a name="l00407"></a><a class="code" href="classstx_1_1btree__multiset.html#55393b327dc306be602ccef0c88f787a">00407</a> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__multiset.html#55393b327dc306be602ccef0c88f787a" title="Total ordering relation of B+ trees of the same type.">operator<</a>(<span class="keyword">const</span> <span class="keyword">self</span> &other)<span class="keyword"> const</span>
<a name="l00408"></a>00408 <span class="keyword"> </span>{
<a name="l00409"></a>00409 <span class="keywordflow">return</span> (<a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a> < other.tree);
<a name="l00410"></a>00410 }
<a name="l00411"></a>00411
<a name="l00413"></a><a class="code" href="classstx_1_1btree__multiset.html#500a68b0ab827a1ff3c70eafc0d416e7">00413</a> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__multiset.html#500a68b0ab827a1ff3c70eafc0d416e7" title="Greater relation. Based on operator&lt;.">operator></a>(<span class="keyword">const</span> <span class="keyword">self</span> &other)<span class="keyword"> const</span>
<a name="l00414"></a>00414 <span class="keyword"> </span>{
<a name="l00415"></a>00415 <span class="keywordflow">return</span> (<a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a> > other.tree);
<a name="l00416"></a>00416 }
<a name="l00417"></a>00417
<a name="l00419"></a><a class="code" href="classstx_1_1btree__multiset.html#262382a945cba26fa52651dcdc6be798">00419</a> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__multiset.html#262382a945cba26fa52651dcdc6be798" title="Less-equal relation. Based on operator&lt;.">operator<=</a>(<span class="keyword">const</span> <span class="keyword">self</span> &other)<span class="keyword"> const</span>
<a name="l00420"></a>00420 <span class="keyword"> </span>{
<a name="l00421"></a>00421 <span class="keywordflow">return</span> (<a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a> <= other.tree);
<a name="l00422"></a>00422 }
<a name="l00423"></a>00423
<a name="l00425"></a><a class="code" href="classstx_1_1btree__multiset.html#41f4e09c03ac5d64caddb3ab8344c2d6">00425</a> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__multiset.html#41f4e09c03ac5d64caddb3ab8344c2d6" title="Greater-equal relation. Based on operator&lt;.">operator>=</a>(<span class="keyword">const</span> <span class="keyword">self</span> &other)<span class="keyword"> const</span>
<a name="l00426"></a>00426 <span class="keyword"> </span>{
<a name="l00427"></a>00427 <span class="keywordflow">return</span> (<a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a> >= other.tree);
<a name="l00428"></a>00428 }
<a name="l00429"></a>00429
<a name="l00430"></a>00430 <span class="keyword">public</span>:
<a name="l00432"></a>00432
<a name="l00434"></a><a class="code" href="classstx_1_1btree__multiset.html#40f13b28a38ac8138a2b145a41aed575">00434</a> <span class="keyword">inline</span> <span class="keyword">self</span>& <a class="code" href="classstx_1_1btree__multiset.html#40f13b28a38ac8138a2b145a41aed575" title="*** Fast Copy: Assign Operator and Copy Constructors">operator= </a>(<span class="keyword">const</span> <span class="keyword">self</span> &other)
<a name="l00435"></a>00435 {
<a name="l00436"></a>00436 <span class="keywordflow">if</span> (<span class="keyword">this</span> != &other)
<a name="l00437"></a>00437 {
<a name="l00438"></a>00438 <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a> = other.tree;
<a name="l00439"></a>00439 }
<a name="l00440"></a>00440 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00441"></a>00441 }
<a name="l00442"></a>00442
<a name="l00445"></a><a class="code" href="classstx_1_1btree__multiset.html#cd46712d0cedf9ec39f2414f25685dd4">00445</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__multiset.html#bd58492292a36010f9460563b3ef10ab" title="Default constructor initializing an empty B+ tree with the standard key comparison...">btree_multiset</a>(<span class="keyword">const</span> <span class="keyword">self</span> &other)
<a name="l00446"></a>00446 : <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>(other.<a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>)
<a name="l00447"></a>00447 {
<a name="l00448"></a>00448 }
<a name="l00449"></a>00449
<a name="l00450"></a>00450 <span class="keyword">public</span>:
<a name="l00451"></a>00451 <span class="comment">// *** Public Insertion Functions</span>
<a name="l00452"></a>00452
<a name="l00455"></a><a class="code" href="classstx_1_1btree__multiset.html#365fc6b6e68b3f2673b2f1f717f6457d">00455</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a> <a class="code" href="classstx_1_1btree__multiset.html#365fc6b6e68b3f2673b2f1f717f6457d" title="Attempt to insert a key into the B+ tree.">insert</a>(<span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multiset.html#70ce8aefc4ca681bd1aee899d261f9f2" title="First template parameter: The key type of the btree.">key_type</a>& x)
<a name="l00456"></a>00456 {
<a name="l00457"></a>00457 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#45d95a83fbbfa0211a972b8f7451a19c" title="Attempt to insert a key/data pair into the B+ tree.">insert2</a>(x, <a class="code" href="classstx_1_1btree__multiset.html#f2b19c009eb7141f3a1de96f2a3895ab" title="The empty data_type.">data_type</a>()).first;
<a name="l00458"></a>00458 }
<a name="l00459"></a>00459
<a name="l00462"></a><a class="code" href="classstx_1_1btree__multiset.html#d224340ed3474cca11108157f5b2822d">00462</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a> <a class="code" href="classstx_1_1btree__multiset.html#365fc6b6e68b3f2673b2f1f717f6457d" title="Attempt to insert a key into the B+ tree.">insert</a>(<a class="code" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a> hint, <span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multiset.html#70ce8aefc4ca681bd1aee899d261f9f2" title="First template parameter: The key type of the btree.">key_type</a> &x)
<a name="l00463"></a>00463 {
<a name="l00464"></a>00464 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#45d95a83fbbfa0211a972b8f7451a19c" title="Attempt to insert a key/data pair into the B+ tree.">insert2</a>(hint, x, <a class="code" href="classstx_1_1btree__multiset.html#f2b19c009eb7141f3a1de96f2a3895ab" title="The empty data_type.">data_type</a>());
<a name="l00465"></a>00465 }
<a name="l00466"></a>00466
<a name="l00469"></a>00469 <span class="keyword">template</span> <<span class="keyword">typename</span> InputIterator>
<a name="l00470"></a><a class="code" href="classstx_1_1btree__multiset.html#118296e63772847f4e602b2a215b27cf">00470</a> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classstx_1_1btree__multiset.html#365fc6b6e68b3f2673b2f1f717f6457d" title="Attempt to insert a key into the B+ tree.">insert</a>(InputIterator first, InputIterator last)
<a name="l00471"></a>00471 {
<a name="l00472"></a>00472 InputIterator iter = first;
<a name="l00473"></a>00473 <span class="keywordflow">while</span>(iter != last)
<a name="l00474"></a>00474 {
<a name="l00475"></a>00475 <a class="code" href="classstx_1_1btree__multiset.html#365fc6b6e68b3f2673b2f1f717f6457d" title="Attempt to insert a key into the B+ tree.">insert</a>(*iter);
<a name="l00476"></a>00476 ++iter;
<a name="l00477"></a>00477 }
<a name="l00478"></a>00478 }
<a name="l00479"></a>00479
<a name="l00480"></a>00480 <span class="keyword">public</span>:
<a name="l00481"></a>00481 <span class="comment">// *** Public Erase Functions</span>
<a name="l00482"></a>00482
<a name="l00484"></a><a class="code" href="classstx_1_1btree__multiset.html#538c6521bc38742550555d346bc5eb2c">00484</a> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__multiset.html#538c6521bc38742550555d346bc5eb2c" title="Erases one (the first) entry of the given key.">erase_one</a>(<span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multiset.html#70ce8aefc4ca681bd1aee899d261f9f2" title="First template parameter: The key type of the btree.">key_type</a> &key)
<a name="l00485"></a>00485 {
<a name="l00486"></a>00486 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#c01d4b6b26e5c8447e92651168b006d4" title="Erases one (the first) of the key/data pairs associated with the given key.">erase_one</a>(key);
<a name="l00487"></a>00487 }
<a name="l00488"></a>00488
<a name="l00491"></a><a class="code" href="classstx_1_1btree__multiset.html#d931d1badbe345bd91646b3cc69fd047">00491</a> <a class="code" href="classstx_1_1btree__multiset.html#ac25b0bd4faefca3c6f938fca0d15405" title="Size type used to count keys.">size_type</a> <a class="code" href="classstx_1_1btree__multiset.html#d931d1badbe345bd91646b3cc69fd047" title="Erases all the entries of the given key.">erase</a>(<span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multiset.html#70ce8aefc4ca681bd1aee899d261f9f2" title="First template parameter: The key type of the btree.">key_type</a> &key)
<a name="l00492"></a>00492 {
<a name="l00493"></a>00493 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#97f6c7874f508e5d1498161a0181606e" title="Erases all the key/data pairs associated with the given key.">erase</a>(key);
<a name="l00494"></a>00494 }
<a name="l00495"></a>00495
<a name="l00496"></a>00496 <span class="preprocessor">#ifdef BTREE_TODO</span>
<a name="l00498"></a><a class="code" href="classstx_1_1btree__multiset.html#ad1378c103cf983f1d06cb4a84699b4c">00498</a> <span class="preprocessor"> void erase(iterator iter)</span>
<a name="l00499"></a>00499 <span class="preprocessor"></span> {
<a name="l00500"></a>00500
<a name="l00501"></a>00501 }
<a name="l00502"></a>00502 <span class="preprocessor">#endif</span>
<a name="l00503"></a>00503 <span class="preprocessor"></span>
<a name="l00504"></a>00504 <span class="preprocessor">#ifdef BTREE_TODO</span>
<a name="l00507"></a><a class="code" href="classstx_1_1btree__multiset.html#2f9ea4f4f44eac84e0a8c241c4622505">00507</a> <span class="preprocessor"> void erase(iterator </span><span class="comment">/* first */</span>, iterator <span class="comment">/* last */</span>)
<a name="l00508"></a>00508 {
<a name="l00509"></a>00509 abort();
<a name="l00510"></a>00510 }
<a name="l00511"></a>00511 <span class="preprocessor">#endif</span>
<a name="l00512"></a>00512 <span class="preprocessor"></span>
<a name="l00513"></a>00513 <span class="preprocessor">#ifdef BTREE_DEBUG</span>
<a name="l00514"></a>00514 <span class="preprocessor"></span><span class="keyword">public</span>:
<a name="l00515"></a>00515 <span class="comment">// *** Debug Printing</span>
<a name="l00516"></a>00516
<a name="l00520"></a><a class="code" href="classstx_1_1btree__multiset.html#1e112c945b538228dc40ad8279dbf194">00520</a> <span class="keywordtype">void</span> <a class="code" href="classstx_1_1btree__multiset.html#1e112c945b538228dc40ad8279dbf194" title="Print out the B+ tree structure with keys onto the given ostream.">print</a>(std::ostream &os)<span class="keyword"> const</span>
<a name="l00521"></a>00521 <span class="keyword"> </span>{
<a name="l00522"></a>00522 <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#97664fdfb85917808eee2aa8487c5e39" title="Print out the B+ tree structure with keys onto the given ostream.">print</a>(os);
<a name="l00523"></a>00523 }
<a name="l00524"></a>00524
<a name="l00526"></a><a class="code" href="classstx_1_1btree__multiset.html#b6b65fee900710fdbb28c1ecab4cee42">00526</a> <span class="keywordtype">void</span> <a class="code" href="classstx_1_1btree__multiset.html#b6b65fee900710fdbb28c1ecab4cee42" title="Print out only the leaves via the double linked list.">print_leaves</a>(std::ostream &os)<span class="keyword"> const</span>
<a name="l00527"></a>00527 <span class="keyword"> </span>{
<a name="l00528"></a>00528 <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#8270dcc972930a6f2c9f112af8b65075" title="Print out only the leaves via the double linked list.">print_leaves</a>(os);
<a name="l00529"></a>00529 }
<a name="l00530"></a>00530 <span class="preprocessor">#endif</span>
<a name="l00531"></a>00531 <span class="preprocessor"></span>
<a name="l00532"></a>00532 <span class="keyword">public</span>:
<a name="l00533"></a>00533 <span class="comment">// *** Verification of B+ Tree Invariants</span>
<a name="l00534"></a>00534
<a name="l00537"></a><a class="code" href="classstx_1_1btree__multiset.html#49918ad21fcb9ffa59c643f6e7d383f9">00537</a> <span class="keywordtype">void</span> <a class="code" href="classstx_1_1btree__multiset.html#49918ad21fcb9ffa59c643f6e7d383f9" title="Run a thorough verification of all B+ tree invariants.">verify</a>()<span class="keyword"> const</span>
<a name="l00538"></a>00538 <span class="keyword"> </span>{
<a name="l00539"></a>00539 <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#e382217f25916442745eb83520b20c12" title="Run a thorough verification of all B+ tree invariants.">verify</a>();
<a name="l00540"></a>00540 }
<a name="l00541"></a>00541
<a name="l00542"></a>00542 <span class="keyword">public</span>:
<a name="l00543"></a>00543
<a name="l00548"></a><a class="code" href="classstx_1_1btree__multiset.html#6b8dc190a9956315a8ffb525838983ae">00548</a> <span class="keywordtype">void</span> <a class="code" href="classstx_1_1btree__multiset.html#6b8dc190a9956315a8ffb525838983ae" title="Dump the contents of the B+ tree out onto an ostream as a binary image.">dump</a>(std::ostream &os)<span class="keyword"> const</span>
<a name="l00549"></a>00549 <span class="keyword"> </span>{
<a name="l00550"></a>00550 <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#4d83f35e94a64b82ca3648d40fb31507" title="Dump the contents of the B+ tree out onto an ostream as a binary image.">dump</a>(os);
<a name="l00551"></a>00551 }
<a name="l00552"></a>00552
<a name="l00557"></a><a class="code" href="classstx_1_1btree__multiset.html#28cb6d203e0360193160f7e43e90b8a3">00557</a> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__multiset.html#28cb6d203e0360193160f7e43e90b8a3" title="Restore a binary image of a dumped B+ tree from an istream.">restore</a>(std::istream &is)
<a name="l00558"></a>00558 {
<a name="l00559"></a>00559 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multiset.html#3226b6ab3d82dea6fbf378e0e21031f6" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#f386da3ca44e31b73f68b50630df3ab9" title="Restore a binary image of a dumped B+ tree from an istream.">restore</a>(is);
<a name="l00560"></a>00560 }
<a name="l00561"></a>00561 };
<a name="l00562"></a>00562
<a name="l00563"></a>00563 } <span class="comment">// namespace stx</span>
<a name="l00564"></a>00564
<a name="l00565"></a>00565 <span class="preprocessor">#endif // _STX_BTREE_MULTISET_H_</span>
</pre></div></div>
<hr size="1"><address style="text-align: right;"><small>Generated on Sun Sep 7 17:32:39 2008 for STX B+ Tree Template Classes by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.6 </small></address>
</body>
</html>
