1 // Copyright (C) 2014-20xx CEA/DEN, EDF R&D
3 // File: PlaneGCSSolver_Storage.cpp
4 // Created: 14 Dec 2015
5 // Author: Artem ZHIDKOV
7 #include <PlaneGCSSolver_Storage.h>
8 #include <PlaneGCSSolver_Builder.h>
9 #include <PlaneGCSSolver_Solver.h>
10 #include <PlaneGCSSolver_ConstraintWrapper.h>
11 #include <PlaneGCSSolver_EntityWrapper.h>
12 #include <PlaneGCSSolver_PointWrapper.h>
13 #include <PlaneGCSSolver_ScalarWrapper.h>
14 #include <PlaneGCSSolver_ParameterWrapper.h>
16 #include <GeomAPI_Edge.h>
17 #include <GeomAPI_Dir2d.h>
18 #include <GeomAPI_Pnt2d.h>
19 #include <GeomAPI_XY.h>
20 #include <GeomDataAPI_Point2D.h>
21 #include <SketchPlugin_Arc.h>
26 PlaneGCSSolver_Storage::PlaneGCSSolver_Storage(const GroupID& theGroup)
27 : SketchSolver_Storage(theGroup),
28 myEntityLastID(EID_SKETCH),
29 myConstraintLastID(CID_UNKNOWN)
33 void PlaneGCSSolver_Storage::addConstraint(
34 ConstraintPtr theConstraint,
35 std::list<ConstraintWrapperPtr> theSolverConstraints)
37 SketchSolver_Storage::addConstraint(theConstraint, theSolverConstraints);
39 // update point-point coincidence
40 if (!theSolverConstraints.empty() &&
41 theSolverConstraints.front()->type() == CONSTRAINT_PT_PT_COINCIDENT) {
42 std::list<ConstraintWrapperPtr>::iterator aCIt = theSolverConstraints.begin();
43 for (; aCIt != theSolverConstraints.end(); ++aCIt)
49 bool PlaneGCSSolver_Storage::update(ConstraintWrapperPtr theConstraint)
51 bool isUpdated = false;
52 std::shared_ptr<PlaneGCSSolver_ConstraintWrapper> aConstraint =
53 std::dynamic_pointer_cast<PlaneGCSSolver_ConstraintWrapper>(theConstraint);
55 // point-Line distance should be positive
56 if (aConstraint->type() == CONSTRAINT_PT_LINE_DISTANCE && aConstraint->value() < 0.0)
57 aConstraint->setValue(-aConstraint->value());
59 // make value of constraint unchangeable
60 ParameterWrapperPtr aValue = aConstraint->valueParameter();
62 isUpdated = update(aValue) || isUpdated;
64 // update constrained entities
65 std::list<EntityWrapperPtr> anEntities = theConstraint->entities();
66 std::list<EntityWrapperPtr>::iterator anIt = anEntities.begin();
67 for (; anIt != anEntities.end(); ++anIt)
68 isUpdated = update(*anIt) || isUpdated;
70 if (aConstraint->id() == CID_UNKNOWN) {
71 const std::list<EntityWrapperPtr>& aSubs = aConstraint->entities();
72 // check middle-point constraint conflicts with point-on-line
73 if (aConstraint->type() == CONSTRAINT_MIDDLE_POINT) {
74 std::map<ConstraintPtr, std::list<ConstraintWrapperPtr> >::const_iterator
75 anIt = myConstraintMap.begin();
76 for (; anIt != myConstraintMap.end(); ++anIt) {
77 EntityWrapperPtr aPoint, aLine;
78 ConstraintWrapperPtr aCurrentConstr = anIt->second.front();
79 if (aCurrentConstr->type() != CONSTRAINT_PT_ON_LINE)
81 const std::list<EntityWrapperPtr>& aCurSubs = aCurrentConstr->entities();
82 std::list<EntityWrapperPtr>::const_iterator aSIt1, aSIt2;
83 for (aSIt1 = aSubs.begin(); aSIt1 != aSubs.end(); ++aSIt1) {
84 if ((*aSIt1)->type() == ENTITY_POINT)
86 else if((*aSIt1)->type() == ENTITY_LINE)
90 for (aSIt2 = aCurSubs.begin(); aSIt2 != aCurSubs.end(); ++aSIt2)
91 if ((*aSIt1)->id() == (*aSIt2)->id())
93 if (aSIt2 == aCurSubs.end())
96 // point-on-line found, change it to bisector
97 if (aSIt1 == aSubs.end()) {
98 std::list<GCSConstraintPtr> aConstrList = aConstraint->constraints();
99 aConstrList.pop_front();
100 aConstraint->setConstraints(aConstrList);
106 // Change ID of constraints
107 aConstraint->setId(++myConstraintLastID);
113 /// \brief Update coordinates of the point or scalar using its base attribute
114 static bool updateValues(EntityWrapperPtr& theEntity)
116 bool isUpdated = false;
117 AttributePtr anAttr = theEntity->baseAttribute();
118 const std::list<ParameterWrapperPtr> aParams = theEntity->parameters();
122 std::shared_ptr<GeomDataAPI_Point2D> aPoint2D =
123 std::dynamic_pointer_cast<GeomDataAPI_Point2D>(anAttr);
125 aCoord[0] = aPoint2D->x();
126 aCoord[1] = aPoint2D->y();
128 AttributeDoublePtr aScalar = std::dynamic_pointer_cast<ModelAPI_AttributeDouble>(anAttr);
130 aCoord[0] = aScalar->value();
133 std::list<ParameterWrapperPtr>::const_iterator anIt = aParams.begin();
134 for (int i = 0; anIt != aParams.end(); ++anIt, ++i)
135 if (fabs((*anIt)->value() - aCoord[i]) > tolerance) {
136 (*anIt)->setValue(aCoord[i]);
142 bool PlaneGCSSolver_Storage::update(EntityWrapperPtr theEntity)
144 if (theEntity->type() == ENTITY_SKETCH)
145 return true; // sketch is not necessary for PlaneGCS, so it is always says true
147 bool isUpdated = false;
149 if (theEntity->baseAttribute()) {
150 isUpdated = updateValues(theEntity);
152 setNeedToResolve(true);
156 std::list<ParameterWrapperPtr> aParams = theEntity->parameters();
157 std::list<ParameterWrapperPtr>::iterator aPIt = aParams.begin();
158 for (; aPIt != aParams.end(); ++aPIt)
159 isUpdated = update(*aPIt) || isUpdated;
161 // update sub-entities
162 std::list<EntityWrapperPtr> aSubEntities = theEntity->subEntities();
163 std::list<EntityWrapperPtr>::iterator aSIt = aSubEntities.begin();
164 for (; aSIt != aSubEntities.end(); ++aSIt)
165 isUpdated = update(*aSIt) || isUpdated;
167 // additional constraints for the arc processing
168 if (theEntity->type() == ENTITY_ARC)
169 processArc(theEntity);
171 // Change entity's ID, if necessary
172 if (theEntity->id() == EID_UNKNOWN) {
173 if (theEntity->type() == ENTITY_POINT) {
174 std::shared_ptr<PlaneGCSSolver_PointWrapper> aPoint =
175 std::dynamic_pointer_cast<PlaneGCSSolver_PointWrapper>(theEntity);
177 aPoint = std::dynamic_pointer_cast<PlaneGCSSolver_PointWrapper>(
178 theEntity->subEntities().front());
180 aPoint->setId(++myEntityLastID);
181 } else if (theEntity->type() == ENTITY_SCALAR) {
182 std::shared_ptr<PlaneGCSSolver_ScalarWrapper> aScalar =
183 std::dynamic_pointer_cast<PlaneGCSSolver_ScalarWrapper>(theEntity);
184 aScalar->setId(++myEntityLastID);
186 std::shared_ptr<PlaneGCSSolver_EntityWrapper> aGCSEnt =
187 std::dynamic_pointer_cast<PlaneGCSSolver_EntityWrapper>(theEntity);
188 aGCSEnt->setId(++myEntityLastID);
194 bool PlaneGCSSolver_Storage::update(ParameterWrapperPtr theParameter)
196 std::shared_ptr<PlaneGCSSolver_ParameterWrapper> aParam =
197 std::dynamic_pointer_cast<PlaneGCSSolver_ParameterWrapper>(theParameter);
198 if (aParam->isProcessed())
200 if (theParameter->group() != myGroupID || theParameter->isParametric())
201 myConst.push_back(aParam->parameter());
203 myParameters.push_back(aParam->parameter());
204 aParam->setProcessed(true);
209 bool PlaneGCSSolver_Storage::remove(ConstraintWrapperPtr theConstraint)
211 std::shared_ptr<PlaneGCSSolver_ConstraintWrapper> aConstraint =
212 std::dynamic_pointer_cast<PlaneGCSSolver_ConstraintWrapper>(theConstraint);
214 bool isFullyRemoved = true;
215 // remove point-point coincidence
216 if (aConstraint->type() == CONSTRAINT_PT_PT_COINCIDENT)
217 isFullyRemoved = removeCoincidence(theConstraint) && isFullyRemoved;
218 // remove sub-entities
219 const std::list<EntityWrapperPtr>& aSubs = aConstraint->entities();
220 std::list<EntityWrapperPtr>::const_iterator aSIt = aSubs.begin();
221 for (; aSIt != aSubs.end(); ++ aSIt)
222 isFullyRemoved = remove(*aSIt) && isFullyRemoved;
224 if (aConstraint->valueParameter())
225 isFullyRemoved = remove(aConstraint->valueParameter()) && isFullyRemoved;
226 if (!isFullyRemoved && aConstraint->baseConstraint() &&
227 (!aConstraint->baseConstraint()->data() || !aConstraint->baseConstraint()->data()->isValid()))
228 isFullyRemoved = true;
229 setNeedToResolve(true);
230 myRemovedConstraints.insert(myRemovedConstraints.end(),
231 aConstraint->constraints().begin(), aConstraint->constraints().end());
233 if (isFullyRemoved && theConstraint->id() == myConstraintLastID)
234 --myConstraintLastID;
236 return isFullyRemoved;
239 bool PlaneGCSSolver_Storage::remove(EntityWrapperPtr theEntity)
241 bool isFullyRemoved = SketchSolver_Storage::remove(theEntity);
242 if (isFullyRemoved && theEntity->id() == myEntityLastID)
244 return isFullyRemoved;
247 bool PlaneGCSSolver_Storage::remove(ParameterWrapperPtr theParameter)
249 std::shared_ptr<PlaneGCSSolver_ParameterWrapper> aParam =
250 std::dynamic_pointer_cast<PlaneGCSSolver_ParameterWrapper>(theParameter);
251 if (aParam->isProcessed()) {
252 double* aValPtr = aParam->parameter();
253 GCS::VEC_pD::iterator anIt = myParameters.begin();
254 for (; anIt != myParameters.end(); ++anIt)
255 if (*anIt == aValPtr)
257 if (anIt != myParameters.end()) {
258 myParameters.erase(anIt);
259 setNeedToResolve(true);
262 for (anIt = myConst.begin(); anIt != myConst.end(); ++anIt)
263 if (*anIt == aValPtr)
265 if (anIt != myConst.end()) {
267 setNeedToResolve(true);
271 aParam->setProcessed(false);
276 void PlaneGCSSolver_Storage::addCoincidentPoints(
277 EntityWrapperPtr theMaster, EntityWrapperPtr theSlave)
279 if (theMaster->type() != ENTITY_POINT || theSlave->type() != ENTITY_POINT)
282 std::shared_ptr<PlaneGCSSolver_PointWrapper> aMaster =
283 std::dynamic_pointer_cast<PlaneGCSSolver_PointWrapper>(theMaster);
285 aMaster = std::dynamic_pointer_cast<PlaneGCSSolver_PointWrapper>(
286 std::dynamic_pointer_cast<PlaneGCSSolver_EntityWrapper>(theMaster)->subEntities().front());
287 std::shared_ptr<PlaneGCSSolver_PointWrapper> aSlave =
288 std::dynamic_pointer_cast<PlaneGCSSolver_PointWrapper>(theSlave);
290 aSlave = std::dynamic_pointer_cast<PlaneGCSSolver_PointWrapper>(
291 std::dynamic_pointer_cast<PlaneGCSSolver_EntityWrapper>(theSlave)->subEntities().front());
293 // Search available coincidence
294 CoincidentPointsMap::iterator aMasterFound = myCoincidentPoints.find(aMaster);
295 CoincidentPointsMap::iterator aSlaveFound = myCoincidentPoints.find(aSlave);
296 if (aMasterFound == myCoincidentPoints.end() && aSlaveFound == myCoincidentPoints.end()) {
297 // try to find master and slave points in the lists of slaves of already existent coincidences
298 CoincidentPointsMap::iterator anIt = myCoincidentPoints.begin();
299 for (; anIt != myCoincidentPoints.end(); ++anIt) {
300 if (anIt->second.find(aMaster) != anIt->second.end())
302 else if (anIt->second.find(aSlave) != anIt->second.end())
305 if (aMasterFound != myCoincidentPoints.end() && aSlaveFound != myCoincidentPoints.end())
310 if (aMasterFound == myCoincidentPoints.end()) {
312 myCoincidentPoints[aMaster] = std::set<EntityWrapperPtr>();
313 aMasterFound = myCoincidentPoints.find(aMaster);
314 } else if (aMasterFound == aSlaveFound)
315 return; // already coincident
317 if (aSlaveFound != myCoincidentPoints.end()) {
318 // A slave has been found, we need to attach all points coincident with it to the new master
319 std::set<EntityWrapperPtr> aNewSlaves = aSlaveFound->second;
320 aNewSlaves.insert(aSlaveFound->first);
321 myCoincidentPoints.erase(aSlaveFound);
323 std::set<EntityWrapperPtr>::const_iterator aSlIt = aNewSlaves.begin();
324 for (; aSlIt != aNewSlaves.end(); ++aSlIt)
325 addCoincidentPoints(aMaster, *aSlIt);
327 //std::list<ParameterWrapperPtr> aSlaveParams = aSlave->parameters();
328 //aSlave->setParameters(aMaster->parameters());
330 //// Remove slave's parameters
331 //std::list<ParameterWrapperPtr>::iterator aParIt = aSlaveParams.begin();
332 //for (; aParIt != aSlaveParams.end(); ++aParIt)
335 aMasterFound->second.insert(aSlave);
340 void PlaneGCSSolver_Storage::changeGroup(EntityWrapperPtr theEntity, const GroupID& theGroup)
342 theEntity->setGroup(theGroup);
343 if (theGroup == myGroupID)
344 makeVariable(theEntity);
346 if (theEntity->type() == ENTITY_POINT)
348 makeConstant(theEntity);
352 void PlaneGCSSolver_Storage::changeGroup(ParameterWrapperPtr theParam, const GroupID& theGroup)
357 void PlaneGCSSolver_Storage::verifyFixed()
362 void PlaneGCSSolver_Storage::processArc(const EntityWrapperPtr& theArc)
364 // no need to constraint a fixed arc
365 if (theArc->group() == GID_OUTOFGROUP)
368 // Calculate additional parameters necessary for PlaneGCS
369 const std::list<EntityWrapperPtr>& aSubs = theArc->subEntities();
370 std::list<EntityWrapperPtr>::const_iterator aSubIt = aSubs.begin();
371 while ((*aSubIt)->type() == ENTITY_POINT) // search scalar entities
373 double* aStartAngle = std::dynamic_pointer_cast<PlaneGCSSolver_ScalarWrapper>(*aSubIt++)->scalar();
374 double* aEndAngle = std::dynamic_pointer_cast<PlaneGCSSolver_ScalarWrapper>(*aSubIt++)->scalar();
375 double* aRadius = std::dynamic_pointer_cast<PlaneGCSSolver_ScalarWrapper>(*aSubIt)->scalar();
377 FeaturePtr anArcFeature = theArc->baseFeature();
378 std::shared_ptr<GeomDataAPI_Point2D> aCenterAttr = std::dynamic_pointer_cast<GeomDataAPI_Point2D>(
379 anArcFeature->attribute(SketchPlugin_Arc::CENTER_ID()));
380 std::shared_ptr<GeomDataAPI_Point2D> aStartAttr = std::dynamic_pointer_cast<GeomDataAPI_Point2D>(
381 anArcFeature->attribute(SketchPlugin_Arc::START_ID()));
382 std::shared_ptr<GeomDataAPI_Point2D> aEndAttr = std::dynamic_pointer_cast<GeomDataAPI_Point2D>(
383 anArcFeature->attribute(SketchPlugin_Arc::END_ID()));
384 if (!aCenterAttr || !aStartAttr || !aEndAttr)
386 std::shared_ptr<GeomAPI_Pnt2d> aCenterPnt = aCenterAttr->pnt();
387 std::shared_ptr<GeomAPI_Pnt2d> aStartPnt = aStartAttr->pnt();
388 std::shared_ptr<GeomAPI_Pnt2d> aEndPnt = aEndAttr->pnt();
390 *aRadius = aCenterPnt->distance(aStartPnt);
391 if (!anArcFeature->lastResult())
393 std::shared_ptr<GeomAPI_Edge> anArcEdge =
394 std::dynamic_pointer_cast<GeomAPI_Edge>(anArcFeature->lastResult()->shape());
397 anArcEdge->getRange(*aStartAngle, *aEndAngle);
399 // No need to add constraints if they are already exist
400 std::map<EntityWrapperPtr, std::vector<GCSConstraintPtr> >::const_iterator
401 aFound = myArcConstraintMap.find(theArc);
402 if (aFound != myArcConstraintMap.end())
405 // Prepare additional constraints to produce the arc
406 std::vector<GCSConstraintPtr> anArcConstraints;
407 std::shared_ptr<PlaneGCSSolver_EntityWrapper> anArcEnt =
408 std::dynamic_pointer_cast<PlaneGCSSolver_EntityWrapper>(theArc);
409 std::shared_ptr<GCS::Arc> anArc = std::dynamic_pointer_cast<GCS::Arc>(anArcEnt->entity());
410 // Distances from center till start and end points are equal to radius
411 anArcConstraints.push_back(GCSConstraintPtr(new GCS::ConstraintP2PDistance(
412 anArc->center, anArc->start, anArc->rad)));
413 anArcConstraints.push_back(GCSConstraintPtr(new GCS::ConstraintP2PDistance(
414 anArc->center, anArc->end, anArc->rad)));
415 // Angles of start and end points should be equal to given angles
416 anArcConstraints.push_back(GCSConstraintPtr(new GCS::ConstraintP2PAngle(
417 anArc->center, anArc->start, anArc->startAngle)));
418 anArcConstraints.push_back(GCSConstraintPtr(new GCS::ConstraintP2PAngle(
419 anArc->center, anArc->end, anArc->endAngle)));
421 myArcConstraintMap[theArc] = anArcConstraints;
425 void PlaneGCSSolver_Storage::makeConstant(const EntityWrapperPtr& theEntity)
427 toggleEntity(theEntity, myParameters, myConst);
428 if (theEntity->type() == ENTITY_POINT)
429 updateCoincident(theEntity);
432 void PlaneGCSSolver_Storage::makeVariable(const EntityWrapperPtr& theEntity)
434 toggleEntity(theEntity, myConst, myParameters);
437 static void getParametersToMove(const EntityWrapperPtr& theEntity, std::set<double*>& theParamList)
439 const std::list<ParameterWrapperPtr> aParams = theEntity->parameters();
440 std::list<ParameterWrapperPtr>::const_iterator aPIt = aParams.begin();
441 for (; aPIt != aParams.end(); ++aPIt)
443 std::dynamic_pointer_cast<PlaneGCSSolver_ParameterWrapper>(*aPIt)->parameter());
445 const std::list<EntityWrapperPtr> aSubs = theEntity->subEntities();
446 std::list<EntityWrapperPtr>::const_iterator aSIt = aSubs.begin();
448 if (theEntity->type() == ENTITY_ARC) {
449 // workaround for the arc processing, because the arc is fixed by a set of constraints,
450 // which will conflict with all parameters fixed:
452 getParametersToMove(*aSIt++, theParamList);
453 // 2. take start point
454 getParametersToMove(*aSIt++, theParamList);
455 // 3. skip end point, radius and start angle, but take end angle parameter
456 getParametersToMove(*(++aSIt), theParamList);
458 for (; aSIt != aSubs.end(); ++aSIt)
459 getParametersToMove(*aSIt, theParamList);
463 void PlaneGCSSolver_Storage::toggleEntity(
464 const EntityWrapperPtr& theEntity, GCS::VEC_pD& theFrom, GCS::VEC_pD& theTo)
466 std::set<double*> aParamsToMove;
467 getParametersToMove(theEntity, aParamsToMove);
469 GCS::VEC_pD::iterator anIt = theFrom.begin();
470 while (anIt != theFrom.end()) {
471 if (aParamsToMove.find(*anIt) == aParamsToMove.end()) {
476 theTo.push_back(*anIt);
477 int aShift = int(anIt - theFrom.begin());
479 anIt = theFrom.begin() + aShift;
483 void PlaneGCSSolver_Storage::updateCoincident(const EntityWrapperPtr& thePoint)
485 CoincidentPointsMap::iterator anIt = myCoincidentPoints.begin();
486 for (; anIt != myCoincidentPoints.end(); ++anIt) {
487 if (anIt->first == thePoint || anIt->second.find(thePoint) != anIt->second.end()) {
488 std::set<EntityWrapperPtr> aCoincident = anIt->second;
489 aCoincident.insert(anIt->first);
491 const std::list<ParameterWrapperPtr>& aBaseParams = thePoint->parameters();
492 std::list<ParameterWrapperPtr> aParams;
493 std::list<ParameterWrapperPtr>::const_iterator aBaseIt, anUpdIt;
495 std::set<EntityWrapperPtr>::const_iterator aCoincIt = aCoincident.begin();
496 for (; aCoincIt != aCoincident.end(); ++aCoincIt)
497 if (*aCoincIt != thePoint && (*aCoincIt)->group() != GID_OUTOFGROUP) {
498 aParams = (*aCoincIt)->parameters();
499 aBaseIt = aBaseParams.begin();
500 for (anUpdIt = aParams.begin(); anUpdIt != aParams.end(); ++anUpdIt, ++aBaseIt)
501 (*anUpdIt)->setValue((*aBaseIt)->value());
510 bool PlaneGCSSolver_Storage::isRedundant(
511 GCSConstraintPtr theCheckedConstraint,
512 ConstraintWrapperPtr theParentConstraint) const
514 if (theParentConstraint->type() == CONSTRAINT_SYMMETRIC) {
515 if (theCheckedConstraint->getTypeId() == GCS::Perpendicular) {
516 BuilderPtr aBuilder = PlaneGCSSolver_Builder::getInstance();
517 // check the initial point is placed on the mirror line
518 std::list<EntityWrapperPtr> aSubs = theParentConstraint->entities();
519 std::shared_ptr<GeomAPI_Pnt2d> aPoint = aBuilder->point(aSubs.front());
520 std::shared_ptr<GeomAPI_Lin2d> aLine = aBuilder->line(aSubs.back());
521 return aLine->distance(aPoint) < tolerance;
528 void PlaneGCSSolver_Storage::initializeSolver(SolverPtr theSolver)
530 std::shared_ptr<PlaneGCSSolver_Solver> aSolver =
531 std::dynamic_pointer_cast<PlaneGCSSolver_Solver>(theSolver);
538 // initialize constraints
539 std::map<ConstraintPtr, std::list<ConstraintWrapperPtr> >::const_iterator
540 aCIt = myConstraintMap.begin();
541 for (; aCIt != myConstraintMap.end(); ++aCIt) {
542 std::list<ConstraintWrapperPtr>::const_iterator aCWIt = aCIt->second.begin();
543 for (; aCWIt != aCIt->second.end(); ++ aCWIt) {
544 std::shared_ptr<PlaneGCSSolver_ConstraintWrapper> aGCS =
545 std::dynamic_pointer_cast<PlaneGCSSolver_ConstraintWrapper>(*aCWIt);
546 std::list<GCSConstraintPtr>::const_iterator anIt = aGCS->constraints().begin();
547 for (; anIt != aGCS->constraints().end(); ++anIt)
548 if (!isRedundant(*anIt, aGCS))
549 aSolver->addConstraint(*anIt);
552 // additional constraints for arcs
553 std::map<EntityWrapperPtr, std::vector<GCSConstraintPtr> >::const_iterator
554 anArcIt = myArcConstraintMap.begin();
555 for (; anArcIt != myArcConstraintMap.end(); ++anArcIt) {
556 std::vector<GCSConstraintPtr>::const_iterator anIt = anArcIt->second.begin();
557 for (; anIt != anArcIt->second.end(); ++anIt)
558 aSolver->addConstraint(*anIt);
560 // removed waste constraints
561 std::list<GCSConstraintPtr>::const_iterator aRemIt = myRemovedConstraints.begin();
562 for (; aRemIt != myRemovedConstraints.end(); ++aRemIt)
563 aSolver->removeConstraint(*aRemIt);
564 myRemovedConstraints.clear();
565 // initialize unknowns
566 aSolver->setParameters(myParameters);
569 void PlaneGCSSolver_Storage::refresh(bool theFixedOnly) const
573 std::map<AttributePtr, EntityWrapperPtr>::const_iterator anIt = myAttributeMap.begin();
574 std::list<ParameterWrapperPtr> aParams;
575 std::list<ParameterWrapperPtr>::const_iterator aParIt;
576 for (; anIt != myAttributeMap.end(); ++anIt) {
577 // the external feature always should keep the up to date values, so,
578 // refresh from the solver is never needed
579 bool isExternal = false;
580 if (anIt->first.get()) {
581 std::shared_ptr<SketchPlugin_Feature> aSketchFeature =
582 std::dynamic_pointer_cast<SketchPlugin_Feature>(anIt->first->owner());
583 if (aSketchFeature.get() && aSketchFeature->isExternal())
587 // update parameter wrappers and obtain values of attributes
588 aParams = anIt->second->parameters();
590 bool isUpd[3] = {false};
592 for (aParIt = aParams.begin(); i < 3 && aParIt != aParams.end(); ++aParIt, ++i) {
593 if (!theFixedOnly || isExternal ||
594 (*aParIt)->group() == GID_OUTOFGROUP || (*aParIt)->isParametric()) {
595 aCoords[i] = (*aParIt)->value();
599 if (!isUpd[0] && !isUpd[1] && !isUpd[2])
600 continue; // nothing is updated
602 std::shared_ptr<GeomDataAPI_Point2D> aPoint2D =
603 std::dynamic_pointer_cast<GeomDataAPI_Point2D>(anIt->first);
605 if ((isUpd[0] && fabs(aPoint2D->x() - aCoords[0]) > tolerance) ||
606 (isUpd[1] && fabs(aPoint2D->y() - aCoords[1]) > tolerance) || isExternal) {
607 if (!isUpd[0] || isExternal) aCoords[0] = aPoint2D->x();
608 if (!isUpd[1] || isExternal) aCoords[1] = aPoint2D->y();
609 aPoint2D->setValue(aCoords[0], aCoords[1]);
610 // Find points coincident with this one (probably not in GID_OUTOFGROUP)
611 CoincidentPointsMap::const_iterator aCoincIt = myCoincidentPoints.begin();
612 for (; aCoincIt != myCoincidentPoints.end(); ++aCoincIt)
613 if (aCoincIt->first == anIt->second ||
614 aCoincIt->second.find(anIt->second) != aCoincIt->second.end())
616 if (aCoincIt != myCoincidentPoints.end()) {
617 aPoint2D = std::dynamic_pointer_cast<GeomDataAPI_Point2D>(
618 aCoincIt->first->baseAttribute());
620 aPoint2D->setValue(aCoords[0], aCoords[1]);
621 std::set<EntityWrapperPtr>::const_iterator aSlaveIt = aCoincIt->second.begin();
622 for (; aSlaveIt != aCoincIt->second.end(); ++aSlaveIt) {
623 aPoint2D = std::dynamic_pointer_cast<GeomDataAPI_Point2D>((*aSlaveIt)->baseAttribute());
625 aPoint2D->setValue(aCoords[0], aCoords[1]);
631 AttributeDoublePtr aScalar = std::dynamic_pointer_cast<ModelAPI_AttributeDouble>(anIt->first);
632 if (aScalar && !isExternal) {
633 if (isUpd[0] && fabs(aScalar->value() - aCoords[0]) > tolerance)
634 aScalar->setValue(aCoords[0]);
639 //blockEvents(false);
642 EntityWrapperPtr PlaneGCSSolver_Storage::calculateMiddlePoint(
643 EntityWrapperPtr theBase, double theCoeff)
645 std::shared_ptr<PlaneGCSSolver_Builder> aBuilder =
646 std::dynamic_pointer_cast<PlaneGCSSolver_Builder>(PlaneGCSSolver_Builder::getInstance());
648 std::shared_ptr<GeomAPI_XY> aMidPoint;
649 if (theBase->type() == ENTITY_LINE) {
650 std::shared_ptr<GeomAPI_Pnt2d> aPoints[2];
651 const std::list<EntityWrapperPtr>& aSubs = theBase->subEntities();
652 std::list<EntityWrapperPtr>::const_iterator anIt = aSubs.begin();
653 for (int i = 0; i < 2; ++i, ++anIt)
654 aPoints[i] = aBuilder->point(*anIt);
655 aMidPoint = aPoints[0]->xy()->multiplied(1.0 - theCoeff)->added(
656 aPoints[1]->xy()->multiplied(theCoeff));
658 else if (theBase->type() == ENTITY_ARC) {
660 double anArcPoint[3][2];
661 const std::list<EntityWrapperPtr>& aSubs = theBase->subEntities();
662 std::list<EntityWrapperPtr>::const_iterator anIt = aSubs.begin();
663 for (int i = 0; i < 3; ++i, ++anIt) {
664 std::shared_ptr<GeomAPI_Pnt2d> aPoint = aBuilder->point(*anIt);
665 anArcPoint[i][0] = aPoint->x();
666 anArcPoint[i][1] = aPoint->y();
668 // project last point of arc on the arc
669 double x = anArcPoint[1][0] - anArcPoint[0][0];
670 double y = anArcPoint[1][1] - anArcPoint[0][1];
671 double aRad = sqrt(x*x + y*y);
672 x = anArcPoint[2][0] - anArcPoint[0][0];
673 y = anArcPoint[2][1] - anArcPoint[0][1];
674 double aNorm = sqrt(x*x + y*y);
675 if (aNorm >= tolerance) {
676 anArcPoint[2][0] = x * aRad / aNorm;
677 anArcPoint[2][1] = y * aRad / aNorm;
679 anArcPoint[1][0] -= anArcPoint[0][0];
680 anArcPoint[1][1] -= anArcPoint[0][1];
681 if (theCoeff < tolerance) {
682 theX = anArcPoint[0][0] + anArcPoint[1][0];
683 theY = anArcPoint[0][1] + anArcPoint[1][1];
684 } else if (1 - theCoeff < tolerance) {
685 theX = anArcPoint[0][0] + anArcPoint[2][0];
686 theY = anArcPoint[0][1] + anArcPoint[2][1];
688 std::shared_ptr<GeomAPI_Dir2d> aStartDir(new GeomAPI_Dir2d(anArcPoint[1][0], anArcPoint[1][1]));
689 std::shared_ptr<GeomAPI_Dir2d> aEndDir(new GeomAPI_Dir2d(anArcPoint[2][0], anArcPoint[2][1]));
690 double anAngle = aStartDir->angle(aEndDir);
694 double aCos = cos(anAngle);
695 double aSin = sin(anAngle);
696 theX = anArcPoint[0][0] + anArcPoint[1][0] * aCos - anArcPoint[1][1] * aSin;
697 theY = anArcPoint[0][1] + anArcPoint[1][0] * aSin + anArcPoint[1][1] * aCos;
699 aMidPoint = std::shared_ptr<GeomAPI_XY>(new GeomAPI_XY(theX, theY));
703 return EntityWrapperPtr();
705 std::list<ParameterWrapperPtr> aParameters;
706 aParameters.push_back(aBuilder->createParameter(myGroupID, aMidPoint->x()));
707 aParameters.push_back(aBuilder->createParameter(myGroupID, aMidPoint->y()));
708 // Create entity (parameters are not filled)
709 GCSPointPtr aPnt(new GCS::Point);
710 aPnt->x = std::dynamic_pointer_cast<PlaneGCSSolver_ParameterWrapper>(aParameters.front())->parameter();
711 aPnt->y = std::dynamic_pointer_cast<PlaneGCSSolver_ParameterWrapper>(aParameters.back())->parameter();
713 EntityWrapperPtr aResult(new PlaneGCSSolver_PointWrapper(AttributePtr(), aPnt));
714 aResult->setGroup(myGroupID);
715 aResult->setParameters(aParameters);