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
214
215
216
217
218
219
220
221
222
|
/**************************************************************************\
*
* This file is part of the Coin 3D visualization library.
* Copyright (C) by Kongsberg Oil & Gas Technologies.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* ("GPL") version 2 as published by the Free Software Foundation.
* See the file LICENSE.GPL at the root directory of this source
* distribution for additional information about the GNU GPL.
*
* For using Coin with software that can not be combined with the GNU
* GPL, and for taking advantage of the additional benefits of our
* support services, please contact Kongsberg Oil & Gas Technologies
* about acquiring a Coin Professional Edition License.
*
* See http://www.coin3d.org/ for more information.
*
* Kongsberg Oil & Gas Technologies, Bygdoy Alle 5, 0257 Oslo, NORWAY.
* http://www.sim.no/ sales@sim.no coin-support@coin3d.org
*
\**************************************************************************/
/*!
\class SoLightPath Inventor/misc/SoLightPath.h
\brief The SoLightPath class is a light version of SoPath.
\ingroup general
SoLightPath can be used if you only need a temporary path, and don't
want the overhead that comes with an SoPath (ref, unref, auditing etc).
It is your responsibility to make sure the path is valid before
using it.
*/
#include <Inventor/misc/SoLightPath.h>
#include <Inventor/misc/SoChildList.h>
#include <Inventor/nodes/SoNode.h>
#include <Inventor/misc/SoTempPath.h>
#if COIN_DEBUG
#include <Inventor/errors/SoDebugError.h>
#endif // COIN_DEBUG
/*!
A constructor. Supply the head node and the approximate length of
the path.
*/
SoLightPath::SoLightPath(SoNode *headnodeptr, const int approxlength)
: headnode(NULL),
indices(approxlength)
{
this->setHead(headnodeptr);
}
/*!
A constructor. Supply the appriximate length of the path.
*/
SoLightPath::SoLightPath(const int approxlength)
: headnode(NULL),
indices(approxlength)
{
}
/*!
Destructor.
*/
SoLightPath::~SoLightPath()
{
if (this->headnode) this->headnode->unref();
}
/*!
Sets head of path. Truncates path to length 1.
*/
void
SoLightPath::setHead(SoNode * const node)
{
if (this->headnode) this->headnode->unref();
this->headnode = node;
assert(node);
this->headnode->ref();
this->indices.truncate(0);
this->indices.append(-1);
}
/*!
Appends a childindex to the path.
*/
void
SoLightPath::append(const int childindex)
{
this->indices.append(childindex);
}
/*!
Same as append().
*/
void
SoLightPath::push(const int childindex)
{
this->indices.append(childindex);
}
/*!
Pops off the last child.
*/
void
SoLightPath::pop(void)
{
#if COIN_DEBUG && 1 // debug
if (this->indices.getLength() <= 1) {
SoDebugError::postInfo("SoLightPath::pop",
"You shouldn't pop off the head node.");
}
#endif // debug
this->truncate(this->indices.getLength()-1);
}
/*!
Sets the tail of the path.
*/
void
SoLightPath::setTail(const int childindex)
{
this->indices[this->indices.getLength()-1] = childindex;
}
/*!
Returns the tail node of the path. Uses getNode().
*/
SoNode *
SoLightPath::getTail(void) const
{
return this->getNode(this->indices.getLength()-1);
}
/*!
Returns the head node.
*/
SoNode *
SoLightPath::getHead(void) const
{
return this->headnode;
}
/*!
Returns the indexth node in path.
*/
SoNode *
SoLightPath::getNode(const int index) const
{
#if COIN_DEBUG && 1 // debug
if (index < 0 || index >= this->indices.getLength()) {
SoDebugError::postInfo("SoLightPath::getNode",
"index %d out of bounds", index);
}
#endif // debug
SoNode *node = this->headnode;
for (int i = 1; i < index; i++) {
int childidx = this->indices[i];
SoChildList *children = node->getChildren();
node = NULL;
if (children == NULL || childidx < 0 || childidx >= children->getLength()) break;
node = (*children)[childidx];
}
return node;
}
/*!
Returns the child index of the indexth node in the path.
*/
int
SoLightPath::getIndex(const int index) const
{
#if COIN_DEBUG && 1 // debug
if (index < 0 || index >= this->indices.getLength()) {
SoDebugError::postInfo("SoLightPath::getNode",
"index %d out of bounds", index);
}
#endif // debug
return this->indices[index];
}
/*!
Returns the length of the path.
*/
int
SoLightPath::getFullLength() const
{
return this->indices.getLength();
}
/*!
Truncates the path from \a startindex.
*/
void
SoLightPath::truncate(const int startindex)
{
this->indices.truncate(startindex);
}
/*!
Updates \a path to be the same path as this path.
*/
void
SoLightPath::makeTempPath(SoTempPath *path) const
{
const int n = this->indices.getLength();
SoNode *node = this->headnode;
path->setHead(node);
for (int i = 1; i < n; i++) {
int childidx = this->indices[i];
// check validity of path, return if invalid
SoChildList *children = node->getChildren();
if (children == NULL || childidx < 0 || childidx >= children->getLength()) break;
node = (*children)[childidx];
path->append(childidx); // childidx should be ok
}
}
|