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
223
224
225
226
227
228
|
// File: TopExp_Explorer.cxx
// Created: Mon Jan 18 18:04:49 1993
// Author: Remi LEQUETTE
// <rle@phylox>
#define No_Standard_NoMoreObject
#define No_Standard_NoSuchObject
#include <TopExp_Explorer.ixx>
#include <TopoDS_Iterator.hxx>
#include <TopAbs.hxx>
#include <Standard.hxx>
#include <Standard_NoMoreObject.hxx>
#include <Standard_NoSuchObject.hxx>
// macro to compare two types of shapes
// always True if the first one is SHAPE
#define SAMETYPE(x,y) ((x) == (y))
#define AVOID(x,y) (((x) == TopAbs_SHAPE) ? Standard_False : (x) == (y))
#define LESSCOMPLEX(x,y) ((x) > (y))
static const Standard_Integer theStackSize = 20;
//=======================================================================
//function : TopExp_Explorer
//purpose :
//=======================================================================
TopExp_Explorer::TopExp_Explorer() :
myStack(0L),myTop(-1),hasMore(Standard_False)
{
myStack = (TopoDS_Iterator*)Standard::Allocate(theStackSize*sizeof(TopoDS_Iterator));
mySizeOfStack = theStackSize;
}
//=======================================================================
//function : TopExp_Explorer
//purpose :
//=======================================================================
TopExp_Explorer::TopExp_Explorer(const TopoDS_Shape& S,
const TopAbs_ShapeEnum ToFind,
const TopAbs_ShapeEnum ToAvoid):
myStack(0L),myTop(-1),hasMore(Standard_False)
{
myStack = (TopoDS_Iterator*)Standard::Allocate(theStackSize*sizeof(TopoDS_Iterator));
mySizeOfStack = theStackSize;
Init(S,ToFind,ToAvoid);
}
//=======================================================================
//function : Init
//purpose :
//=======================================================================
void TopExp_Explorer::Init(const TopoDS_Shape& S,
const TopAbs_ShapeEnum ToFind,
const TopAbs_ShapeEnum ToAvoid)
{
if(myTop >=0) {
for(int i=0;i<= myTop; i++)
myStack[i].~TopoDS_Iterator();
}
myTop = -1;
myShape = S;
toFind = ToFind;
toAvoid = ToAvoid;
if (S.IsNull()) {
hasMore = Standard_False;
return;
}
#if 0
// for SOLID, FACE, EDGE ignores the initial orientation
TopAbs_ShapeEnum T = myShape.ShapeType();
if ((T == TopAbs_SOLID) || (T == TopAbs_FACE) || (T == TopAbs_EDGE))
myShape.Orientation(TopAbs_FORWARD);
#endif
if (toFind == TopAbs_SHAPE)
hasMore = Standard_False;
else {
TopAbs_ShapeEnum ty = S.ShapeType();
if (LESSCOMPLEX(ty,toFind)) {
// the first Shape is less complex, nothing to find
hasMore = Standard_False;
}
else if (!SAMETYPE(ty,toFind)) {
// type is more complex search inside
hasMore = Standard_True;
Next();
}
else {
// type is found
hasMore = Standard_True;
}
}
}
//=======================================================================
//function : Current
//purpose :
//=======================================================================
const TopoDS_Shape& TopExp_Explorer::Current()const
{
Standard_NoSuchObject_Raise_if(!hasMore,"TopExp_Explorer::Current");
if (myTop >= 0) {
const TopoDS_Shape& S = myStack[myTop].Value();
return S;
}
else
return myShape;
}
//=======================================================================
//function : Next
//purpose :
//=======================================================================
void TopExp_Explorer::Next()
{
Standard_Integer NewSize;
TopoDS_Shape ShapTop;
TopAbs_ShapeEnum ty;
Standard_NoMoreObject_Raise_if(!hasMore,"TopExp_Explorer::Next");
if (myTop < 0) {
// empty stack. Entering the initial shape.
ty = myShape.ShapeType();
if (SAMETYPE(toFind,ty)) {
// already visited once
hasMore = Standard_False;
return;
}
else if (AVOID(toAvoid,ty)) {
// avoid the top-level
hasMore = Standard_False;
return;
}
else {
// push and try to find
if(++myTop >= mySizeOfStack) {
NewSize = mySizeOfStack + theStackSize;
TopExp_Stack newStack = (TopoDS_Iterator*)Standard::Allocate(NewSize*sizeof(TopoDS_Iterator));
Standard_Integer i;
for ( i =0; i < myTop; i++) {
new (&newStack[i]) TopoDS_Iterator(myStack[i]);
myStack[i].~TopoDS_Iterator();
}
Standard::Free((Standard_Address&)myStack);
mySizeOfStack = NewSize;
myStack = newStack;
}
new (&myStack[myTop]) TopoDS_Iterator(myShape);
}
}
else myStack[myTop].Next();
for (;;) {
if (myStack[myTop].More()) {
ShapTop = myStack[myTop].Value();
ty = ShapTop.ShapeType();
if (SAMETYPE(toFind,ty)) {
hasMore = Standard_True;
return;
}
else if (LESSCOMPLEX(toFind,ty) && !AVOID(toAvoid,ty)) {
if(++myTop >= mySizeOfStack) {
NewSize = mySizeOfStack + theStackSize;
TopExp_Stack newStack = (TopoDS_Iterator*)Standard::Allocate(NewSize*sizeof(TopoDS_Iterator));
Standard_Integer i;
for (i =0; i < myTop; i++) {
new (&newStack[i]) TopoDS_Iterator(myStack[i]);
myStack[i].~TopoDS_Iterator();
}
Standard::Free((Standard_Address&)myStack);
mySizeOfStack = NewSize;
myStack = newStack;
}
new (&myStack[myTop]) TopoDS_Iterator(ShapTop);
}
else {
myStack[myTop].Next();
}
}
else {
myStack[myTop].~TopoDS_Iterator();
myTop--;
if(myTop < 0) break;
myStack[myTop].Next();
}
}
hasMore = Standard_False;
}
//=======================================================================
//function : ReInit
//purpose :
//=======================================================================
void TopExp_Explorer::ReInit()
{
Init(myShape,toFind,toAvoid);
}
void TopExp_Explorer::Destroy()
{
if (myStack)
{
for(int i=0;i<= myTop; i++)myStack[i].~TopoDS_Iterator();
Standard::Free((Standard_Address&)myStack);
}
mySizeOfStack = 0;
myStack = 0L;
}
|
