btree.h

/*
 * Copyright (C) 2004 Jens Taprogge
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software Foundation,
 * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
 */

#ifndef __BTREE_H
#define __BTREE_H

#include <stdint.h>

struct btree_head {
	struct btree_head 	*prev, *parent, *next;
	uint32_t		 sortkey;
};

typedef int (*btree_cmp) (struct btree_head *a, struct btree_head *b);

void btree_init(struct btree_head *head); 

struct btree_head *btree_find(struct btree_head **root, 
		struct btree_head *search, btree_cmp cmp);

int btree_add(struct btree_head *root, struct btree_head *new, btree_cmp cmp);


struct btree_head *btree_next(struct btree_head *current);

struct btree_head *btree_prev(struct btree_head *current);

struct btree_head *btree_first(struct btree_head *current); 

struct btree_head *btree_last(struct btree_head *current);

#endif