b311480e |
1 | // Created on: 1999-06-24 |
2 | // Created by: Sergey ZARITCHNY |
3 | // Copyright (c) 1999-1999 Matra Datavision |
973c2be1 |
4 | // Copyright (c) 1999-2014 OPEN CASCADE SAS |
b311480e |
5 | // |
973c2be1 |
6 | // This file is part of Open CASCADE Technology software library. |
b311480e |
7 | // |
d5f74e42 |
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 |
973c2be1 |
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. |
b311480e |
13 | // |
973c2be1 |
14 | // Alternatively, this file may be used under the terms of Open CASCADE |
15 | // commercial license or contractual agreement. |
7fd59977 |
16 | |
17 | #include <Draw.hxx> |
18 | #include <DBRep.hxx> |
19 | #include <Draw_Interpretor.hxx> |
20 | #include <QADNaming.hxx> |
21 | #include <BRepTools.hxx> |
22 | #include <TopoDS_Face.hxx> |
23 | #include <TopLoc_Location.hxx> |
24 | #include <BRep_Builder.hxx> |
25 | #include <gp_Pnt.hxx> |
26 | #include <gp_Trsf.hxx> |
27 | #include <BRepTools.hxx> |
28 | #include <TCollection_AsciiString.hxx> |
29 | #include <TNaming_Translator.hxx> |
30 | #include <TopTools_DataMapIteratorOfDataMapOfShapeShape.hxx> |
97385d61 |
31 | #include <DNaming_DataMapOfShapeOfName.hxx> |
32 | #include <DNaming_DataMapIteratorOfDataMapOfShapeOfName.hxx> |
7fd59977 |
33 | #include <TCollection_AsciiString.hxx> |
34 | #include <TopAbs.hxx> |
35 | #include <TopExp_Explorer.hxx> |
36 | #include <TopTools_MapOfShape.hxx> |
37 | #include <TopTools_MapIteratorOfMapOfShape.hxx> |
38 | |
39 | |
40 | |
41 | //======================================================================= |
42 | //function : QADNaming_CheckHasSame |
43 | //purpose : CheckIsSame Shape1 Shape2 |
44 | // - for test ShapeCopy mechanism |
45 | //======================================================================= |
46 | |
47 | static Standard_Integer QADNaming_CheckHasSame (Draw_Interpretor& di, |
48 | Standard_Integer nb, |
49 | const char** arg) |
50 | { |
51 | if(nb < 4) return 1; |
52 | TopoDS_Shape S1 = DBRep::Get(arg[1]); |
53 | if ( S1.IsNull() ) { |
54 | BRep_Builder aBuilder; |
55 | BRepTools::Read( S1, arg[1], aBuilder); |
56 | } |
57 | |
58 | TopoDS_Shape S2 = DBRep::Get(arg[2]); |
59 | if ( S2.IsNull() ) { |
60 | BRep_Builder aBuilder; |
61 | BRepTools::Read( S2, arg[2], aBuilder); |
62 | } |
63 | char M[8]; |
64 | strcpy(M, arg[3]); |
65 | strtok(M, " \t"); |
66 | TopAbs_ShapeEnum mod = TopAbs_FACE; |
67 | if(M[0] == 'F' || M[0] == 'f') |
68 | mod = TopAbs_FACE; |
69 | else if(M[0] == 'E' || M[0] == 'e') |
70 | mod = TopAbs_EDGE; |
71 | else if(M[0] == 'V' || M[0] == 'v') |
72 | mod = TopAbs_VERTEX; |
73 | else |
74 | return 1; |
75 | |
76 | TopExp_Explorer Exp1, Exp2; |
77 | |
78 | TopTools_MapOfShape M1, M2; |
79 | for(Exp1.Init(S1, mod);Exp1.More();Exp1.Next()) { |
80 | M1.Add(Exp1.Current()); |
81 | } |
82 | for(Exp2.Init(S2, mod);Exp2.More();Exp2.Next()) { |
83 | M2.Add(Exp2.Current()); |
84 | } |
85 | |
86 | TopTools_MapIteratorOfMapOfShape itr1(M1); |
87 | TopTools_MapIteratorOfMapOfShape itr2; |
88 | for(;itr1.More();itr1.Next()) { |
89 | const TopoDS_Shape& s1 = itr1.Key(); |
90 | |
91 | for(itr2.Initialize(M2);itr2.More();itr2.Next()) { |
92 | const TopoDS_Shape& s2 = itr2.Key(); |
93 | if(s1.IsSame(s2)) |
586db386 |
94 | di << "Shapes " << arg[1]<< " and "<< arg[2]<< " have SAME subshapes\n"; |
7fd59977 |
95 | } |
96 | } |
97 | |
98 | return 0; |
99 | } |
100 | //======================================================================= |
101 | //function : QADNaming_TCopyShape |
102 | //purpose : CopyShape Shape1 [Shape2 ...] |
103 | // - for test ShapeCopy mechanism |
104 | //======================================================================= |
105 | |
106 | static Standard_Integer QADNaming_TCopyShape (Draw_Interpretor& di, |
107 | Standard_Integer nb, |
108 | const char** arg) |
109 | { |
110 | TNaming_Translator TR; |
111 | if(nb < 2) return (1); |
112 | |
97385d61 |
113 | DNaming_DataMapOfShapeOfName aDMapOfShapeOfName; |
7fd59977 |
114 | for(Standard_Integer i= 1;i < nb; i++) { |
115 | TopoDS_Shape S = DBRep::Get(arg[i]); |
116 | TCollection_AsciiString name(arg[i]); |
117 | name.AssignCat("_c"); |
118 | if ( S.IsNull() ) { |
119 | BRep_Builder aBuilder; |
120 | BRepTools::Read( S, arg[i], aBuilder); |
121 | } |
122 | |
123 | // Add to Map |
124 | if(S.IsNull()) return(1); |
125 | else { |
126 | aDMapOfShapeOfName.Bind(S, name); |
127 | TR.Add(S); |
128 | } |
129 | } // for ... |
130 | |
131 | // PERFORM |
132 | TR.Perform(); |
133 | |
134 | if(TR.IsDone()){ |
135 | // cout << "QADNaming_CopyShape:: Copy is Done " << endl; |
136 | |
97385d61 |
137 | DNaming_DataMapIteratorOfDataMapOfShapeOfName itrn(aDMapOfShapeOfName); |
7fd59977 |
138 | for(;itrn.More();itrn.Next()) { |
139 | TCollection_AsciiString name = itrn.Value(); |
140 | const TopoDS_Shape& Result = TR.Copied(itrn.Key()); |
141 | DBRep::Set(name.ToCString(), Result); |
142 | di.AppendElement(name.ToCString()); |
143 | } |
144 | return 0; |
145 | } |
586db386 |
146 | di << "QADNaming_CopyShape : Error\n"; |
7fd59977 |
147 | return 1; |
148 | } |
149 | |
150 | //======================================================================= |
151 | //function : ToolsCommands |
152 | //purpose : |
153 | //======================================================================= |
154 | |
155 | void QADNaming::ToolsCommands (Draw_Interpretor& theCommands) |
156 | { |
157 | |
158 | static Standard_Boolean done = Standard_False; |
159 | if (done) return; |
160 | done = Standard_True; |
161 | const char* g = "Naming data commands" ; |
162 | |
163 | theCommands.Add ("CopyShape", |
164 | "CopyShape (Shape1 [Shape2] ...)", |
165 | __FILE__, QADNaming_TCopyShape, g); |
166 | |
167 | theCommands.Add ("CheckSame", |
168 | "CheckSame (Shape1 Shape2 ExploMode{F|E|V]", |
169 | __FILE__, QADNaming_CheckHasSame, g); |
170 | } |