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
|
/**************************************************************************\
*
* 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 SoPathList SoPathList.h Inventor/lists/SoPathList.h
\brief The SoPathList class is a container for pointers to SoPath objects.
\ingroup general
As this class inherits SoBaseList, referencing and dereferencing
will default be done on the objects at append(), remove(), insert()
etc.
*/
#include <Inventor/lists/SoPathList.h>
#include <Inventor/SoPath.h>
#include <Inventor/SoFullPath.h>
#include <Inventor/C/tidbits.h>
#include <assert.h>
/*!
Default constructor.
*/
SoPathList::SoPathList(void)
: SoBaseList()
{
}
/*!
Constructor with a hint about the number of elements the list will
hold.
\sa SoBaseList::SoBaseList(const int)
*/
SoPathList::SoPathList(const int size)
: SoBaseList(size)
{
}
/*!
Copy constructor.
Does a shallow copy of the SoPath pointer values, but updates
reference count.
\sa SoBaseList::SoBaseList(const SoBaseList &)
*/
SoPathList::SoPathList(const SoPathList & pl)
: SoBaseList(pl)
{
}
/*!
Destructor.
\sa SoBaseList::~SoBaseList()
*/
SoPathList::~SoPathList()
{
}
/*!
Append \a ptr to the list.
\sa SoBaseList::append()
*/
void
SoPathList::append(SoPath * const path)
{
SoBaseList::append((SoBase *)path);
}
/*!
Return node pointer at index \a i.
\sa SoBaseList::operator[]()
*/
SoPath *
SoPathList::operator[](const int i) const
{
return (SoPath *)SoBaseList::operator[](i);
}
/*!
Shallow copy of contents of list \a pl to this list.
\sa SoBaseList::operator=()
*/
SoPathList &
SoPathList::operator=(const SoPathList & pl)
{
SoBaseList::copy(pl);
return *this;
}
/*!
Find and return index of first item equal to \a path.
*/
int
SoPathList::findPath(const SoPath & path) const
{
int i, n = this->getLength();
for (i = 0; i < n; i++) if (*(*this)[i] == path) return i;
return -1;
}
// Return a negative number if the path pointed to by v0 is considered
// "less than" v1, a positive number if v0 is considered "larger than"
// v1 and zero if they are equal.
//
// "extern C" wrapper is needed with the OSF1/cxx compiler (probably a
// bug in the compiler, but it doesn't seem to hurt to do this
// anyway).
extern "C" {
static int
compare_paths(const void * v0, const void * v1)
{
SoFullPath * p0 = *((SoFullPath**)v0);
SoFullPath * p1 = *((SoFullPath**)v1);
const ptrdiff_t diff = (char *)p0->getHead() - (char *)p1->getHead();
if (diff != 0) { return (int)diff; }
int n = SbMin(p0->getLength(), p1->getLength());
int i;
for (i = 1; i < n; i++) {
const int diff = p0->getIndex(i) - p1->getIndex(i);
if (diff != 0) { return (int)diff; }
}
// shortest path first
return p0->getLength() - p1->getLength();
}
}
/*!
Sort paths in list according to how early they are run into when
traversing the scene graph.
*/
void
SoPathList::sort(void)
{
qsort((void **)this->getArrayPtr(), this->getLength(), sizeof(void *), compare_paths);
}
/*!
Removes identical paths and paths that go through the tail of
another path.
Note that this method assumes the list to be in a sorted order.
\sa sort()
*/
void
SoPathList::uniquify(void)
{
SoFullPath ** array = (SoFullPath**) this->getArrayPtr();
for (int i = this->getLength()-2; i >= 0; i--) {
SoFullPath * p = array[i];
int j = i+1;
// if fork is at tail of current path, remove next path. We might
// have more than one path that go through this path's tail, so do
// the test in a while loop
while ((j < this->getLength()) && (p->findFork(array[j]) == p->getLength()-1)) {
this->remove(j);
// get array pointer again even though it shouldn't change, but
// it might do in the future so...
array = (SoFullPath**) this->getArrayPtr();
}
}
}
|