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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
|
/*
* Copyright (C) 2012-2014 Robin Haberkorn
*
* 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.
*
* 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, see <http://www.gnu.org/licenses/>.
*/
#ifndef __RBTREE_H
#define __RBTREE_H
#include <bsd/sys/tree.h>
#include <glib.h>
#include "undo.h"
namespace SciTECO {
class RBTree {
public:
class RBEntry;
private:
RB_HEAD(Tree, RBEntry) head;
RB_PROTOTYPE_INTERNAL(Tree, RBEntry, nodes, /* unused */, static);
public:
class RBEntry {
public:
RB_ENTRY(RBEntry) nodes;
virtual ~RBEntry() {}
inline RBEntry *
next(void)
{
return RBTree::Tree_RB_NEXT(this);
}
inline RBEntry *
prev(void)
{
return RBTree::Tree_RB_PREV(this);
}
virtual int operator <(RBEntry &entry) = 0;
};
private:
static inline int
compare_entries(RBEntry *e1, RBEntry *e2)
{
return *e1 < *e2;
}
public:
RBTree()
{
RB_INIT(&head);
}
virtual
~RBTree()
{
clear();
}
inline RBEntry *
insert(RBEntry *entry)
{
RB_INSERT(Tree, &head, entry);
return entry;
}
inline RBEntry *
remove(RBEntry *entry)
{
return RB_REMOVE(Tree, &head, entry);
}
inline RBEntry *
find(RBEntry *entry)
{
return RB_FIND(Tree, &head, entry);
}
inline RBEntry *
nfind(RBEntry *entry)
{
return RB_NFIND(Tree, &head, entry);
}
inline RBEntry *
min(void)
{
return RB_MIN(Tree, &head);
}
inline RBEntry *
max(void)
{
return RB_MAX(Tree, &head);
}
inline void
clear(void)
{
RBEntry *cur;
while ((cur = min())) {
remove(cur);
delete cur;
}
}
};
} /* namespace SciTECO */
#endif
|
