|
|
|
|
/*
|
|
|
|
|
* Copyright 1995-2014 Andrew Smith
|
|
|
|
|
*
|
|
|
|
|
* 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 3 of the License, or (at your option)
|
|
|
|
|
* any later version. See COPYING for more details.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#ifndef ___KTREE_H
|
|
|
|
|
#define ___KTREE_H
|
|
|
|
|
|
|
|
|
|
#include "klist.h"
|
|
|
|
|
#include "libckpool.h"
|
|
|
|
|
|
|
|
|
|
#define quithere(status, fmt, ...) \
|
|
|
|
|
quitfrom(status, __FILE__, __func__, __LINE__, fmt, ##__VA_ARGS__)
|
|
|
|
|
|
|
|
|
|
#define KTREE_FFL " - from %s %s() line %d"
|
|
|
|
|
#define KTREE_FFL_HERE __FILE__, __func__, __LINE__
|
|
|
|
|
#define KTREE_FFL_PASS file, func, line
|
|
|
|
|
#define KTREE_FFL_ARGS __maybe_unused const char *file, \
|
|
|
|
|
__maybe_unused const char *func, \
|
|
|
|
|
__maybe_unused const int line
|
|
|
|
|
|
|
|
|
|
typedef struct ktree
|
|
|
|
|
{
|
|
|
|
|
bool isNil;
|
|
|
|
|
bool red;
|
|
|
|
|
struct ktree *parent;
|
|
|
|
|
struct ktree *left;
|
|
|
|
|
struct ktree *right;
|
|
|
|
|
K_ITEM *data;
|
|
|
|
|
long test;
|
|
|
|
|
} K_TREE;
|
|
|
|
|
|
|
|
|
|
typedef void *K_TREE_CTX;
|
|
|
|
|
|
|
|
|
|
extern K_TREE *_new_ktree(KTREE_FFL_ARGS);
|
|
|
|
|
#define new_ktree() _new_ktree(KLIST_FFL_HERE)
|
|
|
|
|
extern void _dump_ktree(K_TREE *root, char *(*dsp_funct)(K_ITEM *), KTREE_FFL_ARGS);
|
|
|
|
|
#define dump_ktree(_root, _dsp_funct) _dump_ktree(_root, _dsp_funct, KLIST_FFL_HERE)
|
|
|
|
|
extern void _dsp_ktree(K_LIST *list, K_TREE *root, char *filename, char *msg, KTREE_FFL_ARGS);
|
|
|
|
|
#define dsp_ktree(_list, _root, _filename, _msg) _dsp_ktree(_list, _root, _filename, _msg, KLIST_FFL_HERE)
|
|
|
|
|
extern K_ITEM *_first_in_ktree(K_TREE *root, K_TREE_CTX *ctx, KTREE_FFL_ARGS);
|
|
|
|
|
#define first_in_ktree(_root, _ctx) _first_in_ktree(_root, _ctx, KLIST_FFL_HERE)
|
|
|
|
|
extern K_ITEM *_last_in_ktree(K_TREE *root, K_TREE_CTX *ctx, KTREE_FFL_ARGS);
|
|
|
|
|
#define last_in_ktree(_root, _ctx) _last_in_ktree(_root, _ctx, KLIST_FFL_HERE)
|
|
|
|
|
extern K_ITEM *_next_in_ktree(K_TREE_CTX *ctx, KTREE_FFL_ARGS);
|
|
|
|
|
#define next_in_ktree(_ctx) _next_in_ktree(_ctx, KLIST_FFL_HERE)
|
|
|
|
|
extern K_ITEM *_prev_in_ktree(K_TREE_CTX *ctx, KTREE_FFL_ARGS);
|
|
|
|
|
#define prev_in_ktree(_ctx) _prev_in_ktree(_ctx, KLIST_FFL_HERE)
|
|
|
|
|
extern K_TREE *_add_to_ktree(K_TREE *root, K_ITEM *data, double (*cmp_func)(K_ITEM *, K_ITEM *), KTREE_FFL_ARGS);
|
|
|
|
|
#define add_to_ktree(_root, _data, _cmp_func) _add_to_ktree(_root, _data, _cmp_func, KLIST_FFL_HERE)
|
|
|
|
|
extern K_ITEM *_find_in_ktree(K_TREE *root, K_ITEM *data, double (*cmp_funct)(K_ITEM *, K_ITEM *), K_TREE_CTX *ctx, KTREE_FFL_ARGS);
|
|
|
|
|
#define find_in_ktree(_root, _data, _cmp_funct, _ctx) _find_in_ktree(_root, _data, _cmp_funct, _ctx, KLIST_FFL_HERE)
|
|
|
|
|
extern K_ITEM *_find_after_in_ktree(K_TREE *ktree, K_ITEM *data, double (*cmp_funct)(K_ITEM *, K_ITEM *), K_TREE_CTX *ctx, KTREE_FFL_ARGS);
|
|
|
|
|
#define find_after_in_ktree(_ktree, _data, _cmp_funct, _ctx) _find_after_in_ktree(_ktree, _data, _cmp_funct, _ctx, KLIST_FFL_HERE)
|
|
|
|
|
extern K_ITEM *_find_before_in_ktree(K_TREE *ktree, K_ITEM *data, double (*cmp_funct)(K_ITEM *, K_ITEM *), K_TREE_CTX *ctx, KTREE_FFL_ARGS);
|
|
|
|
|
#define find_before_in_ktree(_ktree, _data, _cmp_funct, _ctx) _find_before_in_ktree(_ktree, _data, _cmp_funct, _ctx, KLIST_FFL_HERE)
|
|
|
|
|
extern K_TREE *_remove_from_ktree(K_TREE *root, K_ITEM *data, double (*cmp_funct)(K_ITEM *, K_ITEM *), K_TREE_CTX *ctx, KTREE_FFL_ARGS);
|
|
|
|
|
#define remove_from_ktree(_root, _data, _cmp_funct, _ctx) _remove_from_ktree(_root, _data, _cmp_funct, _ctx, KLIST_FFL_HERE)
|
|
|
|
|
extern K_TREE *_free_ktree(K_TREE *root, void (*free_funct)(void *), KTREE_FFL_ARGS);
|
|
|
|
|
#define free_ktree(_root, _free_funct) _free_ktree(_root, _free_funct, KLIST_FFL_HERE)
|
|
|
|
|
|
|
|
|
|
#endif
|
