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
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249 | #include <stdlib.h>
#include "TDUniqueId.hpp"
#include "RandomMersenne.hpp"
#include "DLIList.hpp"
#include "ToolDataUser.hpp"
#include "CubitAttribUser.hpp"
#include "CubitAttrib.hpp"
#include "CADefines.hpp"
#include "RefEntity.hpp"
#include "TopologyEntity.hpp"
#include "CastTo.hpp"
#include "GeometryModifyTool.hpp"
#include "GeometryQueryTool.hpp"
#include "GSaveOpen.hpp"
#include "CAUniqueId.hpp"
#include <stdio.h>
#include <time.h>
extern int init_genrand(unsigned long s);
extern long genrand_int31(void);
TDUIDList TDUniqueId::uniqueIdList;
COPYUIDMap TDUniqueId::mapForCopying;
int TDUniqueId::generate_unique_id()
{
int result;
// initialize the random number generator, using time as a seed; do it here
// instead of as a static variable of the class to add a little more randomness
// to the seed (which uses the time)
static RandomMersenne rng(time(NULL));
// generate random no. and check for duplicate; keep generating until
// we find a non-duplicate; initialize found to true so that we can
// test for duplicates in the loop below
bool found = false;
TDUIDList::iterator found_value;
do {
result = (int)(rng.genrand_int31());
found_value = uniqueIdList.lower_bound(result);
if(found_value != uniqueIdList.end())
{
found = ((*found_value).first == result);
if (found)
DIAGNOSTIC("Duplicate UID found - very unusual!\n");
}
}
while (found);
return result;
}
TDUniqueId::TDUniqueId(ToolDataUser *owner, const int id)
{
ownerEntity = owner;
uniqueId = id == 0 ? generate_unique_id() : id;
TDUIDList::value_type this_pair(uniqueId, this);
unique_id_list().insert(this_pair);
ownerEntity->add_TD(this);
// update the attribute if this is a CAU
CubitAttribUser *cau = CAST_TO(owner, CubitAttribUser);
if (cau) {
CubitAttrib *attrib = cau->get_cubit_attrib(CA_UNIQUE_ID);
attrib->has_updated(CUBIT_FALSE);
attrib->update();
}
}
int TDUniqueId::is_unique_id(const ToolData* td)
{
return (CAST_TO(const_cast<ToolData*>(td), TDUniqueId) != NULL);
}
TDUniqueId::~TDUniqueId()
{
// remove this from the list
//- With multimaps, keys do not have to be unique. With the erase(Key) function,
//- the multimap code will remove all entries with that key from the multimap.
//- The erase(iterator) function only removes the information at that iteration.
//- Here, we search for the proper entry if there is more than one entry for a
//- particular key. Increment the iterator and compare the element to 'this'. If
//- it is a match, erase it by iterator. This will leave the other entry with
//- the similar key in the list, which is necessary for save/restore, and remove the
//- deactivated geometry due to the merge.
std::pair<TDUIDList::iterator, TDUIDList::iterator>
bounds_pair = unique_id_list().equal_range(uniqueId);
TDUIDList::iterator it;
for(it = bounds_pair.first; it != bounds_pair.second; ++it)
{
if(it->second == this)
{
unique_id_list().erase( it );
break;
}
}
}
int TDUniqueId::get_unique_id(ToolDataUser *owner,
const CubitBoolean create_new)
{
assert(owner != 0);
TDUniqueId *uid = (TDUniqueId *) owner->get_TD(&TDUniqueId::is_unique_id);
if (!uid && create_new == CUBIT_TRUE) {
uid = new TDUniqueId(owner);
}
return (uid ? uid->unique_id() : 0);
}
int TDUniqueId::find_td_unique_id(const int temp_id,
DLIList<ToolDataUser*> &td_list,
const RefEntity *related_entity)
{
td_list.clean_out();
int unique_id = temp_id;
//if we are not doing an undo and importing and merging within a file...
if( !GSaveOpen::performingUndo &&
GeometryQueryTool::importingSolidModel &&
!GeometryQueryTool::mergeGloballyOnImport)
{
//see if the old id maps to a new id...if so, use the new id
UIDMap old_uid_to_new_uid_map = CAUniqueId::get_old_to_new_uid_map();
UIDMap::iterator iter;
iter = old_uid_to_new_uid_map.find( unique_id );
if( iter != old_uid_to_new_uid_map.end() )
unique_id = (*iter).second;
}
std::pair<TDUIDList::iterator, TDUIDList::iterator>
bounds_pair = unique_id_list().equal_range(unique_id);
TDUIDList::iterator
it = bounds_pair.first, upper = bounds_pair.second;
if(it == unique_id_list().end())
return 0;
if ((*it).first == unique_id ) {
// the lower bound key is equal to unique_id, so this id is in the list
// look for duplicate id's, return one that's directly related
// get all td's with that id
for (; it != upper; it++) <--- Prefer prefix ++/-- operators for non-primitive types. [+]Prefix ++/-- operators should be preferred for non-primitive types. Pre-increment/decrement can be more efficient than post-increment/decrement. Post-increment/decrement usually involves keeping a copy of the previous value around and adds a little extra code.
{
bool related = true;
ToolDataUser *temp_tdu = (*it).second->owner_entity();
if (NULL != related_entity) {
TopologyEntity *topo_ent = CAST_TO(temp_tdu, TopologyEntity);
RefEntity* temp_entity = const_cast<RefEntity*>(related_entity);
if (!topo_ent ||
!topo_ent->is_directly_related(CAST_TO(temp_entity, TopologyEntity)))
related = false;
}
if (related) td_list.append(temp_tdu);
}
}
return td_list.size();
}
ToolDataUser *TDUniqueId::find_td_unique_id(const int temp_id,
const RefEntity *related_entity)
{
//ToolDataUser *tdu = NULL;
DLIList<ToolDataUser*> td_list;
find_td_unique_id(temp_id, td_list, related_entity);
if (0 == td_list.size()) return NULL;
else {
td_list.reset();
return td_list.get();
}
}
int TDUniqueId::get_unique_id_for_copy( int original_id )
{
//check in the map if the original is already there
//if so, get the corresponding id in the map (this is the new
//unique id on the copy)
COPYUIDMap::iterator iter;
iter = mapForCopying.find( original_id );
if( iter != mapForCopying.end() )
return (*iter).second;
//else, a) generate another unique id b) put the original id in the map with
//the new id directly across from it
int new_uid = generate_unique_id();
COPYUIDMap::value_type tmp_pair( original_id, new_uid );
mapForCopying.insert( tmp_pair );
return new_uid;
}
void TDUniqueId::clear_copy_map()
{
//remove TDs off of entities
COPYUIDMap::iterator iter = mapForCopying.begin();
for(; iter != mapForCopying.end(); iter++ )<--- Prefer prefix ++/-- operators for non-primitive types. [+]Prefix ++/-- operators should be preferred for non-primitive types. Pre-increment/decrement can be more efficient than post-increment/decrement. Post-increment/decrement usually involves keeping a copy of the previous value around and adds a little extra code.
{
DLIList<ToolDataUser*> tool_data_users;
int num_tool_datas = find_td_unique_id( (*iter).second, tool_data_users );
for( ; num_tool_datas--; )
{
ToolDataUser *td_user = tool_data_users.get_and_step();
//make sure the pointer isn't null
ToolData *tool_data = NULL;
if(td_user)
tool_data = td_user->remove_TD(TDUniqueId::is_unique_id);
//delete the TDUniqueId as well
if( tool_data )
delete tool_data;
td_user = find_td_unique_id( (*iter).second );
}
}
//clear out the map
if (mapForCopying.empty()) return;
mapForCopying.clear();
}
int TDUniqueId::unique_id()
{
//if we're doing a copy, don't use the Unique id on the original.
//generate another one
if( GeometryModifyTool::instance()->get_copy_entity() )
{
int unique_id_for_copy = get_unique_id_for_copy( uniqueId );
return unique_id_for_copy;
}
else
return uniqueId;
}
|