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
|
/**
* \file
* \brief
* Implementation of Red-Black Tree as described in
* Intorduction to Algorithms. Cormen et al. Mc Grow Hill. 1990. pp 263-280
*
* The intention is to implement interval trees mentioned in the same book, after the red-black.
* Interval are heavily based on red-black trees (most operations are the same). So, we begin first
* with implementing red-black!
*
* Authors:
* ? <?@?.?>
*
* Copyright 2009-2009 Evangelos Katsikaros
*
* This library is free software; you can redistribute it and/or
* modify it either under the terms of the GNU Lesser General Public
* License version 2.1 as published by the Free Software Foundation
* (the "LGPL") or, at your option, under the terms of the Mozilla
* Public License Version 1.1 (the "MPL"). If you do not alter this
* notice, a recipient may use your version of this file under either
* the MPL or the LGPL.
*
* You should have received a copy of the LGPL along with this library
* in the file COPYING-LGPL-2.1; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
* You should have received a copy of the MPL along with this library
* in the file COPYING-MPL-1.1
*
* The contents of this file are subject to the Mozilla Public License
* Version 1.1 (the "License"); you may not use this file except in
* compliance with the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY
* OF ANY KIND, either express or implied. See the LGPL or the MPL for
* the specific language governing rights and limitations.
*
*/
#ifndef SEEN_LIB2GEOM_REDBLACKTREE_H
#define SEEN_LIB2GEOM_REDBLACKTREE_H
#include <vector>
//#include <cassert>
#include <limits>
#include <cfloat>
#include <2geom/d2.h>
#include <2geom/interval.h>
namespace Geom{
class RedBlack{
public:
Interval interval; // Key of the redblack tree will be the min of the interval
RedBlack *left, *right, *parent;
bool isRed;
Coord subtree_max; // subtree_max = max( x->left->subtree_max, x->right->subtree_max, x->high )
int data;
RedBlack(): left(0), right(0), parent(0), isRed(false), subtree_max(0.0), data(0) {
Interval interval(0.0, 0.0);
}
/*
RedBlack(Coord min, Coord max): left(0), right(0), parent(0), isRed(false), subtree_max(0.0), data(0) {
Interval interval( min, max );
}
*/
inline Coord key(){ return interval.min(); };
inline Coord high(){ return interval.max(); };
};
class RedBlackTree{
public:
RedBlack* root;
RedBlackTree(): root(0) {}
void insert(Rect const &r, int shape, int dimension);
void insert(Coord dimension_min, Coord dimension_max, int shape);
void erase(Rect const &r);
void erase(int shape);
RedBlack* search(Rect const &r, int dimension);
RedBlack* search(Interval i);
RedBlack* search(Coord a, Coord b);
void print_tree();
private:
void inorder_tree_walk(RedBlack* x);
RedBlack* tree_minimum(RedBlack* x);
RedBlack* tree_successor(RedBlack* x);
void left_rotate(RedBlack* x);
void right_rotate(RedBlack* x);
void tree_insert(RedBlack* x);
void update_max(RedBlack* x);
RedBlack* erase(RedBlack* x); // TODO why rerutn pointer? to collect garbage ???
void erase_fixup(RedBlack* x);
};
} // end namespace Geom
#endif // !SEEN_LIB2GEOM_REDBLACKTREE_H
/*
Local Variables:
mode:c++
c-file-style:"stroustrup"
c-file-offsets:((innamespace . 0)(inline-open . 0)(case-label . +))
indent-tabs-mode:nil
fill-column:99
End:
*/
// vim: filetype=cpp:expandtab:shiftwidth=4:tabstop=8:softtabstop=4:fileencoding=utf-8:textwidth=99 :
|
