1 // Copyright (C) 2014-20xx CEA/DEN, EDF R&D
3 // File: SketchSolver_Storage.cpp
4 // Created: 30 Nov 2015
5 // Author: Artem ZHIDKOV
7 #include <SketchSolver_Storage.h>
8 #include <SketchSolver_Manager.h>
10 #include <GeomDataAPI_Point2D.h>
11 #include <ModelAPI_AttributeRefAttr.h>
12 #include <ModelAPI_AttributeRefList.h>
13 #include <SketchPlugin_Arc.h>
14 #include <SketchPlugin_Circle.h>
15 #include <SketchPlugin_Line.h>
16 #include <SketchPlugin_Point.h>
17 #include <SketchPlugin_IntersectionPoint.h>
18 #include <SketchPlugin_ConstraintCoincidence.h>
19 #include <SketchPlugin_ConstraintMirror.h>
20 #include <SketchPlugin_ConstraintRigid.h>
23 /// \brief Verify two vectors of constraints are equal.
24 /// Vectors differ by the order of elements are equal.
25 static bool isEqual(const std::list<ConstraintWrapperPtr>& theCVec1,
26 const std::list<ConstraintWrapperPtr>& theCVec2);
29 void SketchSolver_Storage::addConstraint(ConstraintPtr theConstraint,
30 ConstraintWrapperPtr theSolverConstraint)
32 if (theSolverConstraint) {
33 std::list<ConstraintWrapperPtr> aConstrList(1, theSolverConstraint);
34 addConstraint(theConstraint, aConstrList);
36 addConstraint(theConstraint, std::list<ConstraintWrapperPtr>());
39 void SketchSolver_Storage::addConstraint(
40 ConstraintPtr theConstraint,
41 std::list<ConstraintWrapperPtr> theSolverConstraints)
43 std::map<ConstraintPtr, std::list<ConstraintWrapperPtr> >::const_iterator
44 aFound = myConstraintMap.find(theConstraint);
45 if (aFound == myConstraintMap.end() || !isEqual(aFound->second, theSolverConstraints))
46 setNeedToResolve(true);
48 if (theSolverConstraints.empty()) {
49 // constraint links to the empty list, add its attributes linked to the empty entities
50 std::list<AttributePtr> aRefAttrs =
51 theConstraint->data()->attributes(ModelAPI_AttributeRefAttr::typeId());
52 std::list<AttributePtr>::const_iterator anAttrIt = aRefAttrs.begin();
53 for (; anAttrIt != aRefAttrs.end(); ++anAttrIt) {
54 AttributeRefAttrPtr aRef = std::dynamic_pointer_cast<ModelAPI_AttributeRefAttr>(*anAttrIt);
55 if (aRef->isObject()) {
56 FeaturePtr aFeature = ModelAPI_Feature::feature(aRef->object());
57 if (aFeature) addEntity(aFeature, EntityWrapperPtr());
59 addEntity(aRef->attr(), EntityWrapperPtr());
61 std::list<AttributePtr> aRefLists =
62 theConstraint->data()->attributes(ModelAPI_AttributeRefList::typeId());
63 for (anAttrIt = aRefLists.begin(); anAttrIt != aRefLists.end(); ++anAttrIt) {
64 AttributeRefListPtr aRef = std::dynamic_pointer_cast<ModelAPI_AttributeRefList>(*anAttrIt);
65 std::list<ObjectPtr> anObj = aRef->list();
66 std::list<ObjectPtr>::iterator anIt = anObj.begin();
67 for (; anIt != anObj.end(); ++anIt) {
68 FeaturePtr aFeature = ModelAPI_Feature::feature(*anIt);
69 if (aFeature) addEntity(aFeature, EntityWrapperPtr());
73 else if (theSolverConstraints.front()->type() != CONSTRAINT_PT_PT_COINCIDENT) {
74 // Do not add point-point coincidence, because it is already made by setting
75 // the same parameters for both points
76 std::list<ConstraintWrapperPtr>::iterator aCIt = theSolverConstraints.begin();
77 for (; aCIt != theSolverConstraints.end(); ++aCIt)
81 if (!theSolverConstraints.empty() || aFound == myConstraintMap.end())
82 myConstraintMap[theConstraint] = theSolverConstraints;
83 // block events if necessary
84 if (myEventsBlocked && theConstraint && theConstraint->data() && theConstraint->data()->isValid())
85 theConstraint->data()->blockSendAttributeUpdated(myEventsBlocked);
88 static std::list<AttributePtr> pointAttributes(FeaturePtr theFeature)
90 std::list<AttributePtr> aPoints;
91 if (theFeature->getKind() == SketchPlugin_Arc::ID()) {
92 aPoints.push_back(theFeature->attribute(SketchPlugin_Arc::CENTER_ID()));
93 aPoints.push_back(theFeature->attribute(SketchPlugin_Arc::START_ID()));
94 aPoints.push_back(theFeature->attribute(SketchPlugin_Arc::END_ID()));
96 else if (theFeature->getKind() == SketchPlugin_Circle::ID())
97 aPoints.push_back(theFeature->attribute(SketchPlugin_Circle::CENTER_ID()));
98 else if (theFeature->getKind() == SketchPlugin_Line::ID()) {
99 aPoints.push_back(theFeature->attribute(SketchPlugin_Line::START_ID()));
100 aPoints.push_back(theFeature->attribute(SketchPlugin_Line::END_ID()));
102 else if (theFeature->getKind() == SketchPlugin_Point::ID() ||
103 theFeature->getKind() == SketchPlugin_IntersectionPoint::ID())
104 aPoints.push_back(theFeature->attribute(SketchPlugin_Point::COORD_ID()));
108 void SketchSolver_Storage::addEntity(FeaturePtr theFeature,
109 EntityWrapperPtr theSolverEntity)
111 std::map<FeaturePtr, EntityWrapperPtr>::const_iterator aFound = myFeatureMap.find(theFeature);
112 if (aFound == myFeatureMap.end() || !aFound->second ||
113 (theSolverEntity && !aFound->second->isEqual(theSolverEntity)))
114 setNeedToResolve(true); // the entity is new or modified
116 if (!theSolverEntity) {
117 // feature links to the empty entity, add its attributes
118 std::list<AttributePtr> aPntAttrs = pointAttributes(theFeature);
119 std::list<AttributePtr>::const_iterator anAttrIt = aPntAttrs.begin();
120 for (; anAttrIt != aPntAttrs.end(); ++anAttrIt)
121 addEntity(*anAttrIt, EntityWrapperPtr());
122 if (aFound == myFeatureMap.end())
123 myFeatureMap[theFeature] = theSolverEntity;
125 myFeatureMap[theFeature] = theSolverEntity;
127 // block events if necessary
128 if (myEventsBlocked && theFeature->data() && theFeature->data()->isValid())
129 theFeature->data()->blockSendAttributeUpdated(myEventsBlocked);
132 void SketchSolver_Storage::addEntity(AttributePtr theAttribute,
133 EntityWrapperPtr theSolverEntity)
135 std::map<AttributePtr, EntityWrapperPtr>::const_iterator aFound = myAttributeMap.find(theAttribute);
136 if (aFound == myAttributeMap.end() || !aFound->second ||
137 (theSolverEntity && !aFound->second->isEqual(theSolverEntity)))
138 setNeedToResolve(true); // the entity is new or modified
140 if (theSolverEntity || aFound == myAttributeMap.end())
141 myAttributeMap[theAttribute] = theSolverEntity;
142 // block events if necessary
143 if (myEventsBlocked && theAttribute->owner() &&
144 theAttribute->owner()->data() && theAttribute->owner()->data()->isValid())
145 theAttribute->owner()->data()->blockSendAttributeUpdated(myEventsBlocked);
149 static bool isCopyInMulti(std::shared_ptr<SketchPlugin_Feature> theFeature,
150 const std::map<ConstraintPtr, std::list<ConstraintWrapperPtr> >& theConstraints)
154 bool aResult = theFeature->isCopy();
156 std::map<ConstraintPtr, std::list<ConstraintWrapperPtr> >::const_iterator
157 anIt = theConstraints.begin();
158 for (; anIt != theConstraints.end() && aResult; ++anIt) {
159 if (anIt->first->getKind() != SketchPlugin_ConstraintMirror::ID())
161 AttributeRefListPtr aRefList = std::dynamic_pointer_cast<ModelAPI_AttributeRefList>(
162 anIt->first->attribute(SketchPlugin_Constraint::ENTITY_C()));
163 std::list<ObjectPtr> aMirroredList = aRefList->list();
164 std::list<ObjectPtr>::const_iterator aMIt = aMirroredList.begin();
165 for (; aMIt != aMirroredList.end() && aResult; ++aMIt) {
166 FeaturePtr aFeat = ModelAPI_Feature::feature(*aMIt);
167 if (aFeat == theFeature)
175 bool SketchSolver_Storage::update(FeaturePtr theFeature, const GroupID& theGroup, bool theForce)
177 bool isUpdated = false;
178 EntityWrapperPtr aRelated = entity(theFeature);
179 if (!aRelated) { // Feature is not exist, create it
180 std::shared_ptr<SketchPlugin_Feature> aSketchFeature =
181 std::dynamic_pointer_cast<SketchPlugin_Feature>(theFeature);
182 bool isCopy = isCopyInMulti(aSketchFeature, myConstraintMap);
183 if (!theForce && isCopy && myFeatureMap.find(theFeature) == myFeatureMap.end())
184 return false; // the feature is a copy in "Multi" constraint and does not used in other constraints
186 std::list<EntityWrapperPtr> aSubs;
187 // Reserve the feature in the map of features (do not want to add several copies of it)
188 myFeatureMap[theFeature] = aRelated;
189 // Firstly, create/update its attributes
190 std::list<AttributePtr> anAttrs = pointAttributes(theFeature);
191 std::list<AttributePtr>::const_iterator anIt = anAttrs.begin();
192 for (; anIt != anAttrs.end(); ++anIt) {
193 isUpdated = update(*anIt, theGroup, theForce) || isUpdated;
194 aSubs.push_back(entity(*anIt));
196 // If the feature is a circle, add its radius as a sub
197 if (theFeature->getKind() == SketchPlugin_Circle::ID()) {
198 AttributePtr aRadius = theFeature->attribute(SketchPlugin_Circle::RADIUS_ID());
199 isUpdated = update(aRadius, theGroup, theForce) || isUpdated;
200 aSubs.push_back(entity(aRadius));
202 // If the feature if circle or arc, we need to add normal of the sketch to the list of subs
203 if (theFeature->getKind() == SketchPlugin_Arc::ID() ||
204 theFeature->getKind() == SketchPlugin_Circle::ID()) {
205 EntityWrapperPtr aNormal = getNormal();
206 if (aNormal) aSubs.push_back(aNormal);
208 // Secondly, convert feature
209 BuilderPtr aBuilder = SketchSolver_Manager::instance()->builder();
210 GroupID aGroup = theGroup != GID_UNKNOWN ? theGroup : myGroupID;
211 // Check external feature
212 if (aSketchFeature && (aSketchFeature->isExternal() || isCopy))
213 aGroup = GID_OUTOFGROUP;
214 aRelated = aBuilder->createFeature(theFeature, aSubs, aGroup);
217 addEntity(theFeature, aRelated);
218 } else if (theGroup != GID_UNKNOWN)
219 changeGroup(aRelated, theGroup);
220 return update(aRelated) || isUpdated;
223 bool SketchSolver_Storage::update(AttributePtr theAttribute, const GroupID& theGroup, bool theForce)
225 AttributePtr anAttribute = theAttribute;
226 AttributeRefAttrPtr aRefAttr = std::dynamic_pointer_cast<ModelAPI_AttributeRefAttr>(anAttribute);
228 if (aRefAttr->isObject()) {
229 FeaturePtr aFeature = ModelAPI_Feature::feature(aRefAttr->object());
230 return update(aFeature, theGroup, theForce);
232 anAttribute = aRefAttr->attr();
235 EntityWrapperPtr aRelated = entity(anAttribute);
236 if (!aRelated) { // Attribute is not exist, create it
237 // verify the attribute is a point of arc and add whole arc
238 if (anAttribute->owner()) {
239 FeaturePtr aFeature = ModelAPI_Feature::feature(anAttribute->owner());
240 if (aFeature->getKind() == SketchPlugin_Arc::ID() &&
241 myFeatureMap.find(aFeature) == myFeatureMap.end()) {
242 // Additional checking that all attributes are initialized
243 if (aFeature->attribute(SketchPlugin_Arc::CENTER_ID())->isInitialized() &&
244 aFeature->attribute(SketchPlugin_Arc::START_ID())->isInitialized() &&
245 aFeature->attribute(SketchPlugin_Arc::END_ID())->isInitialized()) {
246 return SketchSolver_Storage::update(aFeature, theGroup, theForce);
248 myFeatureMap[aFeature] = EntityWrapperPtr();
253 BuilderPtr aBuilder = SketchSolver_Manager::instance()->builder();
254 GroupID aGroup = theGroup != GID_UNKNOWN ? theGroup : myGroupID;
255 // Check attribute of external features
256 std::shared_ptr<SketchPlugin_Feature> aSketchFeature =
257 std::dynamic_pointer_cast<SketchPlugin_Feature>(anAttribute->owner());
258 if (aSketchFeature && (aSketchFeature->isExternal() || isCopyInMulti(aSketchFeature, myConstraintMap)))
259 aGroup = GID_OUTOFGROUP;
260 aRelated = aBuilder->createAttribute(anAttribute, aGroup);
263 addEntity(anAttribute, aRelated);
264 } else if (theGroup != GID_UNKNOWN)
265 changeGroup(aRelated, theGroup);
266 return update(aRelated);
271 const std::list<ConstraintWrapperPtr>& SketchSolver_Storage::constraint(
272 const ConstraintPtr& theConstraint) const
274 static std::list<ConstraintWrapperPtr> aDummy;
276 std::map<ConstraintPtr, std::list<ConstraintWrapperPtr>>::const_iterator
277 aFound = myConstraintMap.find(theConstraint);
278 if (aFound != myConstraintMap.end())
279 return aFound->second;
283 const EntityWrapperPtr& SketchSolver_Storage::entity(const FeaturePtr& theFeature) const
285 static EntityWrapperPtr aDummy;
287 std::map<FeaturePtr, EntityWrapperPtr>::const_iterator aFound = myFeatureMap.find(theFeature);
288 if (aFound != myFeatureMap.end())
289 return aFound->second;
293 const EntityWrapperPtr& SketchSolver_Storage::entity(const AttributePtr& theAttribute) const
295 static EntityWrapperPtr aDummy;
297 std::map<AttributePtr, EntityWrapperPtr>::const_iterator
298 aFound = myAttributeMap.find(theAttribute);
299 if (aFound != myAttributeMap.end())
300 return aFound->second;
302 AttributeRefAttrPtr aRefAttr =
303 std::dynamic_pointer_cast<ModelAPI_AttributeRefAttr>(theAttribute);
305 if (aRefAttr->isObject()) {
306 FeaturePtr aFeature = ModelAPI_Feature::feature(aRefAttr->object());
307 return entity(aFeature);
309 return entity(aRefAttr->attr());
314 bool SketchSolver_Storage::removeConstraint(ConstraintPtr theConstraint)
316 std::map<ConstraintPtr, std::list<ConstraintWrapperPtr> >::iterator
317 aFound = myConstraintMap.find(theConstraint);
318 if (aFound == myConstraintMap.end())
319 return true; // no constraint, already deleted
322 std::list<ConstraintWrapperPtr> aConstrList = aFound->second;
323 myConstraintMap.erase(aFound);
324 // Remove SolveSpace constraints
325 bool isFullyRemoved = true;
326 std::list<ConstraintWrapperPtr>::iterator anIt = aConstrList.begin();
327 while (anIt != aConstrList.end()) {
329 std::list<ConstraintWrapperPtr>::iterator aRemoveIt = anIt++;
330 aConstrList.erase(aRemoveIt);
332 isFullyRemoved = false;
336 return isFullyRemoved;
339 template <class ENT_TYPE>
340 static bool isUsed(ConstraintWrapperPtr theConstraint, ENT_TYPE theEntity)
342 if (!theConstraint || !theEntity)
344 std::list<EntityWrapperPtr>::const_iterator anEntIt = theConstraint->entities().begin();
345 for (; anEntIt != theConstraint->entities().end(); ++anEntIt)
346 if ((*anEntIt)->isBase(theEntity))
351 static bool isUsed(EntityWrapperPtr theFeature, AttributePtr theSubEntity)
353 if (!theFeature || !theSubEntity)
355 std::list<EntityWrapperPtr>::const_iterator aSubIt = theFeature->subEntities().begin();
356 for (; aSubIt != theFeature->subEntities().end(); ++aSubIt)
357 if ((*aSubIt)->isBase(theSubEntity))
362 static bool isUsed(FeaturePtr theFeature, AttributePtr theAttribute)
364 if (!theFeature || !theAttribute)
366 std::list<AttributePtr> anAttrList = theFeature->data()->attributes(std::string());
367 std::list<AttributePtr>::const_iterator anIt = anAttrList.begin();
368 for (; anIt != anAttrList.end(); ++anIt) {
369 if (*anIt == theAttribute)
371 AttributeRefAttrPtr aRefAttr = std::dynamic_pointer_cast<ModelAPI_AttributeRefAttr>(*anIt);
372 if (aRefAttr && !aRefAttr->isObject() && aRefAttr->attr() == theAttribute)
378 bool SketchSolver_Storage::isUsed(FeaturePtr theFeature) const
380 if (myFeatureMap.find(theFeature) != myFeatureMap.end())
383 std::map<ConstraintPtr, std::list<ConstraintWrapperPtr> >::const_iterator
384 aCIt = myConstraintMap.begin();
385 std::list<ConstraintWrapperPtr>::const_iterator aCWIt;
386 for (; aCIt != myConstraintMap.end(); ++aCIt)
387 for (aCWIt = aCIt->second.begin(); aCWIt != aCIt->second.end(); ++aCWIt)
388 if (::isUsed(*aCWIt, theFeature))
391 std::list<AttributePtr> anAttrList = pointAttributes(theFeature);
392 std::list<AttributePtr>::const_iterator anIt = anAttrList.begin();
393 for (; anIt != anAttrList.end(); ++anIt)
399 bool SketchSolver_Storage::isUsed(AttributePtr theAttribute) const
401 AttributePtr anAttribute = theAttribute;
402 AttributeRefAttrPtr aRefAttr = std::dynamic_pointer_cast<ModelAPI_AttributeRefAttr>(anAttribute);
404 if (aRefAttr->isObject())
405 return isUsed(ModelAPI_Feature::feature(aRefAttr->object()));
407 anAttribute = aRefAttr->attr();
410 if (myAttributeMap.find(theAttribute) != myAttributeMap.end())
412 // check in constraints
413 std::map<ConstraintPtr, std::list<ConstraintWrapperPtr> >::const_iterator
414 aCIt = myConstraintMap.begin();
415 std::list<ConstraintWrapperPtr>::const_iterator aCWIt;
416 for (; aCIt != myConstraintMap.end(); ++aCIt) {
417 for (aCWIt = aCIt->second.begin(); aCWIt != aCIt->second.end(); ++aCWIt)
418 if (::isUsed(*aCWIt, anAttribute))
420 // Additional check for the Fixed constraints, which have no wrapper associated.
421 if (aCIt->first->getKind() == SketchPlugin_ConstraintRigid::ID() &&
422 ::isUsed(FeaturePtr(aCIt->first), anAttribute))
426 std::map<FeaturePtr, EntityWrapperPtr>::const_iterator aFIt = myFeatureMap.begin();
427 for (; aFIt != myFeatureMap.end(); ++aFIt)
428 if (::isUsed(aFIt->second, anAttribute))
434 bool SketchSolver_Storage::removeEntity(FeaturePtr theFeature)
436 std::map<FeaturePtr, EntityWrapperPtr>::iterator aFound = myFeatureMap.find(theFeature);
437 if (aFound == myFeatureMap.end())
438 return true; // feature not found, nothing to delete
440 EntityWrapperPtr anEntity = aFound->second;
441 myFeatureMap.erase(aFound);
443 // Check if the feature is not used by constraints, remove it
444 if (!anEntity || (!isUsed(theFeature) && remove(anEntity)))
447 // feature is not removed, revert operation
448 myFeatureMap[theFeature] = anEntity;
453 bool SketchSolver_Storage::removeEntity(AttributePtr theAttribute)
455 std::map<AttributePtr, EntityWrapperPtr>::iterator aFound = myAttributeMap.find(theAttribute);
456 if (aFound == myAttributeMap.end())
457 return true; // attribute not found, nothing to delete
459 EntityWrapperPtr anEntity = aFound->second;
460 myAttributeMap.erase(aFound);
462 // Check if the attribute is not used by constraints and features, remove it
463 if (!anEntity || (!isUsed(theAttribute) && remove(anEntity)))
466 // attribute is not removed, revert operation
467 myAttributeMap[theAttribute] = anEntity;
472 // Merge groups containing given entities
473 static void mergeGroups(std::list<std::set<EntityWrapperPtr> >& theGroups,
474 const EntityWrapperPtr& theEntity1, const EntityWrapperPtr& theEntity2)
476 std::list<std::set<EntityWrapperPtr> >::iterator aFound1 = theGroups.end();
477 std::list<std::set<EntityWrapperPtr> >::iterator aFound2 = theGroups.end();
478 std::list<std::set<EntityWrapperPtr> >::iterator anIt = theGroups.begin();
479 for (; anIt != theGroups.end() && (aFound1 == theGroups.end() || aFound2 == theGroups.end());
481 if (anIt->find(theEntity1) != anIt->end())
483 if (anIt->find(theEntity2) != anIt->end())
487 if (aFound1 == aFound2 || aFound1 == theGroups.end() || aFound2 == theGroups.end())
488 return; // nothing to merge
490 aFound1->insert(aFound2->begin(), aFound2->end());
491 theGroups.erase(aFound2);
494 bool SketchSolver_Storage::removeCoincidence(ConstraintWrapperPtr theConstraint)
496 std::list<EntityWrapperPtr> aPoints = theConstraint->entities();
497 std::list<EntityWrapperPtr>::const_iterator aPIt;
499 CoincidentPointsMap::iterator aPtPtIt = myCoincidentPoints.begin();
500 for (; aPtPtIt != myCoincidentPoints.end(); ++aPtPtIt) {
501 for (aPIt = aPoints.begin(); aPIt != aPoints.end(); ++aPIt)
502 if (aPtPtIt->first == *aPIt ||
503 aPtPtIt->second.find(*aPIt) != aPtPtIt->second.end())
505 if (aPIt != aPoints.end())
509 if (aPtPtIt == myCoincidentPoints.end())
510 return true; // already removed
512 // Removing of coincidence may split this group of coincident point to several groups.
513 // Find all of them and also the points which become alone.
514 std::list< std::set<EntityWrapperPtr> > aCoincGroups;
515 std::set<EntityWrapperPtr> aGroup;
516 aGroup.insert(aPtPtIt->first);
517 aCoincGroups.push_back(aGroup);
518 std::set<EntityWrapperPtr>::const_iterator aTempIt = aPtPtIt->second.begin();
519 for (; aTempIt != aPtPtIt->second.end(); ++aTempIt) {
521 aGroup.insert(*aTempIt);
522 aCoincGroups.push_back(aGroup);
525 std::map<ConstraintPtr, std::list<ConstraintWrapperPtr> >::iterator
526 aConstrIt = myConstraintMap.begin();
527 for (; aConstrIt != myConstraintMap.end(); ++aConstrIt) {
528 if (aConstrIt->first->getKind() != SketchPlugin_ConstraintCoincidence::ID())
531 AttributeRefAttrPtr aRefAttr[2] = {
532 aConstrIt->first->refattr(SketchPlugin_Constraint::ENTITY_A()),
533 aConstrIt->first->refattr(SketchPlugin_Constraint::ENTITY_B())
535 AttributePtr anAttr[2];
536 if (aConstrIt->first->data()->isValid()) {
537 if (!aRefAttr[0] || !aRefAttr[1])
540 for (int i = 0; i < 2; ++i) {
541 if (aRefAttr[i]->isObject()) {
542 FeaturePtr aFeature = ModelAPI_Feature::feature(aRefAttr[i]->object());
543 if (!aFeature || (aFeature->getKind() != SketchPlugin_Point::ID() &&
544 aFeature->getKind() != SketchPlugin_IntersectionPoint::ID()))
546 anAttr[i] = aFeature->attribute(SketchPlugin_Point::COORD_ID());
548 anAttr[i] = aRefAttr[i]->attr();
551 // obtain attributes from the constraint wrapper
552 // if SketchPlugin_Constraint has invalid data (already removed)
553 ConstraintWrapperPtr aWrapper = aConstrIt->second.front();
554 anAttr[0] = aWrapper->entities().front()->baseAttribute();
555 anAttr[1] = aWrapper->entities().back()->baseAttribute();
558 EntityWrapperPtr anEntities[2];
559 for (int i = 0; i < 2; ++i) {
560 std::map<AttributePtr, EntityWrapperPtr>::iterator
561 aFound = myAttributeMap.find(anAttr[i]);
562 if (aFound != myAttributeMap.end())
563 anEntities[i] = aFound->second;
565 mergeGroups(aCoincGroups, anEntities[0], anEntities[1]);
568 // Collect alone points and build them new instances
569 std::list<EntityWrapperPtr> aShutOffList;
570 BuilderPtr aBuilder = SketchSolver_Manager::instance()->builder();
571 std::map<EntityWrapperPtr, EntityWrapperPtr> aNotCoinc;
572 std::list<std::set<EntityWrapperPtr> >::iterator aGroupIt = aCoincGroups.begin();
573 while (aGroupIt != aCoincGroups.end()) {
574 if (aGroupIt->size() == 1) {
575 EntityWrapperPtr aPoint = *aGroupIt->begin();
576 aShutOffList.push_back(aPoint);
578 aBuilder->createAttribute(aPoint->baseAttribute(), myGroupID, mySketchID);
579 std::list<std::set<EntityWrapperPtr> >::iterator aRemoveIt = aGroupIt++;
580 aCoincGroups.erase(aRemoveIt);
581 } else // point is not alone
585 if (aNotCoinc.empty() && aCoincGroups.size() == 1)
588 // Find all features and constraints uses non-coincident points
589 replaceEntities(aNotCoinc);
591 // Remove not coincident points and points in separated groups
592 if (!aCoincGroups.empty()) {
593 aGroupIt = aCoincGroups.begin();
594 for (++aGroupIt; aGroupIt != aCoincGroups.end(); ++aGroupIt)
595 aShutOffList.insert(aShutOffList.end(), aGroupIt->begin(), aGroupIt->end());
597 std::list<EntityWrapperPtr>::iterator aNotCIt = aShutOffList.begin();
598 for (; aNotCIt != aShutOffList.end(); ++aNotCIt) {
599 if (aPtPtIt->second.size() <= 1) {
600 myCoincidentPoints.erase(aPtPtIt);
603 if (aPtPtIt->first == *aNotCIt) {
604 std::set<EntityWrapperPtr> aSlaves = aPtPtIt->second;
605 EntityWrapperPtr aNewMaster = *aSlaves.begin();
606 aSlaves.erase(aSlaves.begin());
607 myCoincidentPoints.erase(aPtPtIt);
608 myCoincidentPoints[aNewMaster] = aSlaves;
609 aPtPtIt = myCoincidentPoints.find(aNewMaster);
611 aPtPtIt->second.erase(*aNotCIt);
614 // Create additional groups of coincident points
615 aGroupIt = aCoincGroups.begin();
616 if (!aCoincGroups.empty())
618 for (; aGroupIt != aCoincGroups.end(); ++aGroupIt) {
620 std::set<EntityWrapperPtr>::iterator anEntIt = aGroupIt->begin();
621 for (; anEntIt != aGroupIt->end(); ++anEntIt) {
622 aNotCoinc[*anEntIt] =
623 aBuilder->createAttribute((*anEntIt)->baseAttribute(), myGroupID, mySketchID);
625 // replace points by newly created
626 replaceEntities(aNotCoinc);
627 // set new group of coincident points
628 EntityWrapperPtr aMasterEnt = aNotCoinc.begin()->second;
629 std::map<EntityWrapperPtr, EntityWrapperPtr>::iterator aNCIt = aNotCoinc.begin();
630 for (++aNCIt; aNCIt != aNotCoinc.end(); ++aNCIt)
631 addCoincidentPoints(aMasterEnt, aNCIt->second);
637 void SketchSolver_Storage::replaceEntities(const std::map<EntityWrapperPtr, EntityWrapperPtr>& theChange)
639 std::set<EntityWrapperPtr> anUpdFeatures;
640 std::map<EntityWrapperPtr, EntityWrapperPtr>::const_iterator aSubIt;
641 std::map<FeaturePtr, EntityWrapperPtr>::iterator aFIt = myFeatureMap.begin();
642 for (; aFIt != myFeatureMap.end(); ++aFIt) {
644 continue; // avoid not completed arcs
645 for (aSubIt = theChange.begin(); aSubIt != theChange.end(); ++aSubIt) {
646 if (!aSubIt->second || !::isUsed(aFIt->first, aSubIt->first->baseAttribute()))
648 std::list<EntityWrapperPtr> aSubs = aFIt->second->subEntities();
649 std::list<EntityWrapperPtr>::iterator aSIt = aSubs.begin();
651 for (; aSIt != aSubs.end(); ++aSIt)
652 if (*aSIt == aSubIt->first) {
653 (*aSIt)->update(aSubIt->second);
654 (*aSIt)->setGroup(aFIt->second->group());
658 aFIt->second->setSubEntities(aSubs);
659 anUpdFeatures.insert(aFIt->second);
664 std::set<EntityWrapperPtr>::iterator anUpdIt = anUpdFeatures.begin();
665 for (; anUpdIt != anUpdFeatures.end(); ++anUpdIt)
666 update(EntityWrapperPtr(*anUpdIt));
669 bool SketchSolver_Storage::remove(ConstraintWrapperPtr theConstraint)
671 bool isFullyRemoved = true;
672 std::list<EntityWrapperPtr>::const_iterator anIt = theConstraint->entities().begin();
673 for (; anIt != theConstraint->entities().end(); ++anIt) {
674 FeaturePtr aBaseFeature = (*anIt)->baseFeature();
676 isFullyRemoved = SketchSolver_Storage::removeEntity(aBaseFeature) && isFullyRemoved;
678 isFullyRemoved = SketchSolver_Storage::removeEntity((*anIt)->baseAttribute()) && isFullyRemoved;
680 return isFullyRemoved;
683 bool SketchSolver_Storage::remove(EntityWrapperPtr theEntity)
685 bool isFullyRemoved = true;
686 std::list<EntityWrapperPtr>::const_iterator anEntIt = theEntity->subEntities().begin();
687 for (; anEntIt != theEntity->subEntities().end(); ++anEntIt) {
688 FeaturePtr aBaseFeature = (*anEntIt)->baseFeature();
690 isFullyRemoved = SketchSolver_Storage::removeEntity(aBaseFeature) && isFullyRemoved;
692 AttributePtr aBaseAttr = (*anEntIt)->baseAttribute();
694 isFullyRemoved = SketchSolver_Storage::removeEntity(aBaseAttr) && isFullyRemoved;
700 std::list<ParameterWrapperPtr>::const_iterator aParIt = theEntity->parameters().begin();
701 for (; aParIt != theEntity->parameters().end(); ++aParIt)
702 isFullyRemoved = remove(*aParIt) && isFullyRemoved;
703 return isFullyRemoved;
707 bool SketchSolver_Storage::isInteract(const FeaturePtr& theFeature) const
711 if (myConstraintMap.empty())
712 return true; // empty storage interacts with each feature
714 ConstraintPtr aConstraint = std::dynamic_pointer_cast<SketchPlugin_Constraint>(theFeature);
716 if (myConstraintMap.find(aConstraint) != myConstraintMap.end())
718 } else if (myFeatureMap.find(theFeature) != myFeatureMap.end())
721 std::list<AttributePtr> anAttrList = theFeature->data()->attributes(std::string());
722 std::list<AttributePtr>::const_iterator anIt = anAttrList.begin();
723 for (; anIt != anAttrList.end(); ++anIt)
724 if (isInteract(*anIt))
730 bool SketchSolver_Storage::isInteract(const AttributePtr& theAttribute) const
735 AttributeRefListPtr aRefList =
736 std::dynamic_pointer_cast<ModelAPI_AttributeRefList>(theAttribute);
738 std::list<ObjectPtr> anObjects = aRefList->list();
739 std::list<ObjectPtr>::iterator anObjIt = anObjects.begin();
740 for (; anObjIt != anObjects.end(); ++anObjIt) {
741 FeaturePtr aFeature = ModelAPI_Feature::feature(*anObjIt);
742 if (isInteract(aFeature))
748 AttributeRefAttrPtr aRefAttr =
749 std::dynamic_pointer_cast<ModelAPI_AttributeRefAttr>(theAttribute);
751 return myAttributeMap.find(theAttribute) != myAttributeMap.end();
752 if (!aRefAttr->isObject())
753 return myAttributeMap.find(aRefAttr->attr()) != myAttributeMap.end();
755 FeaturePtr aFeature = ModelAPI_Feature::feature(aRefAttr->object());
756 return isInteract(aFeature);
759 bool SketchSolver_Storage::isConsistent() const
761 // Check the constraints are valid
762 std::map<ConstraintPtr, std::list<ConstraintWrapperPtr> >::const_iterator
763 aCIter = myConstraintMap.begin();
764 for (; aCIter != myConstraintMap.end(); ++aCIter)
765 if (!aCIter->first->data() || !aCIter->first->data()->isValid())
767 // Check the features are valid
768 std::map<FeaturePtr, EntityWrapperPtr>::const_iterator aFIter = myFeatureMap.begin();
769 for (; aFIter != myFeatureMap.end(); aFIter++)
770 if (!aFIter->first->data() || !aFIter->first->data()->isValid())
775 bool SketchSolver_Storage::isFixed(EntityWrapperPtr theEntity) const
777 if (theEntity->group() != myGroupID)
779 // no need additional checking for entities differ than point
780 if (theEntity->type() != ENTITY_POINT)
783 CoincidentPointsMap::const_iterator anIt = myCoincidentPoints.begin();
784 for (; anIt != myCoincidentPoints.end(); ++anIt)
785 if (anIt->first == theEntity || anIt->second.find(theEntity) != anIt->second.end()) {
786 if (anIt->first->group() != myGroupID)
788 std::set<EntityWrapperPtr>::const_iterator anEntIt = anIt->second.begin();
789 for (; anEntIt != anIt->second.end(); ++anEntIt)
790 if ((*anEntIt)->group() != myGroupID)
794 std::map<ConstraintPtr, std::list<ConstraintWrapperPtr> >::const_iterator aCIt = myConstraintMap.begin();
795 std::list<ConstraintWrapperPtr>::const_iterator aCWIt;
796 for (; aCIt != myConstraintMap.end(); ++aCIt) {
797 if (aCIt->second.empty())
799 aCWIt = aCIt->second.begin();
800 if ((*aCWIt)->type() != CONSTRAINT_FIXED)
802 for (; aCWIt != aCIt->second.end(); ++aCIt)
803 if ((theEntity->baseAttribute() && (*aCWIt)->isUsed(theEntity->baseAttribute())) ||
804 (theEntity->baseFeature() && (*aCWIt)->isUsed(theEntity->baseFeature())))
811 void SketchSolver_Storage::removeInvalidEntities()
813 // Remove invalid constraints
814 std::list<ConstraintPtr> anInvalidConstraints;
815 std::map<ConstraintPtr, std::list<ConstraintWrapperPtr> >::const_iterator
816 aCIter = myConstraintMap.begin();
817 for (; aCIter != myConstraintMap.end(); ++aCIter)
818 if (!aCIter->first->data() || !aCIter->first->data()->isValid())
819 anInvalidConstraints.push_back(aCIter->first);
820 std::list<ConstraintPtr>::const_iterator anInvCIt = anInvalidConstraints.begin();
821 for (; anInvCIt != anInvalidConstraints.end(); ++anInvCIt)
822 removeConstraint(*anInvCIt);
823 // Remove invalid features
824 std::list<FeaturePtr> anInvalidFeatures;
825 std::map<FeaturePtr, EntityWrapperPtr>::const_iterator aFIter = myFeatureMap.begin();
826 for (; aFIter != myFeatureMap.end(); aFIter++)
827 if (!aFIter->first->data() || !aFIter->first->data()->isValid())
828 anInvalidFeatures.push_back(aFIter->first);
829 std::list<FeaturePtr>::const_iterator anInvFIt = anInvalidFeatures.begin();
830 for (; anInvFIt != anInvalidFeatures.end(); ++anInvFIt)
831 removeEntity(*anInvFIt);
834 EntityWrapperPtr SketchSolver_Storage::getNormal() const
836 EntityWrapperPtr aSketch = sketch();
840 // Find normal entity
841 const std::list<EntityWrapperPtr>& aSketchSubs = aSketch->subEntities();
842 std::list<EntityWrapperPtr>::const_iterator aSIt = aSketchSubs.begin();
843 for (; aSIt != aSketchSubs.end(); ++aSIt)
844 if ((*aSIt)->type() == ENTITY_NORMAL)
846 return EntityWrapperPtr();
849 const EntityWrapperPtr& SketchSolver_Storage::sketch() const
851 static EntityWrapperPtr aDummySketch;
853 std::map<FeaturePtr, EntityWrapperPtr>::const_iterator aFIt = myFeatureMap.begin();
854 for (; aFIt != myFeatureMap.end(); ++aFIt)
855 if (aFIt->second && aFIt->second->type() == ENTITY_SKETCH)
857 if (aFIt == myFeatureMap.end())
862 void SketchSolver_Storage::setSketch(const EntityWrapperPtr& theSketch)
866 addEntity(FeaturePtr(), theSketch);
869 void SketchSolver_Storage::processArcs()
872 std::map<FeaturePtr, EntityWrapperPtr>::iterator aFIt = myFeatureMap.begin();
873 for (; aFIt != myFeatureMap.end(); ++aFIt)
874 if (!aFIt->second && aFIt->first->getKind() == SketchPlugin_Arc::ID()) {
875 // Additional checking the attributes are initialized
876 if (aFIt->first->attribute(SketchPlugin_Arc::CENTER_ID())->isInitialized() &&
877 aFIt->first->attribute(SketchPlugin_Arc::START_ID())->isInitialized() &&
878 aFIt->first->attribute(SketchPlugin_Arc::END_ID())->isInitialized())
885 void SketchSolver_Storage::blockEvents(bool isBlocked)
887 if (isBlocked == myEventsBlocked)
890 std::map<ConstraintPtr, std::list<ConstraintWrapperPtr> >::const_iterator
891 aCIter = myConstraintMap.begin();
892 for (; aCIter != myConstraintMap.end(); aCIter++)
893 if (aCIter->first->data() && aCIter->first->data()->isValid())
894 aCIter->first->data()->blockSendAttributeUpdated(isBlocked);
896 std::map<FeaturePtr, EntityWrapperPtr>::const_iterator aFIter = myFeatureMap.begin();
897 for (; aFIter != myFeatureMap.end(); aFIter++)
898 if (aFIter->first->data() && aFIter->first->data()->isValid())
899 aFIter->first->data()->blockSendAttributeUpdated(isBlocked);
901 std::map<AttributePtr, EntityWrapperPtr>::const_iterator anAtIter = myAttributeMap.begin();
902 for (; anAtIter != myAttributeMap.end(); anAtIter++)
903 if (anAtIter->first->owner() && anAtIter->first->owner()->data() &&
904 anAtIter->first->owner()->data()->isValid())
905 anAtIter->first->owner()->data()->blockSendAttributeUpdated(isBlocked);
906 myEventsBlocked = isBlocked;
909 std::set<ObjectPtr> SketchSolver_Storage::getConflictingConstraints(SolverPtr theSolver) const
911 std::set<ObjectPtr> aConflicting;
912 std::map<ConstraintPtr, std::list<ConstraintWrapperPtr> >::const_iterator
913 aConstrIt = myConstraintMap.begin();
914 for (; aConstrIt != myConstraintMap.end(); ++aConstrIt) {
915 std::list<ConstraintWrapperPtr>::const_iterator anIt = aConstrIt->second.begin();
916 for (; anIt != aConstrIt->second.end(); ++anIt)
917 if (theSolver->isConflicting((*anIt)->id())) {
918 aConflicting.insert(aConstrIt->first);
929 // ============== Auxiliary functions ====================================
930 bool isEqual(const std::list<ConstraintWrapperPtr>& theCVec1,
931 const std::list<ConstraintWrapperPtr>& theCVec2)
933 if (theCVec1.size() != theCVec2.size())
936 std::list<bool> aChecked(theCVec2.size(), false);
937 std::list<ConstraintWrapperPtr>::const_iterator anIt1 = theCVec1.begin();
938 for (; anIt1 != theCVec1.end(); ++anIt1) {
939 std::list<ConstraintWrapperPtr>::const_iterator anIt2 = theCVec2.begin();
940 std::list<bool>::iterator aCheckIt = aChecked.begin();
941 while (aCheckIt != aChecked.end() && *aCheckIt) {
945 for (; anIt2 != theCVec2.end(); ++anIt2, ++aCheckIt)
946 if (!(*aCheckIt) && (*anIt1)->isEqual(*anIt2)) {
950 // the same constraint is not found
951 if (anIt2 == theCVec2.end())