<!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 >::inner_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_1inner__node.html">inner_node</a>
</div>
</div>
<div class="contents">
<h1>stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::inner_node Struct Reference</h1><!-- doxytag: class="stx::btree::inner_node" --><!-- doxytag: inherits="stx::btree::node" -->Extended structure of a inner <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_1inner__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_1inner__node.html#f44644e684d49141dc8ca17de22c1d8a">initialize</a> (const unsigned short l)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Set variables to initial values. <a href="#f44644e684d49141dc8ca17de22c1d8a"></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_1inner__node.html#54ecb85bfead0e0536fd1cb17cc630c8">isfull</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">True if the node's slots are full. <a href="#54ecb85bfead0e0536fd1cb17cc630c8"></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_1inner__node.html#6b4dc9de51be9819038595d1b55d376e">isfew</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">True if few used entries, less than half full. <a href="#6b4dc9de51be9819038595d1b55d376e"></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_1inner__node.html#659bfb94e6b2bbd92c1354aae5d9ac31">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="#659bfb94e6b2bbd92c1354aae5d9ac31"></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="classstx_1_1btree.html#2054714c400894aa8822f0f52bc120cf">key_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="structstx_1_1btree_1_1inner__node.html#90588183064df8ea1d15fb357a295b62">slotkey</a> [<a class="el" href="classstx_1_1btree.html#83a18c2fb7f4e9cfd47ce7545d004324">innerslotmax</a>]</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Keys of children or data pointers. <a href="#90588183064df8ea1d15fb357a295b62"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="structstx_1_1btree_1_1node.html">node</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="structstx_1_1btree_1_1inner__node.html#90039da3250bc1770fb84f7b7407469f">childid</a> [<a class="el" href="classstx_1_1btree.html#83a18c2fb7f4e9cfd47ce7545d004324">innerslotmax</a>+1]</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Pointers to children. <a href="#90039da3250bc1770fb84f7b7407469f"></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 >::inner_node</h3>
Extended structure of a inner <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 only keys and no data items.
<p>Definition at line <a class="el" href="btree_8h-source.html#l00244">244</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="f44644e684d49141dc8ca17de22c1d8a"></a><!-- doxytag: member="stx::btree::inner_node::initialize" ref="f44644e684d49141dc8ca17de22c1d8a" 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 >::inner_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>
Set variables to initial values.
<p>
<p>Reimplemented from <a class="el" href="structstx_1_1btree_1_1node.html#2080bfd07cff3904cdb0db27a4bfa9fa">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node</a>.</p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00253">253</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>.</p>
<p>Referenced by <a class="el" href="btree_8h-source.html#l01371">stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::allocate_inner()</a>.</p>
</div>
</div><p>
<a class="anchor" name="54ecb85bfead0e0536fd1cb17cc630c8"></a><!-- doxytag: member="stx::btree::inner_node::isfull" ref="54ecb85bfead0e0536fd1cb17cc630c8" 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 >::inner_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#l00259">259</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#l00193">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::innerslotmax</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="6b4dc9de51be9819038595d1b55d376e"></a><!-- doxytag: member="stx::btree::inner_node::isfew" ref="6b4dc9de51be9819038595d1b55d376e" 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 >::inner_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#l00265">265</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#l00203">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::mininnerslots</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="659bfb94e6b2bbd92c1354aae5d9ac31"></a><!-- doxytag: member="stx::btree::inner_node::isunderflow" ref="659bfb94e6b2bbd92c1354aae5d9ac31" 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 >::inner_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#l00271">271</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#l00203">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::mininnerslots</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="90588183064df8ea1d15fb357a295b62"></a><!-- doxytag: member="stx::btree::inner_node::slotkey" ref="90588183064df8ea1d15fb357a295b62" args="[innerslotmax]" -->
<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_1inner__node.html#90588183064df8ea1d15fb357a295b62">inner_node::slotkey</a>[<a class="el" href="classstx_1_1btree.html#83a18c2fb7f4e9cfd47ce7545d004324">innerslotmax</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#l00247">247</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="90039da3250bc1770fb84f7b7407469f"></a><!-- doxytag: member="stx::btree::inner_node::childid" ref="90039da3250bc1770fb84f7b7407469f" args="[innerslotmax+1]" -->
<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_1node.html">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_1inner__node.html#90039da3250bc1770fb84f7b7407469f">inner_node::childid</a>[<a class="el" href="classstx_1_1btree.html#83a18c2fb7f4e9cfd47ce7545d004324">innerslotmax</a>+1] </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Pointers to children.
<p>
<p>Definition at line <a class="el" href="btree_8h-source.html#l00250">250</a> of file <a class="el" href="btree_8h-source.html">btree.h</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>
