btree.h

来自「b树的实现」· C头文件 代码 · 共 51 行

H
51
字号
/*- * Copyright 1997, 1998, 2001 John-Mark Gurney. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright *    notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright *    notice, this list of conditions and the following disclaimer in the *    documentation and/or other materials provided with the distribution. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * *	$Id: btree.h,v 1.4.2.1 2001/03/28 06:17:12 jmg Exp $ * */#ifndef _BTREE_H_#define _BTREE_H_struct btree;#define	BT_SIZEDEF	128typedef void *bt_data_t;typedef int (*bt_cmp_t)(bt_data_t, bt_data_t);struct btree *bt_create(bt_cmp_t , int nodesize);void bt_insert(struct btree *, bt_data_t);void bt_dumptree(struct btree *);void bt_treestats(struct btree *);void *bt_delete(struct btree *, bt_data_t);int bt_checktree(struct btree *, bt_data_t min, bt_data_t max);void *bt_max(struct btree *);void *bt_min(struct btree *);void *bt_find(struct btree *, bt_data_t);#endif /* _BTREE_H_ */

⌨️ 快捷键说明

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