<!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_multimap.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_multimap.h</h1><a href="btree__multimap_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_multimap.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_MULTIMAP_H_</span>
<a name="l00026"></a>00026 <span class="preprocessor"></span><span class="preprocessor">#define _STX_BTREE_MULTIMAP_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="l00046"></a>00046 <span class="keyword">template</span> <<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Data,
<a name="l00047"></a>00047 <span class="keyword">typename</span> _Compare = std::less<_Key>,
<a name="l00048"></a>00048 <span class="keyword">typename</span> _Traits = btree_default_map_traits<_Key, _Data> >
<a name="l00049"></a><a class="code" href="classstx_1_1btree__multimap.html">00049</a> <span class="keyword">class </span><a class="code" href="classstx_1_1btree__multimap.html" title="Specialized B+ tree template class implementing STL&#39;s multimap container.">btree_multimap</a>
<a name="l00050"></a>00050 {
<a name="l00051"></a>00051 <span class="keyword">public</span>:
<a name="l00052"></a>00052 <span class="comment">// *** Template Parameter Types</span>
<a name="l00053"></a>00053
<a name="l00056"></a><a class="code" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">00056</a> <span class="keyword">typedef</span> _Key <a class="code" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17" title="First template parameter: The key type of the btree.">key_type</a>;
<a name="l00057"></a>00057
<a name="l00060"></a><a class="code" href="classstx_1_1btree__multimap.html#5670a7625a2d6ab91b5c16de28b5af38">00060</a> <span class="keyword">typedef</span> _Data <a class="code" href="classstx_1_1btree__multimap.html#5670a7625a2d6ab91b5c16de28b5af38" title="Second template parameter: The data type associated with each key.">data_type</a>;
<a name="l00061"></a>00061
<a name="l00063"></a><a class="code" href="classstx_1_1btree__multimap.html#1ed6f1cb42f6df972cfc822678c3db39">00063</a> <span class="keyword">typedef</span> _Compare <a class="code" href="classstx_1_1btree__multimap.html#1ed6f1cb42f6df972cfc822678c3db39" title="Third 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__multimap.html#2171edbe912d2a5d75344780a8f9b14a">00067</a> <span class="keyword">typedef</span> _Traits <a class="code" href="classstx_1_1btree__multimap.html#2171edbe912d2a5d75344780a8f9b14a" title="Fourth 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">public</span>:
<a name="l00075"></a>00075 <span class="comment">// *** Constructed Types</span>
<a name="l00076"></a>00076
<a name="l00078"></a><a class="code" href="classstx_1_1btree__multimap.html#b7c3372073e85028f623964b24473183">00078</a> <span class="keyword">typedef</span> <a class="code" href="classstx_1_1btree__multimap.html" title="Specialized B+ tree template class implementing STL&#39;s multimap container.">btree_multimap<key_type, data_type, key_compare, traits></a> <span class="keyword">self</span>;
<a name="l00079"></a>00079
<a name="l00082"></a><a class="code" href="classstx_1_1btree__multimap.html#713f2c9cb9aa2dd6d139118f34d5528d">00082</a> <span class="keyword">typedef</span> std::pair<key_type, data_type> <a class="code" href="classstx_1_1btree__multimap.html#713f2c9cb9aa2dd6d139118f34d5528d" title="Construct the STL-required value_type as a composition pair of key and data types...">value_type</a>;
<a name="l00083"></a>00083
<a name="l00085"></a><a class="code" href="classstx_1_1btree__multimap.html#abb706739b81157697fef40056c4c6d8">00085</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="l00086"></a>00086
<a name="l00088"></a><a class="code" href="classstx_1_1btree__multimap.html#d6890cbbe302b9b3f8feee67bdee4d6f">00088</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="l00089"></a>00089
<a name="l00091"></a><a class="code" href="classstx_1_1btree__multimap.html#357de6af8bb93e1d17c4964d593fadf3">00091</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__multimap.html#357de6af8bb93e1d17c4964d593fadf3" title="Size type used to count keys.">size_type</a>;
<a name="l00092"></a>00092
<a name="l00094"></a><a class="code" href="classstx_1_1btree__multimap.html#86799a8aa7f54ba6d156aa749f18cb27">00094</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="l00095"></a>00095
<a name="l00096"></a>00096 <span class="keyword">public</span>:
<a name="l00097"></a>00097 <span class="comment">// *** Static Constant Options and Values of the B+ Tree</span>
<a name="l00098"></a>00098
<a name="l00100"></a><a class="code" href="classstx_1_1btree__multimap.html#3982e943e752ec6de4046c466d2ad7b7">00100</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__multimap.html#3982e943e752ec6de4046c466d2ad7b7" 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="l00101"></a>00101
<a name="l00104"></a><a class="code" href="classstx_1_1btree__multimap.html#80d9ff893243947f019f27172de0bedc">00104</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__multimap.html#80d9ff893243947f019f27172de0bedc" 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="l00105"></a>00105
<a name="l00109"></a><a class="code" href="classstx_1_1btree__multimap.html#85aa5335bbd6797e91ace4da0f65c256">00109</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__multimap.html#85aa5335bbd6797e91ace4da0f65c256" title="Computed B+ tree parameter: The minimum number of key/data 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="l00110"></a>00110
<a name="l00114"></a><a class="code" href="classstx_1_1btree__multimap.html#8dcf58359cf1d8c5a1704bcb244fd486">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__multimap.html#8dcf58359cf1d8c5a1704bcb244fd486" 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="l00115"></a>00115
<a name="l00118"></a><a class="code" href="classstx_1_1btree__multimap.html#3fe2765d6c487fe321c2bdfe242abba6">00118</a> <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__multimap.html#3fe2765d6c487fe321c2bdfe242abba6" 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="l00119"></a>00119
<a name="l00123"></a><a class="code" href="classstx_1_1btree__multimap.html#4e64657f25be2fbf1fc3e08b58e0c802">00123</a> <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__multimap.html#4e64657f25be2fbf1fc3e08b58e0c802" 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="l00124"></a>00124
<a name="l00126"></a><a class="code" href="classstx_1_1btree__multimap.html#0e1e483bc720416c3e8d3edeb683e361">00126</a> <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__multimap.html#0e1e483bc720416c3e8d3edeb683e361" 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="l00127"></a>00127
<a name="l00128"></a>00128 <span class="keyword">public</span>:
<a name="l00129"></a>00129 <span class="comment">// *** Iterators and Reverse Iterators</span>
<a name="l00130"></a>00130
<a name="l00133"></a><a class="code" href="classstx_1_1btree__multimap.html#86673aa76d61a01c408eed51f2895b98">00133</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="l00134"></a>00134
<a name="l00137"></a><a class="code" href="classstx_1_1btree__multimap.html#12bfb41ca874bb5a4a851e4a094525cf">00137</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="l00138"></a>00138
<a name="l00140"></a><a class="code" href="classstx_1_1btree__multimap.html#307913dd10bd05b88055b300983eb032">00140</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="l00141"></a>00141
<a name="l00143"></a><a class="code" href="classstx_1_1btree__multimap.html#309cfcb261ab68de6f3292d7faee5062">00143</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="l00144"></a>00144
<a name="l00145"></a>00145 <span class="keyword">private</span>:
<a name="l00146"></a>00146 <span class="comment">// *** Tree Implementation Object</span>
<a name="l00147"></a>00147
<a name="l00149"></a><a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336">00149</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__multimap.html#44a03a8797e1fee6560ba19600c37336" title="The contained implementation object.">tree</a>;
<a name="l00150"></a>00150
<a name="l00151"></a>00151 <span class="keyword">public</span>:
<a name="l00152"></a>00152 <span class="comment">// *** Constructors and Destructor</span>
<a name="l00153"></a>00153
<a name="l00156"></a><a class="code" href="classstx_1_1btree__multimap.html#de0e7d413605528815a852ef4235f5a6">00156</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__multimap.html#de0e7d413605528815a852ef4235f5a6" title="Default constructor initializing an empty B+ tree with the standard key comparison...">btree_multimap</a>()
<a name="l00157"></a>00157 : <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" title="The contained implementation object.">tree</a>()
<a name="l00158"></a>00158 {
<a name="l00159"></a>00159 }
<a name="l00160"></a>00160
<a name="l00163"></a><a class="code" href="classstx_1_1btree__multimap.html#4c71fb624324770f8df4827979e92582">00163</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__multimap.html#de0e7d413605528815a852ef4235f5a6" title="Default constructor initializing an empty B+ tree with the standard key comparison...">btree_multimap</a>(<span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multimap.html#1ed6f1cb42f6df972cfc822678c3db39" title="Third template parameter: Key comparison function object.">key_compare</a> &kcf)
<a name="l00164"></a>00164 : <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" title="The contained implementation object.">tree</a>(kcf)
<a name="l00165"></a>00165 {
<a name="l00166"></a>00166 }
<a name="l00167"></a>00167
<a name="l00169"></a>00169 <span class="keyword">template</span> <<span class="keyword">class</span> InputIterator>
<a name="l00170"></a><a class="code" href="classstx_1_1btree__multimap.html#dc612c0aa92ffbd052237a8e500839dc">00170</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__multimap.html#de0e7d413605528815a852ef4235f5a6" title="Default constructor initializing an empty B+ tree with the standard key comparison...">btree_multimap</a>(InputIterator first, InputIterator last)
<a name="l00171"></a>00171 : <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" title="The contained implementation object.">tree</a>(first, last)
<a name="l00172"></a>00172 {
<a name="l00173"></a>00173 }
<a name="l00174"></a>00174
<a name="l00177"></a>00177 <span class="keyword">template</span> <<span class="keyword">class</span> InputIterator>
<a name="l00178"></a><a class="code" href="classstx_1_1btree__multimap.html#b4d3c68239214f0c83738aa2b45ea4bf">00178</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__multimap.html#de0e7d413605528815a852ef4235f5a6" title="Default constructor initializing an empty B+ tree with the standard key comparison...">btree_multimap</a>(InputIterator first, InputIterator last, <span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multimap.html#1ed6f1cb42f6df972cfc822678c3db39" title="Third template parameter: Key comparison function object.">key_compare</a> &kcf)
<a name="l00179"></a>00179 : <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" title="The contained implementation object.">tree</a>(first, last, kcf)
<a name="l00180"></a>00180 {
<a name="l00181"></a>00181 }
<a name="l00182"></a>00182
<a name="l00184"></a><a class="code" href="classstx_1_1btree__multimap.html#38bf0d5a5c312b27fde719d447020365">00184</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__multimap.html#38bf0d5a5c312b27fde719d447020365" title="Frees up all used B+ tree memory pages.">~btree_multimap</a>()
<a name="l00185"></a>00185 {
<a name="l00186"></a>00186 }
<a name="l00187"></a>00187
<a name="l00189"></a><a class="code" href="classstx_1_1btree__multimap.html#5cb0337f0ee86b27d02a72bbae9de644">00189</a> <span class="keywordtype">void</span> <a class="code" href="classstx_1_1btree__multimap.html#5cb0337f0ee86b27d02a72bbae9de644" title="Fast swapping of two identical B+ tree objects.">swap</a>(<span class="keyword">self</span>& from)
<a name="l00190"></a>00190 {
<a name="l00191"></a>00191 std::swap(<a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" title="The contained implementation object.">tree</a>, from.tree);
<a name="l00192"></a>00192 }
<a name="l00193"></a>00193
<a name="l00194"></a>00194 <span class="keyword">public</span>:
<a name="l00195"></a>00195 <span class="comment">// *** Key and Value Comparison Function Objects</span>
<a name="l00196"></a>00196
<a name="l00198"></a><a class="code" href="classstx_1_1btree__multimap.html#64c2fa75a15eba90621e42a86989c415">00198</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__multimap.html#1ed6f1cb42f6df972cfc822678c3db39" title="Third template parameter: Key comparison function object.">key_compare</a> <a class="code" href="classstx_1_1btree__multimap.html#64c2fa75a15eba90621e42a86989c415" title="Constant access to the key comparison object sorting the B+ tree.">key_comp</a>()<span class="keyword"> const</span>
<a name="l00199"></a>00199 <span class="keyword"> </span>{
<a name="l00200"></a>00200 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00201"></a>00201 }
<a name="l00202"></a>00202
<a name="l00205"></a><a class="code" href="classstx_1_1btree__multimap.html#b8b33ba0183a2e71d32278ff669a317f">00205</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__multimap.html#b8b33ba0183a2e71d32278ff669a317f" title="Constant access to a constructed value_type comparison object.">value_comp</a>()<span class="keyword"> const</span>
<a name="l00206"></a>00206 <span class="keyword"> </span>{
<a name="l00207"></a>00207 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00208"></a>00208 }
<a name="l00209"></a>00209
<a name="l00210"></a>00210 <span class="keyword">public</span>:
<a name="l00211"></a>00211 <span class="comment">// *** Fast Destruction of the B+ Tree</span>
<a name="l00212"></a>00212
<a name="l00214"></a><a class="code" href="classstx_1_1btree__multimap.html#c3b0ecbcf50799298c6c5d5cdb73aa93">00214</a> <span class="keywordtype">void</span> <a class="code" href="classstx_1_1btree__multimap.html#c3b0ecbcf50799298c6c5d5cdb73aa93" title="Frees all key/data pairs and all nodes of the tree.">clear</a>()
<a name="l00215"></a>00215 {
<a name="l00216"></a>00216 <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00217"></a>00217 }
<a name="l00218"></a>00218
<a name="l00219"></a>00219 <span class="keyword">public</span>:
<a name="l00220"></a>00220 <span class="comment">// *** STL Iterator Construction Functions</span>
<a name="l00221"></a>00221
<a name="l00224"></a><a class="code" href="classstx_1_1btree__multimap.html#f6933cb429397867499bcd349896d565">00224</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__multimap.html#f6933cb429397867499bcd349896d565" title="Constructs a read/data-write iterator that points to the first slot in the first...">begin</a>()
<a name="l00225"></a>00225 {
<a name="l00226"></a>00226 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00227"></a>00227 }
<a name="l00228"></a>00228
<a name="l00231"></a><a class="code" href="classstx_1_1btree__multimap.html#4f5377b914193e004f2df3e8ed19548e">00231</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__multimap.html#4f5377b914193e004f2df3e8ed19548e" title="Constructs a read/data-write iterator that points to the first invalid slot in the...">end</a>()
<a name="l00232"></a>00232 {
<a name="l00233"></a>00233 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00234"></a>00234 }
<a name="l00235"></a>00235
<a name="l00238"></a><a class="code" href="classstx_1_1btree__multimap.html#16cf4c6889cba5166d5212370f9c1596">00238</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__multimap.html#f6933cb429397867499bcd349896d565" 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="l00239"></a>00239 <span class="keyword"> </span>{
<a name="l00240"></a>00240 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00241"></a>00241 }
<a name="l00242"></a>00242
<a name="l00245"></a><a class="code" href="classstx_1_1btree__multimap.html#e42db1ac48770afefb2e9f3b08b75a59">00245</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__multimap.html#4f5377b914193e004f2df3e8ed19548e" 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="l00246"></a>00246 <span class="keyword"> </span>{
<a name="l00247"></a>00247 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00248"></a>00248 }
<a name="l00249"></a>00249
<a name="l00252"></a><a class="code" href="classstx_1_1btree__multimap.html#f9ad7a69fa816e15b9aaefe31046513c">00252</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__multimap.html#f9ad7a69fa816e15b9aaefe31046513c" title="Constructs a read/data-write reverse iterator that points to the first invalid slot...">rbegin</a>()
<a name="l00253"></a>00253 {
<a name="l00254"></a>00254 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00255"></a>00255 }
<a name="l00256"></a>00256
<a name="l00259"></a><a class="code" href="classstx_1_1btree__multimap.html#906eefcb41829b71b9ee3114583ddee8">00259</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__multimap.html#906eefcb41829b71b9ee3114583ddee8" title="Constructs a read/data-write reverse iterator that points to the first slot in the...">rend</a>()
<a name="l00260"></a>00260 {
<a name="l00261"></a>00261 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00262"></a>00262 }
<a name="l00263"></a>00263
<a name="l00266"></a><a class="code" href="classstx_1_1btree__multimap.html#9ab9f5b34e2c284e880b3511c00a6740">00266</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__multimap.html#f9ad7a69fa816e15b9aaefe31046513c" title="Constructs a read/data-write reverse iterator that points to the first invalid slot...">rbegin</a>()<span class="keyword"> const</span>
<a name="l00267"></a>00267 <span class="keyword"> </span>{
<a name="l00268"></a>00268 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00269"></a>00269 }
<a name="l00270"></a>00270
<a name="l00273"></a><a class="code" href="classstx_1_1btree__multimap.html#5ccfcbe81650e9a7f2c1a306e555fd6e">00273</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__multimap.html#906eefcb41829b71b9ee3114583ddee8" 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="l00274"></a>00274 <span class="keyword"> </span>{
<a name="l00275"></a>00275 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00276"></a>00276 }
<a name="l00277"></a>00277
<a name="l00278"></a>00278 <span class="keyword">public</span>:
<a name="l00279"></a>00279 <span class="comment">// *** Access Functions to the Item Count</span>
<a name="l00280"></a>00280
<a name="l00282"></a><a class="code" href="classstx_1_1btree__multimap.html#22e55714cbad60996975e15714aff711">00282</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__multimap.html#357de6af8bb93e1d17c4964d593fadf3" title="Size type used to count keys.">size_type</a> <a class="code" href="classstx_1_1btree__multimap.html#22e55714cbad60996975e15714aff711" title="Return the number of key/data pairs in the B+ tree.">size</a>()<span class="keyword"> const</span>
<a name="l00283"></a>00283 <span class="keyword"> </span>{
<a name="l00284"></a>00284 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00285"></a>00285 }
<a name="l00286"></a>00286
<a name="l00288"></a><a class="code" href="classstx_1_1btree__multimap.html#03e88b6cd0d1c00d26729938d496d5ce">00288</a> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__multimap.html#03e88b6cd0d1c00d26729938d496d5ce" title="Returns true if there is at least one key/data pair in the B+ tree.">empty</a>()<span class="keyword"> const</span>
<a name="l00289"></a>00289 <span class="keyword"> </span>{
<a name="l00290"></a>00290 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00291"></a>00291 }
<a name="l00292"></a>00292
<a name="l00295"></a><a class="code" href="classstx_1_1btree__multimap.html#617b607b97fb9dee9c1e38b9b23c2d67">00295</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__multimap.html#357de6af8bb93e1d17c4964d593fadf3" title="Size type used to count keys.">size_type</a> <a class="code" href="classstx_1_1btree__multimap.html#617b607b97fb9dee9c1e38b9b23c2d67" title="Returns the largest possible size of the B+ Tree.">max_size</a>()<span class="keyword"> const</span>
<a name="l00296"></a>00296 <span class="keyword"> </span>{
<a name="l00297"></a>00297 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00298"></a>00298 }
<a name="l00299"></a>00299
<a name="l00301"></a><a class="code" href="classstx_1_1btree__multimap.html#7a9ce64eb5f04ebd6aa0310dd85b780e">00301</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__multimap.html#7a9ce64eb5f04ebd6aa0310dd85b780e" title="Return a const reference to the current statistics.">get_stats</a>()<span class="keyword"> const</span>
<a name="l00302"></a>00302 <span class="keyword"> </span>{
<a name="l00303"></a>00303 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00304"></a>00304 }
<a name="l00305"></a>00305
<a name="l00306"></a>00306 <span class="keyword">public</span>:
<a name="l00307"></a>00307 <span class="comment">// *** Standard Access Functions Querying the Tree by Descending to a Leaf</span>
<a name="l00308"></a>00308
<a name="l00311"></a><a class="code" href="classstx_1_1btree__multimap.html#aadc23a68e8fd1e0aa8dcff55485e747">00311</a> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__multimap.html#aadc23a68e8fd1e0aa8dcff55485e747" 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__multimap.html#3f9770bfb59a9d96ef15b4155917df17" title="First template parameter: The key type of the btree.">key_type</a> &key)<span class="keyword"> const</span>
<a name="l00312"></a>00312 <span class="keyword"> </span>{
<a name="l00313"></a>00313 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00314"></a>00314 }
<a name="l00315"></a>00315
<a name="l00318"></a><a class="code" href="classstx_1_1btree__multimap.html#bbf5e8d61645d62fff7137bedccb5e55">00318</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__multimap.html#bbf5e8d61645d62fff7137bedccb5e55" title="Tries to locate a key in the B+ tree and returns an iterator to the key/data slot...">find</a>(<span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17" title="First template parameter: The key type of the btree.">key_type</a> &key)
<a name="l00319"></a>00319 {
<a name="l00320"></a>00320 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00321"></a>00321 }
<a name="l00322"></a>00322
<a name="l00325"></a><a class="code" href="classstx_1_1btree__multimap.html#1391b5839733b6dd4e06c25d76c03cc2">00325</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__multimap.html#bbf5e8d61645d62fff7137bedccb5e55" title="Tries to locate a key in the B+ tree and returns an iterator to the key/data slot...">find</a>(<span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17" title="First template parameter: The key type of the btree.">key_type</a> &key)<span class="keyword"> const</span>
<a name="l00326"></a>00326 <span class="keyword"> </span>{
<a name="l00327"></a>00327 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00328"></a>00328 }
<a name="l00329"></a>00329
<a name="l00332"></a><a class="code" href="classstx_1_1btree__multimap.html#caaee3ddcf27e58998ec181afe43ee4d">00332</a> <a class="code" href="classstx_1_1btree__multimap.html#357de6af8bb93e1d17c4964d593fadf3" title="Size type used to count keys.">size_type</a> <a class="code" href="classstx_1_1btree__multimap.html#caaee3ddcf27e58998ec181afe43ee4d" 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__multimap.html#3f9770bfb59a9d96ef15b4155917df17" title="First template parameter: The key type of the btree.">key_type</a> &key)<span class="keyword"> const</span>
<a name="l00333"></a>00333 <span class="keyword"> </span>{
<a name="l00334"></a>00334 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00335"></a>00335 }
<a name="l00336"></a>00336
<a name="l00339"></a><a class="code" href="classstx_1_1btree__multimap.html#2eae97b3022645b3b7e963a30b72e3a2">00339</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__multimap.html#2eae97b3022645b3b7e963a30b72e3a2" 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__multimap.html#3f9770bfb59a9d96ef15b4155917df17" title="First template parameter: The key type of the btree.">key_type</a>& key)
<a name="l00340"></a>00340 {
<a name="l00341"></a>00341 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00342"></a>00342 }
<a name="l00343"></a>00343
<a name="l00346"></a><a class="code" href="classstx_1_1btree__multimap.html#f54859746ea56ec65c06eea0ec8d5392">00346</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__multimap.html#2eae97b3022645b3b7e963a30b72e3a2" 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__multimap.html#3f9770bfb59a9d96ef15b4155917df17" title="First template parameter: The key type of the btree.">key_type</a>& key)<span class="keyword"> const</span>
<a name="l00347"></a>00347 <span class="keyword"> </span>{
<a name="l00348"></a>00348 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00349"></a>00349 }
<a name="l00350"></a>00350
<a name="l00353"></a><a class="code" href="classstx_1_1btree__multimap.html#6fba83fee886d32cf654be485b95ace8">00353</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__multimap.html#6fba83fee886d32cf654be485b95ace8" 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__multimap.html#3f9770bfb59a9d96ef15b4155917df17" title="First template parameter: The key type of the btree.">key_type</a>& key)
<a name="l00354"></a>00354 {
<a name="l00355"></a>00355 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00356"></a>00356 }
<a name="l00357"></a>00357
<a name="l00360"></a><a class="code" href="classstx_1_1btree__multimap.html#73af10f9f04c2608909ef1df28a1813b">00360</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__multimap.html#6fba83fee886d32cf654be485b95ace8" 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__multimap.html#3f9770bfb59a9d96ef15b4155917df17" title="First template parameter: The key type of the btree.">key_type</a>& key)<span class="keyword"> const</span>
<a name="l00361"></a>00361 <span class="keyword"> </span>{
<a name="l00362"></a>00362 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00363"></a>00363 }
<a name="l00364"></a>00364
<a name="l00366"></a><a class="code" href="classstx_1_1btree__multimap.html#05f7c107afe6e204572a43a9d7629657">00366</a> <span class="keyword">inline</span> std::pair<iterator, iterator> <a class="code" href="classstx_1_1btree__multimap.html#05f7c107afe6e204572a43a9d7629657" 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__multimap.html#3f9770bfb59a9d96ef15b4155917df17" title="First template parameter: The key type of the btree.">key_type</a>& key)
<a name="l00367"></a>00367 {
<a name="l00368"></a>00368 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00369"></a>00369 }
<a name="l00370"></a>00370
<a name="l00372"></a><a class="code" href="classstx_1_1btree__multimap.html#23e3f501cf7dca06bdd763a76b9e3071">00372</a> <span class="keyword">inline</span> std::pair<const_iterator, const_iterator> <a class="code" href="classstx_1_1btree__multimap.html#05f7c107afe6e204572a43a9d7629657" 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__multimap.html#3f9770bfb59a9d96ef15b4155917df17" 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__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00375"></a>00375 }
<a name="l00376"></a>00376
<a name="l00377"></a>00377 <span class="keyword">public</span>:
<a name="l00378"></a>00378 <span class="comment">// *** B+ Tree Object Comparison Functions</span>
<a name="l00379"></a>00379
<a name="l00383"></a><a class="code" href="classstx_1_1btree__multimap.html#93a221e69a8969141871d1c7de20cf12">00383</a> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__multimap.html#93a221e69a8969141871d1c7de20cf12" 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="l00384"></a>00384 <span class="keyword"> </span>{
<a name="l00385"></a>00385 <span class="keywordflow">return</span> (<a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" title="The contained implementation object.">tree</a> == other.tree);
<a name="l00386"></a>00386 }
<a name="l00387"></a>00387
<a name="l00389"></a><a class="code" href="classstx_1_1btree__multimap.html#92edd01ba26727fecbe5128cf798c049">00389</a> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__multimap.html#92edd01ba26727fecbe5128cf798c049" 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="l00390"></a>00390 <span class="keyword"> </span>{
<a name="l00391"></a>00391 <span class="keywordflow">return</span> (<a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" title="The contained implementation object.">tree</a> != other.tree);
<a name="l00392"></a>00392 }
<a name="l00393"></a>00393
<a name="l00396"></a><a class="code" href="classstx_1_1btree__multimap.html#2e8708a140fefa623dec2e39dc7251de">00396</a> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__multimap.html#2e8708a140fefa623dec2e39dc7251de" 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="l00397"></a>00397 <span class="keyword"> </span>{
<a name="l00398"></a>00398 <span class="keywordflow">return</span> (<a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" title="The contained implementation object.">tree</a> < other.tree);
<a name="l00399"></a>00399 }
<a name="l00400"></a>00400
<a name="l00402"></a><a class="code" href="classstx_1_1btree__multimap.html#e6ecd7ce94f108a353ef902c9d54d92f">00402</a> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__multimap.html#e6ecd7ce94f108a353ef902c9d54d92f" 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="l00403"></a>00403 <span class="keyword"> </span>{
<a name="l00404"></a>00404 <span class="keywordflow">return</span> (<a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" title="The contained implementation object.">tree</a> > other.tree);
<a name="l00405"></a>00405 }
<a name="l00406"></a>00406
<a name="l00408"></a><a class="code" href="classstx_1_1btree__multimap.html#7c50b60fd464410ef8c268bee34f9720">00408</a> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__multimap.html#7c50b60fd464410ef8c268bee34f9720" 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="l00409"></a>00409 <span class="keyword"> </span>{
<a name="l00410"></a>00410 <span class="keywordflow">return</span> (<a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" title="The contained implementation object.">tree</a> <= other.tree);
<a name="l00411"></a>00411 }
<a name="l00412"></a>00412
<a name="l00414"></a><a class="code" href="classstx_1_1btree__multimap.html#022ccd2bcfc9af5a8b6f27db5fa25e9e">00414</a> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__multimap.html#022ccd2bcfc9af5a8b6f27db5fa25e9e" 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="l00415"></a>00415 <span class="keyword"> </span>{
<a name="l00416"></a>00416 <span class="keywordflow">return</span> (<a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" title="The contained implementation object.">tree</a> >= other.tree);
<a name="l00417"></a>00417 }
<a name="l00418"></a>00418
<a name="l00419"></a>00419 <span class="keyword">public</span>:
<a name="l00421"></a>00421
<a name="l00423"></a><a class="code" href="classstx_1_1btree__multimap.html#08c0ca122dcbb89c61c7422d678b816b">00423</a> <span class="keyword">inline</span> <span class="keyword">self</span>& <a class="code" href="classstx_1_1btree__multimap.html#08c0ca122dcbb89c61c7422d678b816b" title="*** Fast Copy: Assign Operator and Copy Constructors">operator= </a>(<span class="keyword">const</span> <span class="keyword">self</span> &other)
<a name="l00424"></a>00424 {
<a name="l00425"></a>00425 <span class="keywordflow">if</span> (<span class="keyword">this</span> != &other)
<a name="l00426"></a>00426 {
<a name="l00427"></a>00427 <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" title="The contained implementation object.">tree</a> = other.tree;
<a name="l00428"></a>00428 }
<a name="l00429"></a>00429 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00430"></a>00430 }
<a name="l00431"></a>00431
<a name="l00434"></a><a class="code" href="classstx_1_1btree__multimap.html#835ec6395b6330f02210057adda1af36">00434</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__multimap.html#de0e7d413605528815a852ef4235f5a6" title="Default constructor initializing an empty B+ tree with the standard key comparison...">btree_multimap</a>(<span class="keyword">const</span> <span class="keyword">self</span> &other)
<a name="l00435"></a>00435 : <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" title="The contained implementation object.">tree</a>(other.<a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" title="The contained implementation object.">tree</a>)
<a name="l00436"></a>00436 {
<a name="l00437"></a>00437 }
<a name="l00438"></a>00438
<a name="l00439"></a>00439 <span class="keyword">public</span>:
<a name="l00440"></a>00440 <span class="comment">// *** Public Insertion Functions</span>
<a name="l00441"></a>00441
<a name="l00444"></a><a class="code" href="classstx_1_1btree__multimap.html#9702f35a744aef532a2211ea3d58ab4b">00444</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__multimap.html#9702f35a744aef532a2211ea3d58ab4b" title="Attempt to insert a key/data pair into the B+ tree.">insert</a>(<span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multimap.html#713f2c9cb9aa2dd6d139118f34d5528d" title="Construct the STL-required value_type as a composition pair of key and data types...">value_type</a>& x)
<a name="l00445"></a>00445 {
<a name="l00446"></a>00446 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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.first, x.second).first;
<a name="l00447"></a>00447 }
<a name="l00448"></a>00448
<a name="l00452"></a><a class="code" href="classstx_1_1btree__multimap.html#26187a33e283076bde1b80adecbd3bcb">00452</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__multimap.html#9702f35a744aef532a2211ea3d58ab4b" title="Attempt to insert a key/data pair into the B+ tree.">insert</a>(<span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17" title="First template parameter: The key type of the btree.">key_type</a>& key, <span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multimap.html#5670a7625a2d6ab91b5c16de28b5af38" title="Second template parameter: The data type associated with each key.">data_type</a>& data)
<a name="l00453"></a>00453 {
<a name="l00454"></a>00454 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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>(key, data).first;
<a name="l00455"></a>00455 }
<a name="l00456"></a>00456
<a name="l00461"></a><a class="code" href="classstx_1_1btree__multimap.html#fb966a7cf5219322577c6175adb32ad0">00461</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__multimap.html#fb966a7cf5219322577c6175adb32ad0" title="Attempt to insert a key/data pair into the B+ tree.">insert2</a>(<span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17" title="First template parameter: The key type of the btree.">key_type</a>& key, <span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multimap.html#5670a7625a2d6ab91b5c16de28b5af38" title="Second template parameter: The data type associated with each key.">data_type</a>& data)
<a name="l00462"></a>00462 {
<a name="l00463"></a>00463 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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>(key, data).first;
<a name="l00464"></a>00464 }
<a name="l00465"></a>00465
<a name="l00468"></a><a class="code" href="classstx_1_1btree__multimap.html#1344221bd23d34d77f6b93595858b49d">00468</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__multimap.html#9702f35a744aef532a2211ea3d58ab4b" title="Attempt to insert a key/data pair 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__multimap.html#713f2c9cb9aa2dd6d139118f34d5528d" title="Construct the STL-required value_type as a composition pair of key and data types...">value_type</a> &x)
<a name="l00469"></a>00469 {
<a name="l00470"></a>00470 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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.first, x.second);
<a name="l00471"></a>00471 }
<a name="l00472"></a>00472
<a name="l00475"></a><a class="code" href="classstx_1_1btree__multimap.html#da70224bef62e5022cbed2fe569b5a92">00475</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__multimap.html#fb966a7cf5219322577c6175adb32ad0" title="Attempt to insert a key/data pair into the B+ tree.">insert2</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__multimap.html#3f9770bfb59a9d96ef15b4155917df17" title="First template parameter: The key type of the btree.">key_type</a>& key, <span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multimap.html#5670a7625a2d6ab91b5c16de28b5af38" title="Second template parameter: The data type associated with each key.">data_type</a>& data)
<a name="l00476"></a>00476 {
<a name="l00477"></a>00477 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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, key, data);
<a name="l00478"></a>00478 }
<a name="l00479"></a>00479
<a name="l00482"></a>00482 <span class="keyword">template</span> <<span class="keyword">typename</span> InputIterator>
<a name="l00483"></a><a class="code" href="classstx_1_1btree__multimap.html#bfc9e342c17d427f6cc426ad2264173d">00483</a> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classstx_1_1btree__multimap.html#9702f35a744aef532a2211ea3d58ab4b" title="Attempt to insert a key/data pair into the B+ tree.">insert</a>(InputIterator first, InputIterator last)
<a name="l00484"></a>00484 {
<a name="l00485"></a>00485 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" title="The contained implementation object.">tree</a>.<a class="code" href="classstx_1_1btree.html#6a96ea1453ad3392ad4722265ceae976" title="Attempt to insert a key/data pair into the B+ tree.">insert</a>(first, last);
<a name="l00486"></a>00486 }
<a name="l00487"></a>00487
<a name="l00488"></a>00488 <span class="keyword">public</span>:
<a name="l00489"></a>00489 <span class="comment">// *** Public Erase Functions</span>
<a name="l00490"></a>00490
<a name="l00493"></a><a class="code" href="classstx_1_1btree__multimap.html#557bdf2f67b70d222c4042bb70015987">00493</a> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__multimap.html#557bdf2f67b70d222c4042bb70015987" title="Erases one (the first) of the key/data pairs associated with the given key.">erase_one</a>(<span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17" title="First template parameter: The key type of the btree.">key_type</a> &key)
<a name="l00494"></a>00494 {
<a name="l00495"></a>00495 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00496"></a>00496 }
<a name="l00497"></a>00497
<a name="l00500"></a><a class="code" href="classstx_1_1btree__multimap.html#dfed0b8c0ba1dff6ed2ab1ca2cfae94a">00500</a> <a class="code" href="classstx_1_1btree__multimap.html#357de6af8bb93e1d17c4964d593fadf3" title="Size type used to count keys.">size_type</a> <a class="code" href="classstx_1_1btree__multimap.html#dfed0b8c0ba1dff6ed2ab1ca2cfae94a" title="Erases all the key/data pairs associated with the given key.">erase</a>(<span class="keyword">const</span> <a class="code" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17" title="First template parameter: The key type of the btree.">key_type</a> &key)
<a name="l00501"></a>00501 {
<a name="l00502"></a>00502 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00503"></a>00503 }
<a name="l00504"></a>00504
<a name="l00505"></a>00505 <span class="preprocessor">#ifdef BTREE_TODO</span>
<a name="l00507"></a><a class="code" href="classstx_1_1btree__multimap.html#cc52e7baa53b29cbc6f7c5043cb3d560">00507</a> <span class="preprocessor"> void erase(iterator iter)</span>
<a name="l00508"></a>00508 <span class="preprocessor"></span> {
<a name="l00509"></a>00509
<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_TODO</span>
<a name="l00516"></a><a class="code" href="classstx_1_1btree__multimap.html#53cc9810fbf2b9fc5c44fd186867c051">00516</a> <span class="preprocessor"> void erase(iterator </span><span class="comment">/* first */</span>, iterator <span class="comment">/* last */</span>)
<a name="l00517"></a>00517 {
<a name="l00518"></a>00518 abort();
<a name="l00519"></a>00519 }
<a name="l00520"></a>00520 <span class="preprocessor">#endif</span>
<a name="l00521"></a>00521 <span class="preprocessor"></span>
<a name="l00522"></a>00522 <span class="preprocessor">#ifdef BTREE_DEBUG</span>
<a name="l00523"></a>00523 <span class="preprocessor"></span><span class="keyword">public</span>:
<a name="l00524"></a>00524 <span class="comment">// *** Debug Printing</span>
<a name="l00525"></a>00525
<a name="l00529"></a><a class="code" href="classstx_1_1btree__multimap.html#b27a4f7547a8bc0ad3d6a850e22cfbf9">00529</a> <span class="keywordtype">void</span> <a class="code" href="classstx_1_1btree__multimap.html#b27a4f7547a8bc0ad3d6a850e22cfbf9" 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="l00530"></a>00530 <span class="keyword"> </span>{
<a name="l00531"></a>00531 <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00532"></a>00532 }
<a name="l00533"></a>00533
<a name="l00535"></a><a class="code" href="classstx_1_1btree__multimap.html#cf6d5e78c9e4a13ae2d3fe5c8f5d1dfd">00535</a> <span class="keywordtype">void</span> <a class="code" href="classstx_1_1btree__multimap.html#cf6d5e78c9e4a13ae2d3fe5c8f5d1dfd" title="Print out only the leaves via the double linked list.">print_leaves</a>(std::ostream &os)<span class="keyword"> const</span>
<a name="l00536"></a>00536 <span class="keyword"> </span>{
<a name="l00537"></a>00537 <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00538"></a>00538 }
<a name="l00539"></a>00539 <span class="preprocessor">#endif</span>
<a name="l00540"></a>00540 <span class="preprocessor"></span>
<a name="l00541"></a>00541 <span class="keyword">public</span>:
<a name="l00542"></a>00542 <span class="comment">// *** Verification of B+ Tree Invariants</span>
<a name="l00543"></a>00543
<a name="l00546"></a><a class="code" href="classstx_1_1btree__multimap.html#1b2ae1c14872499483091546f360ea68">00546</a> <span class="keywordtype">void</span> <a class="code" href="classstx_1_1btree__multimap.html#1b2ae1c14872499483091546f360ea68" title="Run a thorough verification of all B+ tree invariants.">verify</a>()<span class="keyword"> const</span>
<a name="l00547"></a>00547 <span class="keyword"> </span>{
<a name="l00548"></a>00548 <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00549"></a>00549 }
<a name="l00550"></a>00550
<a name="l00551"></a>00551 <span class="keyword">public</span>:
<a name="l00552"></a>00552
<a name="l00557"></a><a class="code" href="classstx_1_1btree__multimap.html#0e7c74852a6ed850fe77d11ed381066e">00557</a> <span class="keywordtype">void</span> <a class="code" href="classstx_1_1btree__multimap.html#0e7c74852a6ed850fe77d11ed381066e" 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="l00558"></a>00558 <span class="keyword"> </span>{
<a name="l00559"></a>00559 <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00560"></a>00560 }
<a name="l00561"></a>00561
<a name="l00566"></a><a class="code" href="classstx_1_1btree__multimap.html#aa339e8a98e3f48f6d16856001b685bb">00566</a> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__multimap.html#aa339e8a98e3f48f6d16856001b685bb" title="Restore a binary image of a dumped B+ tree from an istream.">restore</a>(std::istream &is)
<a name="l00567"></a>00567 {
<a name="l00568"></a>00568 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336" 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="l00569"></a>00569 }
<a name="l00570"></a>00570 };
<a name="l00571"></a>00571
<a name="l00572"></a>00572 } <span class="comment">// namespace stx</span>
<a name="l00573"></a>00573
<a name="l00574"></a>00574 <span class="preprocessor">#endif // _STX_BTREE_MULTIMAP_H_</span>
</pre></div></div>
<hr size="1"><address style="text-align: right;"><small>Generated on Sun Sep 7 17:32:38 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>
