src/SketchSolver/PlaneGCSSolver/PlaneGCSSolver_Storage.cpp

   1 // Copyright (C) 2014-20xx CEA/DEN, EDF R&D
   2
   3 // File:    PlaneGCSSolver_Storage.cpp
   4 // Created: 14 Dec 2015
   5 // Author:  Artem ZHIDKOV
   6
   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>
  15
  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>
  22 #include <SketchPlugin_ConstraintTangent.h>
  23
  24 #include <cmath>
  25
  26
  27 PlaneGCSSolver_Storage::PlaneGCSSolver_Storage(const GroupID& theGroup)
  28   : SketchSolver_Storage(theGroup),
  29     myEntityLastID(EID_SKETCH),
  30     myConstraintLastID(CID_UNKNOWN)
  31 {
  32 }
  33
  34 void PlaneGCSSolver_Storage::addConstraint(
  35     ConstraintPtr                   theConstraint,
  36     std::list<ConstraintWrapperPtr> theSolverConstraints)
  37 {
  38   SketchSolver_Storage::addConstraint(theConstraint, theSolverConstraints);
  39
  40   // update point-point coincidence
  41   if (!theSolverConstraints.empty() &&
  42       theSolverConstraints.front()->type() == CONSTRAINT_PT_PT_COINCIDENT) {
  43     std::list<ConstraintWrapperPtr>::iterator aCIt = theSolverConstraints.begin();
  44     for (; aCIt != theSolverConstraints.end(); ++aCIt)
  45       update(*aCIt);
  46   }
  47 }
  48
  49
  50 bool PlaneGCSSolver_Storage::update(ConstraintWrapperPtr theConstraint)
  51 {
  52   bool isUpdated = false;
  53   std::shared_ptr<PlaneGCSSolver_ConstraintWrapper> aConstraint =
  54       std::dynamic_pointer_cast<PlaneGCSSolver_ConstraintWrapper>(theConstraint);
  55
  56   // point-Line distance should be positive
  57   if (aConstraint->type() == CONSTRAINT_PT_LINE_DISTANCE && aConstraint->value() < 0.0)
  58     aConstraint->setValue(-aConstraint->value());
  59
  60   // make value of constraint unchangeable
  61   ParameterWrapperPtr aValue = aConstraint->valueParameter();
  62   if (aValue)
  63     isUpdated = update(aValue) || isUpdated;
  64
  65   // update constrained entities
  66   std::list<EntityWrapperPtr> anEntities = theConstraint->entities();
  67   std::list<EntityWrapperPtr>::iterator anIt = anEntities.begin();
  68   for (; anIt != anEntities.end(); ++anIt)
  69     isUpdated = update(*anIt) || isUpdated;
  70
  71   if (aConstraint->id() == CID_UNKNOWN) {
  72     const std::list<EntityWrapperPtr>& aSubs = aConstraint->entities();
  73     // check middle-point constraint conflicts with point-on-line
  74     if (aConstraint->type() == CONSTRAINT_MIDDLE_POINT) {
  75       std::map<ConstraintPtr, std::list<ConstraintWrapperPtr> >::const_iterator
  76           anIt = myConstraintMap.begin();
  77       for (; anIt != myConstraintMap.end(); ++anIt) {
  78         EntityWrapperPtr aPoint, aLine;
  79         ConstraintWrapperPtr aCurrentConstr = anIt->second.front();
  80         if (aCurrentConstr->type() != CONSTRAINT_PT_ON_LINE)
  81           continue;
  82         const std::list<EntityWrapperPtr>& aCurSubs = aCurrentConstr->entities();
  83         std::list<EntityWrapperPtr>::const_iterator aSIt1, aSIt2;
  84         for (aSIt1 = aSubs.begin(); aSIt1 != aSubs.end(); ++aSIt1) {
  85           if ((*aSIt1)->type() == ENTITY_POINT)
  86             aPoint = *aSIt1;
  87           else if((*aSIt1)->type() == ENTITY_LINE)
  88             aLine = *aSIt1;
  89           else
  90             continue;
  91           for (aSIt2 = aCurSubs.begin(); aSIt2 != aCurSubs.end(); ++aSIt2)
  92             if ((*aSIt1)->id() == (*aSIt2)->id())
  93               break;
  94           if (aSIt2 == aCurSubs.end())
  95             break;
  96         }
  97         // point-on-line found, change it to bisector
  98         if (aSIt1 == aSubs.end()) {
  99           std::list<GCSConstraintPtr> aConstrList = aConstraint->constraints();
 100           aConstrList.pop_front();
 101           aConstraint->setConstraints(aConstrList);
 102           break;
 103         }
 104       }
 105     }
 106
 107     // Change ID of constraints
 108     aConstraint->setId(++myConstraintLastID);
 109   }
 110
 111   return isUpdated;
 112 }
 113
 114 /// \brief Update coordinates of the point or scalar using its base attribute
 115 static bool updateValues(EntityWrapperPtr& theEntity)
 116 {
 117   bool isUpdated = false;
 118   AttributePtr anAttr = theEntity->baseAttribute();
 119   const std::list<ParameterWrapperPtr> aParams = theEntity->parameters();
 120
 121   double aCoord[2];
 122
 123   std::shared_ptr<GeomDataAPI_Point2D> aPoint2D =
 124       std::dynamic_pointer_cast<GeomDataAPI_Point2D>(anAttr);
 125   if (aPoint2D) {
 126     aCoord[0] = aPoint2D->x();
 127     aCoord[1] = aPoint2D->y();
 128   } else {
 129     AttributeDoublePtr aScalar = std::dynamic_pointer_cast<ModelAPI_AttributeDouble>(anAttr);
 130     if (aScalar)
 131       aCoord[0] = aScalar->value();
 132   }
 133
 134   std::list<ParameterWrapperPtr>::const_iterator anIt = aParams.begin();
 135   for (int i = 0; anIt != aParams.end(); ++anIt, ++i)
 136     if (fabs((*anIt)->value() - aCoord[i]) > tolerance) {
 137       (*anIt)->setValue(aCoord[i]);
 138       isUpdated = true;
 139     }
 140   return isUpdated;
 141 }
 142
 143 bool PlaneGCSSolver_Storage::update(EntityWrapperPtr theEntity)
 144 {
 145   if (theEntity->type() == ENTITY_SKETCH)
 146     return true; // sketch is not necessary for PlaneGCS, so it is always says true
 147
 148   bool isUpdated = false;
 149
 150   if (theEntity->baseAttribute()) {
 151     isUpdated = updateValues(theEntity);
 152     if (isUpdated) {
 153       setNeedToResolve(true);
 154       if (theEntity->type() == ENTITY_POINT && theEntity->group() != myGroupID)
 155         updateCoincident(theEntity);
 156     }
 157   }
 158
 159   // update parameters
 160   std::list<ParameterWrapperPtr> aParams = theEntity->parameters();
 161   std::list<ParameterWrapperPtr>::iterator aPIt = aParams.begin();
 162   for (; aPIt != aParams.end(); ++aPIt)
 163     isUpdated = update(*aPIt) || isUpdated;
 164
 165   // update sub-entities
 166   std::list<EntityWrapperPtr> aSubEntities = theEntity->subEntities();
 167   std::list<EntityWrapperPtr>::iterator aSIt = aSubEntities.begin();
 168   for (; aSIt != aSubEntities.end(); ++aSIt)
 169     isUpdated = update(*aSIt) || isUpdated;
 170
 171   // additional constraints for the arc processing
 172   if (theEntity->type() == ENTITY_ARC)
 173     processArc(theEntity);
 174
 175   // Change entity's ID, if necessary
 176   if (theEntity->id() == EID_UNKNOWN) {
 177     if (theEntity->type() == ENTITY_POINT) {
 178       std::shared_ptr<PlaneGCSSolver_PointWrapper> aPoint =
 179           std::dynamic_pointer_cast<PlaneGCSSolver_PointWrapper>(theEntity);
 180       if (!aPoint) {
 181         aPoint = std::dynamic_pointer_cast<PlaneGCSSolver_PointWrapper>(
 182             theEntity->subEntities().front());
 183       }
 184       aPoint->setId(++myEntityLastID);
 185     } else if (theEntity->type() == ENTITY_SCALAR) {
 186       std::shared_ptr<PlaneGCSSolver_ScalarWrapper> aScalar =
 187           std::dynamic_pointer_cast<PlaneGCSSolver_ScalarWrapper>(theEntity);
 188       aScalar->setId(++myEntityLastID);
 189     } else {
 190       std::shared_ptr<PlaneGCSSolver_EntityWrapper> aGCSEnt =
 191           std::dynamic_pointer_cast<PlaneGCSSolver_EntityWrapper>(theEntity);
 192       aGCSEnt->setId(++myEntityLastID);
 193     }
 194   }
 195   return isUpdated;
 196 }
 197
 198 bool PlaneGCSSolver_Storage::update(ParameterWrapperPtr theParameter)
 199 {
 200   std::shared_ptr<PlaneGCSSolver_ParameterWrapper> aParam =
 201       std::dynamic_pointer_cast<PlaneGCSSolver_ParameterWrapper>(theParameter);
 202   if (aParam->isProcessed())
 203     return false;
 204   if (theParameter->group() != myGroupID || theParameter->isParametric())
 205     myConst.push_back(aParam->parameter());
 206   else
 207     myParameters.push_back(aParam->parameter());
 208   aParam->setProcessed(true);
 209   return true;
 210 }
 211
 212
 213 bool PlaneGCSSolver_Storage::remove(ConstraintWrapperPtr theConstraint)
 214 {
 215   std::shared_ptr<PlaneGCSSolver_ConstraintWrapper> aConstraint =
 216     std::dynamic_pointer_cast<PlaneGCSSolver_ConstraintWrapper>(theConstraint);
 217
 218   bool isFullyRemoved = true;
 219   // remove point-point coincidence
 220   if (aConstraint->type() == CONSTRAINT_PT_PT_COINCIDENT)
 221     isFullyRemoved = removeCoincidence(theConstraint) && isFullyRemoved;
 222   // remove sub-entities
 223   const std::list<EntityWrapperPtr>& aSubs = aConstraint->entities();
 224   std::list<EntityWrapperPtr>::const_iterator aSIt = aSubs.begin();
 225   for (; aSIt != aSubs.end(); ++ aSIt)
 226     isFullyRemoved = remove(*aSIt) && isFullyRemoved;
 227
 228   if (aConstraint->valueParameter())
 229     isFullyRemoved = remove(aConstraint->valueParameter()) && isFullyRemoved;
 230   if (!isFullyRemoved && aConstraint->baseConstraint() &&
 231      (!aConstraint->baseConstraint()->data() || !aConstraint->baseConstraint()->data()->isValid()))
 232     isFullyRemoved = true;
 233   setNeedToResolve(true);
 234   myRemovedConstraints.insert(myRemovedConstraints.end(),
 235       aConstraint->constraints().begin(), aConstraint->constraints().end());
 236
 237   if (isFullyRemoved && theConstraint->id() == myConstraintLastID)
 238     --myConstraintLastID;
 239
 240   return isFullyRemoved;
 241 }
 242
 243 bool PlaneGCSSolver_Storage::remove(EntityWrapperPtr theEntity)
 244 {
 245   // do not remove entity, if it is used by constraints or other entities
 246   if ((theEntity->baseFeature() && isUsed(theEntity->baseFeature())) ||
 247       (theEntity->baseAttribute() && isUsed(theEntity->baseAttribute())))
 248     return false;
 249
 250   bool isFullyRemoved = SketchSolver_Storage::remove(theEntity);
 251   if (isFullyRemoved) {
 252     if (theEntity->type() == ENTITY_ARC) {
 253       // remove arc additional constraints
 254       std::map<EntityWrapperPtr, std::vector<GCSConstraintPtr> >::iterator
 255           aFound = myArcConstraintMap.find(theEntity);
 256       if (aFound != myArcConstraintMap.end()) {
 257         myRemovedConstraints.insert(myRemovedConstraints.end(),
 258             aFound->second.begin(), aFound->second.end());
 259         myArcConstraintMap.erase(aFound);
 260       }
 261     }
 262     if (theEntity->id() == myEntityLastID)
 263       --myEntityLastID;
 264   }
 265   return isFullyRemoved;
 266 }
 267
 268 bool PlaneGCSSolver_Storage::remove(ParameterWrapperPtr theParameter)
 269 {
 270   std::shared_ptr<PlaneGCSSolver_ParameterWrapper> aParam =
 271       std::dynamic_pointer_cast<PlaneGCSSolver_ParameterWrapper>(theParameter);
 272   if (aParam->isProcessed()) {
 273     double* aValPtr = aParam->parameter();
 274     GCS::VEC_pD::iterator anIt =  myParameters.begin();
 275     for (; anIt != myParameters.end(); ++anIt)
 276       if (*anIt == aValPtr)
 277         break;
 278     if (anIt != myParameters.end()) {
 279       myParameters.erase(anIt);
 280       setNeedToResolve(true);
 281       aParam->setProcessed(false);
 282     }
 283     else {
 284       for (anIt = myConst.begin(); anIt != myConst.end(); ++anIt)
 285         if (*anIt == aValPtr)
 286           break;
 287       if (anIt != myConst.end()) {
 288         myConst.erase(anIt);
 289         setNeedToResolve(true);
 290         aParam->setProcessed(false);
 291       }
 292     }
 293   }
 294   return true;
 295 }
 296
 297
 298 void PlaneGCSSolver_Storage::addCoincidentPoints(
 299     EntityWrapperPtr theMaster, EntityWrapperPtr theSlave)
 300 {
 301   if (theMaster->type() != ENTITY_POINT || theSlave->type() != ENTITY_POINT)
 302     return;
 303
 304   std::shared_ptr<PlaneGCSSolver_PointWrapper> aMaster =
 305       std::dynamic_pointer_cast<PlaneGCSSolver_PointWrapper>(theMaster);
 306   if (!aMaster)
 307     aMaster = std::dynamic_pointer_cast<PlaneGCSSolver_PointWrapper>(
 308       std::dynamic_pointer_cast<PlaneGCSSolver_EntityWrapper>(theMaster)->subEntities().front());
 309   std::shared_ptr<PlaneGCSSolver_PointWrapper> aSlave =
 310       std::dynamic_pointer_cast<PlaneGCSSolver_PointWrapper>(theSlave);
 311   if (!aSlave)
 312     aSlave = std::dynamic_pointer_cast<PlaneGCSSolver_PointWrapper>(
 313       std::dynamic_pointer_cast<PlaneGCSSolver_EntityWrapper>(theSlave)->subEntities().front());
 314
 315   // Search available coincidence
 316   CoincidentPointsMap::iterator aMasterFound = myCoincidentPoints.find(aMaster);
 317   CoincidentPointsMap::iterator aSlaveFound = myCoincidentPoints.find(aSlave);
 318   if (aMasterFound == myCoincidentPoints.end() &&  aSlaveFound == myCoincidentPoints.end()) {
 319     // try to find master and slave points in the lists of slaves of already existent coincidences
 320     CoincidentPointsMap::iterator anIt = myCoincidentPoints.begin();
 321     for (; anIt != myCoincidentPoints.end(); ++anIt) {
 322       if (anIt->second.find(aMaster) != anIt->second.end())
 323         aMasterFound = anIt;
 324       else if (anIt->second.find(aSlave) != anIt->second.end())
 325         aSlaveFound = anIt;
 326
 327       if (aMasterFound != myCoincidentPoints.end() &&  aSlaveFound != myCoincidentPoints.end())
 328         break;
 329     }
 330   }
 331
 332   if (aMasterFound == myCoincidentPoints.end()) {
 333     // create new group
 334     myCoincidentPoints[aMaster] = std::set<EntityWrapperPtr>();
 335     aMasterFound = myCoincidentPoints.find(aMaster);
 336   } else if (aMasterFound == aSlaveFound)
 337     return; // already coincident
 338
 339   if (aSlaveFound != myCoincidentPoints.end()) {
 340     // A slave has been found, we need to attach all points coincident with it to the new master
 341     std::set<EntityWrapperPtr> aNewSlaves = aSlaveFound->second;
 342     aNewSlaves.insert(aSlaveFound->first);
 343     myCoincidentPoints.erase(aSlaveFound);
 344
 345     std::set<EntityWrapperPtr>::const_iterator aSlIt = aNewSlaves.begin();
 346     for (; aSlIt != aNewSlaves.end(); ++aSlIt)
 347       addCoincidentPoints(aMaster, *aSlIt);
 348   } else {
 349     //std::list<ParameterWrapperPtr> aSlaveParams = aSlave->parameters();
 350     //aSlave->setParameters(aMaster->parameters());
 351
 352     //// Remove slave's parameters
 353     //std::list<ParameterWrapperPtr>::iterator aParIt = aSlaveParams.begin();
 354     //for (; aParIt != aSlaveParams.end(); ++aParIt)
 355     //  remove(*aParIt);
 356
 357     aMasterFound->second.insert(aSlave);
 358   }
 359 }
 360
 361
 362 void PlaneGCSSolver_Storage::changeGroup(EntityWrapperPtr theEntity, const GroupID& theGroup)
 363 {
 364   theEntity->setGroup(theGroup);
 365   if (theGroup == myGroupID)
 366     makeVariable(theEntity);
 367   else {
 368     if (theEntity->type() == ENTITY_POINT)
 369       update(theEntity);
 370     makeConstant(theEntity);
 371   }
 372 }
 373
 374 void PlaneGCSSolver_Storage::changeGroup(ParameterWrapperPtr theParam, const GroupID& theGroup)
 375 {
 376   // TODO
 377 }
 378
 379 void PlaneGCSSolver_Storage::verifyFixed()
 380 {
 381   // TODO
 382 }
 383
 384 void PlaneGCSSolver_Storage::processArc(const EntityWrapperPtr& theArc)
 385 {
 386   // no need to constraint a fixed arc
 387   if (theArc->group() == GID_OUTOFGROUP)
 388     return;
 389
 390   // Calculate additional parameters necessary for PlaneGCS
 391   const std::list<EntityWrapperPtr>& aSubs = theArc->subEntities();
 392   std::list<EntityWrapperPtr>::const_iterator aSubIt = aSubs.begin();
 393   while ((*aSubIt)->type() == ENTITY_POINT) // search scalar entities
 394     ++aSubIt;
 395   double* aStartAngle = std::dynamic_pointer_cast<PlaneGCSSolver_ScalarWrapper>(*aSubIt++)->scalar();
 396   double* aEndAngle   = std::dynamic_pointer_cast<PlaneGCSSolver_ScalarWrapper>(*aSubIt++)->scalar();
 397   double* aRadius     = std::dynamic_pointer_cast<PlaneGCSSolver_ScalarWrapper>(*aSubIt)->scalar();
 398
 399   std::shared_ptr<SketchPlugin_Feature> anArcFeature =
 400       std::dynamic_pointer_cast<SketchPlugin_Feature>(theArc->baseFeature());
 401   std::shared_ptr<GeomDataAPI_Point2D> aCenterAttr = std::dynamic_pointer_cast<GeomDataAPI_Point2D>(
 402       anArcFeature->attribute(SketchPlugin_Arc::CENTER_ID()));
 403   std::shared_ptr<GeomDataAPI_Point2D> aStartAttr = std::dynamic_pointer_cast<GeomDataAPI_Point2D>(
 404       anArcFeature->attribute(SketchPlugin_Arc::START_ID()));
 405   std::shared_ptr<GeomDataAPI_Point2D> aEndAttr = std::dynamic_pointer_cast<GeomDataAPI_Point2D>(
 406       anArcFeature->attribute(SketchPlugin_Arc::END_ID()));
 407   if (!aCenterAttr || !aStartAttr || !aEndAttr)
 408     return;
 409   std::shared_ptr<GeomAPI_Pnt2d> aCenterPnt = aCenterAttr->pnt();
 410   std::shared_ptr<GeomAPI_Pnt2d> aStartPnt  = aStartAttr->pnt();
 411   std::shared_ptr<GeomAPI_Pnt2d> aEndPnt    = aEndAttr->pnt();
 412
 413   *aRadius = aCenterPnt->distance(aStartPnt);
 414   if (!anArcFeature->lastResult())
 415     return;
 416   std::shared_ptr<GeomAPI_Edge> anArcEdge =
 417       std::dynamic_pointer_cast<GeomAPI_Edge>(anArcFeature->lastResult()->shape());
 418   if (!anArcEdge)
 419     return;
 420   anArcEdge->getRange(*aStartAngle, *aEndAngle);
 421
 422   // do not constraint copied arc
 423   if (anArcFeature->isCopy())
 424     return;
 425   // No need to add constraints if they are already exist
 426   std::map<EntityWrapperPtr, std::vector<GCSConstraintPtr> >::const_iterator
 427       aFound = myArcConstraintMap.find(theArc);
 428   if (aFound != myArcConstraintMap.end())
 429     return;
 430
 431   // Prepare additional constraints to produce the arc
 432   std::vector<GCSConstraintPtr> anArcConstraints;
 433   std::shared_ptr<PlaneGCSSolver_EntityWrapper> anArcEnt =
 434       std::dynamic_pointer_cast<PlaneGCSSolver_EntityWrapper>(theArc);
 435   std::shared_ptr<GCS::Arc> anArc = std::dynamic_pointer_cast<GCS::Arc>(anArcEnt->entity());
 436   // Distances from center till start and end points are equal to radius
 437   anArcConstraints.push_back(GCSConstraintPtr(new GCS::ConstraintP2PDistance(
 438       anArc->center, anArc->start, anArc->rad)));
 439   anArcConstraints.push_back(GCSConstraintPtr(new GCS::ConstraintP2PDistance(
 440       anArc->center, anArc->end, anArc->rad)));
 441   // Angles of start and end points should be equal to given angles
 442   anArcConstraints.push_back(GCSConstraintPtr(new GCS::ConstraintP2PAngle(
 443       anArc->center, anArc->start, anArc->startAngle)));
 444   anArcConstraints.push_back(GCSConstraintPtr(new GCS::ConstraintP2PAngle(
 445       anArc->center, anArc->end, anArc->endAngle)));
 446
 447   myArcConstraintMap[theArc] = anArcConstraints;
 448 }
 449
 450
 451 void PlaneGCSSolver_Storage::makeConstant(const EntityWrapperPtr& theEntity)
 452 {
 453   toggleEntity(theEntity, myParameters, myConst);
 454   if (theEntity->type() == ENTITY_POINT)
 455     updateCoincident(theEntity);
 456 }
 457
 458 void PlaneGCSSolver_Storage::makeVariable(const EntityWrapperPtr& theEntity)
 459 {
 460   toggleEntity(theEntity, myConst, myParameters);
 461 }
 462
 463 static void getParametersToMove(const EntityWrapperPtr& theEntity, std::set<double*>& theParamList)
 464 {
 465   const std::list<ParameterWrapperPtr> aParams = theEntity->parameters();
 466   std::list<ParameterWrapperPtr>::const_iterator aPIt = aParams.begin();
 467   for (; aPIt != aParams.end(); ++aPIt)
 468     theParamList.insert(
 469         std::dynamic_pointer_cast<PlaneGCSSolver_ParameterWrapper>(*aPIt)->parameter());
 470
 471   const std::list<EntityWrapperPtr> aSubs = theEntity->subEntities();
 472   std::list<EntityWrapperPtr>::const_iterator aSIt = aSubs.begin();
 473
 474   if (theEntity->type() == ENTITY_ARC) {
 475     // workaround for the arc processing, because the arc is fixed by a set of constraints,
 476     // which will conflict with all parameters fixed:
 477     // 1. take center
 478     getParametersToMove(*aSIt++, theParamList);
 479     // 2. take start point
 480     getParametersToMove(*aSIt++, theParamList);
 481     // 3. skip end point, radius and start angle, but take end angle parameter
 482     getParametersToMove(*(++aSIt), theParamList);
 483   } else {
 484     for (; aSIt != aSubs.end(); ++aSIt)
 485       getParametersToMove(*aSIt, theParamList);
 486   }
 487 }
 488
 489 void PlaneGCSSolver_Storage::toggleEntity(
 490     const EntityWrapperPtr& theEntity, GCS::VEC_pD& theFrom, GCS::VEC_pD& theTo)
 491 {
 492   std::set<double*> aParamsToMove;
 493   getParametersToMove(theEntity, aParamsToMove);
 494
 495   GCS::VEC_pD::iterator anIt = theFrom.begin();
 496   while (anIt != theFrom.end()) {
 497     if (aParamsToMove.find(*anIt) == aParamsToMove.end()) {
 498       ++anIt;
 499       continue;
 500     }
 501
 502     theTo.push_back(*anIt);
 503     int aShift = int(anIt - theFrom.begin());
 504     theFrom.erase(anIt);
 505     anIt = theFrom.begin() + aShift;
 506   }
 507 }
 508
 509 void PlaneGCSSolver_Storage::updateCoincident(const EntityWrapperPtr& thePoint)
 510 {
 511   CoincidentPointsMap::iterator anIt = myCoincidentPoints.begin();
 512   for (; anIt != myCoincidentPoints.end(); ++anIt) {
 513     if (anIt->first == thePoint || anIt->second.find(thePoint) != anIt->second.end()) {
 514       std::set<EntityWrapperPtr> aCoincident = anIt->second;
 515       aCoincident.insert(anIt->first);
 516
 517       const std::list<ParameterWrapperPtr>& aBaseParams = thePoint->parameters();
 518       std::list<ParameterWrapperPtr> aParams;
 519       std::list<ParameterWrapperPtr>::const_iterator aBaseIt, anUpdIt;
 520
 521       std::set<EntityWrapperPtr>::const_iterator aCoincIt = aCoincident.begin();
 522       for (; aCoincIt != aCoincident.end(); ++aCoincIt)
 523         if (*aCoincIt != thePoint && (*aCoincIt)->group() != GID_OUTOFGROUP) {
 524           aParams = (*aCoincIt)->parameters();
 525           aBaseIt = aBaseParams.begin();
 526           for (anUpdIt = aParams.begin(); anUpdIt != aParams.end(); ++anUpdIt, ++aBaseIt)
 527             (*anUpdIt)->setValue((*aBaseIt)->value());
 528         }
 529
 530       break;
 531     }
 532   }
 533 }
 534
 535
 536 bool PlaneGCSSolver_Storage::isRedundant(
 537     GCSConstraintPtr theCheckedConstraint,
 538     ConstraintWrapperPtr theParentConstraint,
 539     std::list<std::set<double*> >& theCoincidentPoints) const
 540 {
 541   if (theParentConstraint->type() == CONSTRAINT_SYMMETRIC) {
 542     if (theCheckedConstraint->getTypeId() == GCS::Perpendicular) {
 543       BuilderPtr aBuilder = PlaneGCSSolver_Builder::getInstance();
 544       // check the initial point is placed on the mirror line
 545       std::list<EntityWrapperPtr> aSubs = theParentConstraint->entities();
 546       std::shared_ptr<GeomAPI_Pnt2d> aPoint = aBuilder->point(aSubs.front());
 547       std::shared_ptr<GeomAPI_Lin2d> aLine = aBuilder->line(aSubs.back());
 548       return aLine->distance(aPoint) < tolerance;
 549     }
 550   }
 551   else if (theParentConstraint->type() == CONSTRAINT_PT_PT_COINCIDENT) {
 552     // Verify that the coincidence between points is already added
 553     GCS::VEC_pD aParams = theCheckedConstraint->params();
 554
 555     std::list<std::set<double*> >::iterator aCoincIt, aFound1, aFound2;
 556     aFound1 = aFound2 = theCoincidentPoints.end();
 557     for (aCoincIt = theCoincidentPoints.begin(); aCoincIt != theCoincidentPoints.end(); ++aCoincIt) {
 558       if (aFound1 == theCoincidentPoints.end() && aCoincIt->find(aParams[0]) != aCoincIt->end())
 559         aFound1 = aCoincIt;
 560       if (aFound2 == theCoincidentPoints.end() && aCoincIt->find(aParams[1]) != aCoincIt->end())
 561         aFound2 = aCoincIt;
 562       if (aFound1 != theCoincidentPoints.end() && aFound2 != theCoincidentPoints.end())
 563         break;
 564     }
 565     if (aCoincIt != theCoincidentPoints.end()) { // both point are found
 566       if (aFound1 == aFound2)
 567         return true;
 568       // merge two groups of coincidence
 569       aFound1->insert(aFound2->begin(), aFound2->end());
 570       theCoincidentPoints.erase(aFound2);
 571     } else {
 572       if (aFound1 != theCoincidentPoints.end())
 573         aFound1->insert(aParams[1]);
 574       else if (aFound2 != theCoincidentPoints.end())
 575         aFound2->insert(aParams[0]);
 576       else {
 577         std::set<double*> aNewCoincidence;
 578         aNewCoincidence.insert(aParams[0]);
 579         aNewCoincidence.insert(aParams[1]);
 580         theCoincidentPoints.push_back(aNewCoincidence);
 581       }
 582     }
 583   }
 584
 585   return false;
 586 }
 587
 588 void PlaneGCSSolver_Storage::initializeSolver(SolverPtr theSolver)
 589 {
 590   std::shared_ptr<PlaneGCSSolver_Solver> aSolver =
 591       std::dynamic_pointer_cast<PlaneGCSSolver_Solver>(theSolver);
 592   if (!aSolver)
 593     return;
 594   aSolver->clear();
 595
 596   if (myExistArc)
 597     processArcs();
 598
 599   // initialize constraints
 600   std::map<ConstraintPtr, std::list<ConstraintWrapperPtr> >::const_iterator
 601       aCIt = myConstraintMap.begin();
 602   GCS::SET_I aTangentIDs;
 603   std::list<std::set<double*> > aCoincidentPoints;
 604   for (; aCIt != myConstraintMap.end(); ++aCIt) {
 605     std::list<ConstraintWrapperPtr>::const_iterator aCWIt = aCIt->second.begin();
 606     for (; aCWIt != aCIt->second.end(); ++ aCWIt) {
 607       std::shared_ptr<PlaneGCSSolver_ConstraintWrapper> aGCS =
 608           std::dynamic_pointer_cast<PlaneGCSSolver_ConstraintWrapper>(*aCWIt);
 609       std::list<GCSConstraintPtr>::const_iterator anIt = aGCS->constraints().begin();
 610       for (; anIt != aGCS->constraints().end(); ++anIt)
 611         if (!isRedundant(*anIt, aGCS, aCoincidentPoints))
 612           aSolver->addConstraint(*anIt);
 613     }
 614     // store IDs of tangent constraints to avoid incorrect report of redundant constraints
 615     if (aCIt->first && aCIt->first->getKind() == SketchPlugin_ConstraintTangent::ID())
 616       for (aCWIt = aCIt->second.begin(); aCWIt != aCIt->second.end(); ++ aCWIt)
 617         aTangentIDs.insert((int)(*aCWIt)->id());
 618   }
 619   // additional constraints for arcs
 620   std::map<EntityWrapperPtr, std::vector<GCSConstraintPtr> >::const_iterator
 621       anArcIt = myArcConstraintMap.begin();
 622   for (; anArcIt != myArcConstraintMap.end(); ++anArcIt) {
 623     std::vector<GCSConstraintPtr>::const_iterator anIt = anArcIt->second.begin();
 624     for (; anIt != anArcIt->second.end(); ++anIt)
 625       aSolver->addConstraint(*anIt);
 626   }
 627   // removed waste constraints
 628   std::list<GCSConstraintPtr>::const_iterator aRemIt = myRemovedConstraints.begin();
 629   for (; aRemIt != myRemovedConstraints.end(); ++aRemIt)
 630     aSolver->removeConstraint(*aRemIt);
 631   myRemovedConstraints.clear();
 632   // set list of tangent constraints
 633   aSolver->setTangent(aTangentIDs);
 634   // initialize unknowns
 635   aSolver->setParameters(myParameters);
 636 }
 637
 638 void PlaneGCSSolver_Storage::refresh(bool theFixedOnly) const
 639 {
 640   //blockEvents(true);
 641
 642   std::map<AttributePtr, EntityWrapperPtr>::const_iterator anIt = myAttributeMap.begin();
 643   std::list<ParameterWrapperPtr> aParams;
 644   std::list<ParameterWrapperPtr>::const_iterator aParIt;
 645   for (; anIt != myAttributeMap.end(); ++anIt) {
 646     // the external feature always should keep the up to date values, so,
 647     // refresh from the solver is never needed
 648     bool isExternal = false;
 649     if (anIt->first.get()) {
 650       std::shared_ptr<SketchPlugin_Feature> aSketchFeature =
 651         std::dynamic_pointer_cast<SketchPlugin_Feature>(anIt->first->owner());
 652       if (aSketchFeature.get() && aSketchFeature->isExternal())
 653         isExternal = true;
 654     }
 655
 656     // update parameter wrappers and obtain values of attributes
 657     aParams = anIt->second->parameters();
 658     double aCoords[3];
 659     bool isUpd[3] = {false};
 660     int i = 0;
 661     for (aParIt = aParams.begin(); i < 3 && aParIt != aParams.end(); ++aParIt, ++i) {
 662       if (!theFixedOnly || isExternal ||
 663           (*aParIt)->group() == GID_OUTOFGROUP || (*aParIt)->isParametric()) {
 664         aCoords[i] = (*aParIt)->value();
 665         isUpd[i] = true;
 666       }
 667     }
 668     if (!isUpd[0] && !isUpd[1] && !isUpd[2])
 669       continue; // nothing is updated
 670
 671     std::shared_ptr<GeomDataAPI_Point2D> aPoint2D =
 672         std::dynamic_pointer_cast<GeomDataAPI_Point2D>(anIt->first);
 673     if (aPoint2D) {
 674       if ((isUpd[0] && fabs(aPoint2D->x() - aCoords[0]) > tolerance) ||
 675           (isUpd[1] && fabs(aPoint2D->y() - aCoords[1]) > tolerance) || isExternal) {
 676         if (!isUpd[0] || isExternal) aCoords[0] = aPoint2D->x();
 677         if (!isUpd[1] || isExternal) aCoords[1] = aPoint2D->y();
 678         aPoint2D->setValue(aCoords[0], aCoords[1]);
 679         // Find points coincident with this one (probably not in GID_OUTOFGROUP)
 680         CoincidentPointsMap::const_iterator aCoincIt = myCoincidentPoints.begin();
 681         for (; aCoincIt != myCoincidentPoints.end(); ++aCoincIt)
 682           if (aCoincIt->first == anIt->second ||
 683               aCoincIt->second.find(anIt->second) != aCoincIt->second.end())
 684             break;
 685         if (aCoincIt != myCoincidentPoints.end()) {
 686           aPoint2D = std::dynamic_pointer_cast<GeomDataAPI_Point2D>(
 687               aCoincIt->first->baseAttribute());
 688           if (aPoint2D)
 689             aPoint2D->setValue(aCoords[0], aCoords[1]);
 690           std::set<EntityWrapperPtr>::const_iterator aSlaveIt = aCoincIt->second.begin();
 691           for (; aSlaveIt != aCoincIt->second.end(); ++aSlaveIt) {
 692             aPoint2D = std::dynamic_pointer_cast<GeomDataAPI_Point2D>((*aSlaveIt)->baseAttribute());
 693             if (aPoint2D)
 694               aPoint2D->setValue(aCoords[0], aCoords[1]);
 695           }
 696         }
 697       }
 698       continue;
 699     }
 700     AttributeDoublePtr aScalar = std::dynamic_pointer_cast<ModelAPI_AttributeDouble>(anIt->first);
 701     if (aScalar && !isExternal) {
 702       if (isUpd[0] && fabs(aScalar->value() - aCoords[0]) > tolerance)
 703         aScalar->setValue(aCoords[0]);
 704       continue;
 705     }
 706   }
 707
 708   //blockEvents(false);
 709 }
 710
 711 EntityWrapperPtr PlaneGCSSolver_Storage::calculateMiddlePoint(
 712     EntityWrapperPtr theBase, double theCoeff)
 713 {
 714   std::shared_ptr<PlaneGCSSolver_Builder> aBuilder =
 715       std::dynamic_pointer_cast<PlaneGCSSolver_Builder>(PlaneGCSSolver_Builder::getInstance());
 716
 717   std::shared_ptr<GeomAPI_XY> aMidPoint;
 718   if (theBase->type() == ENTITY_LINE) {
 719     std::shared_ptr<GeomAPI_Pnt2d> aPoints[2];
 720     const std::list<EntityWrapperPtr>& aSubs = theBase->subEntities();
 721     std::list<EntityWrapperPtr>::const_iterator anIt = aSubs.begin();
 722     for (int i = 0; i < 2; ++i, ++anIt)
 723       aPoints[i] = aBuilder->point(*anIt);
 724     aMidPoint = aPoints[0]->xy()->multiplied(1.0 - theCoeff)->added(
 725         aPoints[1]->xy()->multiplied(theCoeff));
 726   }
 727   else if (theBase->type() == ENTITY_ARC) {
 728     double theX, theY;
 729     double anArcPoint[3][2];
 730     const std::list<EntityWrapperPtr>& aSubs = theBase->subEntities();
 731     std::list<EntityWrapperPtr>::const_iterator anIt = aSubs.begin();
 732     for (int i = 0; i < 3; ++i, ++anIt) {
 733       std::shared_ptr<GeomAPI_Pnt2d> aPoint = aBuilder->point(*anIt);
 734       anArcPoint[i][0] = aPoint->x();
 735       anArcPoint[i][1] = aPoint->y();
 736     }
 737     // project last point of arc on the arc
 738     double x = anArcPoint[1][0] - anArcPoint[0][0];
 739     double y = anArcPoint[1][1] - anArcPoint[0][1];
 740     double aRad = sqrt(x*x + y*y);
 741     x = anArcPoint[2][0] - anArcPoint[0][0];
 742     y = anArcPoint[2][1] - anArcPoint[0][1];
 743     double aNorm = sqrt(x*x + y*y);
 744     if (aNorm >= tolerance) {
 745       anArcPoint[2][0] = x * aRad / aNorm;
 746       anArcPoint[2][1] = y * aRad / aNorm;
 747     }
 748     anArcPoint[1][0] -= anArcPoint[0][0];
 749     anArcPoint[1][1] -= anArcPoint[0][1];
 750     if (theCoeff < tolerance) {
 751       theX = anArcPoint[0][0] + anArcPoint[1][0];
 752       theY = anArcPoint[0][1] + anArcPoint[1][1];
 753     } else if (1 - theCoeff < tolerance) {
 754       theX = anArcPoint[0][0] + anArcPoint[2][0];
 755       theY = anArcPoint[0][1] + anArcPoint[2][1];
 756     } else {
 757       std::shared_ptr<GeomAPI_Dir2d> aStartDir(new GeomAPI_Dir2d(anArcPoint[1][0], anArcPoint[1][1]));
 758       std::shared_ptr<GeomAPI_Dir2d> aEndDir(new GeomAPI_Dir2d(anArcPoint[2][0], anArcPoint[2][1]));
 759       double anAngle = aStartDir->angle(aEndDir);
 760       if (anAngle < 0)
 761         anAngle += 2.0 * PI;
 762       anAngle *= theCoeff;
 763       double aCos = cos(anAngle);
 764       double aSin = sin(anAngle);
 765       theX = anArcPoint[0][0] + anArcPoint[1][0] * aCos - anArcPoint[1][1] * aSin;
 766       theY = anArcPoint[0][1] + anArcPoint[1][0] * aSin + anArcPoint[1][1] * aCos;
 767     }
 768     aMidPoint = std::shared_ptr<GeomAPI_XY>(new GeomAPI_XY(theX, theY));
 769   }
 770
 771   if (!aMidPoint)
 772     return EntityWrapperPtr();
 773
 774   std::list<ParameterWrapperPtr> aParameters;
 775   aParameters.push_back(aBuilder->createParameter(myGroupID, aMidPoint->x()));
 776   aParameters.push_back(aBuilder->createParameter(myGroupID, aMidPoint->y()));
 777   // Create entity (parameters are not filled)
 778   GCSPointPtr aPnt(new GCS::Point);
 779   aPnt->x = std::dynamic_pointer_cast<PlaneGCSSolver_ParameterWrapper>(aParameters.front())->parameter();
 780   aPnt->y = std::dynamic_pointer_cast<PlaneGCSSolver_ParameterWrapper>(aParameters.back())->parameter();
 781
 782   EntityWrapperPtr aResult(new PlaneGCSSolver_PointWrapper(AttributePtr(), aPnt));
 783   aResult->setGroup(myGroupID);
 784   aResult->setParameters(aParameters);
 785
 786   update(aResult);
 787   return aResult;
 788 }