-// Copyright (C) 2007-2013 CEA/DEN, EDF R&D, OPEN CASCADE
+// Copyright (C) 2007-2016 CEA/DEN, EDF R&D, OPEN CASCADE
//
// Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
// CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
// 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.
+// 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
#include <map>
std::string LoadRateManagerFirst::Find(const std::vector<std::string>& hosts,
- MapOfParserResourcesType& resList)
+ const MapOfParserResourcesType& resList)
{
if (hosts.size() == 0)
return std::string("");
}
std::string LoadRateManagerCycl::Find(const std::vector<std::string>& hosts,
- MapOfParserResourcesType& resList)
+ const MapOfParserResourcesType& resList)
{
static int imachine = 0;
static int iproc = 0;
if (hosts.size() == 0)
return std::string("");
else{
- ParserResourcesType resource = resList[std::string(hosts[imachine])];
+ MapOfParserResourcesType::const_iterator it(resList.find(hosts[imachine]));
+ ParserResourcesType resource;
+ if(it!=resList.end())
+ resource = (*it).second;
int nbproc = resource.DataForSort._nbOfProcPerNode * resource.DataForSort._nbOfNodes;
if( nbproc <= 0) nbproc = 1;
if( iproc < nbproc ){
}
std::string LoadRateManagerAltCycl::Find(const std::vector<std::string>& hosts,
- MapOfParserResourcesType& resList)
+ const MapOfParserResourcesType& resList)
{
if (hosts.size() == 0)
return std::string("");