#include <ModelAPI_ResultParameter.h>
#include <ModelAPI_ResultPart.h>
#include <ModelAPI_AttributeDocRef.h>
+#include <ModelAPI_Validator.h>
#include <list>
#include <map>
#include <iostream>
#include <Events_Loop.h>
#include <ModelAPI_Events.h>
+#define RECURSE_TOP_LEVEL 50
+
//#define DEBUG_REMOVE_FEATURES
+//#define DEBUG_REMOVE_FEATURES_RECURSE
+//#define DEBUG_CYCLING_1550
+
+#ifdef DEBUG_REMOVE_FEATURES_RECURSE
+#include <sstream>
+std::string getFeatureInfo(FeaturePtr theFeature)
+{
+ if (!theFeature.get())
+ return "";
+ //std::ostringstream aPtrStr;
+ //aPtrStr << "[" << theFeature.get() << "] ";
+ std::string aFeatureInfo = /*aPtrStr.str() + */theFeature->name();
+ CompositeFeaturePtr aComposite = ModelAPI_Tools::compositeOwner(theFeature);
+ if (aComposite.get()) {
+ aFeatureInfo = aFeatureInfo + "[in " + aComposite->name() + "]";
+ }
+ return aFeatureInfo;
+}
+#endif
#ifdef DEBUG_REMOVE_FEATURES
void printMapInfo(const std::map<FeaturePtr, std::set<FeaturePtr> >& theMainList,
anInfo = anInfo + aMainListFeature->name().c_str() + ": " + aRefsInfo + "\n";
}
}
- std::cout << thePrefix.c_str() << ": " << anInfo.c_str() << std::endl;
+ std::cout << thePrefix.c_str() << " [feature: references to]: \n" << anInfo.c_str() << std::endl;
}
void printListInfo(const std::set<FeaturePtr>& theMainList,
return theResult->shape();
}
+void shapesOfType(const FeaturePtr& theFeature,
+ const GeomAPI_Shape::ShapeType& theType,
+ std::set<GeomShapePtr>& theShapes)
+{
+ std::list<ResultPtr> aResults = theFeature->results();
+ std::list<ResultPtr>::const_iterator aRIter = aResults.cbegin();
+ for (; aRIter != aResults.cend(); aRIter++) {
+ ResultPtr aResult = *aRIter;
+ GeomShapePtr aShape = aResult->shape();
+ if (aShape.get() && aShape->shapeType() == theType)
+ theShapes.insert(aShape);
+ }
+}
+
const char* toString(ModelAPI_ExecState theExecState)
{
#define TO_STRING(__NAME__) case __NAME__: return #__NAME__;
return false;
}
-static std::map<int, std::vector<int> > myColorMap;
-
-void appendValues(std::vector<int>& theRGB, const int theRed, const int theGreen, const int theBlue)
-{
- theRGB.push_back(theRed);
- theRGB.push_back(theGreen);
- theRGB.push_back(theBlue);
-}
-
-bool containsValues(std::map<int, std::vector<int> >& theColorMap, std::vector<int>& theValues)
-{
- std::map<int, std::vector<int> >::const_iterator anIt = theColorMap.begin(), aLast = theColorMap.end();
- bool isFound = false;
- for (; anIt != aLast && !isFound; anIt++) {
- std::vector<int> aValues = anIt->second;
- isFound = aValues[0] == theValues[0] &&
- aValues[1] == theValues[1] &&
- aValues[2] == theValues[2];
- }
- return isFound;
-}
-
-std::vector<int> HSVtoRGB(int theH, int theS, int theV)
-{
- std::vector<int> aRGB;
- if (theH < 0 || theH > 360 ||
- theS < 0 || theS > 100 ||
- theV < 0 || theV > 100)
- return aRGB;
-
- int aHi = (int)theH/60;
-
- double aV = theV;
- double aVmin = (100 - theS)*theV/100;
-
- double anA = (theV - aVmin)* (theH % 60) / 60;
-
- double aVinc = aVmin + anA;
- double aVdec = theV - anA;
-
- double aPercentToValue = 255./100;
- int aV_int = (int)(aV*aPercentToValue);
- int aVinc_int = (int)(aVinc*aPercentToValue);
- int aVmin_int = (int)(aVmin*aPercentToValue);
- int aVdec_int = (int)(aVdec*aPercentToValue);
-
- switch(aHi) {
- case 0: appendValues(aRGB, aV_int, aVinc_int, aVmin_int); break;
- case 1: appendValues(aRGB, aVdec_int, aV_int, aVmin_int); break;
- case 2: appendValues(aRGB, aVmin_int, aV_int, aVinc_int); break;
- case 3: appendValues(aRGB, aVmin_int, aVdec_int, aV_int); break;
- case 4: appendValues(aRGB, aVinc_int, aVmin_int, aV_int); break;
- case 5: appendValues(aRGB, aV_int, aVmin_int, aVdec_int); break;
- default: break;
- }
- return aRGB;
-}
-
-
-void fillColorMap()
-{
- if (!myColorMap.empty())
- return;
-
- int i = 0;
- for (int s = 100; s > 0; s = s - 50)
- {
- for (int v = 100; v >= 40; v = v - 20)
- {
- for (int h = 0; h < 359 ; h = h + 60)
- {
- std::vector<int> aColor = HSVtoRGB(h, s, v);
- if (containsValues(myColorMap, aColor))
- continue;
- myColorMap[i] = aColor;
- i++;
- }
- }
- }
-}
-
-void findRandomColor(std::vector<int>& theValues)
-{
- theValues.clear();
- if (myColorMap.empty()) {
- fillColorMap();
- }
-
- size_t aSize = myColorMap.size();
- int anIndex = rand() % aSize;
- if (myColorMap.find(anIndex) != myColorMap.end()) {
- theValues = myColorMap.at(anIndex);
- }
-}
-
ResultPtr findPartResult(const DocumentPtr& theMain, const DocumentPtr& theSub)
{
if (theMain != theSub) { // to optimize and avoid of crash on partset document close (don't touch the sub-document structure)
void allResults(const FeaturePtr& theFeature, std::list<ResultPtr>& theResults)
{
+ if (!theFeature.get()) // safety: for empty feature no results
+ return;
const std::list<std::shared_ptr<ModelAPI_Result> >& aResults = theFeature->results();
std::list<std::shared_ptr<ModelAPI_Result> >::const_iterator aRIter = aResults.begin();
for (; aRIter != aResults.cend(); aRIter++) {
// \param theReferences an out container of references
void addRefsToFeature(const FeaturePtr& theFeature,
const std::map<FeaturePtr, std::set<FeaturePtr> >& theReferencesMap,
+ std::map<FeaturePtr, std::set<FeaturePtr> >& theProcessedReferences,
+ int theRecLevel,
std::set<FeaturePtr>& theReferences)
{
+ if (theRecLevel > RECURSE_TOP_LEVEL)
+ return;
+ theRecLevel++;
+
+ // if the feature is already processed, get the ready references from the map
+ if (theProcessedReferences.find(theFeature) != theProcessedReferences.end()) {
+ std::set<FeaturePtr> aReferences = theProcessedReferences.at(theFeature);
+ theReferences.insert(aReferences.begin(), aReferences.end());
+ return;
+ }
+
if (theReferencesMap.find(theFeature) == theReferencesMap.end())
return; // this feature is not in the selection list, so exists without references to it
std::set<FeaturePtr> aMainReferences = theReferencesMap.at(theFeature);
std::set<FeaturePtr>::const_iterator anIt = aMainReferences.begin(),
aLast = aMainReferences.end();
+#ifdef DEBUG_REMOVE_FEATURES_RECURSE
+ std::string aSpacing;
+ for (int i = 0; i < theRecLevel; i++)
+ aSpacing.append(" ");
+#endif
+
for (; anIt != aLast; anIt++) {
FeaturePtr aRefFeature = *anIt;
+#ifdef DEBUG_REMOVE_FEATURES_RECURSE
+ std::cout << aSpacing << " Ref: " << getFeatureInfo(aRefFeature) << std::endl;
+#endif
if (theReferences.find(aRefFeature) == theReferences.end())
theReferences.insert(aRefFeature);
- addRefsToFeature(aRefFeature, theReferencesMap, theReferences);
+ addRefsToFeature(aRefFeature, theReferencesMap, theProcessedReferences, theRecLevel, theReferences);
}
}
// \param theReferences an out container of references
void findReferences(const std::set<FeaturePtr>& theFeatures,
std::map<FeaturePtr, std::set<FeaturePtr> >& theReferences,
- const bool theUseComposite, const bool theUseRecursion)
+ const bool theUseComposite, const bool theUseRecursion, int theRecLevel)
{
+ if (theRecLevel > RECURSE_TOP_LEVEL)
+ return;
+ theRecLevel++;
std::set<FeaturePtr>::const_iterator anIt = theFeatures.begin(),
aLast = theFeatures.end();
for (; anIt != aLast; anIt++) {
}
theReferences[aFeature] = aFilteredFeatures;
}
- if (theUseRecursion)
- findReferences(aSelRefFeatures, theReferences, theUseComposite, theUseRecursion);
+ if (theUseRecursion) {
+#ifdef DEBUG_CYCLING_1550
+ findReferences(aSelRefFeatures, theReferences, theUseComposite, theUseRecursion, theRecLevel);
+#else
+ findReferences(theReferences[aFeature], theReferences, theUseComposite, theUseRecursion,
+ theRecLevel);
+#endif
+ }
}
}
}
// Information: bool_1 is not selected, ext_2(bool_2) exists
// find all referenced features
std::map<FeaturePtr, std::set<FeaturePtr> > aMainList;
- findReferences(theFeatures, aMainList, theUseComposite, theUseRecursion);
+ int aRecLevel = 0;
+ findReferences(theFeatures, aMainList, theUseComposite, theUseRecursion, aRecLevel);
#ifdef DEBUG_REMOVE_FEATURES
printMapInfo(aMainList, "firstDependencies");
aMainLast = aMainList.end();
for (; aMainIt != aMainLast; aMainIt++) {
FeaturePtr aMainListFeature = aMainIt->first;
+
//std::string aName = aMainListFeature->name();
std::set<FeaturePtr> aMainRefList = aMainIt->second;
- std::set<FeaturePtr> anAddRefFeatures;
+#ifdef DEBUG_REMOVE_FEATURES_RECURSE
+ char aBuf[50];
+ int n = sprintf(aBuf, "%d", aMainRefList.size());
+ std::string aSize(aBuf);
+ std::cout << "_findAllReferences for the Feature: " << getFeatureInfo(aMainListFeature)
+ << ", references size = " << aSize << std::endl;
+#endif
std::set<FeaturePtr>::const_iterator anIt = aMainRefList.begin(),
aLast = aMainRefList.end();
+ std::set<FeaturePtr> aResultRefList;
+ aResultRefList.insert(aMainRefList.begin(), aMainRefList.end());
for (; anIt != aLast; anIt++) {
FeaturePtr aFeature = *anIt;
- addRefsToFeature(aFeature, aMainList, aMainRefList);
+ int aRecLevel = 0;
+#ifdef DEBUG_REMOVE_FEATURES_RECURSE
+ std::cout << " Ref: " << getFeatureInfo(aFeature) << std::endl;
+#endif
+ aRecLevel++;
+ addRefsToFeature(aFeature, aMainList, theReferences, aRecLevel, aResultRefList/*aMainRefList*/);
}
- theReferences[aMainListFeature] = aMainRefList;
+ theReferences[aMainListFeature] = aResultRefList;
}
+#ifdef DEBUG_REMOVE_FEATURES_RECURSE
+ std::cout << std::endl;
+#endif
#ifdef DEBUG_REMOVE_FEATURES
printMapInfo(theReferences, "allDependencies");
}
}
+void getConcealedResults(const FeaturePtr& theFeature,
+ std::list<std::shared_ptr<ModelAPI_Result> >& theResults)
+{
+ SessionPtr aSession = ModelAPI_Session::get();
+
+ std::list<std::pair<std::string, std::list<std::shared_ptr<ModelAPI_Object> > > > aRefs;
+ theFeature->data()->referencesToObjects(aRefs);
+ std::list<std::pair<std::string, std::list<ObjectPtr> > >::const_iterator
+ anIt = aRefs.begin(), aLast = aRefs.end();
+ std::set<ResultPtr> alreadyThere; // to avoid duplications
+ for (; anIt != aLast; anIt++) {
+ if (!aSession->validators()->isConcealed(theFeature->getKind(), anIt->first))
+ continue; // use only concealed attributes
+ std::list<ObjectPtr> anObjects = (*anIt).second;
+ std::list<ObjectPtr>::const_iterator anOIt = anObjects.begin(), anOLast = anObjects.end();
+ for (; anOIt != anOLast; anOIt++) {
+ ResultPtr aResult = std::dynamic_pointer_cast<ModelAPI_Result>(*anOIt);
+ if (aResult && aResult->isConcealed()) {
+ if (alreadyThere.find(aResult) == alreadyThere.end()) // issue 1712, avoid duplicates
+ alreadyThere.insert(aResult);
+ else continue;
+ theResults.push_back(aResult);
+ }
+ }
+ }
+}
+
} // namespace ModelAPI_Tools
