X-Git-Url: http://git.salome-platform.org/gitweb/?a=blobdiff_plain;ds=sidebyside;f=src%2FModel%2FModel_Application.cpp;h=6cfb6a3a38db0fce52b852cab4547a685ca39aaf;hb=95375993f1f35e4716475c0b0c8e265c082c875d;hp=875e1537fb6ab1c98ae51fb527b518952bf9dd5e;hpb=b912c517a85602b2e6e2045262d4ac1d7152fbfd;p=modules%2Fshaper.git diff --git a/src/Model/Model_Application.cpp b/src/Model/Model_Application.cpp index 875e1537f..6cfb6a3a3 100644 --- a/src/Model/Model_Application.cpp +++ b/src/Model/Model_Application.cpp @@ -1,15 +1,27 @@ -// Copyright (C) 2014-20xx CEA/DEN, EDF R&D - -// File: Model_Application.cxx -// Created: Fri Sep 2 2011 -// Author: Mikhail PONIKAROV +// Copyright (C) 2014-2019 CEA/DEN, EDF R&D +// +// This library is free software; you can redistribute it and/or +// modify it under the terms of the GNU Lesser General Public +// License as published by the Free Software Foundation; either +// version 2.1 of the License, or (at your option) any later version. +// +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +// Lesser General Public License for more details. +// +// You should have received a copy of the GNU Lesser General Public +// License along with this library; if not, write to the Free Software +// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA +// +// See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com +// #include #include #include -IMPLEMENT_STANDARD_HANDLE(Model_Application, TDocStd_Application) IMPLEMENT_STANDARD_RTTIEXT(Model_Application, TDocStd_Application) static Handle_Model_Application TheApplication = new Model_Application; @@ -117,42 +129,36 @@ const std::string& Model_Application::loadPath() const } //======================================================================= -void Model_Application::setLoadByDemand(std::string theID) +void Model_Application::setLoadByDemand(std::string theID, const int theDocID) { - myLoadedByDemand.insert(theID); + myLoadedByDemand[theID] = theDocID; } //======================================================================= -bool Model_Application::isLoadByDemand(std::string theID) +bool Model_Application::isLoadByDemand(std::string theID, const int theDocIndex) { - return myLoadedByDemand.find(theID) != myLoadedByDemand.end(); + return myLoadedByDemand.find(theID) != myLoadedByDemand.end() && + myLoadedByDemand[theID] == theDocIndex; } //======================================================================= -void Model_Application::removeUselessDocuments( - std::list > theUsedDocs) +int Model_Application::generateDocumentId() { - std::map >::iterator aDoc = myDocs.begin(); - while(aDoc != myDocs.end()) { - bool aFound = false; - std::list >::iterator aUsed = theUsedDocs.begin(); - for(; !aFound && aUsed != theUsedDocs.end(); aUsed++) { - aFound = aDoc->second == *aUsed; - } - if (!aFound) { // remove the useless - aDoc->second->close(); - myDocs.erase(aDoc); - aDoc = myDocs.begin(); - } else { - aDoc++; + int aResult; + // count until the result id is unique + for(aResult = int(myDocs.size()); true; aResult++) { + if (myDocs.find(aResult) == myDocs.end()) { + bool aFound = false; + std::map::iterator aLBDIter = myLoadedByDemand.begin(); + for(; aLBDIter != myLoadedByDemand.end(); aLBDIter++) { + if (aLBDIter->second == aResult) { + aFound = true; + break; + } + } + if (!aFound) break; } } -} - -int Model_Application::generateDocumentId() -{ - int aResult = int(myDocs.size()); - for(; myDocs.find(aResult) != myDocs.end(); aResult++) {} // count until the result id is unique return aResult; }