File: MAT_Graph.hxx

package info (click to toggle)
opencascade 6.2-7
  • links: PTS
  • area: non-free
  • in suites: lenny
  • size: 444,652 kB
  • ctags: 256,750
  • sloc: cpp: 1,150,123; ansic: 225,762; tcl: 30,130; makefile: 12,619; sh: 7,958; xml: 3,981; lisp: 283; java: 212; csh: 203; perl: 15
file content (196 lines) | stat: -rw-r--r-- 6,300 bytes parent folder | download | duplicates (2)
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
// File generated by CPPExt (Transient)
//
//
//                     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 _MAT_Graph_HeaderFile
#define _MAT_Graph_HeaderFile

#ifndef _Standard_HeaderFile
#include <Standard.hxx>
#endif
#ifndef _Handle_MAT_Graph_HeaderFile
#include <Handle_MAT_Graph.hxx>
#endif

#ifndef _MAT_DataMapOfIntegerArc_HeaderFile
#include <MAT_DataMapOfIntegerArc.hxx>
#endif
#ifndef _MAT_DataMapOfIntegerBasicElt_HeaderFile
#include <MAT_DataMapOfIntegerBasicElt.hxx>
#endif
#ifndef _MAT_DataMapOfIntegerNode_HeaderFile
#include <MAT_DataMapOfIntegerNode.hxx>
#endif
#ifndef _Standard_Integer_HeaderFile
#include <Standard_Integer.hxx>
#endif
#ifndef _MMgt_TShared_HeaderFile
#include <MMgt_TShared.hxx>
#endif
#ifndef _Standard_Boolean_HeaderFile
#include <Standard_Boolean.hxx>
#endif
#ifndef _Handle_MAT_ListOfBisector_HeaderFile
#include <Handle_MAT_ListOfBisector.hxx>
#endif
#ifndef _Handle_MAT_Arc_HeaderFile
#include <Handle_MAT_Arc.hxx>
#endif
#ifndef _Handle_MAT_BasicElt_HeaderFile
#include <Handle_MAT_BasicElt.hxx>
#endif
#ifndef _Handle_MAT_Node_HeaderFile
#include <Handle_MAT_Node.hxx>
#endif
class MAT_ListOfBisector;
class MAT_Arc;
class MAT_BasicElt;
class MAT_Node;
class MAT_DataMapOfIntegerBasicElt;


//! The Class Graph permits the exploration of the <br>
//!          Bisector Locus. <br>
class MAT_Graph : public MMgt_TShared {

public:
 // Methods PUBLIC
 // 

//! Empty constructor. <br>
Standard_EXPORT MAT_Graph();

//! Construct <me> from the result of the method <br>
//!            <CreateMat> of the class <MAT> from <MAT>. <br>
//! <br>
//!            <SemiInfinite> : if some bisector are infinites. <br>
//!            <TheRoots>     : Set of the bisectors. <br>
//!            <NbBasicElts>  : Number of Basic Elements. <br>
//!            <NbArcs>       : Number of Arcs = Number of Bisectors. <br>
Standard_EXPORT   void Perform(const Standard_Boolean SemiInfinite,const Handle(MAT_ListOfBisector)& TheRoots,const Standard_Integer NbBasicElts,const Standard_Integer NbArcs) ;

//! Return the Arc of index <Index> in <theArcs>. <br>
Standard_EXPORT   Handle_MAT_Arc Arc(const Standard_Integer Index) const;

//! Return the BasicElt of index <Index> in <theBasicElts>. <br>
Standard_EXPORT   Handle_MAT_BasicElt BasicElt(const Standard_Integer Index) const;

//! Return the Node of index <Index> in <theNodes>. <br>
Standard_EXPORT   Handle_MAT_Node Node(const Standard_Integer Index) const;

//! Return the number of arcs of <me>. <br>
Standard_EXPORT   Standard_Integer NumberOfArcs() const;

//! Return the number of nodes of <me>. <br>
Standard_EXPORT   Standard_Integer NumberOfNodes() const;

//! Return the number of basic elements of <me>. <br>
Standard_EXPORT   Standard_Integer NumberOfBasicElts() const;

//! Return the number of infinites nodes of <me>. <br>
Standard_EXPORT   Standard_Integer NumberOfInfiniteNodes() const;

//! Merge two BasicElts.  The End of the BasicElt Elt1 <br>
//!          of  IndexElt1 becomes The End of the BasicElt Elt2 <br>
//!          of  IndexElt2.   Elt2 is replaced in  the  arcs  by <br>
//!          Elt1, Elt2 is eliminated. <br>
//! <br>
//!          <MergeArc1> is True  if the fusion  of the BasicElts  => <br>
//!          a fusion  of two Arcs which separated  the same  elements. <br>
//!          In this case <GeomIndexArc1> and  <GeomIndexArc2>  are the <br>
//!          Geometric  Index of this  arcs. <br>
//! <br>
//!          If the  BasicElt corresponds to a close line , <br>
//!          the StartArc and the EndArc of Elt1 can separate the same <br>
//!          elements . <br>
//!          In this case there is a fusion of this arcs, <MergeArc2> <br>
//!          is true and <GeomIndexArc3> and  <GeomIndexArc4>  are the <br>
//!          Geometric  Index of this  arcs. <br>
Standard_EXPORT   void FusionOfBasicElts(const Standard_Integer IndexElt1,const Standard_Integer IndexElt2,Standard_Boolean& MergeArc1,Standard_Integer& GeomIndexArc1,Standard_Integer& GeomIndexArc2,Standard_Boolean& MergeArc2,Standard_Integer& GeomIndexArc3,Standard_Integer& GeomIndexArc4) ;


Standard_EXPORT   void CompactArcs() ;


Standard_EXPORT   void CompactNodes() ;


Standard_EXPORT   void ChangeBasicElts(const MAT_DataMapOfIntegerBasicElt& NewMap) ;


Standard_EXPORT   Handle_MAT_BasicElt ChangeBasicElt(const Standard_Integer Index) ;
//Standard_EXPORT ~MAT_Graph();




 // Type management
 //
 Standard_EXPORT const Handle(Standard_Type)& DynamicType() const;
 //Standard_EXPORT Standard_Boolean	       IsKind(const Handle(Standard_Type)&) const;

protected:

 // Methods PROTECTED
 // 


 // Fields PROTECTED
 //


private: 

 // Methods PRIVATE
 // 

//! Merge two Arcs.  the second node of <Arc2> becomes <br>
//!          the  first node  of <Arc1>.  Update  of the  first <br>
//!          node and the neighbours of <Arc1>. <br>
//!          <Arc2> is eliminated. <br>
Standard_EXPORT   void FusionOfArcs(const Handle(MAT_Arc)& Arc1,const Handle(MAT_Arc)& Arc2) ;


Standard_EXPORT   void UpDateNodes(Standard_Integer& Index) ;


 // Fields PRIVATE
 //
MAT_DataMapOfIntegerArc theArcs;
MAT_DataMapOfIntegerBasicElt theBasicElts;
MAT_DataMapOfIntegerNode theNodes;
Standard_Integer numberOfArcs;
Standard_Integer numberOfNodes;
Standard_Integer numberOfBasicElts;
Standard_Integer numberOfInfiniteNodes;


};





// other Inline functions and methods (like "C++: function call" methods)
//


#endif