Use tempfile.mkdtemp to create temporary directory

[modules/yacs.git] / src / engine / Bloc.cxx

diff --git a/src/engine/Bloc.cxx b/src/engine/Bloc.cxx
index 6fc3240abfa88716d1fb14d9d23e3654f04aaa64..2a70697d6f621566e9e63844cfc6b3dea334feb8 100644 (file)
--- a/src/engine/Bloc.cxx
+++ b/src/engine/Bloc.cxx
@@ -1,4 +1,4 @@
-// Copyright (C) 2006-2016  CEA/DEN, EDF R&D
+// Copyright (C) 2006-2022  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
@@ -173,7 +173,7 @@ void Bloc::exUpdateState()
  * If node name already used in bloc, throw exception.
  * Publish inputPorts in current bloc and ancestors.
  */
-bool Bloc::edAddChild(Node *node) throw(YACS::Exception)
+bool Bloc::edAddChild(Node *node)
 {
   if(isNodeAlreadyAggregated(node))
     {
@@ -217,7 +217,7 @@ bool Bloc::edAddChild(Node *node) throw(YACS::Exception)
  * @exception If 'node' is NOT the son of 'this'.
  */
 
-void Bloc::edRemoveChild(Node *node) throw(YACS::Exception)
+void Bloc::edRemoveChild(Node *node)
 {
   StaticDefinedComposedNode::edRemoveChild(node);
   list<Node *>::iterator iter=find(_setOfNode.begin(),_setOfNode.end(),node);
@@ -276,7 +276,7 @@ std::vector< std::list<Node *> > Bloc::splitIntoIndependantGraph() const
   return ret;
 }
 
-Node *Bloc::getChildByShortName(const std::string& name) const throw(YACS::Exception)
+Node *Bloc::getChildByShortName(const std::string& name) const
 {
   for (list<Node *>::const_iterator iter = _setOfNode.begin(); iter != _setOfNode.end(); iter++)
     if ((*iter)->getName() == name)
@@ -335,7 +335,7 @@ bool insertNodeChildrenInSet(Node *node, std::set<Node *>& nodeSet)
  *        \b WARNING : When using this method 'node' has to be checked in order to be part of direct children of 'this'. 
  *
  */
-void Bloc::checkNoCyclePassingThrough(Node *node) throw(YACS::Exception)
+void Bloc::checkNoCyclePassingThrough(Node *node)
 {
   set<Node *> currentNodesToTest;
   //don't insert node to test in set. 
@@ -473,11 +473,11 @@ std::list< AbstractPoint * > Bloc::analyzeParallelism() const
   return pts;
 }
 
-double Bloc::getWeightRegardingDPL() const
+void Bloc::getWeightRegardingDPL(ComplexWeight *weight)
 {
   std::list< AbstractPoint * > pts(analyzeParallelism());
   ForkBlocPoint fbp(pts,NULL);
-  return fbp.getWeightRegardingDPL();
+  fbp.getWeightRegardingDPL(weight);
 }
 
 void Bloc::removeRecursivelyRedundantCL()