<!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 >::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_1node.html">node</a>
</div>
</div>
<div class="contents">
<h1>stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node Struct Reference</h1><!-- doxytag: class="stx::btree::node" -->The header structure of each <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>
Inherited by <a class="el" href="structstx_1_1btree_1_1inner__node.html">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::inner_node</a>, and <a class="el" href="structstx_1_1btree_1_1leaf__node.html">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node</a>.
<p>
<p>
<a href="structstx_1_1btree_1_1node-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_1node.html#2080bfd07cff3904cdb0db27a4bfa9fa">initialize</a> (const unsigned short l)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Delayed initialisation of constructed <a class="el" href="structstx_1_1btree_1_1node.html" title="The header structure of each node in-memory.">node</a>. <a href="#2080bfd07cff3904cdb0db27a4bfa9fa"></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_1node.html#c7e7d59c64afae8bb9257d5a5a9ab1b8">isleafnode</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">True if this is a leaf <a class="el" href="structstx_1_1btree_1_1node.html" title="The header structure of each node in-memory.">node</a>. <a href="#c7e7d59c64afae8bb9257d5a5a9ab1b8"></a><br></td></tr>
<tr><td colspan="2"><br><h2>Public Attributes</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned short </td><td class="memItemRight" valign="bottom"><a class="el" href="structstx_1_1btree_1_1node.html#7f1964408f460bd6aa16231e41548d04">level</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Level in the b-tree, if level == 0 -> leaf <a class="el" href="structstx_1_1btree_1_1node.html" title="The header structure of each node in-memory.">node</a>. <a href="#7f1964408f460bd6aa16231e41548d04"></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="structstx_1_1btree_1_1node.html#3b012ed5aca34a261be978cb0b183812">slotuse</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Number of key slotuse use, so number of valid children or data pointers. <a href="#3b012ed5aca34a261be978cb0b183812"></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 >::node</h3>
The header structure of each <a class="el" href="structstx_1_1btree_1_1node.html" title="The header structure of each node in-memory.">node</a> in-memory.
<p>
This structure is extended by <a class="el" href="structstx_1_1btree_1_1inner__node.html" title="Extended structure of a inner node in-memory.">inner_node</a> or <a class="el" href="structstx_1_1btree_1_1leaf__node.html" title="Extended structure of a leaf node in memory.">leaf_node</a>.
<p>Definition at line <a class="el" href="btree_8h-source.html#l00219">219</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="2080bfd07cff3904cdb0db27a4bfa9fa"></a><!-- doxytag: member="stx::btree::node::initialize" ref="2080bfd07cff3904cdb0db27a4bfa9fa" args="(const unsigned short l)" -->
<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 >::node::initialize </td>
<td>(</td>
<td class="paramtype">const unsigned short </td>
<td class="paramname"> <em>l</em> </td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Delayed initialisation of constructed <a class="el" href="structstx_1_1btree_1_1node.html" title="The header structure of each node in-memory.">node</a>.
<p>
<p>Reimplemented in <a class="el" href="structstx_1_1btree_1_1inner__node.html#f44644e684d49141dc8ca17de22c1d8a">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::inner_node</a>.</p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00229">229</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#l00222">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node::level</a>, and <a class="el" href="btree_8h-source.html#l00226">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node::slotuse</a>.</p>
<p>Referenced by <a class="el" href="btree_8h-source.html#l00295">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::initialize()</a>, and <a class="el" href="btree_8h-source.html#l00253">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::inner_node::initialize()</a>.</p>
</div>
</div><p>
<a class="anchor" name="c7e7d59c64afae8bb9257d5a5a9ab1b8"></a><!-- doxytag: member="stx::btree::node::isleafnode" ref="c7e7d59c64afae8bb9257d5a5a9ab1b8" 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 >::node::isleafnode </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
True if this is a leaf <a class="el" href="structstx_1_1btree_1_1node.html" title="The header structure of each node in-memory.">node</a>.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00236">236</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#l00222">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node::level</a>.</p>
</div>
</div><p>
<hr><h2>Member Data Documentation</h2>
<a class="anchor" name="7f1964408f460bd6aa16231e41548d04"></a><!-- doxytag: member="stx::btree::node::level" ref="7f1964408f460bd6aa16231e41548d04" 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="structstx_1_1btree_1_1node.html#7f1964408f460bd6aa16231e41548d04">node::level</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Level in the b-tree, if level == 0 -> leaf <a class="el" href="structstx_1_1btree_1_1node.html" title="The header structure of each node in-memory.">node</a>.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00222">222</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#l00229">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node::initialize()</a>, <a class="el" href="btree_8h-source.html#l02008">stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::insert_start()</a>, and <a class="el" href="btree_8h-source.html#l00236">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node::isleafnode()</a>.</p>
</div>
</div><p>
<a class="anchor" name="3b012ed5aca34a261be978cb0b183812"></a><!-- doxytag: member="stx::btree::node::slotuse" ref="3b012ed5aca34a261be978cb0b183812" 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="structstx_1_1btree_1_1node.html#3b012ed5aca34a261be978cb0b183812">node::slotuse</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Number of key slotuse use, so number of valid children or data pointers.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00226">226</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#l01450">stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::end()</a>, <a class="el" href="btree_8h-source.html#l02400">stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::erase_one_descend()</a>, <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#l02008">stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::insert_start()</a>, <a class="el" href="btree_8h-source.html#l00308">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::isfew()</a>, <a class="el" href="btree_8h-source.html#l00265">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::inner_node::isfew()</a>, <a class="el" href="btree_8h-source.html#l00302">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::isfull()</a>, <a class="el" href="btree_8h-source.html#l00259">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::inner_node::isfull()</a>, <a class="el" href="btree_8h-source.html#l00314">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::isunderflow()</a>, <a class="el" href="btree_8h-source.html#l00271">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::inner_node::isunderflow()</a>, <a class="el" href="btree_8h-source.html#l02677">stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::merge_leaves()</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#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#l00717">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::operator--()</a>, and <a class="el" href="btree_8h-source.html#l00513">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>
