42cf5bc1 |
1 | // Created on: 1992-09-23 |
2 | // Created by: Christian CAILLET |
3 | // Copyright (c) 1992-1999 Matra Datavision |
4 | // Copyright (c) 1999-2014 OPEN CASCADE SAS |
5 | // |
6 | // This file is part of Open CASCADE Technology software library. |
7 | // |
8 | // This library is free software; you can redistribute it and/or modify it under |
9 | // the terms of the GNU Lesser General Public License version 2.1 as published |
10 | // by the Free Software Foundation, with special exception defined in the file |
11 | // OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT |
12 | // distribution for complete text of the license and disclaimer of any warranty. |
13 | // |
14 | // Alternatively, this file may be used under the terms of Open CASCADE |
15 | // commercial license or contractual agreement. |
16 | |
17 | #ifndef _IFGraph_Compare_HeaderFile |
18 | #define _IFGraph_Compare_HeaderFile |
19 | |
20 | #include <Standard.hxx> |
21 | #include <Standard_DefineAlloc.hxx> |
22 | #include <Standard_Handle.hxx> |
23 | |
24 | #include <Interface_Graph.hxx> |
25 | #include <Interface_GraphContent.hxx> |
26 | #include <Standard_Boolean.hxx> |
42cf5bc1 |
27 | class Standard_Transient; |
28 | class Interface_EntityIterator; |
29 | |
30 | |
31 | //! this class evaluates effect of two compared sub-parts : |
32 | //! cumulation (union), common part (intersection-overlapping) |
33 | //! part specific to first sub-part or to the second one |
34 | //! Results are kept in a Graph, several question can be set |
35 | //! Basic Iteration gives Cumulation (union) |
36 | class IFGraph_Compare : public Interface_GraphContent |
37 | { |
38 | public: |
39 | |
40 | DEFINE_STANDARD_ALLOC |
41 | |
42 | |
43 | //! creates empty Compare, ready to work |
44 | Standard_EXPORT IFGraph_Compare(const Interface_Graph& agraph); |
45 | |
46 | //! adds an entity and its shared ones to the list : |
47 | //! first True means adds to the first sub-list, else to the 2nd |
48 | Standard_EXPORT void GetFromEntity (const Handle(Standard_Transient)& ent, const Standard_Boolean first); |
49 | |
50 | //! adds a list of entities (as an iterator) as such, that is, |
51 | //! their shared entities are not considered (use AllShared to |
52 | //! have them) |
53 | //! first True means adds to the first sub-list, else to the 2nd |
54 | Standard_EXPORT void GetFromIter (const Interface_EntityIterator& iter, const Standard_Boolean first); |
55 | |
56 | //! merges the second list into the first one, hence the second |
57 | //! list is empty |
58 | Standard_EXPORT void Merge(); |
59 | |
60 | //! Removes the contents of second list |
61 | Standard_EXPORT void RemoveSecond(); |
62 | |
63 | //! Keeps only Common part, sets it as First list and clears |
64 | //! second list |
65 | Standard_EXPORT void KeepCommon(); |
66 | |
67 | //! Allows to restart on a new data set |
68 | Standard_EXPORT void ResetData(); |
69 | |
70 | //! Recomputes result of comparing to sub-parts |
71 | Standard_EXPORT virtual void Evaluate() Standard_OVERRIDE; |
72 | |
73 | //! returns entities common to the both parts |
74 | Standard_EXPORT Interface_EntityIterator Common() const; |
75 | |
76 | //! returns entities which are exclusively in the first list |
77 | Standard_EXPORT Interface_EntityIterator FirstOnly() const; |
78 | |
79 | //! returns entities which are exclusively in the second part |
80 | Standard_EXPORT Interface_EntityIterator SecondOnly() const; |
81 | |
82 | |
83 | |
84 | |
85 | protected: |
86 | |
87 | |
88 | |
89 | |
90 | |
91 | private: |
92 | |
93 | |
94 | |
95 | Interface_Graph thegraph; |
96 | |
97 | |
98 | }; |
99 | |
100 | |
101 | |
102 | |
103 | |
104 | |
105 | |
106 | #endif // _IFGraph_Compare_HeaderFile |