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
|
// File generated by CPPExt (Value)
//
// Copyright (C) 1991 - 2000 by
// Matra Datavision SA. All rights reserved.
//
// Copyright (C) 2001 - 2004 by
// Open CASCADE SA. All rights reserved.
//
// This file is part of the Open CASCADE Technology software.
//
// This software may be distributed and/or modified under the terms and
// conditions of the Open CASCADE Public License as defined by Open CASCADE SA
// and appearing in the file LICENSE included in the packaging of this file.
//
// This software is distributed on an "AS IS" basis, without warranty of any
// kind, and Open CASCADE SA hereby disclaims all such warranties,
// including without limitation, any warranties of merchantability, fitness
// for a particular purpose or non-infringement. Please see the License for
// the specific terms and conditions governing rights and limitations under the
// License.
#ifndef _MAT2d_MiniPath_HeaderFile
#define _MAT2d_MiniPath_HeaderFile
#ifndef _MAT2d_DataMapOfIntegerSequenceOfConnexion_HeaderFile
#include <MAT2d_DataMapOfIntegerSequenceOfConnexion.hxx>
#endif
#ifndef _MAT2d_DataMapOfIntegerConnexion_HeaderFile
#include <MAT2d_DataMapOfIntegerConnexion.hxx>
#endif
#ifndef _MAT2d_SequenceOfConnexion_HeaderFile
#include <MAT2d_SequenceOfConnexion.hxx>
#endif
#ifndef _Standard_Real_HeaderFile
#include <Standard_Real.hxx>
#endif
#ifndef _Standard_Integer_HeaderFile
#include <Standard_Integer.hxx>
#endif
#ifndef _Standard_Boolean_HeaderFile
#include <Standard_Boolean.hxx>
#endif
#ifndef _Handle_MAT2d_Connexion_HeaderFile
#include <Handle_MAT2d_Connexion.hxx>
#endif
class MAT2d_SequenceOfSequenceOfGeometry;
class MAT2d_SequenceOfConnexion;
class MAT2d_Connexion;
#ifndef _Standard_HeaderFile
#include <Standard.hxx>
#endif
#ifndef _Standard_Macro_HeaderFile
#include <Standard_Macro.hxx>
#endif
//! MiniPath computes a path to link all the lines in <br>
//! a set of lines. The path is described as a set of <br>
//! connexions. <br>
//! <br>
//! The set of connexions can be seen as an arbitrary Tree. <br>
//! The node of the tree are the lines. The arcs of the <br>
//! tree are the connexions. The ancestror of a line is <br>
//! the connexion which ends on it. The children of a line <br>
//! are the connexions which start on it. <br>
//! <br>
//! The children of a line are ordered by the relation <br>
//! <IsAfter> defined on the connexions. <br>
//! (See MAT2s_Connexion.cdl). <br>
class MAT2d_MiniPath {
public:
void* operator new(size_t,void* anAddress)
{
return anAddress;
}
void* operator new(size_t size)
{
return Standard::Allocate(size);
}
void operator delete(void *anAddress)
{
if (anAddress) Standard::Free((Standard_Address&)anAddress);
}
// Methods PUBLIC
//
Standard_EXPORT MAT2d_MiniPath();
//! Computes the path to link the lines in <Figure>. <br>
//! the path starts on the line of index <IndStart> <br>
//! <Sense> = True if the Circuit turns in the <br>
//! trigonometric sense. <br>
Standard_EXPORT void Perform(const MAT2d_SequenceOfSequenceOfGeometry& Figure,const Standard_Integer IndStart,const Standard_Boolean Sense) ;
//! Run on the set of connexions to compute the path. <br>
//! the path is an exploration of the tree which contains <br>
//! the connexions and their reverses. <br>
//! if the tree of connexions is <br>
//! A <br>
//! / \ <br>
//! B E <br>
//! / \ \ <br>
//! C D F <br>
//! <br>
//! the path is A->B, B->C, C->B, B->D, D->B, B->A, A->E, <br>
//! E->F, F->E, E->A. <br>
Standard_EXPORT void RunOnConnexions() ;
//! Returns the sequence of connexions corresponding to <br>
//! the path. <br>
Standard_EXPORT const MAT2d_SequenceOfConnexion& Path() const;
//! Returns <True> if there is one Connexion which starts <br>
//! on line designed by <Index>. <br>
Standard_EXPORT Standard_Boolean IsConnexionsFrom(const Standard_Integer Index) const;
//! Returns the connexions which start on line <br>
//! designed by <Index>. <br>
//! <br>
Standard_EXPORT MAT2d_SequenceOfConnexion& ConnexionsFrom(const Standard_Integer Index) ;
//! Returns <True> if the line designed by <Index> is <br>
//! the root. <br>
Standard_EXPORT Standard_Boolean IsRoot(const Standard_Integer Index) const;
//! Returns the connexion which ends on line <br>
//! designed by <Index>. <br>
Standard_EXPORT Handle_MAT2d_Connexion Father(const Standard_Integer Index) ;
protected:
// Methods PROTECTED
//
// Fields PROTECTED
//
private:
// Methods PRIVATE
//
//! Add a connexion to the path. <br>
Standard_EXPORT void Append(const Handle(MAT2d_Connexion)& Connexion) ;
Standard_EXPORT void ExploSons(MAT2d_SequenceOfConnexion& aPath,const Handle(MAT2d_Connexion)& aConnexion) ;
//! Returns the connexion which realises the minimum of <br>
//! distance between the lines of index <L1> and <L2> in <br>
//! <aFigure>. The connexion is oriented from <L1> to <L2>. <br>
Standard_EXPORT Handle_MAT2d_Connexion MinimumL1L2(const MAT2d_SequenceOfSequenceOfGeometry& Figure,const Standard_Integer L1,const Standard_Integer L2) const;
// Fields PRIVATE
//
MAT2d_DataMapOfIntegerSequenceOfConnexion theConnexions;
MAT2d_DataMapOfIntegerConnexion theFather;
MAT2d_SequenceOfConnexion thePath;
Standard_Real theDirection;
Standard_Integer indStart;
};
// other Inline functions and methods (like "C++: function call" methods)
//
#endif
|
