idlebox / 2007 / stx-btree / stx-btree-0.8.3 / doxygen-html / structstx_1_1btree__default__set__traits.html.html (Download File)
<!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_default_set_traits&lt; _Key &gt; Struct Template 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&nbsp;Page</span></a></li>
      <li><a href="pages.html"><span>Related&nbsp;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&nbsp;List</span></a></li>
      <li><a href="hierarchy.html"><span>Class&nbsp;Hierarchy</span></a></li>
      <li><a href="functions.html"><span>Class&nbsp;Members</span></a></li>
    </ul>
  </div>
  <div class="navpath"><a class="el" href="namespacestx.html">stx</a>::<a class="el" href="structstx_1_1btree__default__set__traits.html">btree_default_set_traits</a>
  </div>
</div>
<div class="contents">
<h1>stx::btree_default_set_traits&lt; _Key &gt; Struct Template Reference</h1><!-- doxytag: class="stx::btree_default_set_traits" -->Generates default traits for a B+ tree used as a set.  
<a href="#_details">More...</a>
<p>
<code>#include &lt;<a class="el" href="btree_8h-source.html">btree.h</a>&gt;</code>
<p>

<p>
<a href="structstx_1_1btree__default__set__traits-members.html">List of all members.</a><table border="0" cellpadding="0" cellspacing="0">
<tr><td></td></tr>
<tr><td colspan="2"><br><h2>Static Public Attributes</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static const bool&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="structstx_1_1btree__default__set__traits.html#bbb0859c6f7a2b887863011026e28ab1">selfverify</a> = false</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">If true, the tree will self verify it's invariants after each insert() or erase().  <a href="#bbb0859c6f7a2b887863011026e28ab1"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static const bool&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="structstx_1_1btree__default__set__traits.html#b06ff26a50cb57614ddaf1096b2871bb">debug</a> = false</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">If true, the tree will print out debug information and a tree dump during insert() or erase() operation.  <a href="#b06ff26a50cb57614ddaf1096b2871bb"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static const int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="structstx_1_1btree__default__set__traits.html#b0bbc6a8fdfa17275dab38f5a9c80efc">leafslots</a> = BTREE_MAX( 8, 256 / (sizeof(_Key)) )</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Number of slots in each leaf of the tree.  <a href="#b0bbc6a8fdfa17275dab38f5a9c80efc"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static const int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="structstx_1_1btree__default__set__traits.html#1a1e1c183cffd510e3fc7e71076bad2b">innerslots</a> = BTREE_MAX( 8, 256 / (sizeof(_Key) + sizeof(void*)) )</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Number of slots in each inner node of the tree.  <a href="#1a1e1c183cffd510e3fc7e71076bad2b"></a><br></td></tr>
</table>
<hr><a name="_details"></a><h2>Detailed Description</h2>
<h3>template&lt;typename _Key&gt;<br>
 struct stx::btree_default_set_traits&lt; _Key &gt;</h3>

Generates default traits for a B+ tree used as a set.
<p>
It estimates leaf and inner node sizes by assuming a cache line size of 256 bytes.
<p>Definition at line <a class="el" href="btree_8h-source.html#l00074">74</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>
<hr><h2>Member Data Documentation</h2>
<a class="anchor" name="bbb0859c6f7a2b887863011026e28ab1"></a><!-- doxytag: member="stx::btree_default_set_traits::selfverify" ref="bbb0859c6f7a2b887863011026e28ab1" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename _Key&gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">const bool <a class="el" href="structstx_1_1btree__default__set__traits.html">stx::btree_default_set_traits</a>&lt; _Key &gt;::<a class="el" href="structstx_1_1btree__default__set__traits.html#bbb0859c6f7a2b887863011026e28ab1">selfverify</a> = false<code> [static]</code>          </td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
If true, the tree will self verify it's invariants after each insert() or erase().
<p>
The header must have been compiled with BTREE_DEBUG defined.
<p>Definition at line <a class="el" href="btree_8h-source.html#l00078">78</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>

</div>
</div><p>
<a class="anchor" name="b06ff26a50cb57614ddaf1096b2871bb"></a><!-- doxytag: member="stx::btree_default_set_traits::debug" ref="b06ff26a50cb57614ddaf1096b2871bb" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename _Key&gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">const bool <a class="el" href="structstx_1_1btree__default__set__traits.html">stx::btree_default_set_traits</a>&lt; _Key &gt;::<a class="el" href="structstx_1_1btree__default__set__traits.html#b06ff26a50cb57614ddaf1096b2871bb">debug</a> = false<code> [static]</code>          </td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
If true, the tree will print out debug information and a tree dump during insert() or erase() operation.
<p>
The header must have been compiled with BTREE_DEBUG defined and key_type must be std::ostream printable.
<p>Definition at line <a class="el" href="btree_8h-source.html#l00084">84</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>

</div>
</div><p>
<a class="anchor" name="b0bbc6a8fdfa17275dab38f5a9c80efc"></a><!-- doxytag: member="stx::btree_default_set_traits::leafslots" ref="b0bbc6a8fdfa17275dab38f5a9c80efc" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename _Key&gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">const int <a class="el" href="structstx_1_1btree__default__set__traits.html">stx::btree_default_set_traits</a>&lt; _Key &gt;::<a class="el" href="structstx_1_1btree__default__set__traits.html#b0bbc6a8fdfa17275dab38f5a9c80efc">leafslots</a> = BTREE_MAX( 8, 256 / (sizeof(_Key)) )<code> [static]</code>          </td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Number of slots in each leaf of the tree.
<p>
Estimated so that each node has a size of about 256 bytes.
<p>Definition at line <a class="el" href="btree_8h-source.html#l00088">88</a> of file <a class="el" href="btree_8h-source.html">btree.h</a>.</p>

</div>
</div><p>
<a class="anchor" name="1a1e1c183cffd510e3fc7e71076bad2b"></a><!-- doxytag: member="stx::btree_default_set_traits::innerslots" ref="1a1e1c183cffd510e3fc7e71076bad2b" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename _Key&gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">const int <a class="el" href="structstx_1_1btree__default__set__traits.html">stx::btree_default_set_traits</a>&lt; _Key &gt;::<a class="el" href="structstx_1_1btree__default__set__traits.html#1a1e1c183cffd510e3fc7e71076bad2b">innerslots</a> = BTREE_MAX( 8, 256 / (sizeof(_Key) + sizeof(void*)) )<code> [static]</code>          </td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Number of slots in each inner node of the tree.
<p>
Estimated so that each node has a size of about 256 bytes.
<p>Definition at line <a class="el" href="btree_8h-source.html#l00092">92</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&nbsp;
<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>
RSS 2.0 Weblog Feed Atom 1.0 Weblog Feed Valid XHTML 1.1 Valid CSS (2.1)