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

📄 ttree_8h-source.html

📁 最新版本!fastdb是高效的内存数据库系统
💻 HTML
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
<title>ttree.h Source File</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.2.18 -->
<center>
<a class="qindex" href="index.html">Main Page</a> &nbsp; <a class="qindex" href="hierarchy.html">Class Hierarchy</a> &nbsp; <a class="qindex" href="annotated.html">Compound List</a> &nbsp; <a class="qindex" href="files.html">File List</a> &nbsp; <a class="qindex" href="functions.html">Compound Members</a> &nbsp; </center>
<hr><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 BEGIN_FASTDB_NAMESPACE
00015 
00016 <span class="keyword">class </span>FASTDB_DLL_ENTRY dbTtreeNode { 
00017     <span class="keyword">enum</span> { 
00018         pageSize = 125,
00019         minItems = pageSize - 2 <span class="comment">// minimal number of items in internal node</span>
00020     };
00021 
00022   <span class="keyword">public</span>:
00023     oid_t left;
00024     oid_t right;
00025     int1  balance;
00026     nat2  nItems;
00027     oid_t item[pageSize];
00028 
00029     <span class="keyword">static</span> oid_t allocate(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t recordId);
00030     
00031     <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, 
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>   remove(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t&amp; nodeId, oid_t recordId,  
00034                         <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);
00035     <span class="keyword">static</span> <span class="keywordtype">int</span>   balanceRightBranch(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t&amp; nodeId);
00036     <span class="keyword">static</span> <span class="keywordtype">int</span>   balanceLeftBranch(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t&amp; nodeId);
00037     
00038     <span class="keyword">static</span> <span class="keywordtype">void</span>  purge(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t nodeId);
00039 
00040     <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);
00041     <span class="keywordtype">bool</span> prefixSearch(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, <a class="code" href="classdbSearchContext.html">dbSearchContext</a>&amp; sc);
00042 
00043     <span class="keywordtype">bool</span> traverseForward(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db,<a class="code" href="classdbAnyCursor.html">dbAnyCursor</a>* cursor);
00044     <span class="keywordtype">bool</span> traverseBackward(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, <a class="code" href="classdbAnyCursor.html">dbAnyCursor</a>* cursor);
00045     <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);
00046     <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);
00047 };
00048 
00049 <span class="keyword">class </span>FASTDB_DLL_ENTRY dbTtree { 
00050   <span class="keyword">protected</span>:
00051     oid_t root;
00052 
00053   <span class="keyword">public</span>:
00054     <span class="keyword">static</span> oid_t allocate(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db);
00055     <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);
00056     <span class="keyword">static</span> <span class="keywordtype">void</span>  prefixSearch(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t treeId, <a class="code" href="classdbSearchContext.html">dbSearchContext</a>&amp; sc);
00057     <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, 
00058                         <span class="keywordtype">int</span> type, <span class="keywordtype">int</span> sizeofType, dbUDTComparator comparator, <span class="keywordtype">int</span> offs);
00059     <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,
00060                         <span class="keywordtype">int</span> type, <span class="keywordtype">int</span> sizeofType, dbUDTComparator comparator, <span class="keywordtype">int</span> offs);
00061     <span class="keyword">static</span> <span class="keywordtype">void</span>  drop(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t treeId);
00062     <span class="keyword">static</span> <span class="keywordtype">void</span>  purge(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t treeId);
00063     
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);
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);
00068     <span class="keyword">static</span> <span class="keywordtype">void</span>  traverseForward(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t treeId,
00069                                  <a class="code" href="classdbAnyCursor.html">dbAnyCursor</a>* cursor, dbExprNode* condition);
00070     <span class="keyword">static</span> <span class="keywordtype">void</span>  traverseBackward(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t treeId,
00071                                   <a class="code" href="classdbAnyCursor.html">dbAnyCursor</a>* cursor, dbExprNode* condition);
00072 };
00073 
00074 END_FASTDB_NAMESPACE
00075 
00076 <span class="preprocessor">#endif</span>
</pre></div><hr><address style="align: right;"><small>Generated on Thu Feb 14 12:42:30 2008 for FastDB by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border=0 
width=110 height=53></a>1.2.18 </small></address>
</body>
</html>

⌨️ 快捷键说明

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