📄 rtree_8h-source.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>rtree.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> <a class="qindex" href="hierarchy.html">Class Hierarchy</a> <a class="qindex" href="annotated.html">Compound List</a> <a class="qindex" href="files.html">File List</a> <a class="qindex" href="functions.html">Compound Members</a> </center><hr><h1>rtree.h</h1><div class="fragment"><pre>00001 <span class="comment">//-< RTREE.H >-------------------------------------------------------*--------*</span>00002 <span class="comment">// FastDB Version 1.0 (c) 1999 GARRET * ? *</span>00003 <span class="comment">// (Post Relational Database Management System) * /\| *</span>00004 <span class="comment">// * / \ *</span>00005 <span class="comment">// Created: 22-Nov-2001 K.A. Knizhnik * / [] \ *</span>00006 <span class="comment">// Last update: 22-Nov-2001 K.A. Knizhnik * GARRET *</span>00007 <span class="comment">//-------------------------------------------------------------------*--------*</span>00008 <span class="comment">// R-tree: spatial index</span>00009 <span class="comment">//-------------------------------------------------------------------*--------*</span>00010 00011 <span class="preprocessor">#ifndef __RTREE_H__</span>00012 <span class="preprocessor"></span><span class="preprocessor">#define __RTREE_H__</span>00013 <span class="preprocessor"></span>00014 <span class="preprocessor">#include "rectangle.h"</span>00015 00016 BEGIN_FASTDB_NAMESPACE00017 00018 <span class="preprocessor">#define MAX_RTREE_HEIGHT 8</span>00019 <span class="preprocessor"></span>00020 <span class="keyword">class </span><a class="code" href="classdbAnyCursor.html">dbAnyCursor</a>;00021 00022 <span class="keyword">class </span>dbRtreePage { 00023 <span class="keyword">public</span>:00024 <span class="keyword">struct </span>branch { 00025 <a class="code" href="classrectangle.html">rectangle</a> rect;00026 oid_t p;00027 };00028 00029 <span class="keyword">enum</span> { 00030 card = (dbPageSize - 4) / <span class="keyword">sizeof</span>(branch), <span class="comment">// maximal number of branches at page</span>00031 min_fill = card/2 <span class="comment">// minimal number of branches at non-root page</span>00032 };00033 00034 <span class="keyword">struct </span>reinsert_list { 00035 oid_t chain;00036 <span class="keywordtype">int</span> level;00037 reinsert_list() { chain = 0; }00038 };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>& sc, <span class="keywordtype">int</span> level) <span class="keyword">const</span>;00041 <span class="keyword">static</span> <span class="keywordtype">bool</span> find(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t rootId, <a class="code" href="classdbSearchContext.html">dbSearchContext</a>& sc, <span class="keywordtype">int</span> level);00042 00043 <span class="keyword">static</span> oid_t insert(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, <a class="code" href="classrectangle.html">rectangle</a> <span class="keyword">const</span>& r, oid_t pageId, oid_t recordId, <span class="keywordtype">int</span> level);00044 00045 <span class="keyword">static</span> <span class="keywordtype">bool</span> remove(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, <a class="code" href="classrectangle.html">rectangle</a> <span class="keyword">const</span>& r, oid_t pageId, oid_t recordId, 00046 <span class="keywordtype">int</span> level, reinsert_list& rlist);00047 00048 <span class="keywordtype">void</span> cover(<a class="code" href="classrectangle.html">rectangle</a>& r) <span class="keyword">const</span>;00049 <span class="keyword">static</span> <span class="keywordtype">void</span> cover(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t pageId, <a class="code" href="classrectangle.html">rectangle</a>& r);00050 00051 <span class="keyword">static</span> oid_t add_branch(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t pageId, branch <span class="keyword">const</span>& br);00052 00053 <span class="keywordtype">void</span> remove_branch(<span class="keywordtype">int</span> i);00054 00055 <span class="keyword">static</span> <span class="keywordtype">void</span> purge(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t pageId, <span class="keywordtype">int</span> level);00056 00057 oid_t next_reinsert_page()<span class="keyword"> const </span>{ 00058 <span class="keywordflow">return</span> b[card-1].p; 00059 }00060 00061 <span class="keyword">static</span> oid_t allocate(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t recordId, <a class="code" href="classrectangle.html">rectangle</a> <span class="keyword">const</span>& r);00062 <span class="keyword">static</span> oid_t allocate(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t rootId, oid_t p);00063 00064 int4 n; <span class="comment">// number of branches at page</span>00065 branch b[card];00066 };00067 00068 <span class="keyword">class </span>FASTDB_DLL_ENTRY dbRtree {00069 <span class="keyword">public</span>: 00070 <span class="keyword">enum</span> searchOp { 00071 EQUAL, 00072 OVERLAPS, 00073 SUPERSET,00074 PROPER_SUPERSET, 00075 SUBSET, 00076 PROPER_SUBSET00077 };00078 00079 <span class="keyword">static</span> oid_t allocate(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db);00080 <span class="keyword">static</span> <span class="keywordtype">bool</span> find(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t treeId, <a class="code" href="classdbSearchContext.html">dbSearchContext</a>& sc);00081 <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, <span class="keywordtype">int</span> offs);00082 <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, <a class="code" href="classrectangle.html">rectangle</a> <span class="keyword">const</span>& r);00083 <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, <span class="keywordtype">int</span> offs);00084 <span class="keyword">static</span> <span class="keywordtype">void</span> purge(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t treeId);00085 <span class="keyword">static</span> <span class="keywordtype">void</span> drop(<a class="code" href="classdbDatabase.html">dbDatabase</a>* db, oid_t treeId);00086 00087 <span class="keyword">protected</span>:00088 int4 height;00089 oid_t root;00090 };00091 00092 END_FASTDB_NAMESPACE00093 00094 <span class="preprocessor">#endif</span></pre></div><hr><address style="align: right;"><small>Generated on Mon Oct 23 13:23:58 2006 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 + -