<!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< _Key, _Data, _Compare, _Traits > Class Template Reference</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 class="current"><a href="annotated.html"><span>Classes</span></a></li>
<li><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div class="tabs">
<ul>
<li><a href="annotated.html"><span>Class List</span></a></li>
<li><a href="hierarchy.html"><span>Class Hierarchy</span></a></li>
<li><a href="functions.html"><span>Class Members</span></a></li>
</ul>
</div>
<div class="navpath"><a class="el" href="namespacestx.html">stx</a>::<a class="el" href="classstx_1_1btree__map.html">btree_map</a>
</div>
</div>
<div class="contents">
<h1>stx::btree_map< _Key, _Data, _Compare, _Traits > Class Template Reference</h1><!-- doxytag: class="stx::btree_map" -->Specialized B+ tree template class implementing STL's map container.
<a href="#_details">More...</a>
<p>
<code>#include <<a class="el" href="btree__map_8h-source.html">btree_map.h</a>></code>
<p>
<p>
<a href="classstx_1_1btree__map-members.html">List of all members.</a><table border="0" cellpadding="0" cellspacing="0">
<tr><td></td></tr>
<tr><td colspan="2"><br><h2>Public Types</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef _Key </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">First template parameter: The key type of the <a class="el" href="classstx_1_1btree.html" title="Basic class implementing a base B+ tree data structure in memory.">btree</a>. <a href="#040c329011765fdb3b936b873a6775a7"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef _Data </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#2a0c3c5a2ff8bbd0ab5d2f3477349929">data_type</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Second template parameter: The data type associated with each key. <a href="#2a0c3c5a2ff8bbd0ab5d2f3477349929"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef _Compare </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#c233aee38b556eb6e289c29c8a4fd016">key_compare</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Third template parameter: Key comparison function object. <a href="#c233aee38b556eb6e289c29c8a4fd016"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef _Traits </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#92185c97f9bf9a0960500ff6832d36bb">traits</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Fourth template parameter: Traits object used to define more parameters of the B+ tree. <a href="#92185c97f9bf9a0960500ff6832d36bb"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <a class="el" href="classstx_1_1btree__map.html">btree_map</a>< <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a>, <br>
<a class="el" href="classstx_1_1btree__map.html#2a0c3c5a2ff8bbd0ab5d2f3477349929">data_type</a>, <a class="el" href="classstx_1_1btree__map.html#c233aee38b556eb6e289c29c8a4fd016">key_compare</a>, <a class="el" href="classstx_1_1btree__map.html#92185c97f9bf9a0960500ff6832d36bb">traits</a> > </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#df6c0694ac1ef102249b7a461ca29f8f">self</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Typedef of our own type. <a href="#df6c0694ac1ef102249b7a461ca29f8f"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef std::pair< <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a>, <br>
<a class="el" href="classstx_1_1btree__map.html#2a0c3c5a2ff8bbd0ab5d2f3477349929">data_type</a> > </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#b3e90662e396a7f1b10a7727628b46ed">value_type</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Construct the STL-required value_type as a composition pair of key and data types. <a href="#b3e90662e396a7f1b10a7727628b46ed"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <a class="el" href="classstx_1_1btree.html">stx::btree</a>< <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a>, <br>
<a class="el" href="classstx_1_1btree__map.html#2a0c3c5a2ff8bbd0ab5d2f3477349929">data_type</a>, <a class="el" href="classstx_1_1btree__map.html#b3e90662e396a7f1b10a7727628b46ed">value_type</a>, <br>
<a class="el" href="classstx_1_1btree__map.html#c233aee38b556eb6e289c29c8a4fd016">key_compare</a>, <a class="el" href="classstx_1_1btree__map.html#92185c97f9bf9a0960500ff6832d36bb">traits</a>, false > </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#08c651604225cb6789ebe400150d3c7b">btree_impl</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Implementation type of the btree_base. <a href="#08c651604225cb6789ebe400150d3c7b"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <a class="el" href="classstx_1_1btree_1_1value__compare.html">btree_impl::value_compare</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#309f2cd66f9d561b3b84f9bdecc21d28">value_compare</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Function class comparing two value_type pairs. <a href="#309f2cd66f9d561b3b84f9bdecc21d28"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <a class="el" href="classstx_1_1btree.html#973470864b67129983ea4e1aa2132ac5">btree_impl::size_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#ca5d5599fa2795f4a25e8d5a6e80242d">size_type</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Size type used to count keys. <a href="#ca5d5599fa2795f4a25e8d5a6e80242d"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <a class="el" href="structstx_1_1btree_1_1tree__stats.html">btree_impl::tree_stats</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#ec915e6aa26b1d02e56d00ee3dfebd62">tree_stats</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Small structure containing statistics about the tree. <a href="#ec915e6aa26b1d02e56d00ee3dfebd62"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <a class="el" href="classstx_1_1btree_1_1iterator.html">btree_impl::iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#01212d10908d847a786f1ceecf0f78f2">iterator</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">STL-like iterator object for B+ tree items. <a href="#01212d10908d847a786f1ceecf0f78f2"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <a class="el" href="classstx_1_1btree_1_1const__iterator.html">btree_impl::const_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#30b37125561a2a00ba45c319d8985c7d">const_iterator</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">STL-like iterator object for B+ tree items. <a href="#30b37125561a2a00ba45c319d8985c7d"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <br>
<a class="el" href="classstx_1_1btree_1_1reverse__iterator.html">btree_impl::reverse_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#1c89ffe5afb190c7af6892e256db04f8">reverse_iterator</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">create mutable reverse iterator by using STL magic <a href="#1c89ffe5afb190c7af6892e256db04f8"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <br>
<a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html">btree_impl::const_reverse_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#f7ffc8a2f9d5d820c0e923c0581ae880">const_reverse_iterator</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">create constant reverse iterator by using STL magic <a href="#f7ffc8a2f9d5d820c0e923c0581ae880"></a><br></td></tr>
<tr><td colspan="2"><br><h2>Public Member Functions</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#9b26ac9097c5438cdae800d92d695582">btree_map</a> ()</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Default constructor initializing an empty B+ tree with the standard key comparison function. <a href="#9b26ac9097c5438cdae800d92d695582"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#605efd0b48822a0baa8ef3367a6504c0">btree_map</a> (const <a class="el" href="classstx_1_1btree__map.html#c233aee38b556eb6e289c29c8a4fd016">key_compare</a> &kcf)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Constructor initializing an empty B+ tree with a special key comparison object. <a href="#605efd0b48822a0baa8ef3367a6504c0"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<class InputIterator> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top"> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#d8de818b0844d29afe834cd53feb86dd">btree_map</a> (InputIterator first, InputIterator last)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Constructor initializing a B+ tree with the range [first,last). <a href="#d8de818b0844d29afe834cd53feb86dd"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<class InputIterator> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top"> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#0a5d934afa5f93c149def15447cea989">btree_map</a> (InputIterator first, InputIterator last, const <a class="el" href="classstx_1_1btree__map.html#c233aee38b556eb6e289c29c8a4fd016">key_compare</a> &kcf)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Constructor initializing a B+ tree with the range [first,last) and a special key comparison object. <a href="#0a5d934afa5f93c149def15447cea989"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#1f6993a6ba2fd05e7cbc80581a765c52">~btree_map</a> ()</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Frees up all used B+ tree memory pages. <a href="#1f6993a6ba2fd05e7cbc80581a765c52"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#6205397231ca2d69bf82f61cdc32ec35">swap</a> (<a class="el" href="classstx_1_1btree__map.html">self</a> &from)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Fast swapping of two identical B+ tree objects. <a href="#6205397231ca2d69bf82f61cdc32ec35"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree__map.html#c233aee38b556eb6e289c29c8a4fd016">key_compare</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#29a42dd3c80af581d77527cfa7db4513">key_comp</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Constant access to the key comparison object sorting the B+ tree. <a href="#29a42dd3c80af581d77527cfa7db4513"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree_1_1value__compare.html">value_compare</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#cdff829c1864ef6e477668f30bf44a2a">value_comp</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Constant access to a constructed value_type comparison object. <a href="#cdff829c1864ef6e477668f30bf44a2a"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#27f0fba6c6ce3313a36408b763bf8548">clear</a> ()</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Frees all key/data pairs and all nodes of the tree. <a href="#27f0fba6c6ce3313a36408b763bf8548"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#5b87df24e750f39e73fcce8e379675be">begin</a> ()</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Constructs a read/data-write iterator that points to the first slot in the first leaf of the B+ tree. <a href="#5b87df24e750f39e73fcce8e379675be"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#3b5fc07a6dd524bc7f8e0783664cbaca">end</a> ()</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Constructs a read/data-write iterator that points to the first invalid slot in the last leaf of the B+ tree. <a href="#3b5fc07a6dd524bc7f8e0783664cbaca"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree_1_1const__iterator.html">const_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#66ac5edf6a4e65b1f80753edfd5367c4">begin</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Constructs a read-only constant iterator that points to the first slot in the first leaf of the B+ tree. <a href="#66ac5edf6a4e65b1f80753edfd5367c4"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree_1_1const__iterator.html">const_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#982b7953fdc14daf91509228fd791607">end</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Constructs a read-only constant iterator that points to the first invalid slot in the last leaf of the B+ tree. <a href="#982b7953fdc14daf91509228fd791607"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree_1_1reverse__iterator.html">reverse_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#fab510271fa2ed968305eee46d2b46b7">rbegin</a> ()</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Constructs a read/data-write reverse iterator that points to the first invalid slot in the last leaf of the B+ tree. <a href="#fab510271fa2ed968305eee46d2b46b7"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree_1_1reverse__iterator.html">reverse_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#e76f34d73b410e8b4e8c431fa7bfe8c1">rend</a> ()</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Constructs a read/data-write reverse iterator that points to the first slot in the first leaf of the B+ tree. <a href="#e76f34d73b410e8b4e8c431fa7bfe8c1"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html">const_reverse_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#39a9f9d276f879710d6e038d962a328e">rbegin</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Constructs a read-only reverse iterator that points to the first invalid slot in the last leaf of the B+ tree. <a href="#39a9f9d276f879710d6e038d962a328e"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html">const_reverse_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#aae6e84940f771935c3f400255223c14">rend</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Constructs a read-only reverse iterator that points to the first slot in the first leaf of the B+ tree. <a href="#aae6e84940f771935c3f400255223c14"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree__map.html#ca5d5599fa2795f4a25e8d5a6e80242d">size_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#fd80539179a05388fc9a2b689054ba28">size</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return the number of key/data pairs in the B+ tree. <a href="#fd80539179a05388fc9a2b689054ba28"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#f99d30caf13ce40648b80d7b0b678222">empty</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Returns true if there is at least one key/data pair in the B+ tree. <a href="#f99d30caf13ce40648b80d7b0b678222"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree__map.html#ca5d5599fa2795f4a25e8d5a6e80242d">size_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#b5a71e47f81a88fb13bb3c7e88383922">max_size</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Returns the largest possible size of the B+ Tree. <a href="#b5a71e47f81a88fb13bb3c7e88383922"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">const <a class="el" href="structstx_1_1btree_1_1tree__stats.html">tree_stats</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#8cb0f856ac71e8c923afdfd1db1c0fe5">get_stats</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return a const reference to the current statistics. <a href="#8cb0f856ac71e8c923afdfd1db1c0fe5"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#9b47a200c1420a05a988c48f912d8b18">exists</a> (const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> &key) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Non-STL function checking whether a key is in the B+ tree. <a href="#9b47a200c1420a05a988c48f912d8b18"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#b09ea1baac9483fa6cdec5944352309f">find</a> (const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> &key)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Tries to locate a key in the B+ tree and returns an iterator to the key/data slot if found. <a href="#b09ea1baac9483fa6cdec5944352309f"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree_1_1const__iterator.html">const_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#6bd62582fbd9abcb205543bdaa814309">find</a> (const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> &key) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Tries to locate a key in the B+ tree and returns an constant iterator to the key/data slot if found. <a href="#6bd62582fbd9abcb205543bdaa814309"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree__map.html#ca5d5599fa2795f4a25e8d5a6e80242d">size_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#8b9b2a16bc790eabbe09f0d87db2283d">count</a> (const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> &key) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Tries to locate a key in the B+ tree and returns the number of identical key entries found. <a href="#8b9b2a16bc790eabbe09f0d87db2283d"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#9faf7b0543cbe6484bb14607350756d9">lower_bound</a> (const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> &key)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Searches the B+ tree and returns an iterator to the first key less or equal to the parameter. <a href="#9faf7b0543cbe6484bb14607350756d9"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree_1_1const__iterator.html">const_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#ddf50ec517bbb6e31055d89ae53d1595">lower_bound</a> (const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> &key) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Searches the B+ tree and returns an constant iterator to the first key less or equal to the parameter. <a href="#ddf50ec517bbb6e31055d89ae53d1595"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#66d2fcd14195e498274ab8917cd13bec">upper_bound</a> (const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> &key)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Searches the B+ tree and returns an iterator to the first key greater than the parameter. <a href="#66d2fcd14195e498274ab8917cd13bec"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree_1_1const__iterator.html">const_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#67659d8e4a4f62f78c6fc727637477c4">upper_bound</a> (const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> &key) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Searches the B+ tree and returns an constant iterator to the first key greater than the parameter. <a href="#67659d8e4a4f62f78c6fc727637477c4"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">std::pair< <a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a>, <a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> > </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#3afaea18889502a9566bbf50b5850343">equal_range</a> (const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> &key)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Searches the B+ tree and returns both <a class="el" 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> and <a class="el" 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>. <a href="#3afaea18889502a9566bbf50b5850343"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">std::pair< <a class="el" href="classstx_1_1btree_1_1const__iterator.html">const_iterator</a>, <br>
<a class="el" href="classstx_1_1btree_1_1const__iterator.html">const_iterator</a> > </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#b690cad91308196f0599a6462f9f3b3a">equal_range</a> (const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> &key) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Searches the B+ tree and returns both <a class="el" 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> and <a class="el" 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>. <a href="#b690cad91308196f0599a6462f9f3b3a"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#7b323df7a4b073186e5c6859be002ce3">operator==</a> (const <a class="el" href="classstx_1_1btree__map.html">self</a> &other) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Equality relation of B+ trees of the same type. <a href="#7b323df7a4b073186e5c6859be002ce3"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#031b58b8d8bc32333df20502804bf745">operator!=</a> (const <a class="el" href="classstx_1_1btree__map.html">self</a> &other) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Inequality relation. Based on operator==. <a href="#031b58b8d8bc32333df20502804bf745"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#244be6169080b61f6d08210dde2d9eb0">operator<</a> (const <a class="el" href="classstx_1_1btree__map.html">self</a> &other) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Total ordering relation of B+ trees of the same type. <a href="#244be6169080b61f6d08210dde2d9eb0"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#251659debc458d04d6ada6738c73bf5b">operator></a> (const <a class="el" href="classstx_1_1btree__map.html">self</a> &other) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Greater relation. Based on operator<. <a href="#251659debc458d04d6ada6738c73bf5b"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#4de1327a2f7b4ca358ec3375320e650d">operator<=</a> (const <a class="el" href="classstx_1_1btree__map.html">self</a> &other) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Less-equal relation. Based on operator<. <a href="#4de1327a2f7b4ca358ec3375320e650d"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#8f3c29f24d38ddd589471beac567f3d6">operator>=</a> (const <a class="el" href="classstx_1_1btree__map.html">self</a> &other) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Greater-equal relation. Based on operator<. <a href="#8f3c29f24d38ddd589471beac567f3d6"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree__map.html">self</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#54196c9b520c8436eff8f0f6f56c7146">operator=</a> (const <a class="el" href="classstx_1_1btree__map.html">self</a> &other)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">*** Fast Copy: Assign Operator and Copy Constructors <a href="#54196c9b520c8436eff8f0f6f56c7146"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#c55631114548b5261175199c640cb07d">btree_map</a> (const <a class="el" href="classstx_1_1btree__map.html">self</a> &other)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Copy constructor. <a href="#c55631114548b5261175199c640cb07d"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">std::pair< <a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a>, bool > </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#df36108eef96351d7fa38630573066f9">insert</a> (const <a class="el" href="classstx_1_1btree__map.html#b3e90662e396a7f1b10a7727628b46ed">value_type</a> &x)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Attempt to insert a key/data pair into the B+ tree. <a href="#df36108eef96351d7fa38630573066f9"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">std::pair< <a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a>, bool > </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#47bed0d1ad0c9b0a7e3fdba1469d430f">insert</a> (const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> &key, const <a class="el" href="classstx_1_1btree__map.html#2a0c3c5a2ff8bbd0ab5d2f3477349929">data_type</a> &data)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Attempt to insert a key/data pair into the B+ tree. <a href="#47bed0d1ad0c9b0a7e3fdba1469d430f"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">std::pair< <a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a>, bool > </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#192d38c5b78803a35d0506180eb44454">insert2</a> (const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> &key, const <a class="el" href="classstx_1_1btree__map.html#2a0c3c5a2ff8bbd0ab5d2f3477349929">data_type</a> &data)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Attempt to insert a key/data pair into the B+ tree. <a href="#192d38c5b78803a35d0506180eb44454"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#4aba9bfb366dac25080ef9e19733b9e2">insert</a> (<a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> hint, const <a class="el" href="classstx_1_1btree__map.html#b3e90662e396a7f1b10a7727628b46ed">value_type</a> &x)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Attempt to insert a key/data pair into the B+ tree. <a href="#4aba9bfb366dac25080ef9e19733b9e2"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#7a7f3a4249b133f0b71ae60f2fe6213d">insert2</a> (<a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> hint, const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> &key, const <a class="el" href="classstx_1_1btree__map.html#2a0c3c5a2ff8bbd0ab5d2f3477349929">data_type</a> &data)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Attempt to insert a key/data pair into the B+ tree. <a href="#7a7f3a4249b133f0b71ae60f2fe6213d"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree__map.html#2a0c3c5a2ff8bbd0ab5d2f3477349929">data_type</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#2ce8c6d8cff676eaf3cf5eebe852715b">operator[]</a> (const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> &key)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Returns a reference to the object that is associated with a particular key. <a href="#2ce8c6d8cff676eaf3cf5eebe852715b"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename InputIterator> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#729a6e0eec5864c2273872f304f4b1ca">insert</a> (InputIterator first, InputIterator last)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Attempt to insert the range [first,last) of value_type pairs into the B+ tree. <a href="#729a6e0eec5864c2273872f304f4b1ca"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#c62a19a8e1bc6c1e47ad4a2136cb3b4a">erase_one</a> (const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> &key)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Erases the key/data pairs associated with the given key. <a href="#c62a19a8e1bc6c1e47ad4a2136cb3b4a"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree__map.html#ca5d5599fa2795f4a25e8d5a6e80242d">size_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#8dd1b6d5abc5e9d19f5ce2c602cc2ac0">erase</a> (const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> &key)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Erases all the key/data pairs associated with the given key. <a href="#8dd1b6d5abc5e9d19f5ce2c602cc2ac0"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#7414a2257c95a81734a81591c5e6a2ff">erase</a> (<a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> iter)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Erase the key/data pair referenced by the iterator. <a href="#7414a2257c95a81734a81591c5e6a2ff"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#e3f1517fa5351b83ed8ca397895e53a2">erase</a> (<a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a>, <a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a>)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Erase all key/data pairs in the range [first,last). <a href="#e3f1517fa5351b83ed8ca397895e53a2"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#50de0863f54f6b2aeeef8026601167a4">print</a> (std::ostream &os) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Print out the B+ tree structure with keys onto the given ostream. <a href="#50de0863f54f6b2aeeef8026601167a4"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#8c2cb116ce87ea80dee00d286967e924">print_leaves</a> (std::ostream &os) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Print out only the leaves via the double linked list. <a href="#8c2cb116ce87ea80dee00d286967e924"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#c7c78f35e621b93dde701bf7c5165ee2">verify</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Run a thorough verification of all B+ tree invariants. <a href="#c7c78f35e621b93dde701bf7c5165ee2"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#866a468537769df46395da111fdc584a">dump</a> (std::ostream &os) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Dump the contents of the B+ tree out onto an ostream as a binary image. <a href="#866a468537769df46395da111fdc584a"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#e5b8526fc40d3401d718b45b26c3278d">restore</a> (std::istream &is)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Restore a binary image of a dumped B+ tree from an istream. <a href="#e5b8526fc40d3401d718b45b26c3278d"></a><br></td></tr>
<tr><td colspan="2"><br><h2>Static Public Attributes</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static const unsigned short </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#ca6265c154fd937a7b309629109246e1">leafslotmax</a> = <a class="el" href="classstx_1_1btree.html#12a39ca671e962924f4acf879a44eafc">btree_impl::leafslotmax</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Base B+ tree parameter: The number of key/data slots in each leaf. <a href="#ca6265c154fd937a7b309629109246e1"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static const unsigned short </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#33170e3a298381f94277ad9b3ff58059">innerslotmax</a> = <a class="el" href="classstx_1_1btree.html#83a18c2fb7f4e9cfd47ce7545d004324">btree_impl::innerslotmax</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Base B+ tree parameter: The number of key slots in each inner node, this can differ from slots in each leaf. <a href="#33170e3a298381f94277ad9b3ff58059"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static const unsigned short </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#f378c4efd1fd861ce9d7c269afaa5655">minleafslots</a> = <a class="el" href="classstx_1_1btree.html#c53c2fe18cd06916a25c3b2a6e0486eb">btree_impl::minleafslots</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Computed B+ tree parameter: The minimum number of key/data slots used in a leaf. <a href="#f378c4efd1fd861ce9d7c269afaa5655"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static const unsigned short </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#6a031aced77527fb9199bf34d4619b50">mininnerslots</a> = <a class="el" href="classstx_1_1btree.html#14312352a7289cee65f1793b0183f60e">btree_impl::mininnerslots</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Computed B+ tree parameter: The minimum number of key slots used in an inner node. <a href="#6a031aced77527fb9199bf34d4619b50"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static const bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#ea80b18edf998ef8c1209bb202f253e3">selfverify</a> = <a class="el" href="classstx_1_1btree.html#ee2e25b0fccc7147fd8be0bcf8630b5b">btree_impl::selfverify</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Debug parameter: Enables expensive and thorough checking of the B+ tree invariants after each insert/erase operation. <a href="#ea80b18edf998ef8c1209bb202f253e3"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static const bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#1036f5d3c20c320ec9c755b291f42b2f">debug</a> = <a class="el" href="classstx_1_1btree.html#ac6ff74fe9fb9e87958d73c28cb9eef4">btree_impl::debug</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Debug parameter: Prints out lots of debug information about how the algorithms change the tree. <a href="#1036f5d3c20c320ec9c755b291f42b2f"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static const bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#93046a545dd2455ecbdf0eda4bbff7f2">allow_duplicates</a> = <a class="el" href="classstx_1_1btree.html#35378979c13861883affefda9ad95df7">btree_impl::allow_duplicates</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Operational parameter: Allow duplicate keys in the <a class="el" href="classstx_1_1btree.html" title="Basic class implementing a base B+ tree data structure in memory.">btree</a>. <a href="#93046a545dd2455ecbdf0eda4bbff7f2"></a><br></td></tr>
<tr><td colspan="2"><br><h2>Private Attributes</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree.html">btree_impl</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3">tree</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">The contained implementation object. <a href="#17330e6f6b0071c7920acfdff30420a3"></a><br></td></tr>
</table>
<hr><a name="_details"></a><h2>Detailed Description</h2>
<h3>template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>><br>
class stx::btree_map< _Key, _Data, _Compare, _Traits ></h3>
Specialized B+ tree template class implementing STL's map container.
<p>
Implements the STL map using a B+ tree. It can be used as a drop-in replacement for std::map. Not all asymptotic time requirements are met in theory. There is no allocator template parameter, instead the class has a traits class defining B+ tree properties like slots and self-verification.<p>
Most noteworthy difference to the default red-black implementation of std::map is that the B+ tree does not hold key and data pair together in memory. Instead each B+ tree node has two arrays of keys and data values. This design directly generates many problems in implementing the iterator's operator's which return value_type composition pairs.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00048">48</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<hr><h2>Member Typedef Documentation</h2>
<a class="anchor" name="040c329011765fdb3b936b873a6775a7"></a><!-- doxytag: member="stx::btree_map::key_type" ref="040c329011765fdb3b936b873a6775a7" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">typedef _Key <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
First template parameter: The key type of the <a class="el" href="classstx_1_1btree.html" title="Basic class implementing a base B+ tree data structure in memory.">btree</a>.
<p>
This is stored in inner nodes and leaves
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00055">55</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="2a0c3c5a2ff8bbd0ab5d2f3477349929"></a><!-- doxytag: member="stx::btree_map::data_type" ref="2a0c3c5a2ff8bbd0ab5d2f3477349929" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">typedef _Data <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__map.html#2a0c3c5a2ff8bbd0ab5d2f3477349929">data_type</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Second template parameter: The data type associated with each key.
<p>
Stored in the B+ tree's leaves
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00059">59</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="c233aee38b556eb6e289c29c8a4fd016"></a><!-- doxytag: member="stx::btree_map::key_compare" ref="c233aee38b556eb6e289c29c8a4fd016" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">typedef _Compare <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__map.html#c233aee38b556eb6e289c29c8a4fd016">key_compare</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Third template parameter: Key comparison function object.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00062">62</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="92185c97f9bf9a0960500ff6832d36bb"></a><!-- doxytag: member="stx::btree_map::traits" ref="92185c97f9bf9a0960500ff6832d36bb" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">typedef _Traits <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__map.html#92185c97f9bf9a0960500ff6832d36bb">traits</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Fourth template parameter: Traits object used to define more parameters of the B+ tree.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00066">66</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="df6c0694ac1ef102249b7a461ca29f8f"></a><!-- doxytag: member="stx::btree_map::self" ref="df6c0694ac1ef102249b7a461ca29f8f" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">typedef <a class="el" href="classstx_1_1btree__map.html">btree_map</a><<a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a>, <a class="el" href="classstx_1_1btree__map.html#2a0c3c5a2ff8bbd0ab5d2f3477349929">data_type</a>, <a class="el" href="classstx_1_1btree__map.html#c233aee38b556eb6e289c29c8a4fd016">key_compare</a>, <a class="el" href="classstx_1_1btree__map.html#92185c97f9bf9a0960500ff6832d36bb">traits</a>> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__map.html">self</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Typedef of our own type.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00077">77</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="b3e90662e396a7f1b10a7727628b46ed"></a><!-- doxytag: member="stx::btree_map::value_type" ref="b3e90662e396a7f1b10a7727628b46ed" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">typedef std::pair<<a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a>, <a class="el" href="classstx_1_1btree__map.html#2a0c3c5a2ff8bbd0ab5d2f3477349929">data_type</a>> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__map.html#b3e90662e396a7f1b10a7727628b46ed">value_type</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Construct the STL-required value_type as a composition pair of key and data types.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00081">81</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="08c651604225cb6789ebe400150d3c7b"></a><!-- doxytag: member="stx::btree_map::btree_impl" ref="08c651604225cb6789ebe400150d3c7b" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">typedef <a class="el" href="classstx_1_1btree.html">stx::btree</a><<a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a>, <a class="el" href="classstx_1_1btree__map.html#2a0c3c5a2ff8bbd0ab5d2f3477349929">data_type</a>, <a class="el" href="classstx_1_1btree__map.html#b3e90662e396a7f1b10a7727628b46ed">value_type</a>, <a class="el" href="classstx_1_1btree__map.html#c233aee38b556eb6e289c29c8a4fd016">key_compare</a>, <a class="el" href="classstx_1_1btree__map.html#92185c97f9bf9a0960500ff6832d36bb">traits</a>, false> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree.html">btree_impl</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Implementation type of the btree_base.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00084">84</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="309f2cd66f9d561b3b84f9bdecc21d28"></a><!-- doxytag: member="stx::btree_map::value_compare" ref="309f2cd66f9d561b3b84f9bdecc21d28" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">typedef <a class="el" href="classstx_1_1btree_1_1value__compare.html">btree_impl::value_compare</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree_1_1value__compare.html">value_compare</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Function class comparing two value_type pairs.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00087">87</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="ca5d5599fa2795f4a25e8d5a6e80242d"></a><!-- doxytag: member="stx::btree_map::size_type" ref="ca5d5599fa2795f4a25e8d5a6e80242d" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">typedef <a class="el" href="classstx_1_1btree.html#973470864b67129983ea4e1aa2132ac5">btree_impl::size_type</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__map.html#ca5d5599fa2795f4a25e8d5a6e80242d">size_type</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Size type used to count keys.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00090">90</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="ec915e6aa26b1d02e56d00ee3dfebd62"></a><!-- doxytag: member="stx::btree_map::tree_stats" ref="ec915e6aa26b1d02e56d00ee3dfebd62" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">typedef <a class="el" href="structstx_1_1btree_1_1tree__stats.html">btree_impl::tree_stats</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="structstx_1_1btree_1_1tree__stats.html">tree_stats</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Small structure containing statistics about the tree.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00093">93</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="01212d10908d847a786f1ceecf0f78f2"></a><!-- doxytag: member="stx::btree_map::iterator" ref="01212d10908d847a786f1ceecf0f78f2" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">typedef <a class="el" href="classstx_1_1btree_1_1iterator.html">btree_impl::iterator</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
STL-like iterator object for B+ tree items.
<p>
The iterator points to a specific slot number in a leaf.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00132">132</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="30b37125561a2a00ba45c319d8985c7d"></a><!-- doxytag: member="stx::btree_map::const_iterator" ref="30b37125561a2a00ba45c319d8985c7d" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">typedef <a class="el" href="classstx_1_1btree_1_1const__iterator.html">btree_impl::const_iterator</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree_1_1const__iterator.html">const_iterator</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
STL-like iterator object for B+ tree items.
<p>
The iterator points to a specific slot number in a leaf.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00136">136</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="1c89ffe5afb190c7af6892e256db04f8"></a><!-- doxytag: member="stx::btree_map::reverse_iterator" ref="1c89ffe5afb190c7af6892e256db04f8" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">typedef <a class="el" href="classstx_1_1btree_1_1reverse__iterator.html">btree_impl::reverse_iterator</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree_1_1reverse__iterator.html">reverse_iterator</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
create mutable reverse iterator by using STL magic
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00139">139</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="f7ffc8a2f9d5d820c0e923c0581ae880"></a><!-- doxytag: member="stx::btree_map::const_reverse_iterator" ref="f7ffc8a2f9d5d820c0e923c0581ae880" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">typedef <a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html">btree_impl::const_reverse_iterator</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html">const_reverse_iterator</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
create constant reverse iterator by using STL magic
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00142">142</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<hr><h2>Constructor & Destructor Documentation</h2>
<a class="anchor" name="9b26ac9097c5438cdae800d92d695582"></a><!-- doxytag: member="stx::btree_map::btree_map" ref="9b26ac9097c5438cdae800d92d695582" args="()" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__map.html">btree_map</a> </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Default constructor initializing an empty B+ tree with the standard key comparison function.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00155">155</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="605efd0b48822a0baa8ef3367a6504c0"></a><!-- doxytag: member="stx::btree_map::btree_map" ref="605efd0b48822a0baa8ef3367a6504c0" args="(const key_compare &kcf)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__map.html">btree_map</a> </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html#c233aee38b556eb6e289c29c8a4fd016">key_compare</a> & </td>
<td class="paramname"> <em>kcf</em> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Constructor initializing an empty B+ tree with a special key comparison object.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00162">162</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="d8de818b0844d29afe834cd53feb86dd"></a><!-- doxytag: member="stx::btree_map::btree_map" ref="d8de818b0844d29afe834cd53feb86dd" args="(InputIterator first, InputIterator last)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<div class="memtemplate">
template<class InputIterator> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__map.html">btree_map</a> </td>
<td>(</td>
<td class="paramtype">InputIterator </td>
<td class="paramname"> <em>first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">InputIterator </td>
<td class="paramname"> <em>last</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Constructor initializing a B+ tree with the range [first,last).
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00169">169</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="0a5d934afa5f93c149def15447cea989"></a><!-- doxytag: member="stx::btree_map::btree_map" ref="0a5d934afa5f93c149def15447cea989" args="(InputIterator first, InputIterator last, const key_compare &kcf)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<div class="memtemplate">
template<class InputIterator> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__map.html">btree_map</a> </td>
<td>(</td>
<td class="paramtype">InputIterator </td>
<td class="paramname"> <em>first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">InputIterator </td>
<td class="paramname"> <em>last</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html#c233aee38b556eb6e289c29c8a4fd016">key_compare</a> & </td>
<td class="paramname"> <em>kcf</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Constructor initializing a B+ tree with the range [first,last) and a special key comparison object.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00177">177</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="1f6993a6ba2fd05e7cbc80581a765c52"></a><!-- doxytag: member="stx::btree_map::~btree_map" ref="1f6993a6ba2fd05e7cbc80581a765c52" args="()" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::~<a class="el" href="classstx_1_1btree__map.html">btree_map</a> </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Frees up all used B+ tree memory pages.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00183">183</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="c55631114548b5261175199c640cb07d"></a><!-- doxytag: member="stx::btree_map::btree_map" ref="c55631114548b5261175199c640cb07d" args="(const self &other)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__map.html">btree_map</a> </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html">self</a> & </td>
<td class="paramname"> <em>other</em> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Copy constructor.
<p>
The newly initialized B+ tree object will contain a copy of all key/data pairs.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00434">434</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<hr><h2>Member Function Documentation</h2>
<a class="anchor" name="6205397231ca2d69bf82f61cdc32ec35"></a><!-- doxytag: member="stx::btree_map::swap" ref="6205397231ca2d69bf82f61cdc32ec35" args="(self &from)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::swap </td>
<td>(</td>
<td class="paramtype"><a class="el" href="classstx_1_1btree__map.html">self</a> & </td>
<td class="paramname"> <em>from</em> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Fast swapping of two identical B+ tree objects.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00188">188</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="29a42dd3c80af581d77527cfa7db4513"></a><!-- doxytag: member="stx::btree_map::key_comp" ref="29a42dd3c80af581d77527cfa7db4513" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree__map.html#c233aee38b556eb6e289c29c8a4fd016">key_compare</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::key_comp </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Constant access to the key comparison object sorting the B+ tree.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00197">197</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01318">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::key_comp()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="cdff829c1864ef6e477668f30bf44a2a"></a><!-- doxytag: member="stx::btree_map::value_comp" ref="cdff829c1864ef6e477668f30bf44a2a" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree_1_1value__compare.html">value_compare</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::value_comp </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Constant access to a constructed value_type comparison object.
<p>
required by the STL
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00204">204</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>, and <a class="el" href="btree_8h-source.html#l01325">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::value_comp()</a>.</p>
</div>
</div><p>
<a class="anchor" name="27f0fba6c6ce3313a36408b763bf8548"></a><!-- doxytag: member="stx::btree_map::clear" ref="27f0fba6c6ce3313a36408b763bf8548" args="()" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::clear </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Frees all key/data pairs and all nodes of the tree.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00213">213</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01397">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::clear()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="5b87df24e750f39e73fcce8e379675be"></a><!-- doxytag: member="stx::btree_map::begin" ref="5b87df24e750f39e73fcce8e379675be" args="()" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::begin </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Constructs a read/data-write iterator that points to the first slot in the first leaf of the B+ tree.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00223">223</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01443">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::begin()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="3b5fc07a6dd524bc7f8e0783664cbaca"></a><!-- doxytag: member="stx::btree_map::end" ref="3b5fc07a6dd524bc7f8e0783664cbaca" args="()" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::end </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Constructs a read/data-write iterator that points to the first invalid slot in the last leaf of the B+ tree.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00230">230</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01450">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::end()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="66ac5edf6a4e65b1f80753edfd5367c4"></a><!-- doxytag: member="stx::btree_map::begin" ref="66ac5edf6a4e65b1f80753edfd5367c4" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree_1_1const__iterator.html">const_iterator</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::begin </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Constructs a read-only constant iterator that points to the first slot in the first leaf of the B+ tree.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00237">237</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01443">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::begin()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="982b7953fdc14daf91509228fd791607"></a><!-- doxytag: member="stx::btree_map::end" ref="982b7953fdc14daf91509228fd791607" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree_1_1const__iterator.html">const_iterator</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::end </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Constructs a read-only constant iterator that points to the first invalid slot in the last leaf of the B+ tree.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00244">244</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01450">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::end()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="fab510271fa2ed968305eee46d2b46b7"></a><!-- doxytag: member="stx::btree_map::rbegin" ref="fab510271fa2ed968305eee46d2b46b7" args="()" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree_1_1reverse__iterator.html">reverse_iterator</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::rbegin </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Constructs a read/data-write reverse iterator that points to the first invalid slot in the last leaf of the B+ tree.
<p>
Uses STL magic.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00251">251</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01471">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::rbegin()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="e76f34d73b410e8b4e8c431fa7bfe8c1"></a><!-- doxytag: member="stx::btree_map::rend" ref="e76f34d73b410e8b4e8c431fa7bfe8c1" args="()" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree_1_1reverse__iterator.html">reverse_iterator</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::rend </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Constructs a read/data-write reverse iterator that points to the first slot in the first leaf of the B+ tree.
<p>
Uses STL magic.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00258">258</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01478">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::rend()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="39a9f9d276f879710d6e038d962a328e"></a><!-- doxytag: member="stx::btree_map::rbegin" ref="39a9f9d276f879710d6e038d962a328e" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html">const_reverse_iterator</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::rbegin </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Constructs a read-only reverse iterator that points to the first invalid slot in the last leaf of the B+ tree.
<p>
Uses STL magic.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00265">265</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01471">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::rbegin()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="aae6e84940f771935c3f400255223c14"></a><!-- doxytag: member="stx::btree_map::rend" ref="aae6e84940f771935c3f400255223c14" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html">const_reverse_iterator</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::rend </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Constructs a read-only reverse iterator that points to the first slot in the first leaf of the B+ tree.
<p>
Uses STL magic.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00272">272</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01478">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::rend()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="fd80539179a05388fc9a2b689054ba28"></a><!-- doxytag: member="stx::btree_map::size" ref="fd80539179a05388fc9a2b689054ba28" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree__map.html#ca5d5599fa2795f4a25e8d5a6e80242d">size_type</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::size </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Return the number of key/data pairs in the B+ tree.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00281">281</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01598">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::size()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="f99d30caf13ce40648b80d7b0b678222"></a><!-- doxytag: member="stx::btree_map::empty" ref="f99d30caf13ce40648b80d7b0b678222" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::empty </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Returns true if there is at least one key/data pair in the B+ tree.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00287">287</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01604">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::empty()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="b5a71e47f81a88fb13bb3c7e88383922"></a><!-- doxytag: member="stx::btree_map::max_size" ref="b5a71e47f81a88fb13bb3c7e88383922" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree__map.html#ca5d5599fa2795f4a25e8d5a6e80242d">size_type</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::max_size </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Returns the largest possible size of the B+ Tree.
<p>
This is just a function required by the STL standard, the B+ Tree can hold more items.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00294">294</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01611">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::max_size()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="8cb0f856ac71e8c923afdfd1db1c0fe5"></a><!-- doxytag: member="stx::btree_map::get_stats" ref="8cb0f856ac71e8c923afdfd1db1c0fe5" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">const <a class="el" href="structstx_1_1btree_1_1tree__stats.html">tree_stats</a>& <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::get_stats </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Return a const reference to the current statistics.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00300">300</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01617">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::get_stats()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="9b47a200c1420a05a988c48f912d8b18"></a><!-- doxytag: member="stx::btree_map::exists" ref="9b47a200c1420a05a988c48f912d8b18" args="(const key_type &key) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::exists </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> & </td>
<td class="paramname"> <em>key</em> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Non-STL function checking whether a key is in the B+ tree.
<p>
The same as (find(k) != <a class="el" 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>) or (<a class="el" 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> != 0).
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00310">310</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01627">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::exists()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="b09ea1baac9483fa6cdec5944352309f"></a><!-- doxytag: member="stx::btree_map::find" ref="b09ea1baac9483fa6cdec5944352309f" args="(const key_type &key)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::find </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> & </td>
<td class="paramname"> <em>key</em> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Tries to locate a key in the B+ tree and returns an iterator to the key/data slot if found.
<p>
If unsuccessful it returns <a class="el" 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>.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00317">317</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01648">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::find()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="6bd62582fbd9abcb205543bdaa814309"></a><!-- doxytag: member="stx::btree_map::find" ref="6bd62582fbd9abcb205543bdaa814309" args="(const key_type &key) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree_1_1const__iterator.html">const_iterator</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::find </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> & </td>
<td class="paramname"> <em>key</em> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Tries to locate a key in the B+ tree and returns an constant iterator to the key/data slot if found.
<p>
If unsuccessful it returns <a class="el" 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>.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00324">324</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01648">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::find()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="8b9b2a16bc790eabbe09f0d87db2283d"></a><!-- doxytag: member="stx::btree_map::count" ref="8b9b2a16bc790eabbe09f0d87db2283d" args="(const key_type &key) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree__map.html#ca5d5599fa2795f4a25e8d5a6e80242d">size_type</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::count </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> & </td>
<td class="paramname"> <em>key</em> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Tries to locate a key in the B+ tree and returns the number of identical key entries found.
<p>
Since this is a unique map, <a class="el" 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> returns either 0 or 1.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00332">332</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01692">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::count()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="9faf7b0543cbe6484bb14607350756d9"></a><!-- doxytag: member="stx::btree_map::lower_bound" ref="9faf7b0543cbe6484bb14607350756d9" args="(const key_type &key)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::lower_bound </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> & </td>
<td class="paramname"> <em>key</em> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Searches the B+ tree and returns an iterator to the first key less or equal to the parameter.
<p>
If unsuccessful it returns <a class="el" 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>.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00339">339</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01725">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::lower_bound()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="ddf50ec517bbb6e31055d89ae53d1595"></a><!-- doxytag: member="stx::btree_map::lower_bound" ref="ddf50ec517bbb6e31055d89ae53d1595" args="(const key_type &key) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree_1_1const__iterator.html">const_iterator</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::lower_bound </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> & </td>
<td class="paramname"> <em>key</em> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Searches the B+ tree and returns an constant iterator to the first key less or equal to the parameter.
<p>
If unsuccessful it returns <a class="el" 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>.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00346">346</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01725">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::lower_bound()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="66d2fcd14195e498274ab8917cd13bec"></a><!-- doxytag: member="stx::btree_map::upper_bound" ref="66d2fcd14195e498274ab8917cd13bec" args="(const key_type &key)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::upper_bound </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> & </td>
<td class="paramname"> <em>key</em> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Searches the B+ tree and returns an iterator to the first key greater than the parameter.
<p>
If unsuccessful it returns <a class="el" 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>.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00353">353</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>, and <a class="el" href="btree_8h-source.html#l01767">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::upper_bound()</a>.</p>
</div>
</div><p>
<a class="anchor" name="67659d8e4a4f62f78c6fc727637477c4"></a><!-- doxytag: member="stx::btree_map::upper_bound" ref="67659d8e4a4f62f78c6fc727637477c4" args="(const key_type &key) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree_1_1const__iterator.html">const_iterator</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::upper_bound </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> & </td>
<td class="paramname"> <em>key</em> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Searches the B+ tree and returns an constant iterator to the first key greater than the parameter.
<p>
If unsuccessful it returns <a class="el" 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>.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00360">360</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>, and <a class="el" href="btree_8h-source.html#l01767">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::upper_bound()</a>.</p>
</div>
</div><p>
<a class="anchor" name="3afaea18889502a9566bbf50b5850343"></a><!-- doxytag: member="stx::btree_map::equal_range" ref="3afaea18889502a9566bbf50b5850343" args="(const key_type &key)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">std::pair<<a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a>, <a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a>> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::equal_range </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> & </td>
<td class="paramname"> <em>key</em> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Searches the B+ tree and returns both <a class="el" 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> and <a class="el" 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>.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00366">366</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01808">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::equal_range()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="b690cad91308196f0599a6462f9f3b3a"></a><!-- doxytag: member="stx::btree_map::equal_range" ref="b690cad91308196f0599a6462f9f3b3a" args="(const key_type &key) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">std::pair<<a class="el" href="classstx_1_1btree_1_1const__iterator.html">const_iterator</a>, <a class="el" href="classstx_1_1btree_1_1const__iterator.html">const_iterator</a>> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::equal_range </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> & </td>
<td class="paramname"> <em>key</em> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Searches the B+ tree and returns both <a class="el" 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> and <a class="el" 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>.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00372">372</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01808">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::equal_range()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="7b323df7a4b073186e5c6859be002ce3"></a><!-- doxytag: member="stx::btree_map::operator==" ref="7b323df7a4b073186e5c6859be002ce3" args="(const self &other) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::operator== </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html">self</a> & </td>
<td class="paramname"> <em>other</em> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Equality relation of B+ trees of the same type.
<p>
B+ trees of the same size and equal elements (both key and data) are considered equal.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00383">383</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="031b58b8d8bc32333df20502804bf745"></a><!-- doxytag: member="stx::btree_map::operator!=" ref="031b58b8d8bc32333df20502804bf745" args="(const self &other) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::operator!= </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html">self</a> & </td>
<td class="paramname"> <em>other</em> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Inequality relation. Based on operator==.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00389">389</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="244be6169080b61f6d08210dde2d9eb0"></a><!-- doxytag: member="stx::btree_map::operator<" ref="244be6169080b61f6d08210dde2d9eb0" args="(const self &other) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::operator< </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html">self</a> & </td>
<td class="paramname"> <em>other</em> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Total ordering relation of B+ trees of the same type.
<p>
It uses std::lexicographical_compare() for the actual comparison of elements.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00396">396</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="251659debc458d04d6ada6738c73bf5b"></a><!-- doxytag: member="stx::btree_map::operator>" ref="251659debc458d04d6ada6738c73bf5b" args="(const self &other) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::operator> </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html">self</a> & </td>
<td class="paramname"> <em>other</em> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Greater relation. Based on operator<.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00402">402</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="4de1327a2f7b4ca358ec3375320e650d"></a><!-- doxytag: member="stx::btree_map::operator<=" ref="4de1327a2f7b4ca358ec3375320e650d" args="(const self &other) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::operator<= </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html">self</a> & </td>
<td class="paramname"> <em>other</em> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Less-equal relation. Based on operator<.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00408">408</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="8f3c29f24d38ddd589471beac567f3d6"></a><!-- doxytag: member="stx::btree_map::operator>=" ref="8f3c29f24d38ddd589471beac567f3d6" args="(const self &other) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::operator>= </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html">self</a> & </td>
<td class="paramname"> <em>other</em> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Greater-equal relation. Based on operator<.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00414">414</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="54196c9b520c8436eff8f0f6f56c7146"></a><!-- doxytag: member="stx::btree_map::operator=" ref="54196c9b520c8436eff8f0f6f56c7146" args="(const self &other)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree__map.html">self</a>& <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::operator= </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html">self</a> & </td>
<td class="paramname"> <em>other</em> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
*** Fast Copy: Assign Operator and Copy Constructors
<p>
Assignment operator. All the key/data pairs are copied
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00423">423</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="df36108eef96351d7fa38630573066f9"></a><!-- doxytag: member="stx::btree_map::insert" ref="df36108eef96351d7fa38630573066f9" args="(const value_type &x)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">std::pair<<a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a>, bool> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::insert </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html#b3e90662e396a7f1b10a7727628b46ed">value_type</a> & </td>
<td class="paramname"> <em>x</em> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Attempt to insert a key/data pair into the B+ tree.
<p>
Fails if the pair is already present.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00444">444</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01971">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::insert2()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
<p>Referenced by <a class="el" href="btree__map_8h-source.html#l00483">stx::btree_map< _Key, _Data, _Compare, _Traits >::operator[]()</a>.</p>
</div>
</div><p>
<a class="anchor" name="47bed0d1ad0c9b0a7e3fdba1469d430f"></a><!-- doxytag: member="stx::btree_map::insert" ref="47bed0d1ad0c9b0a7e3fdba1469d430f" args="(const key_type &key, const data_type &data)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">std::pair<<a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a>, bool> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::insert </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> & </td>
<td class="paramname"> <em>key</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html#2a0c3c5a2ff8bbd0ab5d2f3477349929">data_type</a> & </td>
<td class="paramname"> <em>data</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Attempt to insert a key/data pair into the B+ tree.
<p>
Beware that if key_type == data_type, then the template iterator <a class="el" href="classstx_1_1btree__map.html#df36108eef96351d7fa38630573066f9" title="Attempt to insert a key/data pair into the B+ tree.">insert()</a> is called instead. Fails if the inserted pair is already present.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00452">452</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01971">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::insert2()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="192d38c5b78803a35d0506180eb44454"></a><!-- doxytag: member="stx::btree_map::insert2" ref="192d38c5b78803a35d0506180eb44454" args="(const key_type &key, const data_type &data)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">std::pair<<a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a>, bool> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::insert2 </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> & </td>
<td class="paramname"> <em>key</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html#2a0c3c5a2ff8bbd0ab5d2f3477349929">data_type</a> & </td>
<td class="paramname"> <em>data</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Attempt to insert a key/data pair into the B+ tree.
<p>
This function is the same as the other insert, however if key_type == data_type then the non-template function cannot be called. Fails if the inserted pair is already present.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00461">461</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01971">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::insert2()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="4aba9bfb366dac25080ef9e19733b9e2"></a><!-- doxytag: member="stx::btree_map::insert" ref="4aba9bfb366dac25080ef9e19733b9e2" args="(iterator hint, const value_type &x)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::insert </td>
<td>(</td>
<td class="paramtype"><a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> </td>
<td class="paramname"> <em>hint</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html#b3e90662e396a7f1b10a7727628b46ed">value_type</a> & </td>
<td class="paramname"> <em>x</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Attempt to insert a key/data pair into the B+ tree.
<p>
The iterator hint is currently ignored by the B+ tree insertion routine.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00468">468</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01971">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::insert2()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="7a7f3a4249b133f0b71ae60f2fe6213d"></a><!-- doxytag: member="stx::btree_map::insert2" ref="7a7f3a4249b133f0b71ae60f2fe6213d" args="(iterator hint, const key_type &key, const data_type &data)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::insert2 </td>
<td>(</td>
<td class="paramtype"><a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> </td>
<td class="paramname"> <em>hint</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> & </td>
<td class="paramname"> <em>key</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html#2a0c3c5a2ff8bbd0ab5d2f3477349929">data_type</a> & </td>
<td class="paramname"> <em>data</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Attempt to insert a key/data pair into the B+ tree.
<p>
The iterator hint is currently ignored by the B+ tree insertion routine.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00475">475</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01971">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::insert2()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="2ce8c6d8cff676eaf3cf5eebe852715b"></a><!-- doxytag: member="stx::btree_map::operator[]" ref="2ce8c6d8cff676eaf3cf5eebe852715b" args="(const key_type &key)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree__map.html#2a0c3c5a2ff8bbd0ab5d2f3477349929">data_type</a>& <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::operator[] </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> & </td>
<td class="paramname"> <em>key</em> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Returns a reference to the object that is associated with a particular key.
<p>
If the map does not already contain such an object, operator[] inserts the default object <a class="el" href="classstx_1_1btree__map.html#2a0c3c5a2ff8bbd0ab5d2f3477349929" title="Second template parameter: The data type associated with each key.">data_type()</a>.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00483">483</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l00469">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::data()</a>, and <a class="el" href="btree__map_8h-source.html#l00444">stx::btree_map< _Key, _Data, _Compare, _Traits >::insert()</a>.</p>
</div>
</div><p>
<a class="anchor" name="729a6e0eec5864c2273872f304f4b1ca"></a><!-- doxytag: member="stx::btree_map::insert" ref="729a6e0eec5864c2273872f304f4b1ca" args="(InputIterator first, InputIterator last)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<div class="memtemplate">
template<typename InputIterator> </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::insert </td>
<td>(</td>
<td class="paramtype">InputIterator </td>
<td class="paramname"> <em>first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">InputIterator </td>
<td class="paramname"> <em>last</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Attempt to insert the range [first,last) of value_type pairs into the B+ tree.
<p>
Each key/data pair is inserted individually.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00492">492</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l01953">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::insert()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="c62a19a8e1bc6c1e47ad4a2136cb3b4a"></a><!-- doxytag: member="stx::btree_map::erase_one" ref="c62a19a8e1bc6c1e47ad4a2136cb3b4a" args="(const key_type &key)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::erase_one </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> & </td>
<td class="paramname"> <em>key</em> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Erases the key/data pairs associated with the given key.
<p>
For this unique-associative map there is no difference to <a class="el" href="classstx_1_1btree__map.html#8dd1b6d5abc5e9d19f5ce2c602cc2ac0" title="Erases all the key/data pairs associated with the given key.">erase()</a>.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00502">502</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l02335">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::erase_one()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="8dd1b6d5abc5e9d19f5ce2c602cc2ac0"></a><!-- doxytag: member="stx::btree_map::erase" ref="8dd1b6d5abc5e9d19f5ce2c602cc2ac0" args="(const key_type &key)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree__map.html#ca5d5599fa2795f4a25e8d5a6e80242d">size_type</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::erase </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__map.html#040c329011765fdb3b936b873a6775a7">key_type</a> & </td>
<td class="paramname"> <em>key</em> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Erases all the key/data pairs associated with the given key.
<p>
This is implemented using <a class="el" href="classstx_1_1btree__map.html#c62a19a8e1bc6c1e47ad4a2136cb3b4a" title="Erases the key/data pairs associated with the given key.">erase_one()</a>.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00509">509</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l02358">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::erase()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="7414a2257c95a81734a81591c5e6a2ff"></a><!-- doxytag: member="stx::btree_map::erase" ref="7414a2257c95a81734a81591c5e6a2ff" args="(iterator iter)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::erase </td>
<td>(</td>
<td class="paramtype"><a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> </td>
<td class="paramname"> <em>iter</em> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Erase the key/data pair referenced by the iterator.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00516">516</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="e3f1517fa5351b83ed8ca397895e53a2"></a><!-- doxytag: member="stx::btree_map::erase" ref="e3f1517fa5351b83ed8ca397895e53a2" args="(iterator, iterator)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::erase </td>
<td>(</td>
<td class="paramtype"><a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> </td>
<td class="paramname">, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> </td>
<td class="paramname"></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Erase all key/data pairs in the range [first,last).
<p>
This function is currently not implemented by the B+ Tree.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00525">525</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="50de0863f54f6b2aeeef8026601167a4"></a><!-- doxytag: member="stx::btree_map::print" ref="50de0863f54f6b2aeeef8026601167a4" args="(std::ostream &os) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::print </td>
<td>(</td>
<td class="paramtype">std::ostream & </td>
<td class="paramname"> <em>os</em> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Print out the B+ tree structure with keys onto the given ostream.
<p>
This function requires that the header is compiled with BTREE_DEBUG and that key_type is printable via std::ostream.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00538">538</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l02979">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::print()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="8c2cb116ce87ea80dee00d286967e924"></a><!-- doxytag: member="stx::btree_map::print_leaves" ref="8c2cb116ce87ea80dee00d286967e924" args="(std::ostream &os) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::print_leaves </td>
<td>(</td>
<td class="paramtype">std::ostream & </td>
<td class="paramname"> <em>os</em> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Print out only the leaves via the double linked list.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00544">544</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l02987">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::print_leaves()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="c7c78f35e621b93dde701bf7c5165ee2"></a><!-- doxytag: member="stx::btree_map::verify" ref="c7c78f35e621b93dde701bf7c5165ee2" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::verify </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Run a thorough verification of all B+ tree invariants.
<p>
The program aborts via <a class="el" href="btree_8h.html#6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT()</a> if something is wrong.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00555">555</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>, and <a class="el" href="btree_8h-source.html#l03053">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::verify()</a>.</p>
</div>
</div><p>
<a class="anchor" name="866a468537769df46395da111fdc584a"></a><!-- doxytag: member="stx::btree_map::dump" ref="866a468537769df46395da111fdc584a" args="(std::ostream &os) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::dump </td>
<td>(</td>
<td class="paramtype">std::ostream & </td>
<td class="paramname"> <em>os</em> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Dump the contents of the B+ tree out onto an ostream as a binary image.
<p>
The image contains memory pointers which will be fixed when the image is restored. For this to work your key_type and data_type must be integral types and contain no pointers or references.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00566">566</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l03270">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::dump()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="e5b8526fc40d3401d718b45b26c3278d"></a><!-- doxytag: member="stx::btree_map::restore" ref="e5b8526fc40d3401d718b45b26c3278d" args="(std::istream &is)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::restore </td>
<td>(</td>
<td class="paramtype">std::istream & </td>
<td class="paramname"> <em>is</em> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Restore a binary image of a dumped B+ tree from an istream.
<p>
The B+ tree pointers are fixed using the dump order. For dump and restore to work your key_type and data_type must be integral types and contain no pointers or references. Returns true if the restore was successful.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00575">575</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l03287">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::restore()</a>, and <a class="el" href="btree__map_8h-source.html#l00148">stx::btree_map< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<hr><h2>Member Data Documentation</h2>
<a class="anchor" name="ca6265c154fd937a7b309629109246e1"></a><!-- doxytag: member="stx::btree_map::leafslotmax" ref="ca6265c154fd937a7b309629109246e1" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">const unsigned short <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__map.html#ca6265c154fd937a7b309629109246e1">leafslotmax</a> = <a class="el" href="classstx_1_1btree.html#12a39ca671e962924f4acf879a44eafc">btree_impl::leafslotmax</a><code> [static]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Base B+ tree parameter: The number of key/data slots in each leaf.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00099">99</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="33170e3a298381f94277ad9b3ff58059"></a><!-- doxytag: member="stx::btree_map::innerslotmax" ref="33170e3a298381f94277ad9b3ff58059" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">const unsigned short <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__map.html#33170e3a298381f94277ad9b3ff58059">innerslotmax</a> = <a class="el" href="classstx_1_1btree.html#83a18c2fb7f4e9cfd47ce7545d004324">btree_impl::innerslotmax</a><code> [static]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Base B+ tree parameter: The number of key slots in each inner node, this can differ from slots in each leaf.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00103">103</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="f378c4efd1fd861ce9d7c269afaa5655"></a><!-- doxytag: member="stx::btree_map::minleafslots" ref="f378c4efd1fd861ce9d7c269afaa5655" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">const unsigned short <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__map.html#f378c4efd1fd861ce9d7c269afaa5655">minleafslots</a> = <a class="el" href="classstx_1_1btree.html#c53c2fe18cd06916a25c3b2a6e0486eb">btree_impl::minleafslots</a><code> [static]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Computed B+ tree parameter: The minimum number of key/data slots used in a leaf.
<p>
If fewer slots are used, the leaf will be merged or slots shifted from it's siblings.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00108">108</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="6a031aced77527fb9199bf34d4619b50"></a><!-- doxytag: member="stx::btree_map::mininnerslots" ref="6a031aced77527fb9199bf34d4619b50" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">const unsigned short <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__map.html#6a031aced77527fb9199bf34d4619b50">mininnerslots</a> = <a class="el" href="classstx_1_1btree.html#14312352a7289cee65f1793b0183f60e">btree_impl::mininnerslots</a><code> [static]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Computed B+ tree parameter: The minimum number of key slots used in an inner node.
<p>
If fewer slots are used, the inner node will be merged or slots shifted from it's siblings.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00113">113</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="ea80b18edf998ef8c1209bb202f253e3"></a><!-- doxytag: member="stx::btree_map::selfverify" ref="ea80b18edf998ef8c1209bb202f253e3" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">const bool <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__map.html#ea80b18edf998ef8c1209bb202f253e3">selfverify</a> = <a class="el" href="classstx_1_1btree.html#ee2e25b0fccc7147fd8be0bcf8630b5b">btree_impl::selfverify</a><code> [static]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Debug parameter: Enables expensive and thorough checking of the B+ tree invariants after each insert/erase operation.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00117">117</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="1036f5d3c20c320ec9c755b291f42b2f"></a><!-- doxytag: member="stx::btree_map::debug" ref="1036f5d3c20c320ec9c755b291f42b2f" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">const bool <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__map.html#1036f5d3c20c320ec9c755b291f42b2f">debug</a> = <a class="el" href="classstx_1_1btree.html#ac6ff74fe9fb9e87958d73c28cb9eef4">btree_impl::debug</a><code> [static]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Debug parameter: Prints out lots of debug information about how the algorithms change the tree.
<p>
Requires the header file to be compiled with BTREE_DEBUG and the key type must be std::ostream printable.
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00122">122</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="93046a545dd2455ecbdf0eda4bbff7f2"></a><!-- doxytag: member="stx::btree_map::allow_duplicates" ref="93046a545dd2455ecbdf0eda4bbff7f2" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname">const bool <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__map.html#93046a545dd2455ecbdf0eda4bbff7f2">allow_duplicates</a> = <a class="el" href="classstx_1_1btree.html#35378979c13861883affefda9ad95df7">btree_impl::allow_duplicates</a><code> [static]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Operational parameter: Allow duplicate keys in the <a class="el" href="classstx_1_1btree.html" title="Basic class implementing a base B+ tree data structure in memory.">btree</a>.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00125">125</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="17330e6f6b0071c7920acfdff30420a3"></a><!-- doxytag: member="stx::btree_map::tree" ref="17330e6f6b0071c7920acfdff30420a3" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree.html">btree_impl</a> <a class="el" href="classstx_1_1btree__map.html">stx::btree_map</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__map.html#17330e6f6b0071c7920acfdff30420a3">tree</a><code> [private]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
The contained implementation object.
<p>
<p>Definition at line <a class="el" href="btree__map_8h-source.html#l00148">148</a> of file <a class="el" href="btree__map_8h-source.html">btree_map.h</a>.</p>
<p>Referenced by <a class="el" href="btree__map_8h-source.html#l00223">stx::btree_map< _Key, _Data, _Compare, _Traits >::begin()</a>, <a class="el" href="btree__map_8h-source.html#l00213">stx::btree_map< _Key, _Data, _Compare, _Traits >::clear()</a>, <a class="el" href="btree__map_8h-source.html#l00332">stx::btree_map< _Key, _Data, _Compare, _Traits >::count()</a>, <a class="el" href="btree__map_8h-source.html#l00566">stx::btree_map< _Key, _Data, _Compare, _Traits >::dump()</a>, <a class="el" href="btree__map_8h-source.html#l00287">stx::btree_map< _Key, _Data, _Compare, _Traits >::empty()</a>, <a class="el" href="btree__map_8h-source.html#l00230">stx::btree_map< _Key, _Data, _Compare, _Traits >::end()</a>, <a class="el" href="btree__map_8h-source.html#l00366">stx::btree_map< _Key, _Data, _Compare, _Traits >::equal_range()</a>, <a class="el" href="btree__map_8h-source.html#l00509">stx::btree_map< _Key, _Data, _Compare, _Traits >::erase()</a>, <a class="el" href="btree__map_8h-source.html#l00502">stx::btree_map< _Key, _Data, _Compare, _Traits >::erase_one()</a>, <a class="el" href="btree__map_8h-source.html#l00310">stx::btree_map< _Key, _Data, _Compare, _Traits >::exists()</a>, <a class="el" href="btree__map_8h-source.html#l00317">stx::btree_map< _Key, _Data, _Compare, _Traits >::find()</a>, <a class="el" href="btree__map_8h-source.html#l00300">stx::btree_map< _Key, _Data, _Compare, _Traits >::get_stats()</a>, <a class="el" href="btree__map_8h-source.html#l00444">stx::btree_map< _Key, _Data, _Compare, _Traits >::insert()</a>, <a class="el" href="btree__map_8h-source.html#l00461">stx::btree_map< _Key, _Data, _Compare, _Traits >::insert2()</a>, <a class="el" href="btree__map_8h-source.html#l00197">stx::btree_map< _Key, _Data, _Compare, _Traits >::key_comp()</a>, <a class="el" href="btree__map_8h-source.html#l00339">stx::btree_map< _Key, _Data, _Compare, _Traits >::lower_bound()</a>, <a class="el" href="btree__map_8h-source.html#l00294">stx::btree_map< _Key, _Data, _Compare, _Traits >::max_size()</a>, <a class="el" href="btree__map_8h-source.html#l00389">stx::btree_map< _Key, _Data, _Compare, _Traits >::operator!=()</a>, <a class="el" href="btree__map_8h-source.html#l00396">stx::btree_map< _Key, _Data, _Compare, _Traits >::operator<()</a>, <a class="el" href="btree__map_8h-source.html#l00408">stx::btree_map< _Key, _Data, _Compare, _Traits >::operator<=()</a>, <a class="el" href="btree__map_8h-source.html#l00423">stx::btree_map< _Key, _Data, _Compare, _Traits >::operator=()</a>, <a class="el" href="btree__map_8h-source.html#l00383">stx::btree_map< _Key, _Data, _Compare, _Traits >::operator==()</a>, <a class="el" href="btree__map_8h-source.html#l00402">stx::btree_map< _Key, _Data, _Compare, _Traits >::operator>()</a>, <a class="el" href="btree__map_8h-source.html#l00414">stx::btree_map< _Key, _Data, _Compare, _Traits >::operator>=()</a>, <a class="el" href="btree__map_8h-source.html#l00538">stx::btree_map< _Key, _Data, _Compare, _Traits >::print()</a>, <a class="el" href="btree__map_8h-source.html#l00544">stx::btree_map< _Key, _Data, _Compare, _Traits >::print_leaves()</a>, <a class="el" href="btree__map_8h-source.html#l00251">stx::btree_map< _Key, _Data, _Compare, _Traits >::rbegin()</a>, <a class="el" href="btree__map_8h-source.html#l00258">stx::btree_map< _Key, _Data, _Compare, _Traits >::rend()</a>, <a class="el" href="btree__map_8h-source.html#l00575">stx::btree_map< _Key, _Data, _Compare, _Traits >::restore()</a>, <a class="el" href="btree__map_8h-source.html#l00281">stx::btree_map< _Key, _Data, _Compare, _Traits >::size()</a>, <a class="el" href="btree__map_8h-source.html#l00188">stx::btree_map< _Key, _Data, _Compare, _Traits >::swap()</a>, <a class="el" href="btree__map_8h-source.html#l00353">stx::btree_map< _Key, _Data, _Compare, _Traits >::upper_bound()</a>, <a class="el" href="btree__map_8h-source.html#l00204">stx::btree_map< _Key, _Data, _Compare, _Traits >::value_comp()</a>, and <a class="el" href="btree__map_8h-source.html#l00555">stx::btree_map< _Key, _Data, _Compare, _Traits >::verify()</a>.</p>
</div>
</div><p>
<hr>The documentation for this class was generated from the following file:<ul>
<li>stx/<a class="el" href="btree__map_8h-source.html">btree_map.h</a></ul>
</div>
<hr size="1"><address style="text-align: right;"><small>Generated on Sun Sep 7 17:32:39 2008 for STX B+ Tree Template Classes by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.6 </small></address>
</body>
</html>
