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
|
// This file is generated by WOK (CPPExt).
// Please do not edit this file; modify original file instead.
// The copyright and license terms as defined for the original file apply to
// this header file considered to be the "object code" form of the original source.
#ifndef _IFGraph_Compare_HeaderFile
#define _IFGraph_Compare_HeaderFile
#ifndef _Standard_HeaderFile
#include <Standard.hxx>
#endif
#ifndef _Standard_Macro_HeaderFile
#include <Standard_Macro.hxx>
#endif
#ifndef _Interface_Graph_HeaderFile
#include <Interface_Graph.hxx>
#endif
#ifndef _Interface_GraphContent_HeaderFile
#include <Interface_GraphContent.hxx>
#endif
#ifndef _Handle_Standard_Transient_HeaderFile
#include <Handle_Standard_Transient.hxx>
#endif
#ifndef _Standard_Boolean_HeaderFile
#include <Standard_Boolean.hxx>
#endif
class Interface_Graph;
class Standard_Transient;
class Interface_EntityIterator;
//! this class evaluates effect of two compared sub-parts : <br>
//! cumulation (union), common part (intersection-overlapping) <br>
//! part specific to first sub-part or to the second one <br>
//! Results are kept in a Graph, several question can be set <br>
//! Basic Iteration gives Cumulation (union) <br>
class IFGraph_Compare : public Interface_GraphContent {
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);
}
//! creates empty Compare, ready to work <br>
Standard_EXPORT IFGraph_Compare(const Interface_Graph& agraph);
//! adds an entity and its shared ones to the list : <br>
//! first True means adds to the first sub-list, else to the 2nd <br>
Standard_EXPORT void GetFromEntity(const Handle(Standard_Transient)& ent,const Standard_Boolean first) ;
//! adds a list of entities (as an iterator) as such, that is, <br>
//! their shared entities are not considered (use AllShared to <br>
//! have them) <br>
//! first True means adds to the first sub-list, else to the 2nd <br>
Standard_EXPORT void GetFromIter(const Interface_EntityIterator& iter,const Standard_Boolean first) ;
//! merges the second list into the first one, hence the second <br>
//! list is empty <br>
Standard_EXPORT void Merge() ;
//! Removes the contents of second list <br>
Standard_EXPORT void RemoveSecond() ;
//! Keeps only Common part, sets it as First list and clears <br>
//! second list <br>
Standard_EXPORT void KeepCommon() ;
//! Allows to restart on a new data set <br>
Standard_EXPORT void ResetData() ;
//! Recomputes result of comparing to sub-parts <br>
Standard_EXPORT virtual void Evaluate() ;
//! returns entities common to the both parts <br>
Standard_EXPORT Interface_EntityIterator Common() const;
//! returns entities which are exclusively in the first list <br>
Standard_EXPORT Interface_EntityIterator FirstOnly() const;
//! returns entities which are exclusively in the second part <br>
Standard_EXPORT Interface_EntityIterator SecondOnly() const;
protected:
private:
Interface_Graph thegraph;
};
// other Inline functions and methods (like "C++: function call" methods)
#endif
|
