資源簡介
采用平衡二叉樹索引關(guān)鍵字,可以體會數(shù)據(jù)結(jié)構(gòu)用法,也可用于項目,完全開源
代碼片段和文件信息
#include?“BPlusTree.h“
int?bptree::v=2;
node::node()
{
type=0;
idx=new?keyPos[bptree::v*2];
int?i;
for(i=0;i idx[i].pos=NULL;
}
node::~node()
{
int?i;
if(idx)
{
if(!type)
for(i=0;i {
node?*n0=(idx+i)->pos;
if(n0)
{
delete?(node?*)n0;
(idx+i)->pos=NULL;
}
else?break;
}
delete?idx;
}
idx=NULL;
}
int?node::insert(keyPos?*n0node?**bhd)
{
*bhd=NULL;
int?i;
keyPos?*kp;
for(i=0;i {
kp=idx+i;
if(kp->pos==NULL)
break;
if(kp->key==n0->key)
return?1;
if(n0->key>kp->key)
break;
}
int?j=i;
node?*nn=NULL;
node?*nn0=NULL;
j=j-1;
if(j<0)?j=0;
keyPos?k1;
if(!type)
{
nn=(node?*)(idx[j].pos);
if(nn->insert(
?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????目錄??????????0??2008-09-22?14:36??Bptree
?????文件???????2792??2008-09-23?15:55??Bptree\BPlusTree.cpp
?????文件????????518??2008-09-22?23:49??Bptree\BPlusTree.h
?????文件??????76800??2008-09-23?16:01??Bptree\Bptree.ncb
?????文件????????912??2008-09-20?11:57??Bptree\Bptree.sln
????..A..H.??????7680??2008-09-23?16:01??Bptree\Bptree.suo
?????文件???????3054??2008-09-20?12:06??Bptree\Bptree.vcproj
?????文件????????378??2008-09-23?00:04??Bptree\Demo.cpp
?????目錄??????????0??2008-09-22?14:36??Bptree\Debug
?????文件?????135168??2008-09-23?15:55??Bptree\Debug\Bptree.exe
?????文件?????445980??2008-09-23?15:55??Bptree\Debug\Bptree.ilk
?????文件?????470016??2008-09-23?15:55??Bptree\Debug\Bptree.pdb
?????文件???????5220??2008-09-23?15:55??Bptree\Debug\BuildLog.htm
?????文件???????5441??2008-09-23?00:04??Bptree\Debug\Demo.obj
?????文件??????44032??2008-09-23?15:55??Bptree\Debug\vc70.idb
?????文件??????69632??2008-09-23?15:55??Bptree\Debug\vc70.pdb
?????文件??????14007??2008-09-23?15:55??Bptree\Debug\BPlusTree.obj
-----------?---------??----------?-----??----
??????????????1281630????????????????????17
評論
共有 條評論