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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
|
/** \file
* Object hierarchy implementation.
*
* Authors:
* MenTaLguY <mental@rydia.net>
*
* Copyright (C) 2004 MenTaLguY
*
* Released under GNU GPL, read the file 'COPYING' for more information
*/
#include "sp-object.h"
#include "object-hierarchy.h"
namespace Inkscape {
/**
* Create new object hierarchy.
* \param top The first entry if non-NULL.
*/
ObjectHierarchy::ObjectHierarchy(SPObject *top) {
if (top) {
_addBottom(top);
}
}
ObjectHierarchy::~ObjectHierarchy() {
_clear();
}
/**
* Remove all entries.
*/
void ObjectHierarchy::clear() {
_clear();
_changed_signal.emit(NULL, NULL);
}
/**
* Trim or expand hierarchy on top such that object becomes top entry.
*/
void ObjectHierarchy::setTop(SPObject *object) {
g_return_if_fail(object != NULL);
if ( top() == object ) {
return;
}
if (!top()) {
_addTop(object);
} else if (object->isAncestorOf(top())) {
_addTop(object, top());
} else if ( object == bottom() || object->isAncestorOf(bottom()) ) {
_trimAbove(object);
} else {
_clear();
_addTop(object);
}
_changed_signal.emit(top(), bottom());
}
/**
* Add hierarchy from junior's parent to senior to this
* hierarchy's top.
*/
void ObjectHierarchy::_addTop(SPObject *senior, SPObject *junior) {
g_assert(junior != NULL);
g_assert(senior != NULL);
SPObject *object=SP_OBJECT_PARENT(junior);
do {
_addTop(object);
object = SP_OBJECT_PARENT(object);
} while ( object != senior );
}
/**
* Add object to top of hierarchy.
* \pre object!=NULL
*/
void ObjectHierarchy::_addTop(SPObject *object) {
g_assert(object != NULL);
_hierarchy.push_back(_attach(object));
_added_signal.emit(object);
}
/**
* Remove all objects above limit from hierarchy.
*/
void ObjectHierarchy::_trimAbove(SPObject *limit) {
while ( !_hierarchy.empty() && _hierarchy.back().object != limit ) {
SPObject *object=_hierarchy.back().object;
sp_object_ref(object, NULL);
_detach(_hierarchy.back());
_hierarchy.pop_back();
_removed_signal.emit(object);
sp_object_unref(object, NULL);
}
}
/**
* Trim or expand hierarchy at bottom such that object becomes bottom entry.
*/
void ObjectHierarchy::setBottom(SPObject *object) {
g_return_if_fail(object != NULL);
if ( bottom() == object ) {
return;
}
if (!top()) {
_addBottom(object);
} else if (bottom()->isAncestorOf(object)) {
_addBottom(bottom(), object);
} else if ( top() == object ) {
_trimBelow(top());
} else if (top()->isAncestorOf(object)) {
if (object->isAncestorOf(bottom())) {
_trimBelow(object);
} else { // object is a sibling or cousin of bottom()
SPObject *saved_top=top();
sp_object_ref(saved_top, NULL);
_clear();
_addBottom(saved_top);
_addBottom(saved_top, object);
sp_object_unref(saved_top, NULL);
}
} else {
_clear();
_addBottom(object);
}
_changed_signal.emit(top(), bottom());
}
/**
* Remove all objects under given object.
* \param limit If NULL, remove all.
*/
void ObjectHierarchy::_trimBelow(SPObject *limit) {
while ( !_hierarchy.empty() && _hierarchy.front().object != limit ) {
SPObject *object=_hierarchy.front().object;
sp_object_ref(object, NULL);
_detach(_hierarchy.front());
_hierarchy.pop_front();
_removed_signal.emit(object);
sp_object_unref(object, NULL);
}
}
/**
* Add hierarchy from senior to junior to this hierarchy's bottom.
*/
void ObjectHierarchy::_addBottom(SPObject *senior, SPObject *junior) {
g_assert(junior != NULL);
g_assert(senior != NULL);
if ( junior != senior ) {
_addBottom(senior, SP_OBJECT_PARENT(junior));
_addBottom(junior);
}
}
/**
* Add object at bottom of hierarchy.
* \pre object!=NULL
*/
void ObjectHierarchy::_addBottom(SPObject *object) {
g_assert(object != NULL);
_hierarchy.push_front(_attach(object));
_added_signal.emit(object);
}
void ObjectHierarchy::_trim_for_release(SPObject *object, ObjectHierarchy *hier)
{
hier->_trimBelow(object);
g_assert(!hier->_hierarchy.empty());
g_assert(hier->_hierarchy.front().object == object);
sp_object_ref(object, NULL);
hier->_detach(hier->_hierarchy.front());
hier->_hierarchy.pop_front();
hier->_removed_signal.emit(object);
sp_object_unref(object, NULL);
hier->_changed_signal.emit(hier->top(), hier->bottom());
}
ObjectHierarchy::Record ObjectHierarchy::_attach(SPObject *object) {
sp_object_ref(object, NULL);
gulong id = g_signal_connect(G_OBJECT(object), "release", GCallback(&ObjectHierarchy::_trim_for_release), this);
return Record(object, id);
}
void ObjectHierarchy::_detach(ObjectHierarchy::Record const &rec) {
g_signal_handler_disconnect(G_OBJECT(rec.object), rec.handler_id);
sp_object_unref(rec.object, NULL);
}
}
/*
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:encoding=utf-8:textwidth=99 :
|
