return Graph()->AddInputData( ToNodeName , ToParameterName , aValue ) ;
} ;
-inline const CORBA::Any *GraphEditor::DataFlow::GetInData(
+//JR 30.03.2005inline const CORBA::Any *GraphEditor::DataFlow::GetInData(
+inline const CORBA::Any GraphEditor::DataFlow::GetInData(
const char * ToNodeName ,
const char * ToParameterName ) {
return GraphEditor::OutNode::GetInData( ToNodeName ,
ToParameterName ) ;
}
-inline const CORBA::Any *GraphEditor::DataFlow::GetOutData(
+//JR 30.03.2005inline const CORBA::Any *GraphEditor::DataFlow::GetOutData(
+inline const CORBA::Any GraphEditor::DataFlow::GetOutData(
const char * FromNodeName ,
const char * FromParameterName ) {
return GraphEditor::OutNode::GetOutData( FromNodeName ,
FromParameterName ) ;
}
-inline bool GraphEditor::DataFlow::IsValid() {
- return GraphEditor::OutNode::IsValid() ;
+//JR Optional parameter kLoopSwitch (default = true) :
+//In some cases we do not need to check the validity of loops and switchs
+inline bool GraphEditor::DataFlow::IsValid(bool kLoopSwitch ) {
+ return GraphEditor::OutNode::IsValid( kLoopSwitch ) ;
}
inline bool GraphEditor::DataFlow::IsExecutable() {
}
inline long GraphEditor::DataFlow::LevelMax() {
- if ( !IsValid() ) {
+ if ( !IsValid( false ) ) {
return 0 ;
}
return Graph()->LevelMax() ;
}
inline SUPERV::ListOfStrings * GraphEditor::DataFlow::LevelNodes(long aLevel ) {
- if ( !IsValid() ) {
+ if ( !IsValid( false ) ) {
return ((SUPERV::ListOfStrings * ) NULL ) ;
}
return Graph()->LevelNodes( aLevel ) ;