新建.txt

来自「是当初的数据结构的做业,用的是b+树这一块,非常值得初学者的参考」· 文本 代码 · 共 27 行

template<class Key,class Elem,class KKcomp>
bool BPTree<Key, Elem,KKcomp>::
inserthelp(BPNode<key>*subroot,const Key& K,Elem*e,
		   Key& retval,void*&retptr{
	Key myretv;
	void*myretv;
	void*myretp=NULL;
	int currec=binaryle(subroot->recs,subroot->numrec,k);
	if (subroot->isleaf()){
		myretv=K;
		myretp=e;
	}
	else{
		inserthelp((BPNode<Key>*)subroot->recs[currec].ptr,
			                     K,e,myretv,myretp);
		if (myretp==NULL)return true;
		if(subroot->isLeaf()&&
			KKcomp::eq(subroot->recs[currec].key,myretv))
			return false;
		if(!subroot->isFull())
			putinarray<Key>(subroot->recs,currec,myretv,myretp);
		else{
			retptr=splitnode<Key>(subroot,currec,myretc,myretp);
			retval=((BPNode<Key>*)retptr->recs[0].key;
		}
		return true;
	}