1 // Copyright (C) 2014-20xx CEA/DEN, EDF R&D
3 // File: SolveSpaceSolver_Storage.cpp
4 // Created: 18 Mar 2015
5 // Author: Artem ZHIDKOV
7 #include <SolveSpaceSolver_Storage.h>
8 #include <SolveSpaceSolver_ConstraintWrapper.h>
9 #include <SolveSpaceSolver_EntityWrapper.h>
10 #include <SolveSpaceSolver_ParameterWrapper.h>
11 #include <SolveSpaceSolver_Builder.h>
13 #include <GeomAPI_Dir2d.h>
14 #include <GeomAPI_Pnt2d.h>
15 #include <GeomAPI_XY.h>
19 #include <GeomDataAPI_Point.h>
20 #include <GeomDataAPI_Point2D.h>
21 #include <ModelAPI_AttributeDouble.h>
22 #include <ModelAPI_AttributeRefAttr.h>
23 #include <SketchPlugin_Arc.h>
24 #include <SketchPlugin_ConstraintCoincidence.h>
26 /** \brief Search the entity/parameter with specified ID in the list of elements
27 * \param[in] theEntityID unique ID of the element
28 * \param[in] theEntities list of elements
29 * \return position of the found element or -1 if the element is not found
32 static int Search(const uint32_t& theEntityID, const std::vector<T>& theEntities);
34 /// \brief Compare two parameters to be different
35 static bool IsNotEqual(const Slvs_Param& theParam1, const Slvs_Param& theParam2);
36 /// \brief Compare two entities to be different
37 static bool IsNotEqual(const Slvs_Entity& theEntity1, const Slvs_Entity& theEntity2);
38 /// \brief Compare two constraints to be different
39 static bool IsNotEqual(const Slvs_Constraint& theConstraint1, const Slvs_Constraint& theConstraint2);
42 SolveSpaceSolver_Storage::SolveSpaceSolver_Storage(const GroupID& theGroup)
43 : SketchSolver_Storage(theGroup),
44 myWorkplaneID(SLVS_E_UNKNOWN),
45 myParamMaxID(SLVS_E_UNKNOWN),
46 myEntityMaxID(SLVS_E_UNKNOWN),
47 myConstrMaxID(SLVS_C_UNKNOWN),
48 myDuplicatedConstraint(false)
52 bool SolveSpaceSolver_Storage::update(ConstraintWrapperPtr theConstraint)
54 bool isUpdated = false;
55 std::shared_ptr<SolveSpaceSolver_ConstraintWrapper> aConstraint =
56 std::dynamic_pointer_cast<SolveSpaceSolver_ConstraintWrapper>(theConstraint);
57 Slvs_Constraint aSlvsConstr = getConstraint((Slvs_hConstraint)aConstraint->id());
58 if (aSlvsConstr.h == SLVS_C_UNKNOWN)
59 aSlvsConstr = aConstraint->constraint();
61 // update value of constraint if exist
62 if (fabs(aSlvsConstr.valA - theConstraint->value()) > tolerance) {
63 aSlvsConstr.valA = theConstraint->value();
67 // update constrained entities
68 Slvs_hEntity* aPnts[2] = {&aSlvsConstr.ptA, &aSlvsConstr.ptB};
69 Slvs_hEntity* anEnts[4] = {&aSlvsConstr.entityA, &aSlvsConstr.entityB,
70 &aSlvsConstr.entityC, &aSlvsConstr.entityD};
74 std::list<EntityWrapperPtr> anEntities = theConstraint->entities();
75 std::list<EntityWrapperPtr>::iterator anIt = anEntities.begin();
76 for (; anIt != anEntities.end(); ++anIt) {
77 isUpdated = update(*anIt) || isUpdated;
78 // do not update constrained entities for Multi constraints
79 if (aSlvsConstr.type == SLVS_C_MULTI_ROTATION || aSlvsConstr.type == SLVS_C_MULTI_TRANSLATION)
82 Slvs_hEntity anID = (Slvs_hEntity)(*anIt)->id();
83 if ((*anIt)->type() == ENTITY_POINT) {
84 if (*(aPnts[aPtInd]) != anID) {
85 *(aPnts[aPtInd]) = anID;
90 if (*(anEnts[aEntInd]) != anID) {
91 *(anEnts[aEntInd]) = anID;
98 // update constraint itself (do not update constraints Multi)
99 if (aSlvsConstr.type != SLVS_C_MULTI_ROTATION && aSlvsConstr.type != SLVS_C_MULTI_TRANSLATION) {
100 if (aSlvsConstr.wrkpl == SLVS_E_UNKNOWN && myWorkplaneID != SLVS_E_UNKNOWN)
101 aSlvsConstr.wrkpl = myWorkplaneID;
102 if (aSlvsConstr.group == SLVS_G_UNKNOWN)
103 aSlvsConstr.group = (Slvs_hGroup)myGroupID;
104 bool hasDupConstraints = myDuplicatedConstraint;
105 Slvs_hConstraint aConstrID = updateConstraint(aSlvsConstr);
106 if (aSlvsConstr.h == SLVS_C_UNKNOWN) {
107 aConstraint->changeConstraint() = getConstraint(aConstrID);
109 // check duplicated constraints based on different attributes
110 if (myDuplicatedConstraint && findSameConstraint(aConstraint) && !hasDupConstraints)
111 myDuplicatedConstraint = false;
117 bool SolveSpaceSolver_Storage::update(EntityWrapperPtr theEntity)
119 bool isUpdated = false;
120 std::shared_ptr<SolveSpaceSolver_EntityWrapper> anEntity =
121 std::dynamic_pointer_cast<SolveSpaceSolver_EntityWrapper>(theEntity);
122 Slvs_Entity aSlvsEnt = getEntity((Slvs_hEntity)anEntity->id());
123 if (aSlvsEnt.h == SLVS_E_UNKNOWN)
124 aSlvsEnt = anEntity->entity();
126 std::list<ParameterWrapperPtr> aParams = theEntity->parameters();
127 std::list<ParameterWrapperPtr>::iterator aPIt;
128 // if the entity is an attribute, need to update its coordinates
129 if (anEntity->baseAttribute()) {
130 BuilderPtr aBuilder = SolveSpaceSolver_Builder::getInstance();
131 EntityWrapperPtr anUpdAttr = aBuilder->createAttribute(anEntity->baseAttribute(), GID_UNKNOWN);
133 std::list<ParameterWrapperPtr> anUpdParams = anUpdAttr->parameters();
134 std::list<ParameterWrapperPtr>::iterator anUpdIt = anUpdParams.begin();
135 for (aPIt = aParams.begin(); aPIt != aParams.end() && anUpdIt != anUpdParams.end();
137 (*aPIt)->update(*anUpdIt);
144 for (aPIt = aParams.begin(); aPIt != aParams.end(); ++aPIt, ++anInd) {
146 isUpdated = update(*aPIt) || isUpdated;
147 if (aSlvsEnt.param[anInd] != (Slvs_hEntity)(*aPIt)->id()) {
149 aSlvsEnt.param[anInd] = (Slvs_hEntity)(*aPIt)->id();
153 // update sub-entities
154 std::list<EntityWrapperPtr> aSubEntities = theEntity->subEntities();
155 std::list<EntityWrapperPtr>::iterator aSIt = aSubEntities.begin();
156 for (anInd = 0; aSIt != aSubEntities.end(); ++aSIt, ++anInd) {
158 isUpdated = update(*aSIt) || isUpdated;
160 Slvs_hEntity anID = Slvs_hEntity((*aSIt)->id());
161 if ((*aSIt)->type() == ENTITY_NORMAL)
162 aSlvsEnt.normal = anID;
163 else if ((*aSIt)->type() == ENTITY_SCALAR)
164 aSlvsEnt.distance = anID;
165 else if (aSlvsEnt.point[anInd] != anID) {
166 aSlvsEnt.point[anInd] = anID;
167 if ((*aSIt)->baseAttribute())
168 SketchSolver_Storage::addEntity((*aSIt)->baseAttribute(), *aSIt);
172 if (theEntity->type() == ENTITY_POINT && aSubEntities.size() == 1) {
173 // theEntity is based on SketchPlugin_Point => need to substitute its attribute instead
174 bool isNew = (aSlvsEnt.h == SLVS_E_UNKNOWN);
175 aSlvsEnt = getEntity(aSlvsEnt.point[0]);
177 anEntity->changeEntity() = aSlvsEnt;
182 // update entity itself
183 if (aSlvsEnt.wrkpl == SLVS_E_UNKNOWN && myWorkplaneID != SLVS_E_UNKNOWN)
184 aSlvsEnt.wrkpl = myWorkplaneID;
185 if (aSlvsEnt.group == SLVS_G_UNKNOWN)
186 aSlvsEnt.group = (Slvs_hGroup)myGroupID;
187 Slvs_hEntity anEntID = updateEntity(aSlvsEnt);
188 if (aSlvsEnt.h == SLVS_E_UNKNOWN || isUpdated) {
189 anEntity->changeEntity() = getEntity(anEntID);
192 if (anEntity->type() == ENTITY_SKETCH)
193 storeWorkplane(anEntity);
199 bool SolveSpaceSolver_Storage::update(ParameterWrapperPtr theParameter)
201 std::shared_ptr<SolveSpaceSolver_ParameterWrapper> aParameter =
202 std::dynamic_pointer_cast<SolveSpaceSolver_ParameterWrapper>(theParameter);
203 const Slvs_Param& aParam = getParameter((Slvs_hParam)aParameter->id());
204 if (aParam.h != SLVS_E_UNKNOWN && fabs(aParam.val - aParameter->value()) < tolerance)
206 Slvs_Param aParamToUpd = aParameter->parameter();
207 if (aParamToUpd.group == SLVS_G_UNKNOWN)
208 aParamToUpd.group = aParameter->isParametric() ? (Slvs_hGroup)GID_OUTOFGROUP : (Slvs_hGroup)myGroupID;
209 Slvs_hParam anID = updateParameter(aParamToUpd);
210 if (aParam.h == SLVS_E_UNKNOWN) // new parameter
211 aParameter->changeParameter() = getParameter(anID);
215 void SolveSpaceSolver_Storage::storeWorkplane(EntityWrapperPtr theSketch)
217 myWorkplaneID = (Slvs_hEntity)theSketch->id();
219 // Update sub-entities of the sketch
220 std::list<EntityWrapperPtr> aSubEntities = theSketch->subEntities();
221 std::list<EntityWrapperPtr>::iterator aSIt = aSubEntities.begin();
222 for (; aSIt != aSubEntities.end(); ++aSIt) {
223 std::shared_ptr<SolveSpaceSolver_EntityWrapper> aSub =
224 std::dynamic_pointer_cast<SolveSpaceSolver_EntityWrapper>(*aSIt);
225 aSub->changeEntity().wrkpl = myWorkplaneID;
228 // Update all stored entities
229 std::vector<Slvs_Entity>::iterator anIt = myEntities.begin();
230 for (; anIt != myEntities.end(); ++anIt)
231 anIt->wrkpl = myWorkplaneID;
234 void SolveSpaceSolver_Storage::changeGroup(EntityWrapperPtr theEntity, const GroupID& theGroup)
236 std::list<ParameterWrapperPtr> aParams = theEntity->parameters();
237 std::list<ParameterWrapperPtr>::iterator aPIt = aParams.begin();
238 for (; aPIt != aParams.end(); ++aPIt)
239 changeGroup(*aPIt, theGroup);
241 std::list<EntityWrapperPtr> aSubs = theEntity->subEntities();
242 std::list<EntityWrapperPtr>::iterator aSIt = aSubs.begin();
243 for (; aSIt != aSubs.end(); ++aSIt)
244 changeGroup(*aSIt, theGroup);
246 if (theEntity->group() != theGroup) {
247 theEntity->setGroup(theGroup);
248 int aPos = Search((Slvs_hEntity)theEntity->id(), myEntities);
249 if (aPos >= 0 && aPos < (int)myEntities.size()) {
250 myEntities[aPos].group = (Slvs_hGroup)theGroup;
251 setNeedToResolve(true);
256 void SolveSpaceSolver_Storage::changeGroup(ParameterWrapperPtr theParam, const GroupID& theGroup)
258 GroupID aGroup = theGroup;
259 if (theParam->isParametric())
260 aGroup = GID_OUTOFGROUP;
261 if (theParam->group() == aGroup)
264 theParam->setGroup(aGroup);
265 int aPos = Search((Slvs_hParam)theParam->id(), myParameters);
266 if (aPos >= 0 && aPos < (int)myParameters.size()) {
267 myParameters[aPos].group = (Slvs_hGroup)aGroup;
268 setNeedToResolve(true);
272 void SolveSpaceSolver_Storage::addCoincidentPoints(
273 EntityWrapperPtr theMaster, EntityWrapperPtr theSlave)
275 if (theMaster->type() != ENTITY_POINT || theSlave->type() != ENTITY_POINT)
277 if (!theMaster->subEntities().empty() || !theSlave->subEntities().empty()) {
278 EntityWrapperPtr aSubMaster = theMaster->subEntities().empty() ?
279 theMaster : theMaster->subEntities().front();
280 EntityWrapperPtr aSubSlave = theSlave->subEntities().empty() ?
281 theSlave : theSlave->subEntities().front();
282 return addCoincidentPoints(aSubMaster, aSubSlave);
285 // Search available coincidence
286 CoincidentPointsMap::iterator aMasterFound = myCoincidentPoints.find(theMaster);
287 CoincidentPointsMap::iterator aSlaveFound = myCoincidentPoints.find(theSlave);
288 if (aMasterFound == myCoincidentPoints.end() || aSlaveFound == myCoincidentPoints.end()) {
289 // try to find master and slave points in the lists of slaves of already existent coincidences
290 CoincidentPointsMap::iterator anIt = myCoincidentPoints.begin();
291 for (; anIt != myCoincidentPoints.end(); ++anIt) {
292 if (anIt->second.find(theMaster) != anIt->second.end())
294 else if (anIt->second.find(theSlave) != anIt->second.end())
297 if (aMasterFound != myCoincidentPoints.end() && aSlaveFound != myCoincidentPoints.end())
302 if (aMasterFound == myCoincidentPoints.end()) {
304 myCoincidentPoints[theMaster] = std::set<EntityWrapperPtr>();
305 aMasterFound = myCoincidentPoints.find(theMaster);
306 } else if (aMasterFound == aSlaveFound)
307 return; // already coincident
309 if (aSlaveFound != myCoincidentPoints.end()) {
310 // A slave has been found, we need to attach all points coincident with it to the new master
311 std::set<EntityWrapperPtr> aNewSlaves = aSlaveFound->second;
312 aNewSlaves.insert(aSlaveFound->first);
313 myCoincidentPoints.erase(aSlaveFound);
315 std::set<EntityWrapperPtr>::const_iterator aSlIt = aNewSlaves.begin();
316 for (; aSlIt != aNewSlaves.end(); ++aSlIt)
317 addCoincidentPoints(theMaster, *aSlIt);
319 // Update the slave if it was used in constraints and features
320 replaceInFeatures(theSlave, theMaster);
321 replaceInConstraints(theSlave, theMaster);
323 // Remove slave entity (if the IDs are equal no need to remove slave entity, just update it)
324 if (theMaster->id() != theSlave->id())
325 removeEntity((Slvs_hEntity)theSlave->id());
327 std::shared_ptr<SolveSpaceSolver_EntityWrapper> aPointMaster =
328 std::dynamic_pointer_cast<SolveSpaceSolver_EntityWrapper>(theMaster);
329 std::shared_ptr<SolveSpaceSolver_EntityWrapper> aPointSlave =
330 std::dynamic_pointer_cast<SolveSpaceSolver_EntityWrapper>(theSlave);
331 aPointSlave->changeEntity() = aPointMaster->entity();
332 aPointSlave->setParameters(aPointMaster->parameters());
334 aMasterFound->second.insert(theSlave);
338 void SolveSpaceSolver_Storage::replaceInFeatures(
339 EntityWrapperPtr theSource, EntityWrapperPtr theDest)
341 std::map<FeaturePtr, EntityWrapperPtr>::const_iterator anIt = myFeatureMap.begin();
342 for (; anIt != myFeatureMap.end(); ++anIt) {
345 bool isUpdated = false;
346 std::list<EntityWrapperPtr> aSubs = anIt->second->subEntities();
347 std::list<EntityWrapperPtr>::iterator aSubIt = aSubs.begin();
348 for (; aSubIt != aSubs.end(); ++aSubIt)
349 if ((*aSubIt)->id() == theSource->id()) {
350 (*aSubIt)->update(theDest);
357 std::shared_ptr<SolveSpaceSolver_EntityWrapper> aWrapper =
358 std::dynamic_pointer_cast<SolveSpaceSolver_EntityWrapper>(anIt->second);
359 // update SolveSpace entity
360 Slvs_Entity anEnt = aWrapper->entity();
361 for (int i = 0; i < 4; ++i)
362 if (anEnt.point[i] == (Slvs_hEntity)theSource->id())
363 anEnt.point[i] = (Slvs_hEntity)theDest->id();
364 anEnt.h = updateEntity(anEnt);
365 aWrapper->changeEntity() = anEnt;
367 // update sub-entities
368 aWrapper->setSubEntities(aSubs);
372 void SolveSpaceSolver_Storage::replaceInConstraints(
373 EntityWrapperPtr theSource, EntityWrapperPtr theDest)
375 std::map<ConstraintPtr, std::list<ConstraintWrapperPtr> >::const_iterator
376 anIt = myConstraintMap.begin();
377 std::list<ConstraintWrapperPtr>::const_iterator aCIt;
378 for (; anIt != myConstraintMap.end(); ++anIt)
379 for (aCIt = anIt->second.begin(); aCIt != anIt->second.end(); ++aCIt) {
380 // Do not process coincidence between points and "multi" constraints
381 // (these constraints are stored to keep the structure of constraints).
382 if ((*aCIt)->type() == CONSTRAINT_PT_PT_COINCIDENT ||
383 (*aCIt)->type() == CONSTRAINT_MULTI_ROTATION ||
384 (*aCIt)->type() == CONSTRAINT_MULTI_TRANSLATION)
387 bool isUpdated = false;
388 std::list<EntityWrapperPtr> aSubs = (*aCIt)->entities();
389 std::list<EntityWrapperPtr>::iterator aSubIt = aSubs.begin();
390 for (; aSubIt != aSubs.end(); ++aSubIt)
391 if ((*aSubIt)->id() == theSource->id()) {
392 (*aSubIt)->update(theDest);
399 std::shared_ptr<SolveSpaceSolver_ConstraintWrapper> aWrapper =
400 std::dynamic_pointer_cast<SolveSpaceSolver_ConstraintWrapper>(*aCIt);
401 if (theSource->id() == theDest->id()) {
402 // No need to update SolveSpace constraint if the entities are the same
403 aWrapper->changeConstraint() = getConstraint((Slvs_hConstraint)aWrapper->id());
404 aWrapper->setEntities(aSubs);
408 // change constraint entities
409 Slvs_Constraint aConstr = aWrapper->constraint();
410 if (aConstr.ptA == (Slvs_hEntity)theSource->id())
411 aConstr.ptA = (Slvs_hEntity)theDest->id();
412 if (aConstr.ptB == (Slvs_hEntity)theSource->id())
413 aConstr.ptB = (Slvs_hEntity)theDest->id();
415 // check the constraint is duplicated
416 std::vector<Slvs_Constraint>::const_iterator aSlvsCIt = myConstraints.begin();
417 for (; aSlvsCIt != myConstraints.end(); ++aSlvsCIt)
418 if (aConstr.h != aSlvsCIt->h &&
419 aConstr.type == aSlvsCIt->type &&
420 aConstr.ptA == aSlvsCIt->ptA && aConstr.ptB == aSlvsCIt->ptB &&
421 aConstr.entityA == aSlvsCIt->entityA && aConstr.entityB == aSlvsCIt->entityB &&
422 aConstr.entityC == aSlvsCIt->entityC && aConstr.entityD == aSlvsCIt->entityD) {
423 Slvs_hConstraint anIDToRemove = aConstr.h;
425 int aShift = aSlvsCIt - myConstraints.begin();
426 removeConstraint(anIDToRemove);
427 aSlvsCIt = myConstraints.begin() + aShift - 1;
428 for (; aSlvsCIt != myConstraints.end(); ++aSlvsCIt)
429 if (aSlvsCIt->h == aConstr.h)
434 if (aSlvsCIt != myConstraints.end()) {
435 // constraint is duplicated, search its wrapper to add the mapping
436 std::map<ConstraintPtr, std::list<ConstraintWrapperPtr> >::const_iterator
437 anIt2 = myConstraintMap.begin();
438 std::list<ConstraintWrapperPtr>::const_iterator aCIt2;
439 for (; anIt2 != myConstraintMap.end(); ++anIt2)
440 for (aCIt2 = anIt2->second.begin(); aCIt2 != anIt2->second.end(); ++aCIt2)
441 if ((Slvs_hConstraint)(*aCIt2)->id() == aConstr.h) {
442 addSameConstraints(*aCIt2, aWrapper);
446 aConstr.h = updateConstraint(aConstr);
447 aWrapper->changeConstraint() = aConstr;
449 // update sub-entities
450 aWrapper->setEntities(aSubs);
454 void SolveSpaceSolver_Storage::addSameConstraints(ConstraintWrapperPtr theConstraint1,
455 ConstraintWrapperPtr theConstraint2)
457 SameConstraintMap::iterator anIt = myEqualConstraints.begin();
458 for (; anIt != myEqualConstraints.end(); ++anIt) {
459 if (anIt->find(theConstraint1) != anIt->end()) {
460 anIt->insert(theConstraint2);
463 else if (anIt->find(theConstraint2) != anIt->end()) {
464 anIt->insert(theConstraint1);
468 // group not found => create new one
469 std::set<ConstraintWrapperPtr> aNewGroup;
470 aNewGroup.insert(theConstraint1);
471 aNewGroup.insert(theConstraint2);
472 myEqualConstraints.push_back(aNewGroup);
475 bool SolveSpaceSolver_Storage::findSameConstraint(ConstraintWrapperPtr theConstraint)
477 if (theConstraint->type() == CONSTRAINT_PT_PT_COINCIDENT ||
478 theConstraint->type() == CONSTRAINT_MULTI_ROTATION ||
479 theConstraint->type() == CONSTRAINT_MULTI_TRANSLATION)
482 const Slvs_Constraint& aCBase =
483 std::dynamic_pointer_cast<SolveSpaceSolver_ConstraintWrapper>(theConstraint)->constraint();
485 std::map<ConstraintPtr, std::list<ConstraintWrapperPtr> >::const_iterator
486 aCIt = myConstraintMap.begin();
487 std::list<ConstraintWrapperPtr>::const_iterator aCWIt;
488 for (; aCIt != myConstraintMap.end(); ++aCIt)
489 for (aCWIt = aCIt->second.begin(); aCWIt != aCIt->second.end(); ++aCWIt) {
490 if ((*aCWIt)->type() == CONSTRAINT_PT_PT_COINCIDENT ||
491 (*aCWIt)->type() == CONSTRAINT_MULTI_ROTATION ||
492 (*aCWIt)->type() == CONSTRAINT_MULTI_TRANSLATION)
494 if ((*aCWIt)->type() == theConstraint->type()) {
495 const Slvs_Constraint& aCComp = getConstraint((Slvs_hConstraint)(*aCWIt)->id());
497 if (aCBase.ptA == aCComp.ptA && aCBase.ptB == aCComp.ptB &&
498 aCBase.entityA == aCComp.entityA && aCBase.entityB == aCComp.entityB &&
499 aCBase.entityC == aCComp.entityC && aCBase.entityD == aCComp.entityD &&
500 fabs(aCBase.valA -aCComp.valA) < tolerance) {
501 addSameConstraints(*aCWIt, theConstraint);
510 EntityWrapperPtr SolveSpaceSolver_Storage::calculateMiddlePoint(
511 EntityWrapperPtr theBase, double theCoeff)
513 BuilderPtr aBuilder = SolveSpaceSolver_Builder::getInstance();
515 std::shared_ptr<GeomAPI_XY> aMidPoint;
516 if (theBase->type() == ENTITY_LINE) {
517 std::shared_ptr<GeomAPI_Pnt2d> aPoints[2];
518 const std::list<EntityWrapperPtr>& aSubs = theBase->subEntities();
519 std::list<EntityWrapperPtr>::const_iterator anIt = aSubs.begin();
520 for (int i = 0; i < 2; ++i, ++anIt)
521 aPoints[i] = aBuilder->point(*anIt);
522 aMidPoint = aPoints[0]->xy()->multiplied(1.0 - theCoeff)->added(
523 aPoints[1]->xy()->multiplied(theCoeff));
525 else if (theBase->type() == ENTITY_ARC) {
527 double anArcPoint[3][2];
528 const std::list<EntityWrapperPtr>& aSubs = theBase->subEntities();
529 std::list<EntityWrapperPtr>::const_iterator anIt = aSubs.begin();
530 for (int i = 0; i < 3; ++i, ++anIt) {
531 std::shared_ptr<GeomAPI_Pnt2d> aPoint = aBuilder->point(*anIt);
532 anArcPoint[i][0] = aPoint->x();
533 anArcPoint[i][1] = aPoint->y();
535 // project last point of arc on the arc
536 double x = anArcPoint[1][0] - anArcPoint[0][0];
537 double y = anArcPoint[1][1] - anArcPoint[0][1];
538 double aRad = sqrt(x*x + y*y);
539 x = anArcPoint[2][0] - anArcPoint[0][0];
540 y = anArcPoint[2][1] - anArcPoint[0][1];
541 double aNorm = sqrt(x*x + y*y);
542 if (aNorm >= tolerance) {
543 anArcPoint[2][0] = x * aRad / aNorm;
544 anArcPoint[2][1] = y * aRad / aNorm;
546 anArcPoint[1][0] -= anArcPoint[0][0];
547 anArcPoint[1][1] -= anArcPoint[0][1];
548 if (theCoeff < tolerance) {
549 theX = anArcPoint[0][0] + anArcPoint[1][0];
550 theY = anArcPoint[0][1] + anArcPoint[1][1];
551 } else if (1 - theCoeff < tolerance) {
552 theX = anArcPoint[0][0] + anArcPoint[2][0];
553 theY = anArcPoint[0][1] + anArcPoint[2][1];
555 std::shared_ptr<GeomAPI_Dir2d> aStartDir(new GeomAPI_Dir2d(anArcPoint[1][0], anArcPoint[1][1]));
556 std::shared_ptr<GeomAPI_Dir2d> aEndDir(new GeomAPI_Dir2d(anArcPoint[2][0], anArcPoint[2][1]));
557 double anAngle = aStartDir->angle(aEndDir);
561 double aCos = cos(anAngle);
562 double aSin = sin(anAngle);
563 theX = anArcPoint[0][0] + anArcPoint[1][0] * aCos - anArcPoint[1][1] * aSin;
564 theY = anArcPoint[0][1] + anArcPoint[1][0] * aSin + anArcPoint[1][1] * aCos;
566 aMidPoint = std::shared_ptr<GeomAPI_XY>(new GeomAPI_XY(theX, theY));
570 return EntityWrapperPtr();
572 std::list<ParameterWrapperPtr> aParameters;
573 Slvs_Param aParam1 = Slvs_MakeParam(SLVS_E_UNKNOWN, (Slvs_hGroup)myGroupID, aMidPoint->x());
574 aParam1.h = addParameter(aParam1);
575 aParameters.push_back(ParameterWrapperPtr(new SolveSpaceSolver_ParameterWrapper(aParam1)));
576 Slvs_Param aParam2 = Slvs_MakeParam(SLVS_E_UNKNOWN, (Slvs_hGroup)myGroupID, aMidPoint->y());
577 aParam2.h = addParameter(aParam2);
578 aParameters.push_back(ParameterWrapperPtr(new SolveSpaceSolver_ParameterWrapper(aParam2)));
579 // Create entity (parameters are not filled)
580 Slvs_Entity anEntity = Slvs_MakePoint2d(SLVS_E_UNKNOWN, (Slvs_hGroup)myGroupID,
581 (Slvs_hEntity)myWorkplaneID, aParam1.h, aParam2.h);
582 anEntity.h = addEntity(anEntity);
584 EntityWrapperPtr aResult(new SolveSpaceSolver_EntityWrapper(AttributePtr(), anEntity));
585 aResult->setParameters(aParameters);
594 Slvs_hParam SolveSpaceSolver_Storage::addParameter(const Slvs_Param& theParam)
596 if (theParam.h > 0 && theParam.h <= myParamMaxID) {
597 // parameter is already used, rewrite it
598 return updateParameter(theParam);
601 Slvs_Param aParam = theParam;
602 if (aParam.h > myParamMaxID)
603 myParamMaxID = aParam.h;
605 aParam.h = ++myParamMaxID;
606 myParameters.push_back(aParam);
607 myNeedToResolve = true;
611 Slvs_hParam SolveSpaceSolver_Storage::updateParameter(const Slvs_Param& theParam)
613 if (theParam.h > 0 && theParam.h <= myParamMaxID) {
614 // parameter already used, rewrite it
615 int aPos = Search(theParam.h, myParameters);
616 if (aPos >= 0 && aPos < (int)myParameters.size()) {
617 if (IsNotEqual(myParameters[aPos], theParam))
618 setNeedToResolve(true);
619 myParameters[aPos] = theParam;
624 // Parameter is not found, add new one
625 Slvs_Param aParam = theParam;
627 return addParameter(aParam);
630 bool SolveSpaceSolver_Storage::removeParameter(const Slvs_hParam& theParamID)
632 int aPos = Search(theParamID, myParameters);
633 if (aPos >= 0 && aPos < (int)myParameters.size()) {
634 // Firstly, search the parameter is not used elsewhere
635 std::vector<Slvs_Entity>::const_iterator anEntIter = myEntities.begin();
636 for (; anEntIter != myEntities.end(); anEntIter++) {
637 for (int i = 0; i < 4; i++)
638 if (anEntIter->param[i] == theParamID)
642 myParameters.erase(myParameters.begin() + aPos);
643 myParamMaxID = myParameters.empty() ? SLVS_E_UNKNOWN : myParameters.back().h;
644 myNeedToResolve = true;
649 const Slvs_Param& SolveSpaceSolver_Storage::getParameter(const Slvs_hParam& theParamID) const
651 int aPos = Search(theParamID, myParameters);
652 if (aPos >= 0 && aPos < (int)myParameters.size())
653 return myParameters[aPos];
655 // Parameter is not found, return empty object
656 static Slvs_Param aDummy;
662 Slvs_hEntity SolveSpaceSolver_Storage::addEntity(const Slvs_Entity& theEntity)
664 if (theEntity.h > 0 && theEntity.h <= myEntityMaxID) {
665 // Entity is already used, rewrite it
666 return updateEntity(theEntity);
669 Slvs_Entity aEntity = theEntity;
670 if (aEntity.h > myEntityMaxID)
671 myEntityMaxID = aEntity.h;
673 aEntity.h = ++myEntityMaxID;
674 myEntities.push_back(aEntity);
675 myNeedToResolve = true;
679 Slvs_hEntity SolveSpaceSolver_Storage::updateEntity(const Slvs_Entity& theEntity)
681 if (theEntity.h > 0 && theEntity.h <= myEntityMaxID) {
682 // Entity already used, rewrite it
683 int aPos = Search(theEntity.h, myEntities);
684 if (aPos >= 0 && aPos < (int)myEntities.size()) {
685 myNeedToResolve = myNeedToResolve || IsNotEqual(myEntities[aPos], theEntity);
686 myEntities[aPos] = theEntity;
691 // Entity is not found, add new one
692 Slvs_Entity aEntity = theEntity;
694 return addEntity(aEntity);
697 bool SolveSpaceSolver_Storage::removeEntity(const Slvs_hEntity& theEntityID)
700 int aPos = Search(theEntityID, myEntities);
701 if (aPos >= 0 && aPos < (int)myEntities.size()) {
702 // Firstly, check the entity and its attributes is not used elsewhere
703 std::set<Slvs_hEntity> anEntAndSubs;
704 anEntAndSubs.insert(theEntityID);
705 for (int i = 0; i < 4; i++)
706 if (myEntities[aPos].point[i] != SLVS_E_UNKNOWN)
707 anEntAndSubs.insert(myEntities[aPos].point[i]);
709 std::vector<Slvs_Entity>::const_iterator anEntIter = myEntities.begin();
710 for (; anEntIter != myEntities.end(); anEntIter++) {
711 if (anEntAndSubs.find(anEntIter->h) != anEntAndSubs.end())
713 for (int i = 0; i < 4; i++)
714 if (anEntAndSubs.find(anEntIter->point[i]) != anEntAndSubs.end())
716 if (anEntAndSubs.find(anEntIter->distance) != anEntAndSubs.end())
719 std::vector<Slvs_Constraint>::const_iterator aConstrIter = myConstraints.begin();
720 for (; aConstrIter != myConstraints.end(); aConstrIter++) {
721 Slvs_hEntity anEntIDs[6] = {aConstrIter->ptA, aConstrIter->ptB,
722 aConstrIter->entityA, aConstrIter->entityB,
723 aConstrIter->entityC, aConstrIter->entityD};
724 for (int i = 0; i < 6; i++)
725 if (anEntAndSubs.find(anEntIDs[i]) != anEntAndSubs.end())
728 // The entity is not used, remove it and its parameters
729 Slvs_Entity anEntity = myEntities[aPos];
730 myEntities.erase(myEntities.begin() + aPos);
731 myEntityMaxID = myEntities.empty() ? SLVS_E_UNKNOWN : myEntities.back().h;
732 if (anEntity.distance != SLVS_E_UNKNOWN)
733 aResult = aResult && removeParameter(anEntity.distance);
734 for (int i = 0; i < 4; i++)
735 if (anEntity.param[i] != SLVS_E_UNKNOWN)
736 aResult = removeParameter(anEntity.param[i]) && aResult;
737 myNeedToResolve = true;
742 const Slvs_Entity& SolveSpaceSolver_Storage::getEntity(const Slvs_hEntity& theEntityID) const
744 int aPos = Search(theEntityID, myEntities);
745 if (aPos >= 0 && aPos < (int)myEntities.size())
746 return myEntities[aPos];
748 // Entity is not found, return empty object
749 static Slvs_Entity aDummy;
750 aDummy.h = SLVS_E_UNKNOWN;
755 Slvs_hConstraint SolveSpaceSolver_Storage::addConstraint(const Slvs_Constraint& theConstraint)
757 if (theConstraint.h > 0 && theConstraint.h <= myConstrMaxID) {
758 // Constraint is already used, rewrite it
759 return updateConstraint(theConstraint);
762 Slvs_Constraint aConstraint = theConstraint;
764 // Find a constraint with same type uses same arguments to show user overconstraint situation
765 std::vector<Slvs_Constraint>::iterator aCIt = myConstraints.begin();
766 for (; aCIt != myConstraints.end(); aCIt++) {
767 if (aConstraint.type != aCIt->type)
769 if (aConstraint.ptA == aCIt->ptA && aConstraint.ptB == aCIt->ptB &&
770 aConstraint.entityA == aCIt->entityA && aConstraint.entityB == aCIt->entityB &&
771 aConstraint.entityC == aCIt->entityC && aConstraint.entityD == aCIt->entityD) {
772 myDuplicatedConstraint = true;
777 if (aConstraint.h > myConstrMaxID)
778 myConstrMaxID = aConstraint.h;
780 aConstraint.h = ++myConstrMaxID;
781 myConstraints.push_back(aConstraint);
782 myNeedToResolve = true;
783 return aConstraint.h;
786 Slvs_hConstraint SolveSpaceSolver_Storage::updateConstraint(const Slvs_Constraint& theConstraint)
788 if (theConstraint.h > 0 && theConstraint.h <= myConstrMaxID) {
789 // Constraint already used, rewrite it
790 int aPos = Search(theConstraint.h, myConstraints);
791 if (aPos >= 0 && aPos < (int)myConstraints.size()) {
792 myNeedToResolve = myNeedToResolve || IsNotEqual(myConstraints[aPos], theConstraint);
793 myConstraints[aPos] = theConstraint;
794 return theConstraint.h;
798 // Constraint is not found, add new one
799 Slvs_Constraint aConstraint = theConstraint;
801 return addConstraint(aConstraint);
804 bool SolveSpaceSolver_Storage::removeConstraint(const Slvs_hConstraint& theConstraintID)
806 int aPos = Search(theConstraintID, myConstraints);
807 if (aPos >= 0 && aPos < (int)myConstraints.size()) {
808 Slvs_Constraint aConstraint = myConstraints[aPos];
809 myConstraints.erase(myConstraints.begin() + aPos);
810 myConstrMaxID = myConstraints.empty() ? SLVS_E_UNKNOWN : myConstraints.back().h;
811 myNeedToResolve = true;
816 const Slvs_Constraint& SolveSpaceSolver_Storage::getConstraint(const Slvs_hConstraint& theConstraintID) const
818 int aPos = Search(theConstraintID, myConstraints);
819 if (aPos >= 0 && aPos < (int)myConstraints.size())
820 return myConstraints[aPos];
822 // Constraint is not found, return empty object
823 static Slvs_Constraint aDummy;
829 void SolveSpaceSolver_Storage::initializeSolver(SolverPtr theSolver)
831 std::shared_ptr<SolveSpaceSolver_Solver> aSolver =
832 std::dynamic_pointer_cast<SolveSpaceSolver_Solver>(theSolver);
839 if (myConstraints.empty()) {
840 // Adjust all arc to place their points correctly
841 std::vector<Slvs_Entity>::const_iterator anEntIt = myEntities.begin();
842 for (; anEntIt != myEntities.end(); ++anEntIt)
843 if (anEntIt->type == SLVS_E_ARC_OF_CIRCLE)
847 aSolver->setParameters(myParameters.data(), (int)myParameters.size());
848 aSolver->setEntities(myEntities.data(), (int)myEntities.size());
849 aSolver->setConstraints(myConstraints.data(), (int)myConstraints.size());
853 bool SolveSpaceSolver_Storage::removeCoincidence(ConstraintWrapperPtr theConstraint)
855 std::list<EntityWrapperPtr> aPoints = theConstraint->entities();
856 std::list<EntityWrapperPtr>::const_iterator aPIt;
858 CoincidentPointsMap::iterator aPtPtIt = myCoincidentPoints.begin();
859 for (; aPtPtIt != myCoincidentPoints.end(); ++aPtPtIt) {
860 for (aPIt = aPoints.begin(); aPIt != aPoints.end(); ++aPIt)
861 if (aPtPtIt->first == *aPIt ||
862 aPtPtIt->second.find(*aPIt) != aPtPtIt->second.end())
864 if (aPIt != aPoints.end())
868 if (aPtPtIt == myCoincidentPoints.end())
869 return true; // already removed
871 // Create new copies of coincident points
872 BuilderPtr aBuilder = SolveSpaceSolver_Builder::getInstance();
873 std::list<EntityWrapperPtr> aNewPoints;
874 for (aPIt = aPoints.begin(); aPIt != aPoints.end(); ++aPIt)
875 aNewPoints.push_back(aBuilder->createAttribute(
876 (*aPIt)->baseAttribute(), myGroupID, myWorkplaneID));
878 // Find all points fallen out of group of coincident points
879 std::map<EntityWrapperPtr, EntityWrapperPtr> aNotCoinc;
880 aNotCoinc[aPtPtIt->first] = EntityWrapperPtr();
881 std::set<EntityWrapperPtr>::const_iterator aTempIt = aPtPtIt->second.begin();
882 for (; aTempIt != aPtPtIt->second.end(); ++aTempIt)
883 aNotCoinc[*aTempIt] = EntityWrapperPtr();
884 std::map<ConstraintPtr, std::list<ConstraintWrapperPtr> >::iterator
885 aConstrIt = myConstraintMap.begin();
886 for (; aConstrIt != myConstraintMap.end(); ++aConstrIt)
887 if (aConstrIt->first->getKind() == SketchPlugin_ConstraintCoincidence::ID()) {
888 AttributeRefAttrPtr aRefAttrA = std::dynamic_pointer_cast<ModelAPI_AttributeRefAttr>(
889 aConstrIt->first->attribute(SketchPlugin_Constraint::ENTITY_A()));
890 AttributeRefAttrPtr aRefAttrB = std::dynamic_pointer_cast<ModelAPI_AttributeRefAttr>(
891 aConstrIt->first->attribute(SketchPlugin_Constraint::ENTITY_B()));
892 if (!aRefAttrA || !aRefAttrB || aRefAttrA->isObject() || aRefAttrB->isObject())
894 std::map<AttributePtr, EntityWrapperPtr>::iterator
895 aFound = myAttributeMap.find(aRefAttrA->attr());
896 if (aFound != myAttributeMap.end())
897 aNotCoinc.erase(aFound->second);
898 aFound = myAttributeMap.find(aRefAttrB->attr());
899 if (aFound != myAttributeMap.end())
900 aNotCoinc.erase(aFound->second);
902 if (aNotCoinc.empty())
904 std::list<EntityWrapperPtr>::const_iterator aNewPIt;
905 for (aPIt = aPoints.begin(), aNewPIt = aNewPoints.begin();
906 aPIt != aPoints.end(); ++aPIt, ++aNewPIt) {
907 if (aNotCoinc.find(*aPIt) != aNotCoinc.end())
908 aNotCoinc[*aPIt] = *aNewPIt;
911 // Find all features and constraints uses coincident points
912 std::map<EntityWrapperPtr, EntityWrapperPtr>::iterator aNotCIt;
913 std::set<EntityWrapperPtr> anUpdFeatures;
914 std::map<FeaturePtr, EntityWrapperPtr>::iterator aFIt = myFeatureMap.begin();
915 for (; aFIt != myFeatureMap.end(); ++aFIt) {
917 continue; // avoid not completed arcs
918 for (aNotCIt = aNotCoinc.begin(); aNotCIt != aNotCoinc.end(); ++aNotCIt) {
919 if (!aNotCIt->second || !aFIt->second->isUsed(aNotCIt->first->baseAttribute()))
921 std::list<EntityWrapperPtr> aSubs = aFIt->second->subEntities();
922 std::list<EntityWrapperPtr>::iterator aSIt = aSubs.begin();
924 for (; aSIt != aSubs.end(); ++aSIt)
925 if (*aSIt == aNotCIt->first) {
926 *aSIt = aNotCIt->second;
930 aFIt->second->setSubEntities(aSubs);
931 anUpdFeatures.insert(aFIt->second);
936 std::set<EntityWrapperPtr>::iterator anUpdIt = anUpdFeatures.begin();
937 for (; anUpdIt != anUpdFeatures.end(); ++anUpdIt)
938 update(EntityWrapperPtr(*anUpdIt));
940 // remove not coincident points
941 for (aNotCIt = aNotCoinc.begin(); aNotCIt != aNotCoinc.end(); ++aNotCIt) {
942 if (aPtPtIt->second.size() <= 1) {
943 myCoincidentPoints.erase(aPtPtIt);
946 if (aPtPtIt->first == aNotCIt->first) {
947 std::set<EntityWrapperPtr> aSlaves = aPtPtIt->second;
948 EntityWrapperPtr aNewMaster = *aSlaves.begin();
949 aSlaves.erase(aSlaves.begin());
950 myCoincidentPoints.erase(aPtPtIt);
951 myCoincidentPoints[aNewMaster] = aSlaves;
952 aPtPtIt = myCoincidentPoints.find(aNewMaster);
954 aPtPtIt->second.erase(aNotCIt->first);
959 bool SolveSpaceSolver_Storage::remove(ConstraintWrapperPtr theConstraint)
961 std::shared_ptr<SolveSpaceSolver_ConstraintWrapper> aConstraint =
962 std::dynamic_pointer_cast<SolveSpaceSolver_ConstraintWrapper>(theConstraint);
964 // verify whether the constraint has duplicated
965 bool hasSameID = false;
966 SameConstraintMap::iterator anEqIt = myEqualConstraints.begin();
967 for (; anEqIt != myEqualConstraints.end(); ++anEqIt) {
968 std::set<ConstraintWrapperPtr>::const_iterator aFound = anEqIt->find(aConstraint);
969 if (aFound != anEqIt->end()) {
970 // verify there is a constraint with same ID
971 std::set<ConstraintWrapperPtr>::const_iterator anIt = anEqIt->begin();
972 ConstraintID anID = (*aFound)->id();
973 for (++anIt; anIt != anEqIt->end() && !hasSameID; ++anIt)
974 if ((*anIt)->id() == anID && aFound != anIt)
977 anEqIt->erase(aConstraint);
981 if (anEqIt != myEqualConstraints.end() && hasSameID)
984 bool isFullyRemoved = removeConstraint((Slvs_hConstraint)aConstraint->id());
985 // remove point-point coincidence
986 if (aConstraint->type() == CONSTRAINT_PT_PT_COINCIDENT)
987 isFullyRemoved = removeCoincidence(theConstraint) && isFullyRemoved;
988 return SketchSolver_Storage::remove(theConstraint) && isFullyRemoved;
991 bool SolveSpaceSolver_Storage::remove(EntityWrapperPtr theEntity)
996 // Additional check for entity to be used in point-point coincidence
997 bool isCoincide = false;
998 if (theEntity->type() == ENTITY_POINT) {
999 CoincidentPointsMap::const_iterator anIt = myCoincidentPoints.begin();
1000 std::set<EntityWrapperPtr>::const_iterator aCIt;
1001 for (; anIt != myCoincidentPoints.end(); ++anIt) {
1002 if (anIt->first == theEntity)
1004 for (aCIt = anIt->second.begin(); aCIt != anIt->second.end(); ++aCIt)
1005 if (*aCIt == theEntity)
1007 if (aCIt != anIt->second.end())
1010 if (anIt != myCoincidentPoints.end()) {
1011 if (anIt->first != theEntity && isUsed(anIt->first->baseAttribute()))
1013 for (aCIt = anIt->second.begin(); !isCoincide && aCIt != anIt->second.end(); ++aCIt)
1014 if (*aCIt != theEntity && isUsed((*aCIt)->baseAttribute()))
1019 std::shared_ptr<SolveSpaceSolver_EntityWrapper> anEntity =
1020 std::dynamic_pointer_cast<SolveSpaceSolver_EntityWrapper>(theEntity);
1021 bool isFullyRemoved = isCoincide ? true : removeEntity((Slvs_hEntity)anEntity->id());
1022 return (SketchSolver_Storage::remove(theEntity) || isCoincide) && isFullyRemoved;
1025 bool SolveSpaceSolver_Storage::remove(ParameterWrapperPtr theParameter)
1027 return removeParameter((Slvs_hParam)theParameter->id());
1031 void SolveSpaceSolver_Storage::refresh(bool theFixedOnly) const
1033 //blockEvents(true);
1035 std::map<AttributePtr, EntityWrapperPtr>::const_iterator anIt = myAttributeMap.begin();
1036 std::list<ParameterWrapperPtr> aParams;
1037 std::list<ParameterWrapperPtr>::const_iterator aParIt;
1038 for (; anIt != myAttributeMap.end(); ++anIt) {
1041 // the external feature always should keep the up to date values, so,
1042 // refresh from the solver is never needed
1043 if (anIt->first.get()) {
1044 std::shared_ptr<SketchPlugin_Feature> aSketchFeature =
1045 std::dynamic_pointer_cast<SketchPlugin_Feature>(anIt->first->owner());
1046 if (aSketchFeature.get() && aSketchFeature->isExternal())
1048 // not need to refresh here sketch's origin and normal vector
1049 CompositeFeaturePtr aSketch =
1050 std::dynamic_pointer_cast<ModelAPI_CompositeFeature>(anIt->first->owner());
1055 // update parameter wrappers and obtain values of attributes
1056 aParams = anIt->second->parameters();
1058 bool isUpd[3] = {false};
1060 for (aParIt = aParams.begin(); i < 3 && aParIt != aParams.end(); ++aParIt, ++i) {
1061 std::shared_ptr<SolveSpaceSolver_ParameterWrapper> aWrapper =
1062 std::dynamic_pointer_cast<SolveSpaceSolver_ParameterWrapper>(*aParIt);
1063 if (!theFixedOnly || aWrapper->group() == GID_OUTOFGROUP || aWrapper->isParametric()) {
1064 aWrapper->changeParameter().val = getParameter((Slvs_hParam)aWrapper->id()).val;
1065 aCoords[i] = aWrapper->value();
1069 if (!isUpd[0] && !isUpd[1] && !isUpd[2])
1070 continue; // nothing is updated
1072 std::shared_ptr<GeomDataAPI_Point2D> aPoint2D =
1073 std::dynamic_pointer_cast<GeomDataAPI_Point2D>(anIt->first);
1075 if ((isUpd[0] && fabs(aPoint2D->x() - aCoords[0]) > tolerance) ||
1076 (isUpd[1] && fabs(aPoint2D->y() - aCoords[1]) > tolerance)) {
1077 if (!isUpd[0]) aCoords[0] = aPoint2D->x();
1078 if (!isUpd[1]) aCoords[1] = aPoint2D->y();
1079 aPoint2D->setValue(aCoords[0], aCoords[1]);
1080 // Find points coincident with this one (probably not in GID_OUTOFGROUP)
1081 std::map<AttributePtr, EntityWrapperPtr>::const_iterator aLocIt;
1083 aLocIt = myAttributeMap.begin();
1088 for (; aLocIt != myAttributeMap.end(); ++aLocIt) {
1089 if (!aLocIt->second)
1091 std::shared_ptr<SketchPlugin_Feature> aSketchFeature =
1092 std::dynamic_pointer_cast<SketchPlugin_Feature>(aLocIt->first->owner());
1093 if (aSketchFeature && aSketchFeature->isExternal())
1095 if (anIt->second->id() == aLocIt->second->id()) {
1096 aPoint2D = std::dynamic_pointer_cast<GeomDataAPI_Point2D>(aLocIt->first);
1097 aPoint2D->setValue(aCoords[0], aCoords[1]);
1103 AttributeDoublePtr aScalar = std::dynamic_pointer_cast<ModelAPI_AttributeDouble>(anIt->first);
1105 if (isUpd[0] && fabs(aScalar->value() - aCoords[0]) > tolerance)
1106 aScalar->setValue(aCoords[0]);
1109 std::shared_ptr<GeomDataAPI_Point> aPoint =
1110 std::dynamic_pointer_cast<GeomDataAPI_Point>(anIt->first);
1112 if ((isUpd[0] && fabs(aPoint->x() - aCoords[0]) > tolerance) ||
1113 (isUpd[1] && fabs(aPoint->y() - aCoords[1]) > tolerance) ||
1114 (isUpd[2] && fabs(aPoint->z() - aCoords[2]) > tolerance))
1115 if (!isUpd[0]) aCoords[0] = aPoint->x();
1116 if (!isUpd[1]) aCoords[1] = aPoint->y();
1117 if (!isUpd[2]) aCoords[2] = aPoint->z();
1118 aPoint->setValue(aCoords[0], aCoords[1], aCoords[2]);
1123 //blockEvents(false);
1126 void SolveSpaceSolver_Storage::verifyFixed()
1128 std::map<AttributePtr, EntityWrapperPtr>::iterator anAttrIt = myAttributeMap.begin();
1129 for (; anAttrIt != myAttributeMap.end(); ++anAttrIt) {
1130 if (!anAttrIt->second)
1132 const std::list<ParameterWrapperPtr>& aParameters = anAttrIt->second->parameters();
1133 std::list<ParameterWrapperPtr>::const_iterator aParIt = aParameters.begin();
1134 for (; aParIt != aParameters.end(); ++aParIt)
1135 if ((*aParIt)->group() == GID_OUTOFGROUP) {
1136 Slvs_Param aParam = getParameter((Slvs_hParam)(*aParIt)->id());
1137 if (aParam.group != (Slvs_hParam)GID_OUTOFGROUP) {
1138 aParam.group = (Slvs_hParam)GID_OUTOFGROUP;
1139 updateParameter(aParam);
1146 void SolveSpaceSolver_Storage::adjustArc(const Slvs_Entity& theArc)
1148 double anArcPoints[3][2];
1149 double aDist[3] = {0.0};
1150 bool isFixed[3] = {false};
1151 for (int i = 0; i < 3; ++i) {
1152 Slvs_Entity aPoint = getEntity(theArc.point[i]);
1153 isFixed[i] = (aPoint.group != (Slvs_hGroup)myGroupID);
1154 anArcPoints[i][0] = getParameter(aPoint.param[0]).val;
1155 anArcPoints[i][1] = getParameter(aPoint.param[1]).val;
1157 anArcPoints[i][0] -= anArcPoints[0][0];
1158 anArcPoints[i][1] -= anArcPoints[0][1];
1159 aDist[i] = sqrt(anArcPoints[i][0] * anArcPoints[i][0] +
1160 anArcPoints[i][1] * anArcPoints[i][1]);
1164 if (fabs(aDist[1] - aDist[2]) < tolerance)
1168 while (anInd > 0 && isFixed[anInd])
1171 return; // adjust only start or end point of the arc
1173 anArcPoints[anInd][0] /= aDist[anInd];
1174 anArcPoints[anInd][1] /= aDist[anInd];
1176 Slvs_Entity aPoint = getEntity(theArc.point[anInd]);
1177 for (int i = 0; i < 2; ++i) {
1178 Slvs_Param aParam = getParameter(aPoint.param[i]);
1179 aParam.val = anArcPoints[0][i] + aDist[3-anInd] * anArcPoints[anInd][i];
1180 updateParameter(aParam);
1190 // ========================================================
1191 // ========= Auxiliary functions ===============
1192 // ========================================================
1194 template<typename T>
1195 int Search(const uint32_t& theEntityID, const std::vector<T>& theEntities)
1197 int aResIndex = theEntityID <= theEntities.size() ? theEntityID - 1 : 0;
1198 int aVecSize = theEntities.size();
1199 if (theEntities.empty())
1201 while (aResIndex >= 0 && theEntities[aResIndex].h > theEntityID)
1203 while (aResIndex < aVecSize && aResIndex >= 0 && theEntities[aResIndex].h < theEntityID)
1205 if (aResIndex == -1 || (aResIndex < aVecSize && theEntities[aResIndex].h != theEntityID))
1206 aResIndex = aVecSize;
1210 bool IsNotEqual(const Slvs_Param& theParam1, const Slvs_Param& theParam2)
1212 return fabs(theParam1.val - theParam2.val) > tolerance;
1215 bool IsNotEqual(const Slvs_Entity& theEntity1, const Slvs_Entity& theEntity2)
1218 for (; theEntity1.param[i] != 0 && i < 4; i++)
1219 if (theEntity1.param[i] != theEntity2.param[i])
1222 for (; theEntity1.point[i] != 0 && i < 4; i++)
1223 if (theEntity1.point[i] != theEntity2.point[i])
1228 bool IsNotEqual(const Slvs_Constraint& theConstraint1, const Slvs_Constraint& theConstraint2)
1230 return theConstraint1.ptA != theConstraint2.ptA ||
1231 theConstraint1.ptB != theConstraint2.ptB ||
1232 theConstraint1.entityA != theConstraint2.entityA ||
1233 theConstraint1.entityB != theConstraint2.entityB ||
1234 theConstraint1.entityC != theConstraint2.entityC ||
1235 theConstraint1.entityD != theConstraint2.entityD ||
1236 fabs(theConstraint1.valA - theConstraint2.valA) > tolerance;