⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 ttree_8h-source.html

📁 FastDb是高效的内存数据库系统
💻 HTML
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1"><title>FastDB: ttree.h Source File</title><link href="doxygen.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.3.5 --><div class="qindex"><a class="qindex" href="index.html">Main&nbsp;Page</a> | <a class="qindex" href="hierarchy.html">Class&nbsp;Hierarchy</a> | <a class="qindex" href="annotated.html">Class&nbsp;List</a> | <a class="qindex" href="files.html">File&nbsp;List</a> | <a class="qindex" href="functions.html">Class&nbsp;Members</a></div><h1>ttree.h</h1><div class="fragment"><pre>00001 <span class="comment">//-&lt; TTREE.CPP &gt;-----------------------------------------------------*--------*</span>00002 <span class="comment">// FastDB                    Version 1.0         (c) 1999  GARRET    *     ?  *</span>00003 <span class="comment">// (Main Memory Database Management System)                          *   /\|  *</span>00004 <span class="comment">//                                                                   *  /  \  *</span>00005 <span class="comment">//                          Created:     20-Nov-98    K.A. Knizhnik  * / [] \ *</span>00006 <span class="comment">//                          Last update: 10-Dec-98    K.A. Knizhnik  * GARRET *</span>00007 <span class="comment">//-------------------------------------------------------------------*--------*</span>00008 <span class="comment">// T-Tree interface</span>00009 <span class="comment">//-------------------------------------------------------------------*--------*</span>00010 00011 <span class="preprocessor">#ifndef __TTREE_H__</span>00012 <span class="preprocessor"></span><span class="preprocessor">#define __TTREE_H__</span>00013 <span class="preprocessor"></span>00014 <span class="keyword">class </span>FASTDB_DLL_ENTRY dbTtreeNode { 00015     <span class="keyword">enum</span> { 00016         pageSize = 125,00017         minItems = pageSize - 2 <span class="comment">// minimal number of items in internal node</span>00018     };00019 00020   <span class="keyword">public</span>:00021     oid_t left;00022     oid_t right;00023     int1  balance;00024     nat2  nItems;00025     oid_t item[pageSize];00026 00027     <span class="keyword">static</span> oid_t allocate(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t recordId);00028     00029     <span class="keyword">static</span> <span class="keywordtype">bool</span>  insert(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t&amp; nodeId, oid_t recordId, 00030                         <span class="keywordtype">void</span>* key, <span class="keywordtype">int</span> type, <span class="keywordtype">int</span> sizeofType, dbUDTComparator comparator, <span class="keywordtype">int</span> offs);00031     <span class="keyword">static</span> <span class="keywordtype">int</span>   remove(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t&amp; nodeId, oid_t recordId,  00032                         <span class="keywordtype">void</span>* key, <span class="keywordtype">int</span> type, <span class="keywordtype">int</span> sizeofType, dbUDTComparator comparator, <span class="keywordtype">int</span> offs);00033     <span class="keyword">static</span> <span class="keywordtype">int</span>   balanceRightBranch(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t&amp; nodeId);00034     <span class="keyword">static</span> <span class="keywordtype">int</span>   balanceLeftBranch(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t&amp; nodeId);00035     00036     <span class="keyword">static</span> <span class="keywordtype">void</span>  purge(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t nodeId);00037 00038     <span class="keywordtype">bool</span> find(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, <a class="code" href="classdbSearchContext.html">dbSearchContext</a>&amp; sc);00039 00040     <span class="keywordtype">bool</span> traverseForward(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db,<a class="code" href="classdbAnyCursor.html">dbAnyCursor</a>* cursor);00041     <span class="keywordtype">bool</span> traverseBackward(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, <a class="code" href="classdbAnyCursor.html">dbAnyCursor</a>* cursor);00042     <span class="keywordtype">bool</span> traverseForward(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db,<a class="code" href="classdbAnyCursor.html">dbAnyCursor</a>* cursor,dbExprNode* cond);00043     <span class="keywordtype">bool</span> traverseBackward(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db,<a class="code" href="classdbAnyCursor.html">dbAnyCursor</a>* cursor,dbExprNode* cond);00044 };00045 00046 <span class="keyword">class </span>FASTDB_DLL_ENTRY dbTtree { 00047   <span class="keyword">protected</span>:00048     oid_t root;00049 00050   <span class="keyword">public</span>:00051     <span class="keyword">static</span> oid_t allocate(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db);00052     <span class="keyword">static</span> <span class="keywordtype">void</span>  find(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t treeId, <a class="code" href="classdbSearchContext.html">dbSearchContext</a>&amp; sc);00053     <span class="keyword">static</span> <span class="keywordtype">void</span>  insert(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t treeId, oid_t recordId, 00054                         <span class="keywordtype">int</span> type, <span class="keywordtype">int</span> sizeofType, dbUDTComparator comparator, <span class="keywordtype">int</span> offs);00055     <span class="keyword">static</span> <span class="keywordtype">void</span>  remove(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t treeId, oid_t recordId,00056                         <span class="keywordtype">int</span> type, <span class="keywordtype">int</span> sizeofType, dbUDTComparator comparator, <span class="keywordtype">int</span> offs);00057     <span class="keyword">static</span> <span class="keywordtype">void</span>  drop(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t treeId);00058     <span class="keyword">static</span> <span class="keywordtype">void</span>  purge(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t treeId);00059     00060     <span class="keyword">static</span> <span class="keywordtype">void</span>  traverseForward(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t treeId,00061                                  <a class="code" href="classdbAnyCursor.html">dbAnyCursor</a>* cursor);00062     <span class="keyword">static</span> <span class="keywordtype">void</span>  traverseBackward(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t treeId,00063                                   <a class="code" href="classdbAnyCursor.html">dbAnyCursor</a>* cursor);00064     <span class="keyword">static</span> <span class="keywordtype">void</span>  traverseForward(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t treeId,00065                                  <a class="code" href="classdbAnyCursor.html">dbAnyCursor</a>* cursor, dbExprNode* condition);00066     <span class="keyword">static</span> <span class="keywordtype">void</span>  traverseBackward(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t treeId,00067                                   <a class="code" href="classdbAnyCursor.html">dbAnyCursor</a>* cursor, dbExprNode* condition);00068 };00069 00070 00071 <span class="preprocessor">#endif</span></pre></div><hr size="1"><address style="align: right;"><small>Generated on Thu Feb 12 13:04:48 2004 for FastDB by<a href="http://www.doxygen.org/index.html"><img src="doxygen.png" alt="doxygen" align="middle" border=0 > </a>1.3.5 </small></address></body></html>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -