<!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< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator Class 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.html">btree</a>::<a class="el" href="classstx_1_1btree_1_1const__iterator.html">const_iterator</a>
</div>
</div>
<div class="contents">
<h1>stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator Class Reference</h1><!-- doxytag: class="stx::btree::const_iterator" -->STL-like read-only <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a> object for B+ tree items.
<a href="#_details">More...</a>
<p>
<code>#include <<a class="el" href="btree_8h-source.html">btree.h</a>></code>
<p>
<p>
<a href="classstx_1_1btree_1_1const__iterator-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 <a class="el" href="classstx_1_1btree.html#2054714c400894aa8822f0f52bc120cf">btree::key_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#5b65028ba554270fc9e483b303daa431">key_type</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">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>. Returned by <a class="el" href="classstx_1_1btree_1_1const__iterator.html#b57685e4d45fa7aded6d521815f28bad" title="Key of the current slot.">key()</a>. <a href="#5b65028ba554270fc9e483b303daa431"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <a class="el" href="classstx_1_1btree.html#ca29ad902418d86eeb9b9379a38e5fcd">btree::data_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#7ba0058d5b19c1c2025ad795827e85d0">data_type</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">The data 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>. Returned by <a class="el" href="classstx_1_1btree_1_1const__iterator.html#6238d924c309f48f2fc8738a383d48a6" title="Read-only reference to the current data object.">data()</a>. <a href="#7ba0058d5b19c1c2025ad795827e85d0"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <a class="el" href="classstx_1_1btree.html#84c95e7319c922fe297b4acdf2e0910c">btree::value_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#54ba3bd638eba3ad06d390693f834d5a">value_type</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">The value 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>. Returned by <a class="el" href="classstx_1_1btree_1_1const__iterator.html#75c8d475324653ad448aca382c762780" title="Dereference the iterator.">operator*()</a>. <a href="#54ba3bd638eba3ad06d390693f834d5a"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <a class="el" href="classstx_1_1btree.html#f7a75a733f8547491913b0e5b8d11a4e">btree::pair_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#5e113524050bb4bf2700a7f8e0d343dd">pair_type</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">The pair 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="#5e113524050bb4bf2700a7f8e0d343dd"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef const <a class="el" href="classstx_1_1btree_1_1const__iterator.html#54ba3bd638eba3ad06d390693f834d5a">value_type</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#b5742e1d907c75d66953c82c726f55a6">reference</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Reference to the value_type. STL required. <a href="#b5742e1d907c75d66953c82c726f55a6"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef const <a class="el" href="classstx_1_1btree_1_1const__iterator.html#54ba3bd638eba3ad06d390693f834d5a">value_type</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#7c13c3c2d1c3063baaec0290ec9e89a1">pointer</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Pointer to the value_type. STL required. <a href="#7c13c3c2d1c3063baaec0290ec9e89a1"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <br>
std::bidirectional_iterator_tag </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#94d6552fb9477f0d6c7e463028c4b6a9">iterator_category</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">STL-magic <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a> category. <a href="#94d6552fb9477f0d6c7e463028c4b6a9"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef ptrdiff_t </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#1b514d8539ce1d3d2e535254a4f2e603">difference_type</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">STL-magic. <a href="#1b514d8539ce1d3d2e535254a4f2e603"></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">const_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#977f73c4ae2c0e378710996449199643">self</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Our own type. <a href="#977f73c4ae2c0e378710996449199643"></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_1_1const__iterator.html#fbf748c058e755788da0cc0a51e6bad7">const_iterator</a> ()</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Default-Constructor of a const <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a>. <a href="#fbf748c058e755788da0cc0a51e6bad7"></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_1_1const__iterator.html#4c60af20a1b398fe64f1e18d79aa0478">const_iterator</a> (const typename <a class="el" href="structstx_1_1btree_1_1leaf__node.html">btree::leaf_node</a> *l, unsigned short s)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Initializing-Constructor of a const <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a>. <a href="#4c60af20a1b398fe64f1e18d79aa0478"></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_1_1const__iterator.html#e9da619caaf864c8ff450ab6e6e783fe">const_iterator</a> (const <a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> &it)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Copy-constructor from a mutable <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a>. <a href="#e9da619caaf864c8ff450ab6e6e783fe"></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_1_1const__iterator.html#3c861b45c5cc4b1f8d5356f2fb5c5ccd">const_iterator</a> (const <a class="el" href="classstx_1_1btree_1_1reverse__iterator.html">reverse_iterator</a> &it)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Copy-constructor from a mutable reverse <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a>. <a href="#3c861b45c5cc4b1f8d5356f2fb5c5ccd"></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_1_1const__iterator.html#cb0803e93acf0ee8adbe37a27a7bb023">const_iterator</a> (const <a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html">const_reverse_iterator</a> &it)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Copy-constructor from a const reverse <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a>. <a href="#cb0803e93acf0ee8adbe37a27a7bb023"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#b5742e1d907c75d66953c82c726f55a6">reference</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#75c8d475324653ad448aca382c762780">operator*</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Dereference the <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a>. <a href="#75c8d475324653ad448aca382c762780"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#7c13c3c2d1c3063baaec0290ec9e89a1">pointer</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#21393707bc018e2429e786cf2d8c1870">operator-></a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Dereference the <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a>. <a href="#21393707bc018e2429e786cf2d8c1870"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">const <a class="el" href="classstx_1_1btree_1_1const__iterator.html#5b65028ba554270fc9e483b303daa431">key_type</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#b57685e4d45fa7aded6d521815f28bad">key</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Key of the current slot. <a href="#b57685e4d45fa7aded6d521815f28bad"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">const <a class="el" href="classstx_1_1btree_1_1const__iterator.html#7ba0058d5b19c1c2025ad795827e85d0">data_type</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#6238d924c309f48f2fc8738a383d48a6">data</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Read-only reference to the current data object. <a href="#6238d924c309f48f2fc8738a383d48a6"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree_1_1const__iterator.html">self</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#5408c6e484d877de4e3af62ee83d6e98">operator++</a> ()</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Prefix++ advance the <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a> to the next slot. <a href="#5408c6e484d877de4e3af62ee83d6e98"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree_1_1const__iterator.html">self</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#e782a36af74ce768cc8e79b5b99e82f6">operator++</a> (int)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Postfix++ advance the <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a> to the next slot. <a href="#e782a36af74ce768cc8e79b5b99e82f6"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree_1_1const__iterator.html">self</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#5ce3730eb2cb63642fe748d17f35f267">operator--</a> ()</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Prefix-- backstep the <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a> to the last slot. <a href="#5ce3730eb2cb63642fe748d17f35f267"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree_1_1const__iterator.html">self</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#44d6aff6e865a0e906ff7c1273764208">operator--</a> (int)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Postfix-- backstep the <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a> to the last slot. <a href="#44d6aff6e865a0e906ff7c1273764208"></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_1_1const__iterator.html#ba809408f780b903d2f0bee451289a9c">operator==</a> (const <a class="el" href="classstx_1_1btree_1_1const__iterator.html">self</a> &x) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Equality of iterators. <a href="#ba809408f780b903d2f0bee451289a9c"></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_1_1const__iterator.html#1b19065170d8111d9a1dd14f0afc2077">operator!=</a> (const <a class="el" href="classstx_1_1btree_1_1const__iterator.html">self</a> &x) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Inequality of iterators. <a href="#1b19065170d8111d9a1dd14f0afc2077"></a><br></td></tr>
<tr><td colspan="2"><br><h2>Private Attributes</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">const <a class="el" href="structstx_1_1btree_1_1leaf__node.html">btree::leaf_node</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#4d697acee81e71bd0253198f4ba5e7f4">currnode</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">The currently referenced leaf <a class="el" href="structstx_1_1btree_1_1node.html" title="The header structure of each node in-memory.">node</a> of the tree. <a href="#4d697acee81e71bd0253198f4ba5e7f4"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned short </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#09845c35fb432d3b266162afb66f353f">currslot</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Current key/data slot referenced. <a href="#09845c35fb432d3b266162afb66f353f"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#54ba3bd638eba3ad06d390693f834d5a">value_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#eb13d8c406c8104986e8c234efc88cb4">temp_value</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Evil! A temporary value_type to STL-correctly deliver operator* and operator->. <a href="#eb13d8c406c8104986e8c234efc88cb4"></a><br></td></tr>
<tr><td colspan="2"><br><h2>Friends</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">class </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#776e261b45ef26d713a4d105a8d7c240">const_reverse_iterator</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Friendly to the reverse_const_iterator, so it may access the two data items directly. <a href="#776e261b45ef26d713a4d105a8d7c240"></a><br></td></tr>
</table>
<hr><a name="_details"></a><h2>Detailed Description</h2>
<h3>template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false><br>
class stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator</h3>
STL-like read-only <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a> object for B+ tree items.
<p>
The <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a> points to a specific slot number in a leaf.
<p>Definition at line <a class="el" href="btree_8h-source.html#l00565">565</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
<hr><h2>Member Typedef Documentation</h2>
<a class="anchor" name="5b65028ba554270fc9e483b303daa431"></a><!-- doxytag: member="stx::btree::const_iterator::key_type" ref="5b65028ba554270fc9e483b303daa431" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname">typedef <a class="el" href="classstx_1_1btree.html#2054714c400894aa8822f0f52bc120cf">btree::key_type</a> <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::<a class="el" href="classstx_1_1btree_1_1const__iterator.html#5b65028ba554270fc9e483b303daa431">const_iterator::key_type</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
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>. Returned by <a class="el" href="classstx_1_1btree_1_1const__iterator.html#b57685e4d45fa7aded6d521815f28bad" title="Key of the current slot.">key()</a>.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00571">571</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="7ba0058d5b19c1c2025ad795827e85d0"></a><!-- doxytag: member="stx::btree::const_iterator::data_type" ref="7ba0058d5b19c1c2025ad795827e85d0" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname">typedef <a class="el" href="classstx_1_1btree.html#ca29ad902418d86eeb9b9379a38e5fcd">btree::data_type</a> <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::<a class="el" href="classstx_1_1btree_1_1const__iterator.html#7ba0058d5b19c1c2025ad795827e85d0">const_iterator::data_type</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
The data 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>. Returned by <a class="el" href="classstx_1_1btree_1_1const__iterator.html#6238d924c309f48f2fc8738a383d48a6" title="Read-only reference to the current data object.">data()</a>.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00574">574</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="54ba3bd638eba3ad06d390693f834d5a"></a><!-- doxytag: member="stx::btree::const_iterator::value_type" ref="54ba3bd638eba3ad06d390693f834d5a" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname">typedef <a class="el" href="classstx_1_1btree.html#84c95e7319c922fe297b4acdf2e0910c">btree::value_type</a> <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::<a class="el" href="classstx_1_1btree_1_1const__iterator.html#54ba3bd638eba3ad06d390693f834d5a">const_iterator::value_type</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
The value 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>. Returned by <a class="el" href="classstx_1_1btree_1_1const__iterator.html#75c8d475324653ad448aca382c762780" title="Dereference the iterator.">operator*()</a>.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00577">577</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="5e113524050bb4bf2700a7f8e0d343dd"></a><!-- doxytag: member="stx::btree::const_iterator::pair_type" ref="5e113524050bb4bf2700a7f8e0d343dd" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname">typedef <a class="el" href="classstx_1_1btree.html#f7a75a733f8547491913b0e5b8d11a4e">btree::pair_type</a> <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::<a class="el" href="classstx_1_1btree_1_1const__iterator.html#5e113524050bb4bf2700a7f8e0d343dd">const_iterator::pair_type</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
The pair 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>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00580">580</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="b5742e1d907c75d66953c82c726f55a6"></a><!-- doxytag: member="stx::btree::const_iterator::reference" ref="b5742e1d907c75d66953c82c726f55a6" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname">typedef const <a class="el" href="classstx_1_1btree_1_1const__iterator.html#54ba3bd638eba3ad06d390693f834d5a">value_type</a>& <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::<a class="el" href="classstx_1_1btree_1_1const__iterator.html#b5742e1d907c75d66953c82c726f55a6">const_iterator::reference</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Reference to the value_type. STL required.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00583">583</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="7c13c3c2d1c3063baaec0290ec9e89a1"></a><!-- doxytag: member="stx::btree::const_iterator::pointer" ref="7c13c3c2d1c3063baaec0290ec9e89a1" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname">typedef const <a class="el" href="classstx_1_1btree_1_1const__iterator.html#54ba3bd638eba3ad06d390693f834d5a">value_type</a>* <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::<a class="el" href="classstx_1_1btree_1_1const__iterator.html#7c13c3c2d1c3063baaec0290ec9e89a1">const_iterator::pointer</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Pointer to the value_type. STL required.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00586">586</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="94d6552fb9477f0d6c7e463028c4b6a9"></a><!-- doxytag: member="stx::btree::const_iterator::iterator_category" ref="94d6552fb9477f0d6c7e463028c4b6a9" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname">typedef std::bidirectional_iterator_tag <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::<a class="el" href="classstx_1_1btree_1_1const__iterator.html#94d6552fb9477f0d6c7e463028c4b6a9">const_iterator::iterator_category</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
STL-magic <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a> category.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00589">589</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="1b514d8539ce1d3d2e535254a4f2e603"></a><!-- doxytag: member="stx::btree::const_iterator::difference_type" ref="1b514d8539ce1d3d2e535254a4f2e603" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname">typedef ptrdiff_t <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::<a class="el" href="classstx_1_1btree_1_1const__iterator.html#1b514d8539ce1d3d2e535254a4f2e603">const_iterator::difference_type</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
STL-magic.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00592">592</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="977f73c4ae2c0e378710996449199643"></a><!-- doxytag: member="stx::btree::const_iterator::self" ref="977f73c4ae2c0e378710996449199643" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname">typedef <a class="el" href="classstx_1_1btree_1_1const__iterator.html">const_iterator</a> <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::<a class="el" href="classstx_1_1btree_1_1const__iterator.html">const_iterator::self</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Our own type.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00595">595</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<hr><h2>Constructor & Destructor Documentation</h2>
<a class="anchor" name="fbf748c058e755788da0cc0a51e6bad7"></a><!-- doxytag: member="stx::btree::const_iterator::const_iterator" ref="fbf748c058e755788da0cc0a51e6bad7" args="()" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::const_iterator </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Default-Constructor of a const <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a>.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00622">622</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="4c60af20a1b398fe64f1e18d79aa0478"></a><!-- doxytag: member="stx::btree::const_iterator::const_iterator" ref="4c60af20a1b398fe64f1e18d79aa0478" args="(const typename btree::leaf_node *l, unsigned short s)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::const_iterator </td>
<td>(</td>
<td class="paramtype">const typename <a class="el" href="structstx_1_1btree_1_1leaf__node.html">btree::leaf_node</a> * </td>
<td class="paramname"> <em>l</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">unsigned short </td>
<td class="paramname"> <em>s</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>
Initializing-Constructor of a const <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a>.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00627">627</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="e9da619caaf864c8ff450ab6e6e783fe"></a><!-- doxytag: member="stx::btree::const_iterator::const_iterator" ref="e9da619caaf864c8ff450ab6e6e783fe" args="(const iterator &it)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::const_iterator </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree_1_1iterator.html">iterator</a> & </td>
<td class="paramname"> <em>it</em> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Copy-constructor from a mutable <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a>.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00632">632</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="3c861b45c5cc4b1f8d5356f2fb5c5ccd"></a><!-- doxytag: member="stx::btree::const_iterator::const_iterator" ref="3c861b45c5cc4b1f8d5356f2fb5c5ccd" args="(const reverse_iterator &it)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::const_iterator </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree_1_1reverse__iterator.html">reverse_iterator</a> & </td>
<td class="paramname"> <em>it</em> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Copy-constructor from a mutable reverse <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a>.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00637">637</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="cb0803e93acf0ee8adbe37a27a7bb023"></a><!-- doxytag: member="stx::btree::const_iterator::const_iterator" ref="cb0803e93acf0ee8adbe37a27a7bb023" args="(const const_reverse_iterator &it)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::const_iterator </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html">const_reverse_iterator</a> & </td>
<td class="paramname"> <em>it</em> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Copy-constructor from a const reverse <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a>.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00642">642</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<hr><h2>Member Function Documentation</h2>
<a class="anchor" name="75c8d475324653ad448aca382c762780"></a><!-- doxytag: member="stx::btree::const_iterator::operator*" ref="75c8d475324653ad448aca382c762780" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#b5742e1d907c75d66953c82c726f55a6">reference</a> <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::operator* </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Dereference the <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a>.
<p>
Do not use this if possible, use <a class="el" href="classstx_1_1btree_1_1const__iterator.html#b57685e4d45fa7aded6d521815f28bad" title="Key of the current slot.">key()</a> and <a class="el" href="classstx_1_1btree_1_1const__iterator.html#6238d924c309f48f2fc8738a383d48a6" title="Read-only reference to the current data object.">data()</a> instead. The B+ tree does not stored key and data together.
<p>Definition at line <a class="el" href="btree_8h-source.html#l00649">649</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l00601">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::currnode</a>, <a class="el" href="btree_8h-source.html#l00604">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::currslot</a>, <a class="el" href="btree_8h-source.html#l00292">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::slotdata</a>, <a class="el" href="btree_8h-source.html#l00289">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::slotkey</a>, and <a class="el" href="btree_8h-source.html#l00611">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::temp_value</a>.</p>
</div>
</div><p>
<a class="anchor" name="21393707bc018e2429e786cf2d8c1870"></a><!-- doxytag: member="stx::btree::const_iterator::operator->" ref="21393707bc018e2429e786cf2d8c1870" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#7c13c3c2d1c3063baaec0290ec9e89a1">pointer</a> <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::operator-> </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Dereference the <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a>.
<p>
Do not use this if possible, use <a class="el" href="classstx_1_1btree_1_1const__iterator.html#b57685e4d45fa7aded6d521815f28bad" title="Key of the current slot.">key()</a> and <a class="el" href="classstx_1_1btree_1_1const__iterator.html#6238d924c309f48f2fc8738a383d48a6" title="Read-only reference to the current data object.">data()</a> instead. The B+ tree does not stored key and data together.
<p>Definition at line <a class="el" href="btree_8h-source.html#l00659">659</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l00601">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::currnode</a>, <a class="el" href="btree_8h-source.html#l00604">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::currslot</a>, <a class="el" href="btree_8h-source.html#l00292">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::slotdata</a>, <a class="el" href="btree_8h-source.html#l00289">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::slotkey</a>, and <a class="el" href="btree_8h-source.html#l00611">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::temp_value</a>.</p>
</div>
</div><p>
<a class="anchor" name="b57685e4d45fa7aded6d521815f28bad"></a><!-- doxytag: member="stx::btree::const_iterator::key" ref="b57685e4d45fa7aded6d521815f28bad" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname">const <a class="el" href="classstx_1_1btree_1_1const__iterator.html#5b65028ba554270fc9e483b303daa431">key_type</a>& <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::key </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Key of the current slot.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00667">667</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l00601">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::currnode</a>, <a class="el" href="btree_8h-source.html#l00604">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::currslot</a>, and <a class="el" href="btree_8h-source.html#l00289">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::slotkey</a>.</p>
</div>
</div><p>
<a class="anchor" name="6238d924c309f48f2fc8738a383d48a6"></a><!-- doxytag: member="stx::btree::const_iterator::data" ref="6238d924c309f48f2fc8738a383d48a6" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname">const <a class="el" href="classstx_1_1btree_1_1const__iterator.html#7ba0058d5b19c1c2025ad795827e85d0">data_type</a>& <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::data </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Read-only reference to the current data object.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00673">673</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l00601">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::currnode</a>, <a class="el" href="btree_8h-source.html#l00604">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::currslot</a>, and <a class="el" href="btree_8h-source.html#l00292">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::slotdata</a>.</p>
</div>
</div><p>
<a class="anchor" name="5408c6e484d877de4e3af62ee83d6e98"></a><!-- doxytag: member="stx::btree::const_iterator::operator++" ref="5408c6e484d877de4e3af62ee83d6e98" args="()" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree_1_1const__iterator.html">self</a>& <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::operator++ </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Prefix++ advance the <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a> to the next slot.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00679">679</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l00601">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::currnode</a>, <a class="el" href="btree_8h-source.html#l00604">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::currslot</a>, <a class="el" href="btree_8h-source.html#l00286">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::nextleaf</a>, and <a class="el" href="btree_8h-source.html#l00226">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node::slotuse</a>.</p>
</div>
</div><p>
<a class="anchor" name="e782a36af74ce768cc8e79b5b99e82f6"></a><!-- doxytag: member="stx::btree::const_iterator::operator++" ref="e782a36af74ce768cc8e79b5b99e82f6" args="(int)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree_1_1const__iterator.html">self</a> <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::operator++ </td>
<td>(</td>
<td class="paramtype">int </td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Postfix++ advance the <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a> to the next slot.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00697">697</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l00601">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::currnode</a>, <a class="el" href="btree_8h-source.html#l00604">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::currslot</a>, <a class="el" href="btree_8h-source.html#l00286">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::nextleaf</a>, and <a class="el" href="btree_8h-source.html#l00226">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node::slotuse</a>.</p>
</div>
</div><p>
<a class="anchor" name="5ce3730eb2cb63642fe748d17f35f267"></a><!-- doxytag: member="stx::btree::const_iterator::operator--" ref="5ce3730eb2cb63642fe748d17f35f267" args="()" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree_1_1const__iterator.html">self</a>& <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::operator-- </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Prefix-- backstep the <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a> to the last slot.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00717">717</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l00601">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::currnode</a>, <a class="el" href="btree_8h-source.html#l00604">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::currslot</a>, <a class="el" href="btree_8h-source.html#l00283">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::prevleaf</a>, and <a class="el" href="btree_8h-source.html#l00226">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node::slotuse</a>.</p>
</div>
</div><p>
<a class="anchor" name="44d6aff6e865a0e906ff7c1273764208"></a><!-- doxytag: member="stx::btree::const_iterator::operator--" ref="44d6aff6e865a0e906ff7c1273764208" args="(int)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree_1_1const__iterator.html">self</a> <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::operator-- </td>
<td>(</td>
<td class="paramtype">int </td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Postfix-- backstep the <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a> to the last slot.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00735">735</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l00601">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::currnode</a>, <a class="el" href="btree_8h-source.html#l00604">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::currslot</a>, <a class="el" href="btree_8h-source.html#l00283">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::prevleaf</a>, and <a class="el" href="btree_8h-source.html#l00226">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node::slotuse</a>.</p>
</div>
</div><p>
<a class="anchor" name="ba809408f780b903d2f0bee451289a9c"></a><!-- doxytag: member="stx::btree::const_iterator::operator==" ref="ba809408f780b903d2f0bee451289a9c" args="(const self &x) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::operator== </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree_1_1const__iterator.html">self</a> & </td>
<td class="paramname"> <em>x</em> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Equality of iterators.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00755">755</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l00601">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::currnode</a>, and <a class="el" href="btree_8h-source.html#l00604">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::currslot</a>.</p>
</div>
</div><p>
<a class="anchor" name="1b19065170d8111d9a1dd14f0afc2077"></a><!-- doxytag: member="stx::btree::const_iterator::operator!=" ref="1b19065170d8111d9a1dd14f0afc2077" args="(const self &x) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::operator!= </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree_1_1const__iterator.html">self</a> & </td>
<td class="paramname"> <em>x</em> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Inequality of iterators.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00761">761</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
<p>References <a class="el" href="btree_8h-source.html#l00601">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::currnode</a>, and <a class="el" href="btree_8h-source.html#l00604">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::currslot</a>.</p>
</div>
</div><p>
<hr><h2>Friends And Related Function Documentation</h2>
<a class="anchor" name="776e261b45ef26d713a4d105a8d7c240"></a><!-- doxytag: member="stx::btree::const_iterator::const_reverse_iterator" ref="776e261b45ef26d713a4d105a8d7c240" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname">friend class <a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html">const_reverse_iterator</a><code> [friend]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Friendly to the reverse_const_iterator, so it may access the two data items directly.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00607">607</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<hr><h2>Member Data Documentation</h2>
<a class="anchor" name="4d697acee81e71bd0253198f4ba5e7f4"></a><!-- doxytag: member="stx::btree::const_iterator::currnode" ref="4d697acee81e71bd0253198f4ba5e7f4" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname">const <a class="el" href="structstx_1_1btree_1_1leaf__node.html">btree::leaf_node</a>* <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::<a class="el" href="classstx_1_1btree_1_1const__iterator.html#4d697acee81e71bd0253198f4ba5e7f4">const_iterator::currnode</a><code> [private]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
The currently referenced leaf <a class="el" href="structstx_1_1btree_1_1node.html" title="The header structure of each node in-memory.">node</a> of the tree.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00601">601</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
<p>Referenced by <a class="el" href="btree_8h-source.html#l00673">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::data()</a>, <a class="el" href="btree_8h-source.html#l00667">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::key()</a>, <a class="el" href="btree_8h-source.html#l00761">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::operator!=()</a>, <a class="el" href="btree_8h-source.html#l00649">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::operator*()</a>, <a class="el" href="btree_8h-source.html#l00679">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::operator++()</a>, <a class="el" href="btree_8h-source.html#l00717">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::operator--()</a>, <a class="el" href="btree_8h-source.html#l00659">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::operator->()</a>, and <a class="el" href="btree_8h-source.html#l00755">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::operator==()</a>.</p>
</div>
</div><p>
<a class="anchor" name="09845c35fb432d3b266162afb66f353f"></a><!-- doxytag: member="stx::btree::const_iterator::currslot" ref="09845c35fb432d3b266162afb66f353f" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname">unsigned short <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::<a class="el" href="classstx_1_1btree_1_1const__iterator.html#09845c35fb432d3b266162afb66f353f">const_iterator::currslot</a><code> [private]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Current key/data slot referenced.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00604">604</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
<p>Referenced by <a class="el" href="btree_8h-source.html#l00673">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::data()</a>, <a class="el" href="btree_8h-source.html#l00667">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::key()</a>, <a class="el" href="btree_8h-source.html#l00761">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::operator!=()</a>, <a class="el" href="btree_8h-source.html#l00649">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::operator*()</a>, <a class="el" href="btree_8h-source.html#l00679">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::operator++()</a>, <a class="el" href="btree_8h-source.html#l00717">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::operator--()</a>, <a class="el" href="btree_8h-source.html#l00659">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::operator->()</a>, and <a class="el" href="btree_8h-source.html#l00755">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::operator==()</a>.</p>
</div>
</div><p>
<a class="anchor" name="eb13d8c406c8104986e8c234efc88cb4"></a><!-- doxytag: member="stx::btree::const_iterator::temp_value" ref="eb13d8c406c8104986e8c234efc88cb4" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classstx_1_1btree_1_1const__iterator.html#54ba3bd638eba3ad06d390693f834d5a">value_type</a> <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::<a class="el" href="classstx_1_1btree_1_1const__iterator.html#eb13d8c406c8104986e8c234efc88cb4">const_iterator::temp_value</a><code> [mutable, private]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Evil! A temporary value_type to STL-correctly deliver operator* and operator->.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00611">611</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
<p>Referenced by <a class="el" href="btree_8h-source.html#l00649">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::operator*()</a>, and <a class="el" href="btree_8h-source.html#l00659">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::operator->()</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_8h-source.html">btree.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>
