<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
<title>STX B+ Tree Template Classes: stx::btree_multimap< _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__multimap.html">btree_multimap</a>
</div>
</div>
<div class="contents">
<h1>stx::btree_multimap< _Key, _Data, _Compare, _Traits > Class Template Reference</h1><!-- doxytag: class="stx::btree_multimap" -->Specialized B+ tree template class implementing STL's multimap container.
<a href="#_details">More...</a>
<p>
<code>#include <<a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>></code>
<p>
<p>
<a href="classstx_1_1btree__multimap-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__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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="#3f9770bfb59a9d96ef15b4155917df17"></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__multimap.html#5670a7625a2d6ab91b5c16de28b5af38">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="#5670a7625a2d6ab91b5c16de28b5af38"></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__multimap.html#1ed6f1cb42f6df972cfc822678c3db39">key_compare</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Third template parameter: Key comparison function object. <a href="#1ed6f1cb42f6df972cfc822678c3db39"></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__multimap.html#2171edbe912d2a5d75344780a8f9b14a">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="#2171edbe912d2a5d75344780a8f9b14a"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <a class="el" href="classstx_1_1btree__multimap.html">btree_multimap</a><br>
< <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">key_type</a>, <a class="el" href="classstx_1_1btree__multimap.html#5670a7625a2d6ab91b5c16de28b5af38">data_type</a>, <br>
<a class="el" href="classstx_1_1btree__multimap.html#1ed6f1cb42f6df972cfc822678c3db39">key_compare</a>, <a class="el" href="classstx_1_1btree__multimap.html#2171edbe912d2a5d75344780a8f9b14a">traits</a> > </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__multimap.html#b7c3372073e85028f623964b24473183">self</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Typedef of our own type. <a href="#b7c3372073e85028f623964b24473183"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef std::pair< <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">key_type</a>, <br>
<a class="el" href="classstx_1_1btree__multimap.html#5670a7625a2d6ab91b5c16de28b5af38">data_type</a> > </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__multimap.html#713f2c9cb9aa2dd6d139118f34d5528d">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="#713f2c9cb9aa2dd6d139118f34d5528d"></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__multimap.html#3f9770bfb59a9d96ef15b4155917df17">key_type</a>, <br>
<a class="el" href="classstx_1_1btree__multimap.html#5670a7625a2d6ab91b5c16de28b5af38">data_type</a>, <a class="el" href="classstx_1_1btree__multimap.html#713f2c9cb9aa2dd6d139118f34d5528d">value_type</a>, <br>
<a class="el" href="classstx_1_1btree__multimap.html#1ed6f1cb42f6df972cfc822678c3db39">key_compare</a>, <a class="el" href="classstx_1_1btree__multimap.html#2171edbe912d2a5d75344780a8f9b14a">traits</a>, true > </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__multimap.html#abb706739b81157697fef40056c4c6d8">btree_impl</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Implementation type of the btree_base. <a href="#abb706739b81157697fef40056c4c6d8"></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__multimap.html#d6890cbbe302b9b3f8feee67bdee4d6f">value_compare</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Function class comparing two value_type pairs. <a href="#d6890cbbe302b9b3f8feee67bdee4d6f"></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__multimap.html#357de6af8bb93e1d17c4964d593fadf3">size_type</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Size type used to count keys. <a href="#357de6af8bb93e1d17c4964d593fadf3"></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__multimap.html#86799a8aa7f54ba6d156aa749f18cb27">tree_stats</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Small structure containing statistics about the tree. <a href="#86799a8aa7f54ba6d156aa749f18cb27"></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__multimap.html#86673aa76d61a01c408eed51f2895b98">iterator</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">STL-like iterator object for B+ tree items. <a href="#86673aa76d61a01c408eed51f2895b98"></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__multimap.html#12bfb41ca874bb5a4a851e4a094525cf">const_iterator</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">STL-like iterator object for B+ tree items. <a href="#12bfb41ca874bb5a4a851e4a094525cf"></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__multimap.html#307913dd10bd05b88055b300983eb032">reverse_iterator</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">create mutable reverse iterator by using STL magic <a href="#307913dd10bd05b88055b300983eb032"></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__multimap.html#309cfcb261ab68de6f3292d7faee5062">const_reverse_iterator</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">create constant reverse iterator by using STL magic <a href="#309cfcb261ab68de6f3292d7faee5062"></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__multimap.html#de0e7d413605528815a852ef4235f5a6">btree_multimap</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="#de0e7d413605528815a852ef4235f5a6"></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__multimap.html#4c71fb624324770f8df4827979e92582">btree_multimap</a> (const <a class="el" href="classstx_1_1btree__multimap.html#1ed6f1cb42f6df972cfc822678c3db39">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="#4c71fb624324770f8df4827979e92582"></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__multimap.html#dc612c0aa92ffbd052237a8e500839dc">btree_multimap</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="#dc612c0aa92ffbd052237a8e500839dc"></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__multimap.html#b4d3c68239214f0c83738aa2b45ea4bf">btree_multimap</a> (InputIterator first, InputIterator last, const <a class="el" href="classstx_1_1btree__multimap.html#1ed6f1cb42f6df972cfc822678c3db39">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="#b4d3c68239214f0c83738aa2b45ea4bf"></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__multimap.html#38bf0d5a5c312b27fde719d447020365">~btree_multimap</a> ()</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Frees up all used B+ tree memory pages. <a href="#38bf0d5a5c312b27fde719d447020365"></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__multimap.html#5cb0337f0ee86b27d02a72bbae9de644">swap</a> (<a class="el" href="classstx_1_1btree__multimap.html">self</a> &from)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Fast swapping of two identical B+ tree objects. <a href="#5cb0337f0ee86b27d02a72bbae9de644"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree__multimap.html#1ed6f1cb42f6df972cfc822678c3db39">key_compare</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__multimap.html#64c2fa75a15eba90621e42a86989c415">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="#64c2fa75a15eba90621e42a86989c415"></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__multimap.html#b8b33ba0183a2e71d32278ff669a317f">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="#b8b33ba0183a2e71d32278ff669a317f"></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__multimap.html#c3b0ecbcf50799298c6c5d5cdb73aa93">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="#c3b0ecbcf50799298c6c5d5cdb73aa93"></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__multimap.html#f6933cb429397867499bcd349896d565">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="#f6933cb429397867499bcd349896d565"></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__multimap.html#4f5377b914193e004f2df3e8ed19548e">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="#4f5377b914193e004f2df3e8ed19548e"></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__multimap.html#16cf4c6889cba5166d5212370f9c1596">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="#16cf4c6889cba5166d5212370f9c1596"></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__multimap.html#e42db1ac48770afefb2e9f3b08b75a59">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="#e42db1ac48770afefb2e9f3b08b75a59"></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__multimap.html#f9ad7a69fa816e15b9aaefe31046513c">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="#f9ad7a69fa816e15b9aaefe31046513c"></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__multimap.html#906eefcb41829b71b9ee3114583ddee8">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="#906eefcb41829b71b9ee3114583ddee8"></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__multimap.html#9ab9f5b34e2c284e880b3511c00a6740">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="#9ab9f5b34e2c284e880b3511c00a6740"></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__multimap.html#5ccfcbe81650e9a7f2c1a306e555fd6e">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="#5ccfcbe81650e9a7f2c1a306e555fd6e"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree__multimap.html#357de6af8bb93e1d17c4964d593fadf3">size_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__multimap.html#22e55714cbad60996975e15714aff711">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="#22e55714cbad60996975e15714aff711"></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__multimap.html#03e88b6cd0d1c00d26729938d496d5ce">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="#03e88b6cd0d1c00d26729938d496d5ce"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree__multimap.html#357de6af8bb93e1d17c4964d593fadf3">size_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__multimap.html#617b607b97fb9dee9c1e38b9b23c2d67">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="#617b607b97fb9dee9c1e38b9b23c2d67"></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__multimap.html#7a9ce64eb5f04ebd6aa0310dd85b780e">get_stats</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return a const reference to the current statistics. <a href="#7a9ce64eb5f04ebd6aa0310dd85b780e"></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__multimap.html#aadc23a68e8fd1e0aa8dcff55485e747">exists</a> (const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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="#aadc23a68e8fd1e0aa8dcff55485e747"></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__multimap.html#bbf5e8d61645d62fff7137bedccb5e55">find</a> (const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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="#bbf5e8d61645d62fff7137bedccb5e55"></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__multimap.html#1391b5839733b6dd4e06c25d76c03cc2">find</a> (const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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="#1391b5839733b6dd4e06c25d76c03cc2"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree__multimap.html#357de6af8bb93e1d17c4964d593fadf3">size_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__multimap.html#caaee3ddcf27e58998ec181afe43ee4d">count</a> (const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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="#caaee3ddcf27e58998ec181afe43ee4d"></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__multimap.html#2eae97b3022645b3b7e963a30b72e3a2">lower_bound</a> (const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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="#2eae97b3022645b3b7e963a30b72e3a2"></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__multimap.html#f54859746ea56ec65c06eea0ec8d5392">lower_bound</a> (const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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="#f54859746ea56ec65c06eea0ec8d5392"></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__multimap.html#6fba83fee886d32cf654be485b95ace8">upper_bound</a> (const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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="#6fba83fee886d32cf654be485b95ace8"></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__multimap.html#73af10f9f04c2608909ef1df28a1813b">upper_bound</a> (const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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="#73af10f9f04c2608909ef1df28a1813b"></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__multimap.html#05f7c107afe6e204572a43a9d7629657">equal_range</a> (const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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__multimap.html#2eae97b3022645b3b7e963a30b72e3a2" 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__multimap.html#6fba83fee886d32cf654be485b95ace8" title="Searches the B+ tree and returns an iterator to the first key greater than the parameter...">upper_bound()</a>. <a href="#05f7c107afe6e204572a43a9d7629657"></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__multimap.html#23e3f501cf7dca06bdd763a76b9e3071">equal_range</a> (const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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__multimap.html#2eae97b3022645b3b7e963a30b72e3a2" 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__multimap.html#6fba83fee886d32cf654be485b95ace8" title="Searches the B+ tree and returns an iterator to the first key greater than the parameter...">upper_bound()</a>. <a href="#23e3f501cf7dca06bdd763a76b9e3071"></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__multimap.html#93a221e69a8969141871d1c7de20cf12">operator==</a> (const <a class="el" href="classstx_1_1btree__multimap.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="#93a221e69a8969141871d1c7de20cf12"></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__multimap.html#92edd01ba26727fecbe5128cf798c049">operator!=</a> (const <a class="el" href="classstx_1_1btree__multimap.html">self</a> &other) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Inequality relation. Based on operator==. <a href="#92edd01ba26727fecbe5128cf798c049"></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__multimap.html#2e8708a140fefa623dec2e39dc7251de">operator<</a> (const <a class="el" href="classstx_1_1btree__multimap.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="#2e8708a140fefa623dec2e39dc7251de"></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__multimap.html#e6ecd7ce94f108a353ef902c9d54d92f">operator></a> (const <a class="el" href="classstx_1_1btree__multimap.html">self</a> &other) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Greater relation. Based on operator<. <a href="#e6ecd7ce94f108a353ef902c9d54d92f"></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__multimap.html#7c50b60fd464410ef8c268bee34f9720">operator<=</a> (const <a class="el" href="classstx_1_1btree__multimap.html">self</a> &other) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Less-equal relation. Based on operator<. <a href="#7c50b60fd464410ef8c268bee34f9720"></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__multimap.html#022ccd2bcfc9af5a8b6f27db5fa25e9e">operator>=</a> (const <a class="el" href="classstx_1_1btree__multimap.html">self</a> &other) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Greater-equal relation. Based on operator<. <a href="#022ccd2bcfc9af5a8b6f27db5fa25e9e"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree__multimap.html">self</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__multimap.html#08c0ca122dcbb89c61c7422d678b816b">operator=</a> (const <a class="el" href="classstx_1_1btree__multimap.html">self</a> &other)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">*** Fast Copy: Assign Operator and Copy Constructors <a href="#08c0ca122dcbb89c61c7422d678b816b"></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__multimap.html#835ec6395b6330f02210057adda1af36">btree_multimap</a> (const <a class="el" href="classstx_1_1btree__multimap.html">self</a> &other)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Copy constructor. <a href="#835ec6395b6330f02210057adda1af36"></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__multimap.html#9702f35a744aef532a2211ea3d58ab4b">insert</a> (const <a class="el" href="classstx_1_1btree__multimap.html#713f2c9cb9aa2dd6d139118f34d5528d">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="#9702f35a744aef532a2211ea3d58ab4b"></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__multimap.html#26187a33e283076bde1b80adecbd3bcb">insert</a> (const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">key_type</a> &key, const <a class="el" href="classstx_1_1btree__multimap.html#5670a7625a2d6ab91b5c16de28b5af38">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="#26187a33e283076bde1b80adecbd3bcb"></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__multimap.html#fb966a7cf5219322577c6175adb32ad0">insert2</a> (const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">key_type</a> &key, const <a class="el" href="classstx_1_1btree__multimap.html#5670a7625a2d6ab91b5c16de28b5af38">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="#fb966a7cf5219322577c6175adb32ad0"></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__multimap.html#1344221bd23d34d77f6b93595858b49d">insert</a> (<a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> hint, const <a class="el" href="classstx_1_1btree__multimap.html#713f2c9cb9aa2dd6d139118f34d5528d">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="#1344221bd23d34d77f6b93595858b49d"></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__multimap.html#da70224bef62e5022cbed2fe569b5a92">insert2</a> (<a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> hint, const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">key_type</a> &key, const <a class="el" href="classstx_1_1btree__multimap.html#5670a7625a2d6ab91b5c16de28b5af38">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="#da70224bef62e5022cbed2fe569b5a92"></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__multimap.html#bfc9e342c17d427f6cc426ad2264173d">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="#bfc9e342c17d427f6cc426ad2264173d"></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__multimap.html#557bdf2f67b70d222c4042bb70015987">erase_one</a> (const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">key_type</a> &key)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Erases one (the first) of the key/data pairs associated with the given key. <a href="#557bdf2f67b70d222c4042bb70015987"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree__multimap.html#357de6af8bb93e1d17c4964d593fadf3">size_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree__multimap.html#dfed0b8c0ba1dff6ed2ab1ca2cfae94a">erase</a> (const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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="#dfed0b8c0ba1dff6ed2ab1ca2cfae94a"></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__multimap.html#cc52e7baa53b29cbc6f7c5043cb3d560">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="#cc52e7baa53b29cbc6f7c5043cb3d560"></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__multimap.html#53cc9810fbf2b9fc5c44fd186867c051">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="#53cc9810fbf2b9fc5c44fd186867c051"></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__multimap.html#b27a4f7547a8bc0ad3d6a850e22cfbf9">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="#b27a4f7547a8bc0ad3d6a850e22cfbf9"></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__multimap.html#cf6d5e78c9e4a13ae2d3fe5c8f5d1dfd">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="#cf6d5e78c9e4a13ae2d3fe5c8f5d1dfd"></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__multimap.html#1b2ae1c14872499483091546f360ea68">verify</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Run a thorough verification of all B+ tree invariants. <a href="#1b2ae1c14872499483091546f360ea68"></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__multimap.html#0e7c74852a6ed850fe77d11ed381066e">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="#0e7c74852a6ed850fe77d11ed381066e"></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__multimap.html#aa339e8a98e3f48f6d16856001b685bb">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="#aa339e8a98e3f48f6d16856001b685bb"></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__multimap.html#3982e943e752ec6de4046c466d2ad7b7">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="#3982e943e752ec6de4046c466d2ad7b7"></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__multimap.html#80d9ff893243947f019f27172de0bedc">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="#80d9ff893243947f019f27172de0bedc"></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__multimap.html#85aa5335bbd6797e91ace4da0f65c256">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="#85aa5335bbd6797e91ace4da0f65c256"></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__multimap.html#8dcf58359cf1d8c5a1704bcb244fd486">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="#8dcf58359cf1d8c5a1704bcb244fd486"></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__multimap.html#3fe2765d6c487fe321c2bdfe242abba6">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="#3fe2765d6c487fe321c2bdfe242abba6"></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__multimap.html#4e64657f25be2fbf1fc3e08b58e0c802">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="#4e64657f25be2fbf1fc3e08b58e0c802"></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__multimap.html#0e1e483bc720416c3e8d3edeb683e361">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="#0e1e483bc720416c3e8d3edeb683e361"></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__multimap.html#44a03a8797e1fee6560ba19600c37336">tree</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">The contained implementation object. <a href="#44a03a8797e1fee6560ba19600c37336"></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_multimap< _Key, _Data, _Compare, _Traits ></h3>
Specialized B+ tree template class implementing STL's multimap container.
<p>
Implements the STL multimap using a B+ tree. It can be used as a drop-in replacement for std::multimap. 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::multimap 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__multimap_8h-source.html#l00049">49</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
<hr><h2>Member Typedef Documentation</h2>
<a class="anchor" name="3f9770bfb59a9d96ef15b4155917df17"></a><!-- doxytag: member="stx::btree_multimap::key_type" ref="3f9770bfb59a9d96ef15b4155917df17" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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__multimap_8h-source.html#l00056">56</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="5670a7625a2d6ab91b5c16de28b5af38"></a><!-- doxytag: member="stx::btree_multimap::data_type" ref="5670a7625a2d6ab91b5c16de28b5af38" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__multimap.html#5670a7625a2d6ab91b5c16de28b5af38">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__multimap_8h-source.html#l00060">60</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="1ed6f1cb42f6df972cfc822678c3db39"></a><!-- doxytag: member="stx::btree_multimap::key_compare" ref="1ed6f1cb42f6df972cfc822678c3db39" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__multimap.html#1ed6f1cb42f6df972cfc822678c3db39">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__multimap_8h-source.html#l00063">63</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="2171edbe912d2a5d75344780a8f9b14a"></a><!-- doxytag: member="stx::btree_multimap::traits" ref="2171edbe912d2a5d75344780a8f9b14a" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__multimap.html#2171edbe912d2a5d75344780a8f9b14a">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__multimap_8h-source.html#l00067">67</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="b7c3372073e85028f623964b24473183"></a><!-- doxytag: member="stx::btree_multimap::self" ref="b7c3372073e85028f623964b24473183" 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__multimap.html">btree_multimap</a><<a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">key_type</a>, <a class="el" href="classstx_1_1btree__multimap.html#5670a7625a2d6ab91b5c16de28b5af38">data_type</a>, <a class="el" href="classstx_1_1btree__multimap.html#1ed6f1cb42f6df972cfc822678c3db39">key_compare</a>, <a class="el" href="classstx_1_1btree__multimap.html#2171edbe912d2a5d75344780a8f9b14a">traits</a>> <a class="el" href="classstx_1_1btree__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__multimap.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__multimap_8h-source.html#l00078">78</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="713f2c9cb9aa2dd6d139118f34d5528d"></a><!-- doxytag: member="stx::btree_multimap::value_type" ref="713f2c9cb9aa2dd6d139118f34d5528d" 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__multimap.html#3f9770bfb59a9d96ef15b4155917df17">key_type</a>, <a class="el" href="classstx_1_1btree__multimap.html#5670a7625a2d6ab91b5c16de28b5af38">data_type</a>> <a class="el" href="classstx_1_1btree__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__multimap.html#713f2c9cb9aa2dd6d139118f34d5528d">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__multimap_8h-source.html#l00082">82</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="abb706739b81157697fef40056c4c6d8"></a><!-- doxytag: member="stx::btree_multimap::btree_impl" ref="abb706739b81157697fef40056c4c6d8" 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__multimap.html#3f9770bfb59a9d96ef15b4155917df17">key_type</a>, <a class="el" href="classstx_1_1btree__multimap.html#5670a7625a2d6ab91b5c16de28b5af38">data_type</a>, <a class="el" href="classstx_1_1btree__multimap.html#713f2c9cb9aa2dd6d139118f34d5528d">value_type</a>, <a class="el" href="classstx_1_1btree__multimap.html#1ed6f1cb42f6df972cfc822678c3db39">key_compare</a>, <a class="el" href="classstx_1_1btree__multimap.html#2171edbe912d2a5d75344780a8f9b14a">traits</a>, true> <a class="el" href="classstx_1_1btree__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00085">85</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="d6890cbbe302b9b3f8feee67bdee4d6f"></a><!-- doxytag: member="stx::btree_multimap::value_compare" ref="d6890cbbe302b9b3f8feee67bdee4d6f" 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__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00088">88</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="357de6af8bb93e1d17c4964d593fadf3"></a><!-- doxytag: member="stx::btree_multimap::size_type" ref="357de6af8bb93e1d17c4964d593fadf3" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__multimap.html#357de6af8bb93e1d17c4964d593fadf3">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__multimap_8h-source.html#l00091">91</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="86799a8aa7f54ba6d156aa749f18cb27"></a><!-- doxytag: member="stx::btree_multimap::tree_stats" ref="86799a8aa7f54ba6d156aa749f18cb27" 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__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00094">94</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="86673aa76d61a01c408eed51f2895b98"></a><!-- doxytag: member="stx::btree_multimap::iterator" ref="86673aa76d61a01c408eed51f2895b98" 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__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00133">133</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="12bfb41ca874bb5a4a851e4a094525cf"></a><!-- doxytag: member="stx::btree_multimap::const_iterator" ref="12bfb41ca874bb5a4a851e4a094525cf" 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__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00137">137</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="307913dd10bd05b88055b300983eb032"></a><!-- doxytag: member="stx::btree_multimap::reverse_iterator" ref="307913dd10bd05b88055b300983eb032" 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__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00140">140</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="309cfcb261ab68de6f3292d7faee5062"></a><!-- doxytag: member="stx::btree_multimap::const_reverse_iterator" ref="309cfcb261ab68de6f3292d7faee5062" 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__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00143">143</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<hr><h2>Constructor & Destructor Documentation</h2>
<a class="anchor" name="de0e7d413605528815a852ef4235f5a6"></a><!-- doxytag: member="stx::btree_multimap::btree_multimap" ref="de0e7d413605528815a852ef4235f5a6" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__multimap.html">btree_multimap</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__multimap_8h-source.html#l00156">156</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="4c71fb624324770f8df4827979e92582"></a><!-- doxytag: member="stx::btree_multimap::btree_multimap" ref="4c71fb624324770f8df4827979e92582" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__multimap.html">btree_multimap</a> </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__multimap.html#1ed6f1cb42f6df972cfc822678c3db39">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__multimap_8h-source.html#l00163">163</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="dc612c0aa92ffbd052237a8e500839dc"></a><!-- doxytag: member="stx::btree_multimap::btree_multimap" ref="dc612c0aa92ffbd052237a8e500839dc" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__multimap.html">btree_multimap</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__multimap_8h-source.html#l00170">170</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="b4d3c68239214f0c83738aa2b45ea4bf"></a><!-- doxytag: member="stx::btree_multimap::btree_multimap" ref="b4d3c68239214f0c83738aa2b45ea4bf" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__multimap.html">btree_multimap</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__multimap.html#1ed6f1cb42f6df972cfc822678c3db39">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__multimap_8h-source.html#l00178">178</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="38bf0d5a5c312b27fde719d447020365"></a><!-- doxytag: member="stx::btree_multimap::~btree_multimap" ref="38bf0d5a5c312b27fde719d447020365" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::~<a class="el" href="classstx_1_1btree__multimap.html">btree_multimap</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__multimap_8h-source.html#l00184">184</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="835ec6395b6330f02210057adda1af36"></a><!-- doxytag: member="stx::btree_multimap::btree_multimap" ref="835ec6395b6330f02210057adda1af36" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__multimap.html">btree_multimap</a> </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__multimap.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 or all key/data pairs.
<p>Definition at line <a class="el" href="btree__multimap_8h-source.html#l00434">434</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<hr><h2>Member Function Documentation</h2>
<a class="anchor" name="5cb0337f0ee86b27d02a72bbae9de644"></a><!-- doxytag: member="stx::btree_multimap::swap" ref="5cb0337f0ee86b27d02a72bbae9de644" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::swap </td>
<td>(</td>
<td class="paramtype"><a class="el" href="classstx_1_1btree__multimap.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__multimap_8h-source.html#l00189">189</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
<p>References <a class="el" href="btree__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="64c2fa75a15eba90621e42a86989c415"></a><!-- doxytag: member="stx::btree_multimap::key_comp" ref="64c2fa75a15eba90621e42a86989c415" 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__multimap.html#1ed6f1cb42f6df972cfc822678c3db39">key_compare</a> <a class="el" href="classstx_1_1btree__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00198">198</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="b8b33ba0183a2e71d32278ff669a317f"></a><!-- doxytag: member="stx::btree_multimap::value_comp" ref="b8b33ba0183a2e71d32278ff669a317f" 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__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00205">205</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
<p>References <a class="el" href="btree__multimap_8h-source.html#l00149">stx::btree_multimap< _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="c3b0ecbcf50799298c6c5d5cdb73aa93"></a><!-- doxytag: member="stx::btree_multimap::clear" ref="c3b0ecbcf50799298c6c5d5cdb73aa93" 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__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00214">214</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="f6933cb429397867499bcd349896d565"></a><!-- doxytag: member="stx::btree_multimap::begin" ref="f6933cb429397867499bcd349896d565" 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__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00224">224</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="4f5377b914193e004f2df3e8ed19548e"></a><!-- doxytag: member="stx::btree_multimap::end" ref="4f5377b914193e004f2df3e8ed19548e" 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__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00231">231</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="16cf4c6889cba5166d5212370f9c1596"></a><!-- doxytag: member="stx::btree_multimap::begin" ref="16cf4c6889cba5166d5212370f9c1596" 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__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00238">238</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="e42db1ac48770afefb2e9f3b08b75a59"></a><!-- doxytag: member="stx::btree_multimap::end" ref="e42db1ac48770afefb2e9f3b08b75a59" 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__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00245">245</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="f9ad7a69fa816e15b9aaefe31046513c"></a><!-- doxytag: member="stx::btree_multimap::rbegin" ref="f9ad7a69fa816e15b9aaefe31046513c" 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__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00252">252</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="906eefcb41829b71b9ee3114583ddee8"></a><!-- doxytag: member="stx::btree_multimap::rend" ref="906eefcb41829b71b9ee3114583ddee8" 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__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00259">259</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="9ab9f5b34e2c284e880b3511c00a6740"></a><!-- doxytag: member="stx::btree_multimap::rbegin" ref="9ab9f5b34e2c284e880b3511c00a6740" 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__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00266">266</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="5ccfcbe81650e9a7f2c1a306e555fd6e"></a><!-- doxytag: member="stx::btree_multimap::rend" ref="5ccfcbe81650e9a7f2c1a306e555fd6e" 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__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00273">273</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="22e55714cbad60996975e15714aff711"></a><!-- doxytag: member="stx::btree_multimap::size" ref="22e55714cbad60996975e15714aff711" 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__multimap.html#357de6af8bb93e1d17c4964d593fadf3">size_type</a> <a class="el" href="classstx_1_1btree__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00282">282</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="03e88b6cd0d1c00d26729938d496d5ce"></a><!-- doxytag: member="stx::btree_multimap::empty" ref="03e88b6cd0d1c00d26729938d496d5ce" 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__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00288">288</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="617b607b97fb9dee9c1e38b9b23c2d67"></a><!-- doxytag: member="stx::btree_multimap::max_size" ref="617b607b97fb9dee9c1e38b9b23c2d67" 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__multimap.html#357de6af8bb93e1d17c4964d593fadf3">size_type</a> <a class="el" href="classstx_1_1btree__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00295">295</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="7a9ce64eb5f04ebd6aa0310dd85b780e"></a><!-- doxytag: member="stx::btree_multimap::get_stats" ref="7a9ce64eb5f04ebd6aa0310dd85b780e" 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__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00301">301</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="aadc23a68e8fd1e0aa8dcff55485e747"></a><!-- doxytag: member="stx::btree_multimap::exists" ref="aadc23a68e8fd1e0aa8dcff55485e747" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::exists </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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__multimap.html#4f5377b914193e004f2df3e8ed19548e" 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__multimap.html#caaee3ddcf27e58998ec181afe43ee4d" 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__multimap_8h-source.html#l00311">311</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="bbf5e8d61645d62fff7137bedccb5e55"></a><!-- doxytag: member="stx::btree_multimap::find" ref="bbf5e8d61645d62fff7137bedccb5e55" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::find </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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__multimap.html#4f5377b914193e004f2df3e8ed19548e" 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__multimap_8h-source.html#l00318">318</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="1391b5839733b6dd4e06c25d76c03cc2"></a><!-- doxytag: member="stx::btree_multimap::find" ref="1391b5839733b6dd4e06c25d76c03cc2" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::find </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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__multimap.html#4f5377b914193e004f2df3e8ed19548e" 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__multimap_8h-source.html#l00325">325</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="caaee3ddcf27e58998ec181afe43ee4d"></a><!-- doxytag: member="stx::btree_multimap::count" ref="caaee3ddcf27e58998ec181afe43ee4d" 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__multimap.html#357de6af8bb93e1d17c4964d593fadf3">size_type</a> <a class="el" href="classstx_1_1btree__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::count </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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>
<p>Definition at line <a class="el" href="btree__multimap_8h-source.html#l00332">332</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="2eae97b3022645b3b7e963a30b72e3a2"></a><!-- doxytag: member="stx::btree_multimap::lower_bound" ref="2eae97b3022645b3b7e963a30b72e3a2" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::lower_bound </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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__multimap.html#4f5377b914193e004f2df3e8ed19548e" 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__multimap_8h-source.html#l00339">339</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="f54859746ea56ec65c06eea0ec8d5392"></a><!-- doxytag: member="stx::btree_multimap::lower_bound" ref="f54859746ea56ec65c06eea0ec8d5392" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::lower_bound </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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__multimap.html#4f5377b914193e004f2df3e8ed19548e" 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__multimap_8h-source.html#l00346">346</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="6fba83fee886d32cf654be485b95ace8"></a><!-- doxytag: member="stx::btree_multimap::upper_bound" ref="6fba83fee886d32cf654be485b95ace8" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::upper_bound </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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__multimap.html#4f5377b914193e004f2df3e8ed19548e" 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__multimap_8h-source.html#l00353">353</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
<p>References <a class="el" href="btree__multimap_8h-source.html#l00149">stx::btree_multimap< _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="73af10f9f04c2608909ef1df28a1813b"></a><!-- doxytag: member="stx::btree_multimap::upper_bound" ref="73af10f9f04c2608909ef1df28a1813b" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::upper_bound </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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__multimap.html#4f5377b914193e004f2df3e8ed19548e" 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__multimap_8h-source.html#l00360">360</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
<p>References <a class="el" href="btree__multimap_8h-source.html#l00149">stx::btree_multimap< _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="05f7c107afe6e204572a43a9d7629657"></a><!-- doxytag: member="stx::btree_multimap::equal_range" ref="05f7c107afe6e204572a43a9d7629657" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::equal_range </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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__multimap.html#2eae97b3022645b3b7e963a30b72e3a2" 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__multimap.html#6fba83fee886d32cf654be485b95ace8" 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__multimap_8h-source.html#l00366">366</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="23e3f501cf7dca06bdd763a76b9e3071"></a><!-- doxytag: member="stx::btree_multimap::equal_range" ref="23e3f501cf7dca06bdd763a76b9e3071" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::equal_range </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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__multimap.html#2eae97b3022645b3b7e963a30b72e3a2" 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__multimap.html#6fba83fee886d32cf654be485b95ace8" 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__multimap_8h-source.html#l00372">372</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="93a221e69a8969141871d1c7de20cf12"></a><!-- doxytag: member="stx::btree_multimap::operator==" ref="93a221e69a8969141871d1c7de20cf12" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::operator== </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__multimap.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. Beware of the random ordering of duplicate keys.
<p>Definition at line <a class="el" href="btree__multimap_8h-source.html#l00383">383</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
<p>References <a class="el" href="btree__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="92edd01ba26727fecbe5128cf798c049"></a><!-- doxytag: member="stx::btree_multimap::operator!=" ref="92edd01ba26727fecbe5128cf798c049" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::operator!= </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__multimap.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__multimap_8h-source.html#l00389">389</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
<p>References <a class="el" href="btree__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="2e8708a140fefa623dec2e39dc7251de"></a><!-- doxytag: member="stx::btree_multimap::operator<" ref="2e8708a140fefa623dec2e39dc7251de" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::operator< </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__multimap.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__multimap_8h-source.html#l00396">396</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
<p>References <a class="el" href="btree__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="e6ecd7ce94f108a353ef902c9d54d92f"></a><!-- doxytag: member="stx::btree_multimap::operator>" ref="e6ecd7ce94f108a353ef902c9d54d92f" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::operator> </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__multimap.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__multimap_8h-source.html#l00402">402</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
<p>References <a class="el" href="btree__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="7c50b60fd464410ef8c268bee34f9720"></a><!-- doxytag: member="stx::btree_multimap::operator<=" ref="7c50b60fd464410ef8c268bee34f9720" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::operator<= </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__multimap.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__multimap_8h-source.html#l00408">408</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
<p>References <a class="el" href="btree__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="022ccd2bcfc9af5a8b6f27db5fa25e9e"></a><!-- doxytag: member="stx::btree_multimap::operator>=" ref="022ccd2bcfc9af5a8b6f27db5fa25e9e" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::operator>= </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__multimap.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__multimap_8h-source.html#l00414">414</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
<p>References <a class="el" href="btree__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="08c0ca122dcbb89c61c7422d678b816b"></a><!-- doxytag: member="stx::btree_multimap::operator=" ref="08c0ca122dcbb89c61c7422d678b816b" 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__multimap.html">self</a>& <a class="el" href="classstx_1_1btree__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::operator= </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__multimap.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__multimap_8h-source.html#l00423">423</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
<p>References <a class="el" href="btree__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="9702f35a744aef532a2211ea3d58ab4b"></a><!-- doxytag: member="stx::btree_multimap::insert" ref="9702f35a744aef532a2211ea3d58ab4b" 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"><a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> <a class="el" href="classstx_1_1btree__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::insert </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__multimap.html#713f2c9cb9aa2dd6d139118f34d5528d">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>
As this tree allows duplicates insertion never fails.
<p>Definition at line <a class="el" href="btree__multimap_8h-source.html#l00444">444</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="26187a33e283076bde1b80adecbd3bcb"></a><!-- doxytag: member="stx::btree_multimap::insert" ref="26187a33e283076bde1b80adecbd3bcb" 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"><a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> <a class="el" href="classstx_1_1btree__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::insert </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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__multimap.html#5670a7625a2d6ab91b5c16de28b5af38">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__multimap.html#9702f35a744aef532a2211ea3d58ab4b" title="Attempt to insert a key/data pair into the B+ tree.">insert()</a> is called instead. As this tree allows duplicates insertion never fails.
<p>Definition at line <a class="el" href="btree__multimap_8h-source.html#l00452">452</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="fb966a7cf5219322577c6175adb32ad0"></a><!-- doxytag: member="stx::btree_multimap::insert2" ref="fb966a7cf5219322577c6175adb32ad0" 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"><a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> <a class="el" href="classstx_1_1btree__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::insert2 </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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__multimap.html#5670a7625a2d6ab91b5c16de28b5af38">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. As this tree allows duplicates insertion never fails.
<p>Definition at line <a class="el" href="btree__multimap_8h-source.html#l00461">461</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="1344221bd23d34d77f6b93595858b49d"></a><!-- doxytag: member="stx::btree_multimap::insert" ref="1344221bd23d34d77f6b93595858b49d" 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__multimap.html">stx::btree_multimap</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__multimap.html#713f2c9cb9aa2dd6d139118f34d5528d">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__multimap_8h-source.html#l00468">468</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="da70224bef62e5022cbed2fe569b5a92"></a><!-- doxytag: member="stx::btree_multimap::insert2" ref="da70224bef62e5022cbed2fe569b5a92" 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__multimap.html">stx::btree_multimap</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__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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__multimap.html#5670a7625a2d6ab91b5c16de28b5af38">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__multimap_8h-source.html#l00475">475</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="bfc9e342c17d427f6cc426ad2264173d"></a><!-- doxytag: member="stx::btree_multimap::insert" ref="bfc9e342c17d427f6cc426ad2264173d" 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__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00483">483</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="557bdf2f67b70d222c4042bb70015987"></a><!-- doxytag: member="stx::btree_multimap::erase_one" ref="557bdf2f67b70d222c4042bb70015987" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::erase_one </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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 one (the first) of the key/data pairs associated with the given key.
<p>
<p>Definition at line <a class="el" href="btree__multimap_8h-source.html#l00493">493</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="dfed0b8c0ba1dff6ed2ab1ca2cfae94a"></a><!-- doxytag: member="stx::btree_multimap::erase" ref="dfed0b8c0ba1dff6ed2ab1ca2cfae94a" 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__multimap.html#357de6af8bb93e1d17c4964d593fadf3">size_type</a> <a class="el" href="classstx_1_1btree__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::erase </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree__multimap.html#3f9770bfb59a9d96ef15b4155917df17">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__multimap.html#557bdf2f67b70d222c4042bb70015987" title="Erases one (the first) of the key/data pairs associated with the given key.">erase_one()</a> and thus not very efficient.
<p>Definition at line <a class="el" href="btree__multimap_8h-source.html#l00500">500</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="cc52e7baa53b29cbc6f7c5043cb3d560"></a><!-- doxytag: member="stx::btree_multimap::erase" ref="cc52e7baa53b29cbc6f7c5043cb3d560" 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__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00507">507</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="53cc9810fbf2b9fc5c44fd186867c051"></a><!-- doxytag: member="stx::btree_multimap::erase" ref="53cc9810fbf2b9fc5c44fd186867c051" 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__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00516">516</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="b27a4f7547a8bc0ad3d6a850e22cfbf9"></a><!-- doxytag: member="stx::btree_multimap::print" ref="b27a4f7547a8bc0ad3d6a850e22cfbf9" 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__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00529">529</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="cf6d5e78c9e4a13ae2d3fe5c8f5d1dfd"></a><!-- doxytag: member="stx::btree_multimap::print_leaves" ref="cf6d5e78c9e4a13ae2d3fe5c8f5d1dfd" 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__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00535">535</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="1b2ae1c14872499483091546f360ea68"></a><!-- doxytag: member="stx::btree_multimap::verify" ref="1b2ae1c14872499483091546f360ea68" 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__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00546">546</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
<p>References <a class="el" href="btree__multimap_8h-source.html#l00149">stx::btree_multimap< _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="0e7c74852a6ed850fe77d11ed381066e"></a><!-- doxytag: member="stx::btree_multimap::dump" ref="0e7c74852a6ed850fe77d11ed381066e" 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__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00557">557</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<a class="anchor" name="aa339e8a98e3f48f6d16856001b685bb"></a><!-- doxytag: member="stx::btree_multimap::restore" ref="aa339e8a98e3f48f6d16856001b685bb" 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__multimap.html">stx::btree_multimap</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__multimap_8h-source.html#l00566">566</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.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__multimap_8h-source.html#l00149">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::tree</a>.</p>
</div>
</div><p>
<hr><h2>Member Data Documentation</h2>
<a class="anchor" name="3982e943e752ec6de4046c466d2ad7b7"></a><!-- doxytag: member="stx::btree_multimap::leafslotmax" ref="3982e943e752ec6de4046c466d2ad7b7" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__multimap.html#3982e943e752ec6de4046c466d2ad7b7">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__multimap_8h-source.html#l00100">100</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="80d9ff893243947f019f27172de0bedc"></a><!-- doxytag: member="stx::btree_multimap::innerslotmax" ref="80d9ff893243947f019f27172de0bedc" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__multimap.html#80d9ff893243947f019f27172de0bedc">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__multimap_8h-source.html#l00104">104</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="85aa5335bbd6797e91ace4da0f65c256"></a><!-- doxytag: member="stx::btree_multimap::minleafslots" ref="85aa5335bbd6797e91ace4da0f65c256" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__multimap.html#85aa5335bbd6797e91ace4da0f65c256">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__multimap_8h-source.html#l00109">109</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="8dcf58359cf1d8c5a1704bcb244fd486"></a><!-- doxytag: member="stx::btree_multimap::mininnerslots" ref="8dcf58359cf1d8c5a1704bcb244fd486" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__multimap.html#8dcf58359cf1d8c5a1704bcb244fd486">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__multimap_8h-source.html#l00114">114</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="3fe2765d6c487fe321c2bdfe242abba6"></a><!-- doxytag: member="stx::btree_multimap::selfverify" ref="3fe2765d6c487fe321c2bdfe242abba6" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__multimap.html#3fe2765d6c487fe321c2bdfe242abba6">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__multimap_8h-source.html#l00118">118</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="4e64657f25be2fbf1fc3e08b58e0c802"></a><!-- doxytag: member="stx::btree_multimap::debug" ref="4e64657f25be2fbf1fc3e08b58e0c802" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__multimap.html#4e64657f25be2fbf1fc3e08b58e0c802">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__multimap_8h-source.html#l00123">123</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="0e1e483bc720416c3e8d3edeb683e361"></a><!-- doxytag: member="stx::btree_multimap::allow_duplicates" ref="0e1e483bc720416c3e8d3edeb683e361" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__multimap.html#0e1e483bc720416c3e8d3edeb683e361">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__multimap_8h-source.html#l00126">126</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="44a03a8797e1fee6560ba19600c37336"></a><!-- doxytag: member="stx::btree_multimap::tree" ref="44a03a8797e1fee6560ba19600c37336" 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__multimap.html">stx::btree_multimap</a>< _Key, _Data, _Compare, _Traits >::<a class="el" href="classstx_1_1btree__multimap.html#44a03a8797e1fee6560ba19600c37336">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__multimap_8h-source.html#l00149">149</a> of file <a class="el" href="btree__multimap_8h-source.html">btree_multimap.h</a>.</p>
<p>Referenced by <a class="el" href="btree__multimap_8h-source.html#l00224">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::begin()</a>, <a class="el" href="btree__multimap_8h-source.html#l00214">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::clear()</a>, <a class="el" href="btree__multimap_8h-source.html#l00332">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::count()</a>, <a class="el" href="btree__multimap_8h-source.html#l00557">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::dump()</a>, <a class="el" href="btree__multimap_8h-source.html#l00288">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::empty()</a>, <a class="el" href="btree__multimap_8h-source.html#l00231">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::end()</a>, <a class="el" href="btree__multimap_8h-source.html#l00366">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::equal_range()</a>, <a class="el" href="btree__multimap_8h-source.html#l00500">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::erase()</a>, <a class="el" href="btree__multimap_8h-source.html#l00493">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::erase_one()</a>, <a class="el" href="btree__multimap_8h-source.html#l00311">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::exists()</a>, <a class="el" href="btree__multimap_8h-source.html#l00318">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::find()</a>, <a class="el" href="btree__multimap_8h-source.html#l00301">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::get_stats()</a>, <a class="el" href="btree__multimap_8h-source.html#l00444">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::insert()</a>, <a class="el" href="btree__multimap_8h-source.html#l00461">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::insert2()</a>, <a class="el" href="btree__multimap_8h-source.html#l00198">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::key_comp()</a>, <a class="el" href="btree__multimap_8h-source.html#l00339">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::lower_bound()</a>, <a class="el" href="btree__multimap_8h-source.html#l00295">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::max_size()</a>, <a class="el" href="btree__multimap_8h-source.html#l00389">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::operator!=()</a>, <a class="el" href="btree__multimap_8h-source.html#l00396">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::operator<()</a>, <a class="el" href="btree__multimap_8h-source.html#l00408">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::operator<=()</a>, <a class="el" href="btree__multimap_8h-source.html#l00423">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::operator=()</a>, <a class="el" href="btree__multimap_8h-source.html#l00383">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::operator==()</a>, <a class="el" href="btree__multimap_8h-source.html#l00402">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::operator>()</a>, <a class="el" href="btree__multimap_8h-source.html#l00414">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::operator>=()</a>, <a class="el" href="btree__multimap_8h-source.html#l00529">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::print()</a>, <a class="el" href="btree__multimap_8h-source.html#l00535">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::print_leaves()</a>, <a class="el" href="btree__multimap_8h-source.html#l00252">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::rbegin()</a>, <a class="el" href="btree__multimap_8h-source.html#l00259">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::rend()</a>, <a class="el" href="btree__multimap_8h-source.html#l00566">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::restore()</a>, <a class="el" href="btree__multimap_8h-source.html#l00282">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::size()</a>, <a class="el" href="btree__multimap_8h-source.html#l00189">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::swap()</a>, <a class="el" href="btree__multimap_8h-source.html#l00353">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::upper_bound()</a>, <a class="el" href="btree__multimap_8h-source.html#l00205">stx::btree_multimap< _Key, _Data, _Compare, _Traits >::value_comp()</a>, and <a class="el" href="btree__multimap_8h-source.html#l00546">stx::btree_multimap< _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__multimap_8h-source.html">btree_multimap.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>
