X-Git-Url: http://git.salome-platform.org/gitweb/?a=blobdiff_plain;ds=sidebyside;f=src%2FSketchSolver%2FSketchSolver_Storage.cpp;h=c63d28e437a662c61818cf2c85b400e6f0f3516d;hb=9fb3a575c3b7585b7789c48e8fbfa1db8619a173;hp=9dbf54f0c6aa5bbdd166a615460cc2f63c9e201c;hpb=e9f48e35e26dfce648e2f6ecbe1e43c51ba32a7e;p=modules%2Fshaper.git diff --git a/src/SketchSolver/SketchSolver_Storage.cpp b/src/SketchSolver/SketchSolver_Storage.cpp index 9dbf54f0c..c63d28e43 100644 --- a/src/SketchSolver/SketchSolver_Storage.cpp +++ b/src/SketchSolver/SketchSolver_Storage.cpp @@ -1,446 +1,722 @@ // Copyright (C) 2014-20xx CEA/DEN, EDF R&D // File: SketchSolver_Storage.cpp -// Created: 18 Mar 2015 +// Created: 30 Nov 2015 // Author: Artem ZHIDKOV #include +#include -#include +#include +#include +#include +#include +#include +#include +#include +#include +#include -/** \brief Search the entity/parameter with specified ID in the list of elements - * \param[in] theEntityID unique ID of the element - * \param[in] theEntities list of elements - * \return position of the found element or -1 if the element is not found - */ -template -static int Search(const uint32_t& theEntityID, const std::vector& theEntities); -/// \brief Compare two parameters to be different -static bool IsNotEqual(const Slvs_Param& theParam1, const Slvs_Param& theParam2); -/// \brief Compare two entities to be different -static bool IsNotEqual(const Slvs_Entity& theEntity1, const Slvs_Entity& theEntity2); -/// \brief Compare two constriants to be different -static bool IsNotEqual(const Slvs_Constraint& theConstraint1, const Slvs_Constraint& theConstraint2); +/// \brief Verify two vectors of constraints are equal. +/// Vectors differ by the order of elements are equal. +static bool isEqual(const std::list& theCVec1, + const std::list& theCVec2); -SketchSolver_Storage::SketchSolver_Storage() - : myParamMaxID(SLVS_E_UNKNOWN), - myEntityMaxID(SLVS_E_UNKNOWN), - myConstrMaxID(SLVS_C_UNKNOWN), - myFixed(SLVS_E_UNKNOWN), - myNeedToResolve(false) +void SketchSolver_Storage::addConstraint(ConstraintPtr theConstraint, + ConstraintWrapperPtr theSolverConstraint) { + if (theSolverConstraint) { + std::list aConstrList(1, theSolverConstraint); + addConstraint(theConstraint, aConstrList); + } else + addConstraint(theConstraint, std::list()); } -Slvs_hParam SketchSolver_Storage::addParameter(const Slvs_Param& theParam) +void SketchSolver_Storage::addConstraint( + ConstraintPtr theConstraint, + std::list theSolverConstraints) { - if (theParam.h > 0 && theParam.h <= myParamMaxID) { - // parameter is already used, rewrite it - return updateParameter(theParam); - } - - Slvs_Param aParam = theParam; - if (aParam.h > myParamMaxID) - myParamMaxID = aParam.h; - else - aParam.h = ++myParamMaxID; - myParameters.push_back(aParam); - myNeedToResolve = true; - return aParam.h; -} - -Slvs_hParam SketchSolver_Storage::updateParameter(const Slvs_Param& theParam) -{ - if (theParam.h > 0 && theParam.h <= myParamMaxID) { - // parameter already used, rewrite it - int aPos = Search(theParam.h, myParameters); - if (aPos >= 0 && aPos < (int)myParameters.size()) { - myNeedToResolve = myNeedToResolve || IsNotEqual(myParameters[aPos], theParam); - myParameters[aPos] = theParam; - return theParam.h; + std::map >::const_iterator + aFound = myConstraintMap.find(theConstraint); + if (aFound == myConstraintMap.end() || !isEqual(aFound->second, theSolverConstraints)) + setNeedToResolve(true); + + if (theSolverConstraints.empty()) { + // constraint links to the empty list, add its attributes linked to the empty entities + std::list aRefAttrs = + theConstraint->data()->attributes(ModelAPI_AttributeRefAttr::typeId()); + std::list::const_iterator anAttrIt = aRefAttrs.begin(); + for (; anAttrIt != aRefAttrs.end(); ++anAttrIt) { + AttributeRefAttrPtr aRef = std::dynamic_pointer_cast(*anAttrIt); + if (aRef->isObject()) { + FeaturePtr aFeature = ModelAPI_Feature::feature(aRef->object()); + if (aFeature) addEntity(aFeature, EntityWrapperPtr()); + } else + addEntity(aRef->attr(), EntityWrapperPtr()); + } + std::list aRefLists = + theConstraint->data()->attributes(ModelAPI_AttributeRefList::typeId()); + for (anAttrIt = aRefLists.begin(); anAttrIt != aRefLists.end(); ++anAttrIt) { + AttributeRefListPtr aRef = std::dynamic_pointer_cast(*anAttrIt); + std::list anObj = aRef->list(); + std::list::iterator anIt = anObj.begin(); + for (; anIt != anObj.end(); ++anIt) { + FeaturePtr aFeature = ModelAPI_Feature::feature(*anIt); + if (aFeature) addEntity(aFeature, EntityWrapperPtr()); + } } } + else if (theSolverConstraints.front()->type() != CONSTRAINT_PT_PT_COINCIDENT) { + // Do not add point-point coincidence, because it is already made by setting + // the same parameters for both points + std::list::iterator aCIt = theSolverConstraints.begin(); + for (; aCIt != theSolverConstraints.end(); ++aCIt) + update(*aCIt); + } - // Parameter is not found, add new one - Slvs_Param aParam = theParam; - aParam.h = 0; - return addParameter(aParam); + if (!theSolverConstraints.empty() || aFound == myConstraintMap.end()) + myConstraintMap[theConstraint] = theSolverConstraints; + // block events if necessary + if (myEventsBlocked && theConstraint && theConstraint->data() && theConstraint->data()->isValid()) + theConstraint->data()->blockSendAttributeUpdated(myEventsBlocked); } -bool SketchSolver_Storage::removeParameter(const Slvs_hParam& theParamID) +static std::list pointAttributes(FeaturePtr theFeature) { - int aPos = Search(theParamID, myParameters); - if (aPos >= 0 && aPos < (int)myParameters.size()) { - // Firstly, search the parametes is not used elsewhere - std::vector::const_iterator anEntIter = myEntities.begin(); - for (; anEntIter != myEntities.end(); anEntIter++) { - for (int i = 0; i < 4; i++) - if (anEntIter->param[i] == theParamID) - return false; - } - // Remove parameter - myParameters.erase(myParameters.begin() + aPos); - myParamMaxID = myParameters.empty() ? SLVS_E_UNKNOWN : myParameters.back().h; - myNeedToResolve = true; - myRemovedParameters.insert(theParamID); - return true; + std::list aPoints; + if (theFeature->getKind() == SketchPlugin_Arc::ID()) { + aPoints.push_back(theFeature->attribute(SketchPlugin_Arc::CENTER_ID())); + aPoints.push_back(theFeature->attribute(SketchPlugin_Arc::START_ID())); + aPoints.push_back(theFeature->attribute(SketchPlugin_Arc::END_ID())); } - return false; + else if (theFeature->getKind() == SketchPlugin_Circle::ID()) + aPoints.push_back(theFeature->attribute(SketchPlugin_Circle::CENTER_ID())); + else if (theFeature->getKind() == SketchPlugin_Line::ID()) { + aPoints.push_back(theFeature->attribute(SketchPlugin_Line::START_ID())); + aPoints.push_back(theFeature->attribute(SketchPlugin_Line::END_ID())); + } + else if (theFeature->getKind() == SketchPlugin_Point::ID() || + theFeature->getKind() == SketchPlugin_IntersectionPoint::ID()) + aPoints.push_back(theFeature->attribute(SketchPlugin_Point::COORD_ID())); + return aPoints; } -const Slvs_Param& SketchSolver_Storage::getParameter(const Slvs_hParam& theParamID) const +void SketchSolver_Storage::addEntity(FeaturePtr theFeature, + EntityWrapperPtr theSolverEntity) { - int aPos = Search(theParamID, myParameters); - if (aPos >= 0 && aPos < (int)myParameters.size()) - return myParameters[aPos]; + std::map::const_iterator aFound = myFeatureMap.find(theFeature); + if (aFound == myFeatureMap.end() || !aFound->second || + (theSolverEntity && !aFound->second->isEqual(theSolverEntity))) + setNeedToResolve(true); // the entity is new or modified + + if (!theSolverEntity) { + // feature links to the empty entity, add its attributes + std::list aPntAttrs = pointAttributes(theFeature); + std::list::const_iterator anAttrIt = aPntAttrs.begin(); + for (; anAttrIt != aPntAttrs.end(); ++anAttrIt) + addEntity(*anAttrIt, EntityWrapperPtr()); + if (aFound == myFeatureMap.end()) + myFeatureMap[theFeature] = theSolverEntity; + } else + myFeatureMap[theFeature] = theSolverEntity; + + // block events if necessary + if (myEventsBlocked && theFeature->data() && theFeature->data()->isValid()) + theFeature->data()->blockSendAttributeUpdated(myEventsBlocked); +} - // Parameter is not found, return empty object - static Slvs_Param aDummy; - aDummy.h = 0; - return aDummy; +void SketchSolver_Storage::addEntity(AttributePtr theAttribute, + EntityWrapperPtr theSolverEntity) +{ + std::map::const_iterator aFound = myAttributeMap.find(theAttribute); + if (aFound == myAttributeMap.end() || !aFound->second || + (theSolverEntity && !aFound->second->isEqual(theSolverEntity))) + setNeedToResolve(true); // the entity is new or modified + + if (theSolverEntity || aFound == myAttributeMap.end()) + myAttributeMap[theAttribute] = theSolverEntity; + // block events if necessary + if (myEventsBlocked && theAttribute->owner() && + theAttribute->owner()->data() && theAttribute->owner()->data()->isValid()) + theAttribute->owner()->data()->blockSendAttributeUpdated(myEventsBlocked); } -Slvs_hEntity SketchSolver_Storage::addEntity(const Slvs_Entity& theEntity) +bool SketchSolver_Storage::update(FeaturePtr theFeature, const GroupID& theGroup) { - if (theEntity.h > 0 && theEntity.h <= myEntityMaxID) { - // Entity is already used, rewrite it - return updateEntity(theEntity); - } - - Slvs_Entity aEntity = theEntity; - if (aEntity.h > myEntityMaxID) - myEntityMaxID = aEntity.h; - else - aEntity.h = ++myEntityMaxID; - myEntities.push_back(aEntity); - myNeedToResolve = true; - return aEntity.h; -} - -Slvs_hEntity SketchSolver_Storage::updateEntity(const Slvs_Entity& theEntity) -{ - if (theEntity.h > 0 && theEntity.h <= myEntityMaxID) { - // Entity already used, rewrite it - int aPos = Search(theEntity.h, myEntities); - if (aPos >= 0 && aPos < (int)myEntities.size()) { - myNeedToResolve = myNeedToResolve || IsNotEqual(myEntities[aPos], theEntity); - myEntities[aPos] = theEntity; - return theEntity.h; + bool isUpdated = false; + EntityWrapperPtr aRelated = entity(theFeature); + if (!aRelated) { // Feature is not exist, create it + std::list aSubs; + // Reserve the feature in the map of features (do not want to add several copies of it) + myFeatureMap[theFeature] = aRelated; + // Firstly, create/update its attributes + std::list anAttrs = pointAttributes(theFeature); + std::list::const_iterator anIt = anAttrs.begin(); + for (; anIt != anAttrs.end(); ++anIt) { + isUpdated = update(*anIt, theGroup) || isUpdated; + aSubs.push_back(entity(*anIt)); } - } - - // Entity is not found, add new one - Slvs_Entity aEntity = theEntity; - aEntity.h = 0; - return addEntity(aEntity); -} - -bool SketchSolver_Storage::removeEntity(const Slvs_hEntity& theEntityID) -{ - bool aResult = true; - int aPos = Search(theEntityID, myEntities); - if (aPos >= 0 && aPos < (int)myEntities.size()) { - // Firstly, check the entity is not used elsewhere - std::vector::const_iterator anEntIter = myEntities.begin(); - for (; anEntIter != myEntities.end(); anEntIter++) { - for (int i = 0; i < 4; i++) - if (anEntIter->point[i] == theEntityID) - return false; - if (anEntIter->distance == theEntityID) - return false; + // If the feature is a circle, add its radius as a sub + if (theFeature->getKind() == SketchPlugin_Circle::ID()) { + AttributePtr aRadius = theFeature->attribute(SketchPlugin_Circle::RADIUS_ID()); + isUpdated = update(aRadius, theGroup) || isUpdated; + aSubs.push_back(entity(aRadius)); } - std::vector::const_iterator aConstrIter = myConstraints.begin(); - for (; aConstrIter != myConstraints.end(); aConstrIter++) { - Slvs_hEntity anEntIDs[6] = {aConstrIter->ptA, aConstrIter->ptB, - aConstrIter->entityA, aConstrIter->entityB, - aConstrIter->entityC, aConstrIter->entityD}; - for (int i = 0; i < 6; i++) - if (anEntIDs[i] == theEntityID) - return false; + // If the feature if circle or arc, we need to add normal of the sketch to the list of subs + if (theFeature->getKind() == SketchPlugin_Arc::ID() || + theFeature->getKind() == SketchPlugin_Circle::ID()) { + EntityWrapperPtr aNormal = getNormal(); + if (aNormal) aSubs.push_back(aNormal); } - // The entity is not used, remove it and its parameters - Slvs_Entity anEntity = myEntities[aPos]; - myEntities.erase(myEntities.begin() + aPos); - myEntityMaxID = myEntities.empty() ? SLVS_E_UNKNOWN : myEntities.back().h; - if (anEntity.distance != SLVS_E_UNKNOWN) - aResult = aResult && removeParameter(anEntity.distance); - for (int i = 0; i < 4; i++) - if (anEntity.param[i] != SLVS_E_UNKNOWN) - aResult = removeParameter(anEntity.param[i]) && aResult; - for (int i = 0; i < 4; i++) - if (anEntity.point[i] != SLVS_E_UNKNOWN) - aResult = removeEntity(anEntity.point[i]) && aResult; - myNeedToResolve = true; - myRemovedEntities.insert(theEntityID); - if (anEntity.type == SLVS_E_POINT_IN_2D || anEntity.type == SLVS_E_POINT_IN_3D) - removeCoincidentPoint(theEntityID); + // Secondly, convert feature + BuilderPtr aBuilder = SketchSolver_Manager::instance()->builder(); + GroupID aGroup = theGroup != GID_UNKNOWN ? theGroup : myGroupID; + // Check external feature + std::shared_ptr aSketchFeature = + std::dynamic_pointer_cast(theFeature); + if (aSketchFeature && aSketchFeature->isExternal()) + aGroup = GID_OUTOFGROUP; + aRelated = aBuilder->createFeature(theFeature, aSubs, aGroup); + if (!aRelated) + return false; + addEntity(theFeature, aRelated); + } else if (theGroup != GID_UNKNOWN) + changeGroup(aRelated, theGroup); + return update(aRelated) || isUpdated; +} + +bool SketchSolver_Storage::update(AttributePtr theAttribute, const GroupID& theGroup) +{ + AttributePtr anAttribute = theAttribute; + AttributeRefAttrPtr aRefAttr = std::dynamic_pointer_cast(anAttribute); + if (aRefAttr) { + if (aRefAttr->isObject()) { + FeaturePtr aFeature = ModelAPI_Feature::feature(aRefAttr->object()); + return update(aFeature, theGroup); + } else + anAttribute = aRefAttr->attr(); } - return aResult; + + EntityWrapperPtr aRelated = entity(anAttribute); + if (!aRelated) { // Attribute is not exist, create it + // verify the attribute is a point of arc and add whole arc + if (anAttribute->owner()) { + FeaturePtr aFeature = ModelAPI_Feature::feature(anAttribute->owner()); + if (aFeature->getKind() == SketchPlugin_Arc::ID() && + myFeatureMap.find(aFeature) == myFeatureMap.end()) { + // Additional checking that all attributes are initialized + if (aFeature->attribute(SketchPlugin_Arc::CENTER_ID())->isInitialized() && + aFeature->attribute(SketchPlugin_Arc::START_ID())->isInitialized() && + aFeature->attribute(SketchPlugin_Arc::END_ID())->isInitialized()) { + return SketchSolver_Storage::update(aFeature); + } else { + myFeatureMap[aFeature] = EntityWrapperPtr(); + myExistArc = true; + } + } + } + BuilderPtr aBuilder = SketchSolver_Manager::instance()->builder(); + GroupID aGroup = theGroup != GID_UNKNOWN ? theGroup : myGroupID; + // Check attribute of external features + std::shared_ptr aSketchFeature = + std::dynamic_pointer_cast(theAttribute->owner()); + if (aSketchFeature && aSketchFeature->isExternal()) + aGroup = GID_OUTOFGROUP; + aRelated = aBuilder->createAttribute(anAttribute, aGroup); + if (!aRelated) + return false; + addEntity(anAttribute, aRelated); + } else if (theGroup != GID_UNKNOWN) + changeGroup(aRelated, theGroup); + return update(aRelated); } -const Slvs_Entity& SketchSolver_Storage::getEntity(const Slvs_hEntity& theEntityID) const + + +const std::list& SketchSolver_Storage::constraint( + const ConstraintPtr& theConstraint) const { - int aPos = Search(theEntityID, myEntities); - if (aPos >= 0 && aPos < (int)myEntities.size()) - return myEntities[aPos]; + static std::list aDummy; - // Entity is not found, return empty object - static Slvs_Entity aDummy; - aDummy.h = 0; + std::map>::const_iterator + aFound = myConstraintMap.find(theConstraint); + if (aFound != myConstraintMap.end()) + return aFound->second; return aDummy; } -Slvs_hConstraint SketchSolver_Storage::isPointFixed(const Slvs_hEntity& thePointID) const +const EntityWrapperPtr& SketchSolver_Storage::entity(const FeaturePtr& theFeature) const { - // Search the set of coincident points - std::vector< std::set >::const_iterator aCPIter = myCoincidentPoints.begin(); - for (; aCPIter != myCoincidentPoints.end(); aCPIter++) - if (aCPIter->find(thePointID) != aCPIter->end()) - break; - if (aCPIter == myCoincidentPoints.end()) { - std::vector::const_iterator aConstrIter = myConstraints.begin(); - for (; aConstrIter != myConstraints.end(); aConstrIter++) - if (aConstrIter->type == SLVS_C_WHERE_DRAGGED && - aConstrIter->ptA == thePointID) - return aConstrIter->h; - return SLVS_E_UNKNOWN; - } + static EntityWrapperPtr aDummy; - // Search the Rigid constraint - std::vector::const_iterator aConstrIter = myConstraints.begin(); - for (; aConstrIter != myConstraints.end(); aConstrIter++) - if (aConstrIter->type == SLVS_C_WHERE_DRAGGED && - aCPIter->find(aConstrIter->ptA) != aCPIter->end()) - return aConstrIter->h; - return SLVS_E_UNKNOWN; + std::map::const_iterator aFound = myFeatureMap.find(theFeature); + if (aFound != myFeatureMap.end()) + return aFound->second; + return aDummy; } - -Slvs_hConstraint SketchSolver_Storage::addConstraint(const Slvs_Constraint& theConstraint) +const EntityWrapperPtr& SketchSolver_Storage::entity(const AttributePtr& theAttribute) const { - if (theConstraint.h > 0 && theConstraint.h <= myConstrMaxID) { - // Constraint is already used, rewrite it - return updateConstraint(theConstraint); + static EntityWrapperPtr aDummy; + + std::map::const_iterator + aFound = myAttributeMap.find(theAttribute); + if (aFound != myAttributeMap.end()) + return aFound->second; + + AttributeRefAttrPtr aRefAttr = + std::dynamic_pointer_cast(theAttribute); + if (aRefAttr) { + if (aRefAttr->isObject()) { + FeaturePtr aFeature = ModelAPI_Feature::feature(aRefAttr->object()); + return entity(aFeature); + } else + return entity(aRefAttr->attr()); } + return aDummy; +} - Slvs_Constraint aConstraint = theConstraint; - if (aConstraint.h > myConstrMaxID) - myConstrMaxID = aConstraint.h; - else - aConstraint.h = ++myConstrMaxID; - myConstraints.push_back(aConstraint); - myNeedToResolve = true; - if (aConstraint.type == SLVS_C_POINTS_COINCIDENT) - addCoincidentPoints(aConstraint.ptA, aConstraint.ptB); - return aConstraint.h; -} - -Slvs_hConstraint SketchSolver_Storage::updateConstraint(const Slvs_Constraint& theConstraint) -{ - if (theConstraint.h > 0 && theConstraint.h <= myConstrMaxID) { - // Constraint already used, rewrite it - int aPos = Search(theConstraint.h, myConstraints); - if (aPos >= 0 && aPos < (int)myConstraints.size()) { - myNeedToResolve = myNeedToResolve || IsNotEqual(myConstraints[aPos], theConstraint); - myConstraints[aPos] = theConstraint; - if (theConstraint.type == SLVS_C_POINTS_COINCIDENT) - addCoincidentPoints(theConstraint.ptA, theConstraint.ptB); - return theConstraint.h; +bool SketchSolver_Storage::removeConstraint(ConstraintPtr theConstraint) +{ + std::map >::iterator + aFound = myConstraintMap.find(theConstraint); + if (aFound == myConstraintMap.end()) + return true; // no constraint, already deleted + + // Remove constraint + std::list aConstrList = aFound->second; + myConstraintMap.erase(aFound); + // Remove SolveSpace constraints + bool isFullyRemoved = true; + std::list::iterator anIt = aConstrList.begin(); + while (anIt != aConstrList.end()) { + if (remove(*anIt)) { + std::list::iterator aRemoveIt = anIt++; + aConstrList.erase(aRemoveIt); + } else { + isFullyRemoved = false; + ++anIt; } } + return isFullyRemoved; +} - // Constraint is not found, add new one - Slvs_Constraint aConstraint = theConstraint; - aConstraint.h = 0; - return addConstraint(aConstraint); -} - -bool SketchSolver_Storage::removeConstraint(const Slvs_hConstraint& theConstraintID) -{ - bool aResult = true; - int aPos = Search(theConstraintID, myConstraints); - if (aPos >= 0 && aPos < (int)myConstraints.size()) { - Slvs_Constraint aConstraint = myConstraints[aPos]; - myConstraints.erase(myConstraints.begin() + aPos); - myConstrMaxID = myConstraints.empty() ? SLVS_E_UNKNOWN : myConstraints.back().h; - myNeedToResolve = true; - myRemovedConstraints.insert(theConstraintID); - // Remove all entities - Slvs_hEntity anEntities[6] = {aConstraint.ptA, aConstraint.ptB, - aConstraint.entityA, aConstraint.entityB, - aConstraint.entityC, aConstraint.entityD}; - for (int i = 0; i < 6; i++) - if (anEntities[i] != SLVS_E_UNKNOWN) - aResult = removeEntity(anEntities[i]) && aResult; - // remove temporary fixed point, if available - if (myFixed == theConstraintID) - myFixed = SLVS_E_UNKNOWN; +template +static bool isUsed(ConstraintWrapperPtr theConstraint, ENT_TYPE theEntity) +{ + if (!theConstraint || !theEntity) + return false; + std::list::const_iterator anEntIt = theConstraint->entities().begin(); + for (; anEntIt != theConstraint->entities().end(); ++anEntIt) + if ((*anEntIt)->isBase(theEntity)) + return true; + return false; +} + +static bool isUsed(EntityWrapperPtr theFeature, AttributePtr theSubEntity) +{ + if (!theFeature || !theSubEntity) + return false; + std::list::const_iterator aSubIt = theFeature->subEntities().begin(); + for (; aSubIt != theFeature->subEntities().end(); ++aSubIt) + if ((*aSubIt)->isBase(theSubEntity)) + return true; + return false; +} + +static bool isUsed(ConstraintPtr theConstraint, AttributePtr theAttribute) +{ + if (!theConstraint || !theAttribute) + return false; + std::list anAttrList = theConstraint->data()->attributes(std::string()); + std::list::const_iterator anIt = anAttrList.begin(); + for (; anIt != anAttrList.end(); ++anIt) { + if (*anIt == theAttribute) + return true; + AttributeRefAttrPtr aRefAttr = std::dynamic_pointer_cast(*anIt); + if (aRefAttr && !aRefAttr->isObject() && aRefAttr->attr() == theAttribute) + return true; } - return aResult; + return false; +} + +bool SketchSolver_Storage::isUsed(FeaturePtr theFeature) const +{ + if (myFeatureMap.find(theFeature) != myFeatureMap.end()) + return true; + // check constraints + std::map >::const_iterator + aCIt = myConstraintMap.begin(); + std::list::const_iterator aCWIt; + for (; aCIt != myConstraintMap.end(); ++aCIt) + for (aCWIt = aCIt->second.begin(); aCWIt != aCIt->second.end(); ++aCWIt) + if (::isUsed(*aCWIt, theFeature)) + return true; + // check attributes + std::list anAttrList = pointAttributes(theFeature); + std::list::const_iterator anIt = anAttrList.begin(); + for (; anIt != anAttrList.end(); ++anIt) + if (isUsed(*anIt)) + return true; + return false; } -const Slvs_Constraint& SketchSolver_Storage::getConstraint(const Slvs_hConstraint& theConstraintID) const +bool SketchSolver_Storage::isUsed(AttributePtr theAttribute) const { - int aPos = Search(theConstraintID, myConstraints); - if (aPos >= 0 && aPos < (int)myConstraints.size()) - return myConstraints[aPos]; + AttributePtr anAttribute = theAttribute; + AttributeRefAttrPtr aRefAttr = std::dynamic_pointer_cast(anAttribute); + if (aRefAttr) { + if (aRefAttr->isObject()) + return isUsed(ModelAPI_Feature::feature(aRefAttr->object())); + else + anAttribute = aRefAttr->attr(); + } - // Constraint is not found, return empty object - static Slvs_Constraint aDummy; - aDummy.h = 0; - return aDummy; + if (myAttributeMap.find(theAttribute) != myAttributeMap.end()) + return true; + // check in constraints + std::map >::const_iterator + aCIt = myConstraintMap.begin(); + std::list::const_iterator aCWIt; + for (; aCIt != myConstraintMap.end(); ++aCIt) { + for (aCWIt = aCIt->second.begin(); aCWIt != aCIt->second.end(); ++aCWIt) + if (::isUsed(*aCWIt, anAttribute)) + return true; + // Additional check for the Fixed constraints, which have no wrapper associated. + if (aCIt->first->getKind() == SketchPlugin_ConstraintRigid::ID() && + ::isUsed(aCIt->first, anAttribute)) + return true; + } + // check in features + std::map::const_iterator aFIt = myFeatureMap.begin(); + for (; aFIt != myFeatureMap.end(); ++aFIt) + if (::isUsed(aFIt->second, anAttribute)) + return true; + return false; } -void SketchSolver_Storage::addTemporaryConstraint(const Slvs_hConstraint& theConstraintID) + +bool SketchSolver_Storage::removeEntity(FeaturePtr theFeature) { - if (myFixed != SLVS_E_UNKNOWN) - return; // the point is already fixed - int aPos = Search(theConstraintID, myConstraints); - if (aPos >= 0 && aPos < (int)myConstraints.size()) - myFixed = theConstraintID; + std::map::iterator aFound = myFeatureMap.find(theFeature); + if (aFound == myFeatureMap.end()) + return true; // feature not found, nothing to delete + + EntityWrapperPtr anEntity = aFound->second; + myFeatureMap.erase(aFound); + + // Check if the feature is not used by constraints, remove it + if (!anEntity || (!isUsed(theFeature) && remove(anEntity))) + return true; + + // feature is not removed, revert operation + myFeatureMap[theFeature] = anEntity; + update(anEntity); + return false; } -void SketchSolver_Storage::getRemoved( - std::set& theParameters, - std::set& theEntities, - std::set& theConstraints) +bool SketchSolver_Storage::removeEntity(AttributePtr theAttribute) { - theParameters = myRemovedParameters; - theEntities = myRemovedEntities; - theConstraints = myRemovedConstraints; + std::map::iterator aFound = myAttributeMap.find(theAttribute); + if (aFound == myAttributeMap.end()) + return true; // attribute not found, nothing to delete + + EntityWrapperPtr anEntity = aFound->second; + myAttributeMap.erase(aFound); + + // Check if the attribute is not used by constraints and features, remove it + if (!anEntity || (!isUsed(theAttribute) && remove(anEntity))) + return true; - myRemovedParameters.clear(); - myRemovedEntities.clear(); - myRemovedConstraints.clear(); + // attribute is not removed, revert operation + myAttributeMap[theAttribute] = anEntity; + update(anEntity); + return false; } -void SketchSolver_Storage::initializeSolver(SketchSolver_Solver& theSolver) + +bool SketchSolver_Storage::remove(ConstraintWrapperPtr theConstraint) { - theSolver.setParameters(myParameters.data(), (int)myParameters.size()); - theSolver.setEntities(myEntities.data(), (int)myEntities.size()); + bool isFullyRemoved = true; + std::list::const_iterator anIt = theConstraint->entities().begin(); + for (; anIt != theConstraint->entities().end(); ++anIt) { + FeaturePtr aBaseFeature = (*anIt)->baseFeature(); + if (aBaseFeature) + isFullyRemoved = SketchSolver_Storage::removeEntity(aBaseFeature) && isFullyRemoved; + else + isFullyRemoved = SketchSolver_Storage::removeEntity((*anIt)->baseAttribute()) && isFullyRemoved; + } + return isFullyRemoved; +} - // Copy constraints excluding the fixed one - std::vector aConstraints = myConstraints; - if (myFixed != SLVS_E_UNKNOWN) { - Slvs_hEntity aFixedPoint = SLVS_E_UNKNOWN; - std::vector::iterator anIt = aConstraints.begin(); - for (; anIt != aConstraints.end(); anIt++) - if (anIt->h == myFixed) { - aFixedPoint = anIt->ptA; - aConstraints.erase(anIt); - break; - } - // set dragged parameters - int aPos = Search(aFixedPoint, myEntities); - theSolver.setDraggedParameters(myEntities[aPos].param); +bool SketchSolver_Storage::remove(EntityWrapperPtr theEntity) +{ + bool isFullyRemoved = true; + std::list::const_iterator anEntIt = theEntity->subEntities().begin(); + for (; anEntIt != theEntity->subEntities().end(); ++anEntIt) { + FeaturePtr aBaseFeature = (*anEntIt)->baseFeature(); + if (aBaseFeature) + isFullyRemoved = SketchSolver_Storage::removeEntity(aBaseFeature) && isFullyRemoved; + else + isFullyRemoved = SketchSolver_Storage::removeEntity((*anEntIt)->baseAttribute()) && isFullyRemoved; } - theSolver.setConstraints(aConstraints.data(), (int)aConstraints.size()); -} - -void SketchSolver_Storage::addCoincidentPoints( - const Slvs_hEntity& thePoint1, const Slvs_hEntity& thePoint2) -{ - std::vector< std::set >::iterator aCIter = myCoincidentPoints.begin(); - std::vector< std::set >::iterator aFoundIter = myCoincidentPoints.end(); // already found coincidence - bool isFound = false; - for (; aCIter != myCoincidentPoints.end(); aCIter++) { - bool isFirstFound = aCIter->find(thePoint1) != aCIter->end(); - bool isSecondFound = aCIter->find(thePoint2) != aCIter->end(); - isFound = isFound || isFirstFound || isSecondFound; - if (isFirstFound && isSecondFound) - break; // already coincident - else if (isFirstFound || isSecondFound) { - if (aFoundIter != myCoincidentPoints.end()) { - // merge two sets - aFoundIter->insert(aCIter->begin(), aCIter->end()); - myCoincidentPoints.erase(aCIter); - break; - } - aCIter->insert(thePoint1); - aCIter->insert(thePoint2); + + std::list::const_iterator aParIt = theEntity->parameters().begin(); + for (; aParIt != theEntity->parameters().end(); ++aParIt) + isFullyRemoved = remove(*aParIt) && isFullyRemoved; + return isFullyRemoved; +} + + +bool SketchSolver_Storage::isInteract(const FeaturePtr& theFeature) const +{ + if (!theFeature) + return false; + if (myConstraintMap.empty()) + return true; // empty storage interacts with each feature + + ConstraintPtr aConstraint = std::dynamic_pointer_cast(theFeature); + if (aConstraint) { + if (myConstraintMap.find(aConstraint) != myConstraintMap.end()) + return true; + } else if (myFeatureMap.find(theFeature) != myFeatureMap.end()) + return true; + + std::list anAttrList = theFeature->data()->attributes(std::string()); + std::list::const_iterator anIt = anAttrList.begin(); + for (; anIt != anAttrList.end(); ++anIt) + if (isInteract(*anIt)) + return true; + + return false; +} + +bool SketchSolver_Storage::isInteract(const AttributePtr& theAttribute) const +{ + if (!theAttribute) + return false; + + AttributeRefListPtr aRefList = + std::dynamic_pointer_cast(theAttribute); + if (aRefList) { + std::list anObjects = aRefList->list(); + std::list::iterator anObjIt = anObjects.begin(); + for (; anObjIt != anObjects.end(); ++anObjIt) { + FeaturePtr aFeature = ModelAPI_Feature::feature(*anObjIt); + if (isInteract(aFeature)) + return true; } + return false; } - // coincident points not found - if (!isFound) { - std::set aNewSet; - aNewSet.insert(thePoint1); - aNewSet.insert(thePoint2); - myCoincidentPoints.push_back(aNewSet); - } + + AttributeRefAttrPtr aRefAttr = + std::dynamic_pointer_cast(theAttribute); + if (!aRefAttr) + return myAttributeMap.find(theAttribute) != myAttributeMap.end(); + if (!aRefAttr->isObject()) + return myAttributeMap.find(aRefAttr->attr()) != myAttributeMap.end(); + + FeaturePtr aFeature = ModelAPI_Feature::feature(aRefAttr->object()); + return isInteract(aFeature); } -void SketchSolver_Storage::removeCoincidentPoint(const Slvs_hEntity& thePoint) +bool SketchSolver_Storage::isConsistent() const { - std::vector< std::set >::iterator aCIter = myCoincidentPoints.begin(); - for (; aCIter != myCoincidentPoints.end(); aCIter++) - if (aCIter->find(thePoint) != aCIter->end()) { - aCIter->erase(thePoint); - if (aCIter->size() <= 1) - myCoincidentPoints.erase(aCIter); - break; - } + // Check the constraints are valid + std::map >::const_iterator + aCIter = myConstraintMap.begin(); + for (; aCIter != myConstraintMap.end(); ++aCIter) + if (!aCIter->first->data() || !aCIter->first->data()->isValid()) + return false; + // Check the features are valid + std::map::const_iterator aFIter = myFeatureMap.begin(); + for (; aFIter != myFeatureMap.end(); aFIter++) + if (!aFIter->first->data() || !aFIter->first->data()->isValid()) + return false; + return true; } -bool SketchSolver_Storage::isCoincident( - const Slvs_hEntity& thePoint1, const Slvs_hEntity& thePoint2) const +bool SketchSolver_Storage::isFixed(EntityWrapperPtr theEntity) const { - std::vector< std::set >::const_iterator aCIter = myCoincidentPoints.begin(); - for (; aCIter != myCoincidentPoints.end(); aCIter++) - if (aCIter->find(thePoint1) != aCIter->end() && aCIter->find(thePoint2) != aCIter->end()) - return true; + if (theEntity->group() != myGroupID) + return true; + // no need additional checking for entities differ than point + if (theEntity->type() != ENTITY_POINT) + return false; + + CoincidentPointsMap::const_iterator anIt = myCoincidentPoints.begin(); + for (; anIt != myCoincidentPoints.end(); ++anIt) + if (anIt->first == theEntity || anIt->second.find(theEntity) != anIt->second.end()) { + if (anIt->first->group() != myGroupID) + return true; + std::set::const_iterator anEntIt = anIt->second.begin(); + for (; anEntIt != anIt->second.end(); ++anEntIt) + if ((*anEntIt)->group() != myGroupID) + return true; + } + + std::map >::const_iterator aCIt = myConstraintMap.begin(); + std::list::const_iterator aCWIt; + for (; aCIt != myConstraintMap.end(); ++aCIt) { + if (aCIt->second.empty()) + continue; + aCWIt = aCIt->second.begin(); + if ((*aCWIt)->type() != CONSTRAINT_FIXED) + continue; + for (; aCWIt != aCIt->second.end(); ++aCIt) + if ((theEntity->baseAttribute() && (*aCWIt)->isUsed(theEntity->baseAttribute())) || + (theEntity->baseFeature() && (*aCWIt)->isUsed(theEntity->baseFeature()))) + return true; + } + return false; } +void SketchSolver_Storage::removeInvalidEntities() +{ + // Remove invalid constraints + std::list anInvalidConstraints; + std::map >::const_iterator + aCIter = myConstraintMap.begin(); + for (; aCIter != myConstraintMap.end(); ++aCIter) + if (!aCIter->first->data() || !aCIter->first->data()->isValid()) + anInvalidConstraints.push_back(aCIter->first); + std::list::const_iterator anInvCIt = anInvalidConstraints.begin(); + for (; anInvCIt != anInvalidConstraints.end(); ++anInvCIt) + removeConstraint(*anInvCIt); + // Remove invalid features + std::list anInvalidFeatures; + std::map::const_iterator aFIter = myFeatureMap.begin(); + for (; aFIter != myFeatureMap.end(); aFIter++) + if (!aFIter->first->data() || !aFIter->first->data()->isValid()) + anInvalidFeatures.push_back(aFIter->first); + std::list::const_iterator anInvFIt = anInvalidFeatures.begin(); + for (; anInvFIt != anInvalidFeatures.end(); ++anInvFIt) + removeEntity(*anInvFIt); +} +EntityWrapperPtr SketchSolver_Storage::getNormal() const +{ + EntityWrapperPtr aSketch = sketch(); + if (!aSketch) + return aSketch; + + // Find normal entity + const std::list& aSketchSubs = aSketch->subEntities(); + std::list::const_iterator aSIt = aSketchSubs.begin(); + for (; aSIt != aSketchSubs.end(); ++aSIt) + if ((*aSIt)->type() == ENTITY_NORMAL) + return *aSIt; + return EntityWrapperPtr(); +} +const EntityWrapperPtr& SketchSolver_Storage::sketch() const +{ + static EntityWrapperPtr aDummySketch; -// ======================================================== -// ========= Auxiliary functions =============== -// ======================================================== + std::map::const_iterator aFIt = myFeatureMap.begin(); + for (; aFIt != myFeatureMap.end(); ++aFIt) + if (aFIt->second && aFIt->second->type() == ENTITY_SKETCH) + break; + if (aFIt == myFeatureMap.end()) + return aDummySketch; + return aFIt->second; +} -template -int Search(const uint32_t& theEntityID, const std::vector& theEntities) +void SketchSolver_Storage::setSketch(const EntityWrapperPtr& theSketch) { - int aResIndex = theEntityID <= theEntities.size() ? theEntityID - 1 : 0; - int aVecSize = theEntities.size(); - if (theEntities.empty()) - return 1; - while (aResIndex >= 0 && theEntities[aResIndex].h > theEntityID) - aResIndex--; - while (aResIndex < aVecSize && aResIndex >= 0 && theEntities[aResIndex].h < theEntityID) - aResIndex++; - if (aResIndex == -1) - aResIndex = aVecSize; - return aResIndex; + if (sketch()) + return; + addEntity(FeaturePtr(), theSketch); } -bool IsNotEqual(const Slvs_Param& theParam1, const Slvs_Param& theParam2) +void SketchSolver_Storage::processArcs() { - return fabs(theParam1.val - theParam2.val) > tolerance; + myExistArc = false; + std::map::iterator aFIt = myFeatureMap.begin(); + for (; aFIt != myFeatureMap.end(); ++aFIt) + if (!aFIt->second && aFIt->first->getKind() == SketchPlugin_Arc::ID()) { + // Additional checking the attributes are initialized + if (aFIt->first->attribute(SketchPlugin_Arc::CENTER_ID())->isInitialized() && + aFIt->first->attribute(SketchPlugin_Arc::START_ID())->isInitialized() && + aFIt->first->attribute(SketchPlugin_Arc::END_ID())->isInitialized()) + update(aFIt->first); + else + myExistArc = true; + } } -bool IsNotEqual(const Slvs_Entity& theEntity1, const Slvs_Entity& theEntity2) +void SketchSolver_Storage::blockEvents(bool isBlocked) { - int i = 0; - for (; theEntity1.param[i] != 0 && i < 4; i++) - if (theEntity1.param[i] != theEntity2.param[i]) - return true; - i = 0; - for (; theEntity1.point[i] != 0 && i < 4; i++) - if (theEntity1.point[i] != theEntity2.point[i]) - return true; - return false; + if (isBlocked == myEventsBlocked) + return; + + std::map >::const_iterator + aCIter = myConstraintMap.begin(); + for (; aCIter != myConstraintMap.end(); aCIter++) + if (aCIter->first->data() && aCIter->first->data()->isValid()) + aCIter->first->data()->blockSendAttributeUpdated(isBlocked); + + std::map::const_iterator aFIter = myFeatureMap.begin(); + for (; aFIter != myFeatureMap.end(); aFIter++) + if (aFIter->first->data() && aFIter->first->data()->isValid()) + aFIter->first->data()->blockSendAttributeUpdated(isBlocked); + + std::map::const_iterator anAtIter = myAttributeMap.begin(); + for (; anAtIter != myAttributeMap.end(); anAtIter++) + if (anAtIter->first->owner() && anAtIter->first->owner()->data() && + anAtIter->first->owner()->data()->isValid()) + anAtIter->first->owner()->data()->blockSendAttributeUpdated(isBlocked); + myEventsBlocked = isBlocked; } -bool IsNotEqual(const Slvs_Constraint& theConstraint1, const Slvs_Constraint& theConstraint2) +std::set SketchSolver_Storage::getConflictingConstraints(SolverPtr theSolver) const { - return theConstraint1.ptA != theConstraint2.ptA || - theConstraint1.ptB != theConstraint2.ptB || - theConstraint1.entityA != theConstraint2.entityA || - theConstraint1.entityB != theConstraint2.entityB || - theConstraint1.entityC != theConstraint2.entityC || - theConstraint1.entityD != theConstraint2.entityD || - fabs(theConstraint1.valA - theConstraint2.valA) > tolerance; + std::set aConflicting; + std::map >::const_iterator + aConstrIt = myConstraintMap.begin(); + for (; aConstrIt != myConstraintMap.end(); ++aConstrIt) { + std::list::const_iterator anIt = aConstrIt->second.begin(); + for (; anIt != aConstrIt->second.end(); ++anIt) + if (theSolver->isConflicting((*anIt)->id())) { + aConflicting.insert(aConstrIt->first); + break; + } + } + return aConflicting; +} + + + + + +// ============== Auxiliary functions ==================================== +bool isEqual(const std::list& theCVec1, + const std::list& theCVec2) +{ + if (theCVec1.size() != theCVec2.size()) + return false; + + std::list aChecked(theCVec2.size(), false); + std::list::const_iterator anIt1 = theCVec1.begin(); + for (; anIt1 != theCVec1.end(); ++anIt1) { + std::list::const_iterator anIt2 = theCVec2.begin(); + std::list::iterator aCheckIt = aChecked.begin(); + while (aCheckIt != aChecked.end() && *aCheckIt) { + ++aCheckIt; + ++anIt2; + } + for (; anIt2 != theCVec2.end(); ++anIt2, ++aCheckIt) + if (!(*aCheckIt) && (*anIt1)->isEqual(*anIt2)) { + *aCheckIt = true; + break; + } + // the same constraint is not found + if (anIt2 == theCVec2.end()) + return false; + } + return true; }