btree.h

在SCO UNIX制定界面程序 可根据文件配制菜单,而不必修改源程序,非常方便

/***********************
 *    B+ 树算法	       *
 ***********************/

#include <stdio.h>
#include <string.h>

#define SUCC	0
#define	FAIL	-1

#define M_TREE		11
#define BTREE_KEY_LEN	10

typedef struct btree_inode {
			char type;
			struct btree_inode *parent;

			struct btree_inode *pre;
			struct btree_inode *next;

			int n;
			void *ip[M_TREE+1];
			char key[M_TREE+1][BTREE_KEY_LEN+1];
} INODE;

typedef struct btree_leave {
			char type;
			INODE *parent;
			
			void *data;
} LEAVE;

int Insert_btree ( char *key , void *data , int len , INODE *p , int i );
int Search_btree ( char *key , void *data , int len , void **p1 , int *i );
void Delete_btree ( INODE *p , int i );
void Update_btree ( INODE *p , int i ,  void *data , int len );
int Next_to_next_btree ( void **p1 , int *i , char *key , void *data , int len );