1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
|
/*
* Flexible B-tree implementation. Supports reference counting for
* copy-on-write, user-defined node properties, and variable
* degree.
*
* This file is copyright 2001,2004 Simon Tatham.
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without limitation the rights to use,
* copy, modify, merge, publish, distribute, sublicense, and/or
* sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following
* conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL SIMON TATHAM BE LIABLE FOR
* ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
* CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#ifndef BTREE_H
#define BTREE_H
#include <stddef.h> /* for offsetof */
#ifndef alignof
#define alignof(typ) ( offsetof(struct { char c; typ t; }, t) )
#endif
typedef struct btree btree;
typedef void *bt_element_t;
typedef int (*cmpfn_t)(void *state, bt_element_t, bt_element_t);
typedef bt_element_t (*copyfn_t)(void *state, bt_element_t);
typedef void (*freefn_t)(void *state, bt_element_t);
typedef void (*propmakefn_t)(void *state, bt_element_t, void *dest);
/* s1 may be NULL (indicating copy s2 into dest). s2 is never NULL. */
typedef void (*propmergefn_t)(void *state, void *s1, void *s2, void *dest);
typedef int (*searchfn_t)(void *tstate, void *sstate, int ntrees,
void **props, int *counts,
bt_element_t *elts, int *is_elt);
enum {
BT_REL_EQ, BT_REL_LT, BT_REL_LE, BT_REL_GT, BT_REL_GE
};
btree *bt_new(cmpfn_t cmp, copyfn_t copy, freefn_t freeelt,
int propsize, int propalign, propmakefn_t propmake,
propmergefn_t propmerge, void *state, int mindegree);
void bt_free(btree *bt);
btree *bt_clone(btree *bt);
int bt_count(btree *bt);
bt_element_t bt_index(btree *bt, int index);
bt_element_t bt_index_w(btree *bt, int index);
bt_element_t bt_findrelpos(btree *bt, bt_element_t element, cmpfn_t cmp,
int relation, int *index);
bt_element_t bt_findrel(btree *bt, bt_element_t element, cmpfn_t cmp,
int relation);
bt_element_t bt_findpos(btree *bt, bt_element_t element, cmpfn_t cmp,
int *index);
bt_element_t bt_find(btree *bt, bt_element_t element, cmpfn_t cmp);
bt_element_t bt_propfind(btree *bt, searchfn_t search, void *sstate,
int *index);
bt_element_t bt_replace(btree *bt, bt_element_t element, int index);
void bt_addpos(btree *bt, bt_element_t element, int pos);
bt_element_t bt_add(btree *bt, bt_element_t element);
bt_element_t bt_delpos(btree *bt, int pos);
bt_element_t bt_del(btree *bt, bt_element_t element);
btree *bt_join(btree *bt1, btree *bt2);
btree *bt_joinr(btree *bt1, btree *bt2);
btree *bt_splitpos(btree *bt, int index, int before);
btree *bt_split(btree *bt, bt_element_t element, cmpfn_t cmp, int rel);
#endif /* BTREE_H */
|
