<!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_map.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_map.h</h1><a href="btree__map_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_map.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_MAP_H_</span>
<a name="l00026"></a>00026 <span class="preprocessor"></span><span class="preprocessor">#define _STX_BTREE_MAP_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="l00045"></a>00045 <span class="keyword">template</span> <<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Data,
<a name="l00046"></a>00046 <span class="keyword">typename</span> _Compare = std::less<_Key>,
<a name="l00047"></a>00047 <span class="keyword">typename</span> _Traits = btree_default_map_traits<_Key, _Data> >
<a name="l00048"></a><a class="code" href="classstx_1_1btree__map.html">00048</a> <span class="keyword">class </span><a class="code" href="classstx_1_1btree__map.html" title="Specialized B+ tree template class implementing STL&#39;s map container.">btree_map</a>
<a name="l00049"></a>00049 {
<a name="l00050"></a>00050 <span class="keyword">public</span>:
<a name="l00051"></a>00051 <span class="comment">// *** Template Parameter Types</span>
<a name="l00052"></a>00052
<a name="l00055"></a><a class="code" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">00055</a> <span class="keyword">typedef</span> _Key <a class="code" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7" title="First template parameter: The key type of the btree.">key_type</a>;
<a name="l00056"></a>00056
<a name="l00059"></a><a class="code" href="classstx_1_1btree__map.html#2a0c3c5a2ff8bbd0ab5d2f3477349929">00059</a> <span class="keyword">typedef</span> _Data <a class="code" href="classstx_1_1btree__map.html#2a0c3c5a2ff8bbd0ab5d2f3477349929" title="Second template parameter: The data type associated with each key.">data_type</a>;
<a name="l00060"></a>00060
<a name="l00062"></a><a class="code" href="classstx_1_1btree__map.html#c233aee38b556eb6e289c29c8a4fd016">00062</a> <span class="keyword">typedef</span> _Compare <a class="code" href="classstx_1_1btree__map.html#c233aee38b556eb6e289c29c8a4fd016" title="Third template parameter: Key comparison function object.">key_compare</a>;
<a name="l00063"></a>00063
<a name="l00066"></a><a class="code" href="classstx_1_1btree__map.html#92185c97f9bf9a0960500ff6832d36bb">00066</a> <span class="keyword">typedef</span> _Traits <a class="code" href="classstx_1_1btree__map.html#92185c97f9bf9a0960500ff6832d36bb" title="Fourth template parameter: Traits object used to define more parameters of the B+...">traits</a>;
<a name="l00067"></a>00067
<a name="l00068"></a>00068 <span class="comment">// The macro BTREE_FRIENDS can be used by outside class to access the B+</span>
<a name="l00069"></a>00069 <span class="comment">// tree internals. This was added for wxBTreeDemo to be able to draw the</span>
<a name="l00070"></a>00070 <span class="comment">// tree.</span>
<a name="l00071"></a>00071 <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="l00072"></a>00072
<a name="l00073"></a>00073 <span class="keyword">public</span>:
<a name="l00074"></a>00074 <span class="comment">// *** Constructed Types</span>
<a name="l00075"></a>00075
<a name="l00077"></a><a class="code" href="classstx_1_1btree__map.html#df6c0694ac1ef102249b7a461ca29f8f">00077</a> <span class="keyword">typedef</span> <a class="code" href="classstx_1_1btree__map.html" title="Specialized B+ tree template class implementing STL&#39;s map container.">btree_map<key_type, data_type, key_compare, traits></a> <span class="keyword">self</span>;
<a name="l00078"></a>00078
<a name="l00081"></a><a class="code" href="classstx_1_1btree__map.html#b3e90662e396a7f1b10a7727628b46ed">00081</a> <span class="keyword">typedef</span> std::pair<key_type, data_type> <a class="code" href="classstx_1_1btree__map.html#b3e90662e396a7f1b10a7727628b46ed" title="Construct the STL-required value_type as a composition pair of key and data types...">value_type</a>;
<a name="l00082"></a>00082
<a name="l00084"></a><a class="code" href="classstx_1_1btree__map.html#08c651604225cb6789ebe400150d3c7b">00084</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, false></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="l00085"></a>00085
<a name="l00087"></a><a class="code" href="classstx_1_1btree__map.html#309f2cd66f9d561b3b84f9bdecc21d28">00087</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="l00088"></a>00088
<a name="l00090"></a><a class="code" href="classstx_1_1btree__map.html#ca5d5599fa2795f4a25e8d5a6e80242d">00090</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__map.html#ca5d5599fa2795f4a25e8d5a6e80242d" title="Size type used to count keys.">size_type</a>;
<a name="l00091"></a>00091
<a name="l00093"></a><a class="code" href="classstx_1_1btree__map.html#ec915e6aa26b1d02e56d00ee3dfebd62">00093</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="l00094"></a>00094
<a name="l00095"></a>00095 <span class="keyword">public</span>:
<a name="l00096"></a>00096 <span class="comment">// *** Static Constant Options and Values of the B+ Tree</span>
<a name="l00097"></a>00097
<a name="l00099"></a><a class="code" href="classstx_1_1btree__map.html#ca6265c154fd937a7b309629109246e1">00099</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__map.html#ca6265c154fd937a7b309629109246e1" 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="l00100"></a>00100
<a name="l00103"></a><a class="code" href="classstx_1_1btree__map.html#33170e3a298381f94277ad9b3ff58059">00103</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__map.html#33170e3a298381f94277ad9b3ff58059" 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="l00104"></a>00104
<a name="l00108"></a><a class="code" href="classstx_1_1btree__map.html#f378c4efd1fd861ce9d7c269afaa5655">00108</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__map.html#f378c4efd1fd861ce9d7c269afaa5655" 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="l00109"></a>00109
<a name="l00113"></a><a class="code" href="classstx_1_1btree__map.html#6a031aced77527fb9199bf34d4619b50">00113</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__map.html#6a031aced77527fb9199bf34d4619b50" 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="l00114"></a>00114
<a name="l00117"></a><a class="code" href="classstx_1_1btree__map.html#ea80b18edf998ef8c1209bb202f253e3">00117</a> <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__map.html#ea80b18edf998ef8c1209bb202f253e3" 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="l00118"></a>00118
<a name="l00122"></a><a class="code" href="classstx_1_1btree__map.html#1036f5d3c20c320ec9c755b291f42b2f">00122</a> <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__map.html#1036f5d3c20c320ec9c755b291f42b2f" 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="l00123"></a>00123
<a name="l00125"></a><a class="code" href="classstx_1_1btree__map.html#93046a545dd2455ecbdf0eda4bbff7f2">00125</a> <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__map.html#93046a545dd2455ecbdf0eda4bbff7f2" 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="l00126"></a>00126
<a name="l00127"></a>00127 <span class="keyword">public</span>:
<a name="l00128"></a>00128 <span class="comment">// *** Iterators and Reverse Iterators</span>
<a name="l00129"></a>00129
<a name="l00132"></a><a class="code" href="classstx_1_1btree__map.html#01212d10908d847a786f1ceecf0f78f2">00132</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="l00133"></a>00133
<a name="l00136"></a><a class="code" href="classstx_1_1btree__map.html#30b37125561a2a00ba45c319d8985c7d">00136</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="l00137"></a>00137
<a name="l00139"></a><a class="code" href="classstx_1_1btree__map.html#1c89ffe5afb190c7af6892e256db04f8">00139</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="l00140"></a>00140
<a name="l00142"></a><a class="code" href="classstx_1_1btree__map.html#f7ffc8a2f9d5d820c0e923c0581ae880">00142</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="l00143"></a>00143
<a name="l00144"></a>00144 <span class="keyword">private</span>:
<a name="l00145"></a>00145 <span class="comment">// *** Tree Implementation Object</span>
<a name="l00146"></a>00146
<a name="l00148"></a><a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3">00148</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__map.html#17330e6f6b0071c7920acfdff30420a3" title="The contained implementation object.">tree</a>;
<a name="l00149"></a>00149
<a name="l00150"></a>00150 <span class="keyword">public</span>:
<a name="l00151"></a>00151 <span class="comment">// *** Constructors and Destructor</span>
<a name="l00152"></a>00152
<a name="l00155"></a><a class="code" href="classstx_1_1btree__map.html#9b26ac9097c5438cdae800d92d695582">00155</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__map.html#9b26ac9097c5438cdae800d92d695582" title="Default constructor initializing an empty B+ tree with the standard key comparison...">btree_map</a>()
<a name="l00156"></a>00156 : <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" title="The contained implementation object.">tree</a>()
<a name="l00157"></a>00157 {
<a name="l00158"></a>00158 }
<a name="l00159"></a>00159
<a name="l00162"></a><a class="code" href="classstx_1_1btree__map.html#605efd0b48822a0baa8ef3367a6504c0">00162</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__map.html#9b26ac9097c5438cdae800d92d695582" title="Default constructor initializing an empty B+ tree with the standard key comparison...">btree_map</a>(<span class="keyword">const</span> <a class="code" href="classstx_1_1btree__map.html#c233aee38b556eb6e289c29c8a4fd016" title="Third template parameter: Key comparison function object.">key_compare</a> &kcf)
<a name="l00163"></a>00163 : <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" title="The contained implementation object.">tree</a>(kcf)
<a name="l00164"></a>00164 {
<a name="l00165"></a>00165 }
<a name="l00166"></a>00166
<a name="l00168"></a>00168 <span class="keyword">template</span> <<span class="keyword">class</span> InputIterator>
<a name="l00169"></a><a class="code" href="classstx_1_1btree__map.html#d8de818b0844d29afe834cd53feb86dd">00169</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__map.html#9b26ac9097c5438cdae800d92d695582" title="Default constructor initializing an empty B+ tree with the standard key comparison...">btree_map</a>(InputIterator first, InputIterator last)
<a name="l00170"></a>00170 : <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" title="The contained implementation object.">tree</a>(first, last)
<a name="l00171"></a>00171 {
<a name="l00172"></a>00172 }
<a name="l00173"></a>00173
<a name="l00176"></a>00176 <span class="keyword">template</span> <<span class="keyword">class</span> InputIterator>
<a name="l00177"></a><a class="code" href="classstx_1_1btree__map.html#0a5d934afa5f93c149def15447cea989">00177</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__map.html#9b26ac9097c5438cdae800d92d695582" title="Default constructor initializing an empty B+ tree with the standard key comparison...">btree_map</a>(InputIterator first, InputIterator last, <span class="keyword">const</span> <a class="code" href="classstx_1_1btree__map.html#c233aee38b556eb6e289c29c8a4fd016" title="Third template parameter: Key comparison function object.">key_compare</a> &kcf)
<a name="l00178"></a>00178 : <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" title="The contained implementation object.">tree</a>(first, last, kcf)
<a name="l00179"></a>00179 {
<a name="l00180"></a>00180 }
<a name="l00181"></a>00181
<a name="l00183"></a><a class="code" href="classstx_1_1btree__map.html#1f6993a6ba2fd05e7cbc80581a765c52">00183</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__map.html#1f6993a6ba2fd05e7cbc80581a765c52" title="Frees up all used B+ tree memory pages.">~btree_map</a>()
<a name="l00184"></a>00184 {
<a name="l00185"></a>00185 }
<a name="l00186"></a>00186
<a name="l00188"></a><a class="code" href="classstx_1_1btree__map.html#6205397231ca2d69bf82f61cdc32ec35">00188</a> <span class="keywordtype">void</span> <a class="code" href="classstx_1_1btree__map.html#6205397231ca2d69bf82f61cdc32ec35" title="Fast swapping of two identical B+ tree objects.">swap</a>(<span class="keyword">self</span>& from)
<a name="l00189"></a>00189 {
<a name="l00190"></a>00190 std::swap(<a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" title="The contained implementation object.">tree</a>, from.tree);
<a name="l00191"></a>00191 }
<a name="l00192"></a>00192
<a name="l00193"></a>00193 <span class="keyword">public</span>:
<a name="l00194"></a>00194 <span class="comment">// *** Key and Value Comparison Function Objects</span>
<a name="l00195"></a>00195
<a name="l00197"></a><a class="code" href="classstx_1_1btree__map.html#29a42dd3c80af581d77527cfa7db4513">00197</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__map.html#c233aee38b556eb6e289c29c8a4fd016" title="Third template parameter: Key comparison function object.">key_compare</a> <a class="code" href="classstx_1_1btree__map.html#29a42dd3c80af581d77527cfa7db4513" title="Constant access to the key comparison object sorting the B+ tree.">key_comp</a>()<span class="keyword"> const</span>
<a name="l00198"></a>00198 <span class="keyword"> </span>{
<a name="l00199"></a>00199 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00200"></a>00200 }
<a name="l00201"></a>00201
<a name="l00204"></a><a class="code" href="classstx_1_1btree__map.html#cdff829c1864ef6e477668f30bf44a2a">00204</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__map.html#cdff829c1864ef6e477668f30bf44a2a" title="Constant access to a constructed value_type comparison object.">value_comp</a>()<span class="keyword"> const</span>
<a name="l00205"></a>00205 <span class="keyword"> </span>{
<a name="l00206"></a>00206 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00207"></a>00207 }
<a name="l00208"></a>00208
<a name="l00209"></a>00209 <span class="keyword">public</span>:
<a name="l00210"></a>00210 <span class="comment">// *** Fast Destruction of the B+ Tree</span>
<a name="l00211"></a>00211
<a name="l00213"></a><a class="code" href="classstx_1_1btree__map.html#27f0fba6c6ce3313a36408b763bf8548">00213</a> <span class="keywordtype">void</span> <a class="code" href="classstx_1_1btree__map.html#27f0fba6c6ce3313a36408b763bf8548" title="Frees all key/data pairs and all nodes of the tree.">clear</a>()
<a name="l00214"></a>00214 {
<a name="l00215"></a>00215 <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00216"></a>00216 }
<a name="l00217"></a>00217
<a name="l00218"></a>00218 <span class="keyword">public</span>:
<a name="l00219"></a>00219 <span class="comment">// *** STL Iterator Construction Functions</span>
<a name="l00220"></a>00220
<a name="l00223"></a><a class="code" href="classstx_1_1btree__map.html#5b87df24e750f39e73fcce8e379675be">00223</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__map.html#5b87df24e750f39e73fcce8e379675be" title="Constructs a read/data-write iterator that points to the first slot in the first...">begin</a>()
<a name="l00224"></a>00224 {
<a name="l00225"></a>00225 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00226"></a>00226 }
<a name="l00227"></a>00227
<a name="l00230"></a><a class="code" href="classstx_1_1btree__map.html#3b5fc07a6dd524bc7f8e0783664cbaca">00230</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__map.html#3b5fc07a6dd524bc7f8e0783664cbaca" title="Constructs a read/data-write iterator that points to the first invalid slot in the...">end</a>()
<a name="l00231"></a>00231 {
<a name="l00232"></a>00232 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00233"></a>00233 }
<a name="l00234"></a>00234
<a name="l00237"></a><a class="code" href="classstx_1_1btree__map.html#66ac5edf6a4e65b1f80753edfd5367c4">00237</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__map.html#5b87df24e750f39e73fcce8e379675be" 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="l00238"></a>00238 <span class="keyword"> </span>{
<a name="l00239"></a>00239 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00240"></a>00240 }
<a name="l00241"></a>00241
<a name="l00244"></a><a class="code" href="classstx_1_1btree__map.html#982b7953fdc14daf91509228fd791607">00244</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__map.html#3b5fc07a6dd524bc7f8e0783664cbaca" 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="l00245"></a>00245 <span class="keyword"> </span>{
<a name="l00246"></a>00246 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00247"></a>00247 }
<a name="l00248"></a>00248
<a name="l00251"></a><a class="code" href="classstx_1_1btree__map.html#fab510271fa2ed968305eee46d2b46b7">00251</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__map.html#fab510271fa2ed968305eee46d2b46b7" title="Constructs a read/data-write reverse iterator that points to the first invalid slot...">rbegin</a>()
<a name="l00252"></a>00252 {
<a name="l00253"></a>00253 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00254"></a>00254 }
<a name="l00255"></a>00255
<a name="l00258"></a><a class="code" href="classstx_1_1btree__map.html#e76f34d73b410e8b4e8c431fa7bfe8c1">00258</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__map.html#e76f34d73b410e8b4e8c431fa7bfe8c1" title="Constructs a read/data-write reverse iterator that points to the first slot in the...">rend</a>()
<a name="l00259"></a>00259 {
<a name="l00260"></a>00260 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00261"></a>00261 }
<a name="l00262"></a>00262
<a name="l00265"></a><a class="code" href="classstx_1_1btree__map.html#39a9f9d276f879710d6e038d962a328e">00265</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__map.html#fab510271fa2ed968305eee46d2b46b7" title="Constructs a read/data-write reverse iterator that points to the first invalid slot...">rbegin</a>()<span class="keyword"> const</span>
<a name="l00266"></a>00266 <span class="keyword"> </span>{
<a name="l00267"></a>00267 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00268"></a>00268 }
<a name="l00269"></a>00269
<a name="l00272"></a><a class="code" href="classstx_1_1btree__map.html#aae6e84940f771935c3f400255223c14">00272</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__map.html#e76f34d73b410e8b4e8c431fa7bfe8c1" 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="l00273"></a>00273 <span class="keyword"> </span>{
<a name="l00274"></a>00274 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00275"></a>00275 }
<a name="l00276"></a>00276
<a name="l00277"></a>00277 <span class="keyword">public</span>:
<a name="l00278"></a>00278 <span class="comment">// *** Access Functions to the Item Count</span>
<a name="l00279"></a>00279
<a name="l00281"></a><a class="code" href="classstx_1_1btree__map.html#fd80539179a05388fc9a2b689054ba28">00281</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__map.html#ca5d5599fa2795f4a25e8d5a6e80242d" title="Size type used to count keys.">size_type</a> <a class="code" href="classstx_1_1btree__map.html#fd80539179a05388fc9a2b689054ba28" title="Return the number of key/data pairs in the B+ tree.">size</a>()<span class="keyword"> const</span>
<a name="l00282"></a>00282 <span class="keyword"> </span>{
<a name="l00283"></a>00283 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00284"></a>00284 }
<a name="l00285"></a>00285
<a name="l00287"></a><a class="code" href="classstx_1_1btree__map.html#f99d30caf13ce40648b80d7b0b678222">00287</a> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__map.html#f99d30caf13ce40648b80d7b0b678222" 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="l00288"></a>00288 <span class="keyword"> </span>{
<a name="l00289"></a>00289 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00290"></a>00290 }
<a name="l00291"></a>00291
<a name="l00294"></a><a class="code" href="classstx_1_1btree__map.html#b5a71e47f81a88fb13bb3c7e88383922">00294</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__map.html#ca5d5599fa2795f4a25e8d5a6e80242d" title="Size type used to count keys.">size_type</a> <a class="code" href="classstx_1_1btree__map.html#b5a71e47f81a88fb13bb3c7e88383922" title="Returns the largest possible size of the B+ Tree.">max_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__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00297"></a>00297 }
<a name="l00298"></a>00298
<a name="l00300"></a><a class="code" href="classstx_1_1btree__map.html#8cb0f856ac71e8c923afdfd1db1c0fe5">00300</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__map.html#8cb0f856ac71e8c923afdfd1db1c0fe5" title="Return a const reference to the current statistics.">get_stats</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__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00303"></a>00303 }
<a name="l00304"></a>00304
<a name="l00305"></a>00305 <span class="keyword">public</span>:
<a name="l00306"></a>00306 <span class="comment">// *** Standard Access Functions Querying the Tree by Descending to a Leaf</span>
<a name="l00307"></a>00307
<a name="l00310"></a><a class="code" href="classstx_1_1btree__map.html#9b47a200c1420a05a988c48f912d8b18">00310</a> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__map.html#9b47a200c1420a05a988c48f912d8b18" 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__map.html#040c329011765fdb3b936b873a6775a7" title="First template parameter: The key type of the btree.">key_type</a> &key)<span class="keyword"> const</span>
<a name="l00311"></a>00311 <span class="keyword"> </span>{
<a name="l00312"></a>00312 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00313"></a>00313 }
<a name="l00314"></a>00314
<a name="l00317"></a><a class="code" href="classstx_1_1btree__map.html#b09ea1baac9483fa6cdec5944352309f">00317</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__map.html#b09ea1baac9483fa6cdec5944352309f" 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__map.html#040c329011765fdb3b936b873a6775a7" title="First template parameter: The key type of the btree.">key_type</a> &key)
<a name="l00318"></a>00318 {
<a name="l00319"></a>00319 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00320"></a>00320 }
<a name="l00321"></a>00321
<a name="l00324"></a><a class="code" href="classstx_1_1btree__map.html#6bd62582fbd9abcb205543bdaa814309">00324</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__map.html#b09ea1baac9483fa6cdec5944352309f" 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__map.html#040c329011765fdb3b936b873a6775a7" title="First template parameter: The key type of the btree.">key_type</a> &key)<span class="keyword"> const</span>
<a name="l00325"></a>00325 <span class="keyword"> </span>{
<a name="l00326"></a>00326 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00327"></a>00327 }
<a name="l00328"></a>00328
<a name="l00332"></a><a class="code" href="classstx_1_1btree__map.html#8b9b2a16bc790eabbe09f0d87db2283d">00332</a> <a class="code" href="classstx_1_1btree__map.html#ca5d5599fa2795f4a25e8d5a6e80242d" title="Size type used to count keys.">size_type</a> <a class="code" href="classstx_1_1btree__map.html#8b9b2a16bc790eabbe09f0d87db2283d" 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__map.html#040c329011765fdb3b936b873a6775a7" 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__map.html#17330e6f6b0071c7920acfdff30420a3" 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__map.html#9faf7b0543cbe6484bb14607350756d9">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__map.html#9faf7b0543cbe6484bb14607350756d9" 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__map.html#040c329011765fdb3b936b873a6775a7" 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__map.html#17330e6f6b0071c7920acfdff30420a3" 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__map.html#ddf50ec517bbb6e31055d89ae53d1595">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__map.html#9faf7b0543cbe6484bb14607350756d9" 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__map.html#040c329011765fdb3b936b873a6775a7" 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__map.html#17330e6f6b0071c7920acfdff30420a3" 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__map.html#66d2fcd14195e498274ab8917cd13bec">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__map.html#66d2fcd14195e498274ab8917cd13bec" 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__map.html#040c329011765fdb3b936b873a6775a7" 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__map.html#17330e6f6b0071c7920acfdff30420a3" 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__map.html#67659d8e4a4f62f78c6fc727637477c4">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__map.html#66d2fcd14195e498274ab8917cd13bec" 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__map.html#040c329011765fdb3b936b873a6775a7" 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__map.html#17330e6f6b0071c7920acfdff30420a3" 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__map.html#3afaea18889502a9566bbf50b5850343">00366</a> <span class="keyword">inline</span> std::pair<iterator, iterator> <a class="code" href="classstx_1_1btree__map.html#3afaea18889502a9566bbf50b5850343" 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__map.html#040c329011765fdb3b936b873a6775a7" 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__map.html#17330e6f6b0071c7920acfdff30420a3" 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__map.html#b690cad91308196f0599a6462f9f3b3a">00372</a> <span class="keyword">inline</span> std::pair<const_iterator, const_iterator> <a class="code" href="classstx_1_1btree__map.html#3afaea18889502a9566bbf50b5850343" 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__map.html#040c329011765fdb3b936b873a6775a7" 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__map.html#17330e6f6b0071c7920acfdff30420a3" 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__map.html#7b323df7a4b073186e5c6859be002ce3">00383</a> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__map.html#7b323df7a4b073186e5c6859be002ce3" 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__map.html#17330e6f6b0071c7920acfdff30420a3" 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__map.html#031b58b8d8bc32333df20502804bf745">00389</a> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__map.html#031b58b8d8bc32333df20502804bf745" 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__map.html#17330e6f6b0071c7920acfdff30420a3" 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__map.html#244be6169080b61f6d08210dde2d9eb0">00396</a> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__map.html#244be6169080b61f6d08210dde2d9eb0" 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__map.html#17330e6f6b0071c7920acfdff30420a3" 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__map.html#251659debc458d04d6ada6738c73bf5b">00402</a> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__map.html#251659debc458d04d6ada6738c73bf5b" 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__map.html#17330e6f6b0071c7920acfdff30420a3" 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__map.html#4de1327a2f7b4ca358ec3375320e650d">00408</a> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__map.html#4de1327a2f7b4ca358ec3375320e650d" 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__map.html#17330e6f6b0071c7920acfdff30420a3" 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__map.html#8f3c29f24d38ddd589471beac567f3d6">00414</a> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__map.html#8f3c29f24d38ddd589471beac567f3d6" 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__map.html#17330e6f6b0071c7920acfdff30420a3" 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__map.html#54196c9b520c8436eff8f0f6f56c7146">00423</a> <span class="keyword">inline</span> <span class="keyword">self</span>& <a class="code" href="classstx_1_1btree__map.html#54196c9b520c8436eff8f0f6f56c7146" 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__map.html#17330e6f6b0071c7920acfdff30420a3" 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__map.html#c55631114548b5261175199c640cb07d">00434</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__map.html#9b26ac9097c5438cdae800d92d695582" title="Default constructor initializing an empty B+ tree with the standard key comparison...">btree_map</a>(<span class="keyword">const</span> <span class="keyword">self</span> &other)
<a name="l00435"></a>00435 : <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" title="The contained implementation object.">tree</a>(other.<a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" 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__map.html#df36108eef96351d7fa38630573066f9">00444</a> <span class="keyword">inline</span> std::pair<iterator, bool> <a class="code" href="classstx_1_1btree__map.html#df36108eef96351d7fa38630573066f9" 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__map.html#b3e90662e396a7f1b10a7727628b46ed" 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__map.html#17330e6f6b0071c7920acfdff30420a3" 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);
<a name="l00447"></a>00447 }
<a name="l00448"></a>00448
<a name="l00452"></a><a class="code" href="classstx_1_1btree__map.html#47bed0d1ad0c9b0a7e3fdba1469d430f">00452</a> <span class="keyword">inline</span> std::pair<iterator, bool> <a class="code" href="classstx_1_1btree__map.html#df36108eef96351d7fa38630573066f9" 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__map.html#040c329011765fdb3b936b873a6775a7" 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__map.html#2a0c3c5a2ff8bbd0ab5d2f3477349929" 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__map.html#17330e6f6b0071c7920acfdff30420a3" 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);
<a name="l00455"></a>00455 }
<a name="l00456"></a>00456
<a name="l00461"></a><a class="code" href="classstx_1_1btree__map.html#192d38c5b78803a35d0506180eb44454">00461</a> <span class="keyword">inline</span> std::pair<iterator, bool> <a class="code" href="classstx_1_1btree__map.html#192d38c5b78803a35d0506180eb44454" 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__map.html#040c329011765fdb3b936b873a6775a7" 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__map.html#2a0c3c5a2ff8bbd0ab5d2f3477349929" 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__map.html#17330e6f6b0071c7920acfdff30420a3" 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);
<a name="l00464"></a>00464 }
<a name="l00465"></a>00465
<a name="l00468"></a><a class="code" href="classstx_1_1btree__map.html#4aba9bfb366dac25080ef9e19733b9e2">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__map.html#df36108eef96351d7fa38630573066f9" 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__map.html#b3e90662e396a7f1b10a7727628b46ed" 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__map.html#17330e6f6b0071c7920acfdff30420a3" 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__map.html#7a7f3a4249b133f0b71ae60f2fe6213d">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__map.html#192d38c5b78803a35d0506180eb44454" 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__map.html#040c329011765fdb3b936b873a6775a7" 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__map.html#2a0c3c5a2ff8bbd0ab5d2f3477349929" 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__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00483"></a><a class="code" href="classstx_1_1btree__map.html#2ce8c6d8cff676eaf3cf5eebe852715b">00483</a> <span class="keyword">inline</span> <a class="code" href="classstx_1_1btree__map.html#2a0c3c5a2ff8bbd0ab5d2f3477349929" title="Second template parameter: The data type associated with each key.">data_type</a>& <a class="code" href="classstx_1_1btree__map.html#2ce8c6d8cff676eaf3cf5eebe852715b" title="Returns a reference to the object that is associated with a particular key.">operator[]</a>(<span class="keyword">const</span> <a class="code" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7" title="First template parameter: The key type of the btree.">key_type</a>& key)
<a name="l00484"></a>00484 {
<a name="l00485"></a>00485 <a class="code" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a> i = <a class="code" href="classstx_1_1btree__map.html#df36108eef96351d7fa38630573066f9" title="Attempt to insert a key/data pair into the B+ tree.">insert</a>( <a class="code" href="classstx_1_1btree__map.html#b3e90662e396a7f1b10a7727628b46ed" title="Construct the STL-required value_type as a composition pair of key and data types...">value_type</a>(key, <a class="code" href="classstx_1_1btree__map.html#2a0c3c5a2ff8bbd0ab5d2f3477349929" title="Second template parameter: The data type associated with each key.">data_type</a>()) ).first;
<a name="l00486"></a>00486 <span class="keywordflow">return</span> i.<a class="code" href="classstx_1_1btree_1_1iterator.html#611b8e53a3678e53c78d198b25e05a2f" title="Writable reference to the current data object.">data</a>();
<a name="l00487"></a>00487 }
<a name="l00488"></a>00488
<a name="l00491"></a>00491 <span class="keyword">template</span> <<span class="keyword">typename</span> InputIterator>
<a name="l00492"></a><a class="code" href="classstx_1_1btree__map.html#729a6e0eec5864c2273872f304f4b1ca">00492</a> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classstx_1_1btree__map.html#df36108eef96351d7fa38630573066f9" title="Attempt to insert a key/data pair into the B+ tree.">insert</a>(InputIterator first, InputIterator last)
<a name="l00493"></a>00493 {
<a name="l00494"></a>00494 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00495"></a>00495 }
<a name="l00496"></a>00496
<a name="l00497"></a>00497 <span class="keyword">public</span>:
<a name="l00498"></a>00498 <span class="comment">// *** Public Erase Functions</span>
<a name="l00499"></a>00499
<a name="l00502"></a><a class="code" href="classstx_1_1btree__map.html#c62a19a8e1bc6c1e47ad4a2136cb3b4a">00502</a> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__map.html#c62a19a8e1bc6c1e47ad4a2136cb3b4a" title="Erases the key/data pairs associated with the given key.">erase_one</a>(<span class="keyword">const</span> <a class="code" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7" title="First template parameter: The key type of the btree.">key_type</a> &key)
<a name="l00503"></a>00503 {
<a name="l00504"></a>00504 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00505"></a>00505 }
<a name="l00506"></a>00506
<a name="l00509"></a><a class="code" href="classstx_1_1btree__map.html#8dd1b6d5abc5e9d19f5ce2c602cc2ac0">00509</a> <a class="code" href="classstx_1_1btree__map.html#ca5d5599fa2795f4a25e8d5a6e80242d" title="Size type used to count keys.">size_type</a> <a class="code" href="classstx_1_1btree__map.html#8dd1b6d5abc5e9d19f5ce2c602cc2ac0" 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__map.html#040c329011765fdb3b936b873a6775a7" title="First template parameter: The key type of the btree.">key_type</a> &key)
<a name="l00510"></a>00510 {
<a name="l00511"></a>00511 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00512"></a>00512 }
<a name="l00513"></a>00513
<a name="l00514"></a>00514 <span class="preprocessor">#ifdef BTREE_TODO</span>
<a name="l00516"></a><a class="code" href="classstx_1_1btree__map.html#7414a2257c95a81734a81591c5e6a2ff">00516</a> <span class="preprocessor"> void erase(iterator iter)</span>
<a name="l00517"></a>00517 <span class="preprocessor"></span> {
<a name="l00518"></a>00518
<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_TODO</span>
<a name="l00525"></a><a class="code" href="classstx_1_1btree__map.html#e3f1517fa5351b83ed8ca397895e53a2">00525</a> <span class="preprocessor"> void erase(iterator </span><span class="comment">/* first */</span>, iterator <span class="comment">/* last */</span>)
<a name="l00526"></a>00526 {
<a name="l00527"></a>00527 abort();
<a name="l00528"></a>00528 }
<a name="l00529"></a>00529 <span class="preprocessor">#endif</span>
<a name="l00530"></a>00530 <span class="preprocessor"></span>
<a name="l00531"></a>00531 <span class="preprocessor">#ifdef BTREE_DEBUG</span>
<a name="l00532"></a>00532 <span class="preprocessor"></span><span class="keyword">public</span>:
<a name="l00533"></a>00533 <span class="comment">// *** Debug Printing</span>
<a name="l00534"></a>00534
<a name="l00538"></a><a class="code" href="classstx_1_1btree__map.html#50de0863f54f6b2aeeef8026601167a4">00538</a> <span class="keywordtype">void</span> <a class="code" href="classstx_1_1btree__map.html#50de0863f54f6b2aeeef8026601167a4" 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="l00539"></a>00539 <span class="keyword"> </span>{
<a name="l00540"></a>00540 <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00541"></a>00541 }
<a name="l00542"></a>00542
<a name="l00544"></a><a class="code" href="classstx_1_1btree__map.html#8c2cb116ce87ea80dee00d286967e924">00544</a> <span class="keywordtype">void</span> <a class="code" href="classstx_1_1btree__map.html#8c2cb116ce87ea80dee00d286967e924" title="Print out only the leaves via the double linked list.">print_leaves</a>(std::ostream &os)<span class="keyword"> const</span>
<a name="l00545"></a>00545 <span class="keyword"> </span>{
<a name="l00546"></a>00546 <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00547"></a>00547 }
<a name="l00548"></a>00548 <span class="preprocessor">#endif</span>
<a name="l00549"></a>00549 <span class="preprocessor"></span>
<a name="l00550"></a>00550 <span class="keyword">public</span>:
<a name="l00551"></a>00551 <span class="comment">// *** Verification of B+ Tree Invariants</span>
<a name="l00552"></a>00552
<a name="l00555"></a><a class="code" href="classstx_1_1btree__map.html#c7c78f35e621b93dde701bf7c5165ee2">00555</a> <span class="keywordtype">void</span> <a class="code" href="classstx_1_1btree__map.html#c7c78f35e621b93dde701bf7c5165ee2" title="Run a thorough verification of all B+ tree invariants.">verify</a>()<span class="keyword"> const</span>
<a name="l00556"></a>00556 <span class="keyword"> </span>{
<a name="l00557"></a>00557 <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00558"></a>00558 }
<a name="l00559"></a>00559
<a name="l00560"></a>00560 <span class="keyword">public</span>:
<a name="l00561"></a>00561
<a name="l00566"></a><a class="code" href="classstx_1_1btree__map.html#866a468537769df46395da111fdc584a">00566</a> <span class="keywordtype">void</span> <a class="code" href="classstx_1_1btree__map.html#866a468537769df46395da111fdc584a" 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="l00567"></a>00567 <span class="keyword"> </span>{
<a name="l00568"></a>00568 <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00569"></a>00569 }
<a name="l00570"></a>00570
<a name="l00575"></a><a class="code" href="classstx_1_1btree__map.html#e5b8526fc40d3401d718b45b26c3278d">00575</a> <span class="keywordtype">bool</span> <a class="code" href="classstx_1_1btree__map.html#e5b8526fc40d3401d718b45b26c3278d" title="Restore a binary image of a dumped B+ tree from an istream.">restore</a>(std::istream &is)
<a name="l00576"></a>00576 {
<a name="l00577"></a>00577 <span class="keywordflow">return</span> <a class="code" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3" 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="l00578"></a>00578 }
<a name="l00579"></a>00579 };
<a name="l00580"></a>00580
<a name="l00581"></a>00581 } <span class="comment">// namespace stx</span>
<a name="l00582"></a>00582
<a name="l00583"></a>00583 <span class="preprocessor">#endif // _STX_BTREE_MAP_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>
