<!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 >::leaf_node Struct 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="structstx_1_1btree_1_1leaf__node.html">leaf_node</a>
</div>
</div>
<div class="contents">
<h1>stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node Struct Reference</h1><!-- doxytag: class="stx::btree::leaf_node" --><!-- doxytag: inherits="stx::btree::node" -->Extended structure of a leaf <a class="el" href="structstx_1_1btree_1_1node.html" title="The header structure of each node in-memory.">node</a> in memory.
<a href="#_details">More...</a>
<p>
Inherits <a class="el" href="structstx_1_1btree_1_1node.html">stx::btree::node</a>.
<p>
<p>
<a href="structstx_1_1btree_1_1leaf__node-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 Member Functions</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="structstx_1_1btree_1_1leaf__node.html#b0094a85e6adbebdd3bc4a671fddfca5">initialize</a> ()</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Set variables to initial values. <a href="#b0094a85e6adbebdd3bc4a671fddfca5"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="structstx_1_1btree_1_1leaf__node.html#abecfe27dbb19007a00e1119993647c5">isfull</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">True if the node's slots are full. <a href="#abecfe27dbb19007a00e1119993647c5"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="structstx_1_1btree_1_1leaf__node.html#c3c84ea0c97039832aa4ade6c5477b34">isfew</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">True if few used entries, less than half full. <a href="#c3c84ea0c97039832aa4ade6c5477b34"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="structstx_1_1btree_1_1leaf__node.html#7807c0b01d2012177e8d10edc0b05049">isunderflow</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">True if <a class="el" href="structstx_1_1btree_1_1node.html" title="The header structure of each node in-memory.">node</a> has too few entries. <a href="#7807c0b01d2012177e8d10edc0b05049"></a><br></td></tr>
<tr><td colspan="2"><br><h2>Public Attributes</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="structstx_1_1btree_1_1leaf__node.html">leaf_node</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="structstx_1_1btree_1_1leaf__node.html#257df6dcc876599f25df40b5e721fcae">prevleaf</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Double linked list pointers to traverse the leaves. <a href="#257df6dcc876599f25df40b5e721fcae"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="structstx_1_1btree_1_1leaf__node.html">leaf_node</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="structstx_1_1btree_1_1leaf__node.html#58266afc9bdcdb6db404db198cec7608">nextleaf</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Double linked list pointers to traverse the leaves. <a href="#58266afc9bdcdb6db404db198cec7608"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree.html#2054714c400894aa8822f0f52bc120cf">key_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="structstx_1_1btree_1_1leaf__node.html#cdae18752022a3f57ecb2be00bbe4dfd">slotkey</a> [<a class="el" href="classstx_1_1btree.html#12a39ca671e962924f4acf879a44eafc">leafslotmax</a>]</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Keys of children or data pointers. <a href="#cdae18752022a3f57ecb2be00bbe4dfd"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classstx_1_1btree.html#ca29ad902418d86eeb9b9379a38e5fcd">data_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="structstx_1_1btree_1_1leaf__node.html#06d022590b9aa76fd0f0ff56c48b1eb5">slotdata</a> [<a class="el" href="classstx_1_1btree.html#12a39ca671e962924f4acf879a44eafc">leafslotmax</a>]</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Array of data. <a href="#06d022590b9aa76fd0f0ff56c48b1eb5"></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>
struct stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node</h3>
Extended structure of a leaf <a class="el" href="structstx_1_1btree_1_1node.html" title="The header structure of each node in-memory.">node</a> in memory.
<p>
Contains pairs of keys and data items. Key and data slots are kept in separate arrays, because the key array is traversed very often compared to accessing the data items.
<p>Definition at line <a class="el" href="btree_8h-source.html#l00280">280</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
<hr><h2>Member Function Documentation</h2>
<a class="anchor" name="b0094a85e6adbebdd3bc4a671fddfca5"></a><!-- doxytag: member="stx::btree::leaf_node::initialize" ref="b0094a85e6adbebdd3bc4a671fddfca5" 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">void <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::initialize </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Set variables to initial values.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00295">295</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#l00229">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node::initialize()</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#l00283">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::prevleaf</a>.</p>
<p>Referenced by <a class="el" href="btree_8h-source.html#l01362">stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::allocate_leaf()</a>.</p>
</div>
</div><p>
<a class="anchor" name="abecfe27dbb19007a00e1119993647c5"></a><!-- doxytag: member="stx::btree::leaf_node::isfull" ref="abecfe27dbb19007a00e1119993647c5" 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">bool <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::isfull </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
True if the node's slots are full.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00302">302</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#l00189">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leafslotmax</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="c3c84ea0c97039832aa4ade6c5477b34"></a><!-- doxytag: member="stx::btree::leaf_node::isfew" ref="c3c84ea0c97039832aa4ade6c5477b34" 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">bool <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::isfew </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
True if few used entries, less than half full.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00308">308</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#l00198">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::minleafslots</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="7807c0b01d2012177e8d10edc0b05049"></a><!-- doxytag: member="stx::btree::leaf_node::isunderflow" ref="7807c0b01d2012177e8d10edc0b05049" 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">bool <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::isunderflow </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
True if <a class="el" href="structstx_1_1btree_1_1node.html" title="The header structure of each node in-memory.">node</a> has too few entries.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00314">314</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#l00198">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::minleafslots</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>
<hr><h2>Member Data Documentation</h2>
<a class="anchor" name="257df6dcc876599f25df40b5e721fcae"></a><!-- doxytag: member="stx::btree::leaf_node::prevleaf" ref="257df6dcc876599f25df40b5e721fcae" 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="structstx_1_1btree_1_1leaf__node.html">leaf_node</a>* <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::<a class="el" href="structstx_1_1btree_1_1leaf__node.html#257df6dcc876599f25df40b5e721fcae">leaf_node::prevleaf</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Double linked list pointers to traverse the leaves.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00283">283</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#l01905">stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::copy_recursive()</a>, <a class="el" href="btree_8h-source.html#l00295">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::initialize()</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#l00882">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_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#l00513">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::operator--()</a>, <a class="el" href="btree_8h-source.html#l03351">stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::restore_node()</a>, and <a class="el" href="btree_8h-source.html#l02194">stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::split_leaf_node()</a>.</p>
</div>
</div><p>
<a class="anchor" name="58266afc9bdcdb6db404db198cec7608"></a><!-- doxytag: member="stx::btree::leaf_node::nextleaf" ref="58266afc9bdcdb6db404db198cec7608" 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="structstx_1_1btree_1_1leaf__node.html">leaf_node</a>* <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::<a class="el" href="structstx_1_1btree_1_1leaf__node.html#58266afc9bdcdb6db404db198cec7608">leaf_node::nextleaf</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Double linked list pointers to traverse the leaves.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00286">286</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#l01905">stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::copy_recursive()</a>, <a class="el" href="btree_8h-source.html#l00295">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::initialize()</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#l00475">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::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#l00920">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::operator--()</a>, <a class="el" href="btree_8h-source.html#l02987">stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::print_leaves()</a>, <a class="el" href="btree_8h-source.html#l03351">stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::restore_node()</a>, and <a class="el" href="btree_8h-source.html#l02194">stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::split_leaf_node()</a>.</p>
</div>
</div><p>
<a class="anchor" name="cdae18752022a3f57ecb2be00bbe4dfd"></a><!-- doxytag: member="stx::btree::leaf_node::slotkey" ref="cdae18752022a3f57ecb2be00bbe4dfd" args="[leafslotmax]" -->
<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#2054714c400894aa8822f0f52bc120cf">key_type</a> <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::<a class="el" href="structstx_1_1btree_1_1leaf__node.html#cdae18752022a3f57ecb2be00bbe4dfd">leaf_node::slotkey</a>[<a class="el" href="classstx_1_1btree.html#12a39ca671e962924f4acf879a44eafc">leafslotmax</a>] </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Keys of children or data pointers.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00289">289</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#l01076">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::key()</a>, <a class="el" href="btree_8h-source.html#l00868">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::key()</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#l00463">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::key()</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#l00848">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_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#l00445">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::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>, <a class="el" href="btree_8h-source.html#l00859">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::operator->()</a>, <a class="el" href="btree_8h-source.html#l00659">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::operator->()</a>, <a class="el" href="btree_8h-source.html#l00455">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::operator->()</a>, and <a class="el" href="btree_8h-source.html#l02194">stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::split_leaf_node()</a>.</p>
</div>
</div><p>
<a class="anchor" name="06d022590b9aa76fd0f0ff56c48b1eb5"></a><!-- doxytag: member="stx::btree::leaf_node::slotdata" ref="06d022590b9aa76fd0f0ff56c48b1eb5" args="[leafslotmax]" -->
<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#ca29ad902418d86eeb9b9379a38e5fcd">data_type</a> <a class="el" href="classstx_1_1btree.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::<a class="el" href="structstx_1_1btree_1_1leaf__node.html#06d022590b9aa76fd0f0ff56c48b1eb5">leaf_node::slotdata</a>[<a class="el" href="classstx_1_1btree.html#12a39ca671e962924f4acf879a44eafc">leafslotmax</a>] </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Array of data.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00292">292</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#l00875">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::data()</a>, <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#l00469">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::data()</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#l00848">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_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#l00445">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::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>, <a class="el" href="btree_8h-source.html#l00859">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_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#l00455">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::operator->()</a>.</p>
</div>
</div><p>
<hr>The documentation for this struct 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>
