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
|
//--------------------------------------------------------------------
//
// File Name : IGESSolid_BooleanTree.cxx
// Date :
// Author : CKY / Contract Toubro-Larsen
// Copyright : MATRA-DATAVISION 1993
//
//--------------------------------------------------------------------
#include <IGESSolid_ToolBooleanTree.ixx>
#include <IGESData_ParamCursor.hxx>
#include <IGESData_IGESEntity.hxx>
#include <TColStd_HArray1OfInteger.hxx>
#include <IGESData_HArray1OfIGESEntity.hxx>
#include <Interface_Macros.hxx>
#include <stdio.h>
IGESSolid_ToolBooleanTree::IGESSolid_ToolBooleanTree () { }
void IGESSolid_ToolBooleanTree::ReadOwnParams
(const Handle(IGESSolid_BooleanTree)& ent,
const Handle(IGESData_IGESReaderData)& IR, IGESData_ParamReader& PR) const
{
//Standard_Boolean st; //szv#4:S4163:12Mar99 moved down
Standard_Integer length, intvalue;
Handle(IGESData_IGESEntity) entvalue;
Handle(TColStd_HArray1OfInteger) tempOperations;
Handle(IGESData_HArray1OfIGESEntity) tempOperands;
Standard_Boolean st = PR.ReadInteger(PR.Current(), "Length of post-order notation", length);
if (st && length > 0)
{
tempOperations = new TColStd_HArray1OfInteger(1,length); tempOperations->Init(0);
tempOperands = new IGESData_HArray1OfIGESEntity(1,length);
// Op. 1-2 : Operands
//st = PR.ReadEntity(IR, PR.Current(), "Operand 1", entvalue); //szv#4:S4163:12Mar99 moved in if
if (PR.ReadEntity(IR, PR.Current(), "Operand 1", entvalue))
tempOperands->SetValue(1, entvalue);
//st = PR.ReadEntity(IR, PR.Current(), "Operand 2", entvalue); //szv#4:S4163:12Mar99 moved in if
if (PR.ReadEntity(IR, PR.Current(), "Operand 2", entvalue))
tempOperands->SetValue(2, entvalue);
// Op. 3 -> length-1 : Operand or Operation
for (Standard_Integer i = 3; i < length; i++)
{
Standard_Integer curnum = PR.CurrentNumber();
PR.ReadInteger(PR.Current(), "Operation code", intvalue); //szv#4:S4163:12Mar99 `st=` not needed
if (intvalue < 0) {
entvalue = PR.ParamEntity (IR,curnum);
if (entvalue.IsNull()) PR.AddFail("Operand : incorrect reference");
else tempOperands->SetValue(i, entvalue);
}
else tempOperations->SetValue(i, intvalue);
}
// Last Op. : Operation
//st = PR.ReadInteger(PR.Current(), "Operation code", intvalue); //szv#4:S4163:12Mar99 moved in if
if (PR.ReadInteger(PR.Current(), "Operation code", intvalue))
tempOperations->SetValue(length, intvalue);
}
else PR.AddFail("Length of post-order : Not Positive");
DirChecker(ent).CheckTypeAndForm(PR.CCheck(),ent);
ent->Init(tempOperands, tempOperations);
}
void IGESSolid_ToolBooleanTree::WriteOwnParams
(const Handle(IGESSolid_BooleanTree)& ent, IGESData_IGESWriter& IW) const
{
Standard_Integer length = ent->Length();
IW.Send(length);
for (Standard_Integer i = 1; i <= length; i++)
{
if (ent->IsOperand(i)) IW.Send(ent->Operand(i), Standard_True);
else IW.Send(ent->Operation(i));
}
}
void IGESSolid_ToolBooleanTree::OwnShared
(const Handle(IGESSolid_BooleanTree)& ent, Interface_EntityIterator& iter) const
{
Standard_Integer length = ent->Length();
for (Standard_Integer i = 1; i <= length; i++)
{
if (ent->IsOperand(i)) iter.GetOneItem(ent->Operand(i));
}
}
void IGESSolid_ToolBooleanTree::OwnCopy
(const Handle(IGESSolid_BooleanTree)& another,
const Handle(IGESSolid_BooleanTree)& ent, Interface_CopyTool& TC) const
{
Standard_Integer i;
Standard_Integer length = another->Length();
Handle(TColStd_HArray1OfInteger) tempOperations =
new TColStd_HArray1OfInteger(1, length);
Handle(IGESData_HArray1OfIGESEntity) tempOperands =
new IGESData_HArray1OfIGESEntity(1, length);
for (i=1; i<= length; i++)
{
if (another->IsOperand(i)) // Operand
{
DeclareAndCast(IGESData_IGESEntity, new_ent,
TC.Transferred(another->Operand(i)));
tempOperands->SetValue(i, new_ent);
}
else // Operation
tempOperations->SetValue(i, another->Operation(i));
}
ent->Init (tempOperands, tempOperations);
}
IGESData_DirChecker IGESSolid_ToolBooleanTree::DirChecker
(const Handle(IGESSolid_BooleanTree)& /*ent*/) const
{
IGESData_DirChecker DC(180, 0);
DC.Structure (IGESData_DefVoid);
DC.LineFont (IGESData_DefAny);
DC.Color (IGESData_DefAny);
DC.UseFlagRequired (0);
DC.GraphicsIgnored (1);
return DC;
}
void IGESSolid_ToolBooleanTree::OwnCheck
(const Handle(IGESSolid_BooleanTree)& ent,
const Interface_ShareTool& , Handle(Interface_Check)& ach) const
{
Standard_Integer length = ent->Length();
if (length <= 2)
ach->AddFail("Length of post-order notation : Less than three");
else {
if (!ent->IsOperand(1)) ach->AddFail("First Item is not an Operand");
if (!ent->IsOperand(2)) ach->AddFail("Second Item is not an Operand");
if ( ent->IsOperand(length)) ach->AddFail("Last Item is not an Operation");
}
for (Standard_Integer i = 1; i <= length; i ++) {
if (!ent->Operand(i).IsNull()) continue;
if (ent->Operation(i) < 1 || ent->Operation(i) > 3) {
char mess[80];
sprintf(mess,"Item no. %d Incorrect",i);
ach->AddFail(mess);
}
}
}
void IGESSolid_ToolBooleanTree::OwnDump
(const Handle(IGESSolid_BooleanTree)& ent, const IGESData_IGESDumper& dumper,
const Handle(Message_Messenger)& S, const Standard_Integer level) const
{
Standard_Integer i, length = ent->Length();
S << "IGESSolid_Boolean Tree" << endl;
S << "Length of the post-order notation :" << length << endl;
if (level > 4)
{
S << "Post-order notation of the Boolean Tree :" << endl;
for (i = 1; i <= length; i++)
{
if (ent->IsOperand(i))
{
S << "[" << i << "] Operand : ";
dumper.Dump (ent->Operand(i),S, 1);
S << endl;
}
else
{
Standard_Integer opcode = ent->Operation(i);
S << "[" << i << "] Operator : " << opcode;
if (opcode == 1) S << " (Union)";
else if (opcode == 2) S << " (Intersection)" << endl;
else if (opcode == 3) S << " (Difference)" << endl;
else S << " (incorrect value)" << endl;
}
}
}
// S << endl;
}
|
