<!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_reverse_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__reverse__iterator.html">const_reverse_iterator</a>
</div>
</div>
<div class="contents">
<h1>stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator Class Reference</h1><!-- doxytag: class="stx::btree::const_reverse_iterator" -->STL-like read-only reverse <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__reverse__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__reverse__iterator.html#1e60bb315384bd6d3fc4ff946057a360">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__reverse__iterator.html#f793b31f244d2a03ab394b466387a372" title="Key of the current slot.">key()</a>. <a href="#1e60bb315384bd6d3fc4ff946057a360"></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__reverse__iterator.html#106f94074dbdb77fb2421536d718e15c">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__reverse__iterator.html#4703b48f546c796e956df7bbe5373e39" title="Read-only reference to the current data object.">data()</a>. <a href="#106f94074dbdb77fb2421536d718e15c"></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__reverse__iterator.html#eaedc04c88fe4839aa51107ca222f818">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__reverse__iterator.html#92db70365bc6e1f7dceb362963fe7c73" title="Dereference the iterator.">operator*()</a>. <a href="#eaedc04c88fe4839aa51107ca222f818"></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__reverse__iterator.html#3e5c5e8489b2db3eab6d190d571f27c6">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="#3e5c5e8489b2db3eab6d190d571f27c6"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef const <a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html#eaedc04c88fe4839aa51107ca222f818">value_type</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html#3a0398260c421ca4de4083552d8ab546">reference</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Reference to the value_type. STL required. <a href="#3a0398260c421ca4de4083552d8ab546"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef const <a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html#eaedc04c88fe4839aa51107ca222f818">value_type</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html#c12c887effa006d48c61ff60bb170abd">pointer</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Pointer to the value_type. STL required. <a href="#c12c887effa006d48c61ff60bb170abd"></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__reverse__iterator.html#822570226458d3e68de30d9f6ed013f1">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="#822570226458d3e68de30d9f6ed013f1"></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__reverse__iterator.html#0dfa5c3c516b3748600046fb88e5c73a">difference_type</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">STL-magic. <a href="#0dfa5c3c516b3748600046fb88e5c73a"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <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_1_1const__reverse__iterator.html#e67c029008badd15c95bc143c98e87ee">self</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Our own type. <a href="#e67c029008badd15c95bc143c98e87ee"></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__reverse__iterator.html#0aac51015383e5493742b39c50ef193b">const_reverse_iterator</a> ()</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Default-Constructor of 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="#0aac51015383e5493742b39c50ef193b"></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__reverse__iterator.html#883d9b09368fd58f0c3c6b6b5aa6a296">const_reverse_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 reverse <a class="el" href="classstx_1_1btree_1_1iterator.html" title="STL-like iterator object for B+ tree items.">iterator</a>. <a href="#883d9b09368fd58f0c3c6b6b5aa6a296"></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__reverse__iterator.html#2837430dc7496bc770e099d95e542465">const_reverse_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="#2837430dc7496bc770e099d95e542465"></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__reverse__iterator.html#f2ed10f3956cd4ab2b980d8535dd15b2">const_reverse_iterator</a> (const <a class="el" href="classstx_1_1btree_1_1const__iterator.html">const_iterator</a> &it)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Copy-constructor from 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="#f2ed10f3956cd4ab2b980d8535dd15b2"></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__reverse__iterator.html#6060264962f1acbb77b632cef29c50ca">const_reverse_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="#6060264962f1acbb77b632cef29c50ca"></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#3a0398260c421ca4de4083552d8ab546">reference</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html#92db70365bc6e1f7dceb362963fe7c73">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="#92db70365bc6e1f7dceb362963fe7c73"></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#c12c887effa006d48c61ff60bb170abd">pointer</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html#40d50567f95956b58c78128361a7e15f">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="#40d50567f95956b58c78128361a7e15f"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">const <a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html#1e60bb315384bd6d3fc4ff946057a360">key_type</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html#f793b31f244d2a03ab394b466387a372">key</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Key of the current slot. <a href="#f793b31f244d2a03ab394b466387a372"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">const <a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html#106f94074dbdb77fb2421536d718e15c">data_type</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html#4703b48f546c796e956df7bbe5373e39">data</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Read-only reference to the current data object. <a href="#4703b48f546c796e956df7bbe5373e39"></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">self</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html#c1e04aa8c7bd265db02fecc8003bbdc6">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 previous slot. <a href="#c1e04aa8c7bd265db02fecc8003bbdc6"></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">self</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html#efc3b1b60154e0886097b49ec6da31b5">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 previous slot. <a href="#efc3b1b60154e0886097b49ec6da31b5"></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">self</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html#1347b67882817c08da24344bb76f6398">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 next slot. <a href="#1347b67882817c08da24344bb76f6398"></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">self</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html#817df1b41f8b8710118469c7410d9254">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 next slot. <a href="#817df1b41f8b8710118469c7410d9254"></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__reverse__iterator.html#b1b5359558d90265966fc675f8f0a79d">operator==</a> (const <a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html">self</a> &x) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Equality of iterators. <a href="#b1b5359558d90265966fc675f8f0a79d"></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__reverse__iterator.html#d137bc33fe6406998a6c30488112c5f5">operator!=</a> (const <a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html">self</a> &x) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Inequality of iterators. <a href="#d137bc33fe6406998a6c30488112c5f5"></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__reverse__iterator.html#17dace563a5d3f0fa10d0d90cca24223">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="#17dace563a5d3f0fa10d0d90cca24223"></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__reverse__iterator.html#dae98850235d0be22f1864f08b62171e">currslot</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">One slot past the current key/data slot referenced. <a href="#dae98850235d0be22f1864f08b62171e"></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#eaedc04c88fe4839aa51107ca222f818">value_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html#7fda84dc75435d77ade7165735384ab3">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="#7fda84dc75435d77ade7165735384ab3"></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__reverse__iterator.html#f0a70641f2216cc31420487a62dd3b0d">reverse_iterator</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Friendly to the <a class="el" href="classstx_1_1btree_1_1const__iterator.html" title="STL-like read-only iterator object for B+ tree items.">const_iterator</a>, so it may access the two data items directly. <a href="#f0a70641f2216cc31420487a62dd3b0d"></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_reverse_iterator</h3>
STL-like read-only reverse <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#l00972">972</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="1e60bb315384bd6d3fc4ff946057a360"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::key_type" ref="1e60bb315384bd6d3fc4ff946057a360" 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__reverse__iterator.html#1e60bb315384bd6d3fc4ff946057a360">const_reverse_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__reverse__iterator.html#f793b31f244d2a03ab394b466387a372" title="Key of the current slot.">key()</a>.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00978">978</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="106f94074dbdb77fb2421536d718e15c"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::data_type" ref="106f94074dbdb77fb2421536d718e15c" 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__reverse__iterator.html#106f94074dbdb77fb2421536d718e15c">const_reverse_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__reverse__iterator.html#4703b48f546c796e956df7bbe5373e39" title="Read-only reference to the current data object.">data()</a>.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00981">981</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="eaedc04c88fe4839aa51107ca222f818"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::value_type" ref="eaedc04c88fe4839aa51107ca222f818" 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__reverse__iterator.html#eaedc04c88fe4839aa51107ca222f818">const_reverse_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__reverse__iterator.html#92db70365bc6e1f7dceb362963fe7c73" title="Dereference the iterator.">operator*()</a>.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00984">984</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="3e5c5e8489b2db3eab6d190d571f27c6"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::pair_type" ref="3e5c5e8489b2db3eab6d190d571f27c6" 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__reverse__iterator.html#3e5c5e8489b2db3eab6d190d571f27c6">const_reverse_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#l00987">987</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="3a0398260c421ca4de4083552d8ab546"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::reference" ref="3a0398260c421ca4de4083552d8ab546" 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__reverse__iterator.html#eaedc04c88fe4839aa51107ca222f818">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__reverse__iterator.html#3a0398260c421ca4de4083552d8ab546">const_reverse_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#l00990">990</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="c12c887effa006d48c61ff60bb170abd"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::pointer" ref="c12c887effa006d48c61ff60bb170abd" 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__reverse__iterator.html#eaedc04c88fe4839aa51107ca222f818">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__reverse__iterator.html#c12c887effa006d48c61ff60bb170abd">const_reverse_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#l00993">993</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="822570226458d3e68de30d9f6ed013f1"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::iterator_category" ref="822570226458d3e68de30d9f6ed013f1" 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__reverse__iterator.html#822570226458d3e68de30d9f6ed013f1">const_reverse_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#l00996">996</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="0dfa5c3c516b3748600046fb88e5c73a"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::difference_type" ref="0dfa5c3c516b3748600046fb88e5c73a" 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__reverse__iterator.html#0dfa5c3c516b3748600046fb88e5c73a">const_reverse_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#l00999">999</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="e67c029008badd15c95bc143c98e87ee"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::self" ref="e67c029008badd15c95bc143c98e87ee" 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__reverse__iterator.html">const_reverse_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__reverse__iterator.html">const_reverse_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#l01002">1002</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="0aac51015383e5493742b39c50ef193b"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::const_reverse_iterator" ref="0aac51015383e5493742b39c50ef193b" 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_reverse_iterator::const_reverse_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 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#l01029">1029</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="883d9b09368fd58f0c3c6b6b5aa6a296"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::const_reverse_iterator" ref="883d9b09368fd58f0c3c6b6b5aa6a296" 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_reverse_iterator::const_reverse_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 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#l01034">1034</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="2837430dc7496bc770e099d95e542465"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::const_reverse_iterator" ref="2837430dc7496bc770e099d95e542465" 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_reverse_iterator::const_reverse_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#l01039">1039</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="f2ed10f3956cd4ab2b980d8535dd15b2"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::const_reverse_iterator" ref="f2ed10f3956cd4ab2b980d8535dd15b2" args="(const 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_reverse_iterator::const_reverse_iterator </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree_1_1const__iterator.html">const_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 <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#l01044">1044</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="6060264962f1acbb77b632cef29c50ca"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::const_reverse_iterator" ref="6060264962f1acbb77b632cef29c50ca" 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_reverse_iterator::const_reverse_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#l01049">1049</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="92db70365bc6e1f7dceb362963fe7c73"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::operator*" ref="92db70365bc6e1f7dceb362963fe7c73" 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__reverse__iterator.html#3a0398260c421ca4de4083552d8ab546">reference</a> <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_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__reverse__iterator.html#f793b31f244d2a03ab394b466387a372" title="Key of the current slot.">key()</a> and <a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html#4703b48f546c796e956df7bbe5373e39" 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#l01056">1056</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#l00046">BTREE_ASSERT</a>, <a class="el" href="btree_8h-source.html#l01008">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::currnode</a>, <a class="el" href="btree_8h-source.html#l01011">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_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#l01018">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::temp_value</a>.</p>
</div>
</div><p>
<a class="anchor" name="40d50567f95956b58c78128361a7e15f"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::operator->" ref="40d50567f95956b58c78128361a7e15f" 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__reverse__iterator.html#c12c887effa006d48c61ff60bb170abd">pointer</a> <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_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__reverse__iterator.html#f793b31f244d2a03ab394b466387a372" title="Key of the current slot.">key()</a> and <a class="el" href="classstx_1_1btree_1_1const__reverse__iterator.html#4703b48f546c796e956df7bbe5373e39" 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#l01067">1067</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#l00046">BTREE_ASSERT</a>, <a class="el" href="btree_8h-source.html#l01008">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::currnode</a>, <a class="el" href="btree_8h-source.html#l01011">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_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#l01018">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::temp_value</a>.</p>
</div>
</div><p>
<a class="anchor" name="f793b31f244d2a03ab394b466387a372"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::key" ref="f793b31f244d2a03ab394b466387a372" 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__reverse__iterator.html#1e60bb315384bd6d3fc4ff946057a360">key_type</a>& <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_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#l01076">1076</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#l00046">BTREE_ASSERT</a>, <a class="el" href="btree_8h-source.html#l01008">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::currnode</a>, <a class="el" href="btree_8h-source.html#l01011">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_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="4703b48f546c796e956df7bbe5373e39"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::data" ref="4703b48f546c796e956df7bbe5373e39" 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__reverse__iterator.html#106f94074dbdb77fb2421536d718e15c">data_type</a>& <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_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#l01083">1083</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#l00046">BTREE_ASSERT</a>, <a class="el" href="btree_8h-source.html#l01008">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::currnode</a>, <a class="el" href="btree_8h-source.html#l01011">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_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="c1e04aa8c7bd265db02fecc8003bbdc6"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::operator++" ref="c1e04aa8c7bd265db02fecc8003bbdc6" 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__reverse__iterator.html">self</a>& <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_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 previous slot.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l01090">1090</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#l01008">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::currnode</a>, <a class="el" href="btree_8h-source.html#l01011">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_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="efc3b1b60154e0886097b49ec6da31b5"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::operator++" ref="efc3b1b60154e0886097b49ec6da31b5" 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__reverse__iterator.html">self</a> <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_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 previous slot.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l01108">1108</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#l01008">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::currnode</a>, <a class="el" href="btree_8h-source.html#l01011">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_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="1347b67882817c08da24344bb76f6398"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::operator--" ref="1347b67882817c08da24344bb76f6398" 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__reverse__iterator.html">self</a>& <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_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 next slot.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l01128">1128</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#l01008">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::currnode</a>, <a class="el" href="btree_8h-source.html#l01011">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_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="817df1b41f8b8710118469c7410d9254"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::operator--" ref="817df1b41f8b8710118469c7410d9254" 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__reverse__iterator.html">self</a> <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_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 next slot.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l01146">1146</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#l01008">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::currnode</a>, <a class="el" href="btree_8h-source.html#l01011">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_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="b1b5359558d90265966fc675f8f0a79d"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::operator==" ref="b1b5359558d90265966fc675f8f0a79d" 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_reverse_iterator::operator== </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree_1_1const__reverse__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#l01166">1166</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#l01008">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::currnode</a>, and <a class="el" href="btree_8h-source.html#l01011">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::currslot</a>.</p>
</div>
</div><p>
<a class="anchor" name="d137bc33fe6406998a6c30488112c5f5"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::operator!=" ref="d137bc33fe6406998a6c30488112c5f5" 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_reverse_iterator::operator!= </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classstx_1_1btree_1_1const__reverse__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#l01172">1172</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#l01008">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::currnode</a>, and <a class="el" href="btree_8h-source.html#l01011">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::currslot</a>.</p>
</div>
</div><p>
<hr><h2>Friends And Related Function Documentation</h2>
<a class="anchor" name="f0a70641f2216cc31420487a62dd3b0d"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::reverse_iterator" ref="f0a70641f2216cc31420487a62dd3b0d" 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_1reverse__iterator.html">reverse_iterator</a><code> [friend]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Friendly to the <a class="el" href="classstx_1_1btree_1_1const__iterator.html" title="STL-like read-only iterator object for B+ tree items.">const_iterator</a>, so it may access the two data items directly.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l01014">1014</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="17dace563a5d3f0fa10d0d90cca24223"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::currnode" ref="17dace563a5d3f0fa10d0d90cca24223" 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__reverse__iterator.html#17dace563a5d3f0fa10d0d90cca24223">const_reverse_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#l01008">1008</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#l01083">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::data()</a>, <a class="el" href="btree_8h-source.html#l01076">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::key()</a>, <a class="el" href="btree_8h-source.html#l01172">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::operator!=()</a>, <a class="el" href="btree_8h-source.html#l01056">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::operator*()</a>, <a class="el" href="btree_8h-source.html#l01090">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::operator++()</a>, <a class="el" href="btree_8h-source.html#l01128">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::operator--()</a>, <a class="el" href="btree_8h-source.html#l01067">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::operator->()</a>, and <a class="el" href="btree_8h-source.html#l01166">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::operator==()</a>.</p>
</div>
</div><p>
<a class="anchor" name="dae98850235d0be22f1864f08b62171e"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::currslot" ref="dae98850235d0be22f1864f08b62171e" 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__reverse__iterator.html#dae98850235d0be22f1864f08b62171e">const_reverse_iterator::currslot</a><code> [private]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
One slot past the current key/data slot referenced.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l01011">1011</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#l01083">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::data()</a>, <a class="el" href="btree_8h-source.html#l01076">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::key()</a>, <a class="el" href="btree_8h-source.html#l01172">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::operator!=()</a>, <a class="el" href="btree_8h-source.html#l01056">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::operator*()</a>, <a class="el" href="btree_8h-source.html#l01090">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::operator++()</a>, <a class="el" href="btree_8h-source.html#l01128">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::operator--()</a>, <a class="el" href="btree_8h-source.html#l01067">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::operator->()</a>, and <a class="el" href="btree_8h-source.html#l01166">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::operator==()</a>.</p>
</div>
</div><p>
<a class="anchor" name="7fda84dc75435d77ade7165735384ab3"></a><!-- doxytag: member="stx::btree::const_reverse_iterator::temp_value" ref="7fda84dc75435d77ade7165735384ab3" 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__reverse__iterator.html#eaedc04c88fe4839aa51107ca222f818">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__reverse__iterator.html#7fda84dc75435d77ade7165735384ab3">const_reverse_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#l01018">1018</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#l01056">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::operator*()</a>, and <a class="el" href="btree_8h-source.html#l01067">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_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>
