Skip to content

Commit

Permalink
- remove irrelevant and often wrong information from some description…
Browse files Browse the repository at this point in the history
… strings

git-svn-id: https://openmodelica.org/svn/OpenModelica/trunk@16943 f25d12d1-65f4-0310-ae8a-bbce733d8d8e
  • Loading branch information
lochel committed Aug 29, 2013
1 parent ccb775e commit b957f4b
Show file tree
Hide file tree
Showing 41 changed files with 287 additions and 575 deletions.
15 changes: 5 additions & 10 deletions Compiler/BackEnd/BackendDAECreate.mo
Expand Up @@ -3509,8 +3509,7 @@ algorithm
end match;
end findZeroCrossings1;

protected function findZeroCrossings2 "function: findZeroCrossings2

protected function findZeroCrossings2 "
Helper function to find_zero_crossing.
modified: 2011-01 by wbraun
"
Expand Down Expand Up @@ -3923,8 +3922,7 @@ algorithm
end matchcontinue;
end collectZC;

protected function collectZCAlgs "function: collectZeroCrossings

protected function collectZCAlgs "
Collects zero crossings in algorithms stamts, beside for loops those are
processed by collectZCAlgsFor

Expand Down Expand Up @@ -4398,8 +4396,7 @@ algorithm
end matchcontinue;
end mergeZeroCrossings;

protected function mergeZeroCrossing "function: mergeZeroCrossing

protected function mergeZeroCrossing "
Merges two zero crossings into one by makeing the union of the lists of
equaions and when clauses they appear in.
modified: 2011-01 by wbraun
Expand Down Expand Up @@ -4436,8 +4433,7 @@ algorithm
end matchcontinue;
end mergeZeroCrossing;

protected function sameZeroCrossing "function: sameZeroCrossing

protected function sameZeroCrossing "
Returns true if both zero crossings have the same function expression
"
input BackendDAE.ZeroCrossing inZeroCrossing1;
Expand Down Expand Up @@ -4472,8 +4468,7 @@ algorithm
end match;
end sameZeroCrossing;

protected function differentZeroCrossing "function: differentZeroCrossing

protected function differentZeroCrossing "
Return true if the realation expressions differ.
"
input BackendDAE.ZeroCrossing zc1;
Expand Down
31 changes: 10 additions & 21 deletions Compiler/BackEnd/BackendDAEOptimize.mo
Expand Up @@ -322,9 +322,7 @@ end lateInlineFunction;
// remove simply equations stuff
//
// =============================================================================
// protected function updateEquationSystemMatching
// " function: updateEquationSystemMatching
// author: Frenkel TUD 2012-09"
// protected function updateEquationSystemMatching "author: Frenkel TUD 2012-09"
// input BackendDAE.Variables ordvars;
// input BackendDAE.EquationArray eqns;
// input array<Integer> ass1 "ass[varindx]=eqnindx";
Expand Down Expand Up @@ -373,8 +371,7 @@ end lateInlineFunction;
// end updateEquationSystemMatching;

// protected function updateStrongComponent
// " function: updateStrongComponent
// author: Frenkel TUD 2012-09"
// "// author: Frenkel TUD 2012-09"
// input BackendDAE.StrongComponent iComp;
// input array<Integer> varindxs;
// input array<Integer> eqnindxs;
Expand Down Expand Up @@ -529,8 +526,7 @@ algorithm
end updateTornSystemComp;

// protected function updateVarArray
// " function: updateVarArray
// author: Frenkel TUD 2012-09"
// "// author: Frenkel TUD 2012-09"
// input Integer index;
// input Integer numberOfElement;
// input Integer insertindex;
Expand Down Expand Up @@ -590,8 +586,7 @@ end updateTornSystemComp;
// end updateVarArray;

// protected function updateEquationArray
// " function: updateEquationArray
// author: Frenkel TUD 2012-09"
// "// author: Frenkel TUD 2012-09"
// input Integer index;
// input Integer numberOfElement;
// input Integer insertindex;
Expand Down Expand Up @@ -642,8 +637,7 @@ end updateTornSystemComp;
// end updateEquationArray;

protected function traverseIncidenceMatrix
" function: traverseIncidenceMatrix
author: Frenkel TUD 2010-12"
" author: Frenkel TUD 2010-12"
replaceable type Type_a subtypeof Any;
input BackendDAE.IncidenceMatrix inM;
input FuncType func;
Expand All @@ -659,8 +653,7 @@ algorithm
end traverseIncidenceMatrix;

protected function traverseIncidenceMatrix1
" function: traverseIncidenceMatrix1
author: Frenkel TUD 2010-12"
" author: Frenkel TUD 2010-12"
replaceable type Type_a subtypeof Any;
input BackendDAE.IncidenceMatrix inM;
input FuncType func;
Expand All @@ -678,8 +671,7 @@ algorithm
end traverseIncidenceMatrix1;

protected function traverseIncidenceMatrix2
" function: traverseIncidenceMatrix1
author: Frenkel TUD 2010-12"
" author: Frenkel TUD 2010-12"
replaceable type Type_a subtypeof Any;
input BackendDAE.IncidenceMatrix inM;
input FuncType func;
Expand Down Expand Up @@ -716,8 +708,7 @@ algorithm
end traverseIncidenceMatrix2;

protected function traverseIncidenceMatrixList
" function: traverseIncidenceMatrixList
author: Frenkel TUD 2011-04"
" author: Frenkel TUD 2011-04"
replaceable type Type_a subtypeof Any;
input list<Integer> inLst "elements to traverse";
input BackendDAE.IncidenceMatrix inM;
Expand Down Expand Up @@ -869,8 +860,7 @@ algorithm
end countSimpleEquationsFinder;

protected function countsimpleEquation
" function: countsimpleEquation
author: Frenkel TUD 2011-05"
" author: Frenkel TUD 2011-05"
input BackendDAE.IncidenceMatrixElement elem;
input Integer length;
input Integer pos;
Expand Down Expand Up @@ -1045,8 +1035,7 @@ algorithm
end removeParametersFinder;

protected function replaceFinalVars
" function: replaceFinalVars
author: Frenkel TUD 2011-04"
" author: Frenkel TUD 2011-04"
input Integer inNumRepl;
input BackendDAE.Variables inVars;
input BackendVarTransform.VariableReplacements inRepl;
Expand Down
45 changes: 15 additions & 30 deletions Compiler/BackEnd/BackendDAEUtil.mo
Expand Up @@ -486,8 +486,7 @@ algorithm
end copyBackendDAE;

public function copyBackendDAEEqSystem
" function: copyBackendDAE
author: Frenkel TUD, wbraun
" author: Frenkel TUD, wbraun
Copy the dae to avoid changes in
vectors."
input BackendDAE.EqSystem inSysts;
Expand Down Expand Up @@ -519,8 +518,7 @@ algorithm
end copyBackendDAEEqSystem;

public function copyBackendDAEShared
" function: copyBackendDAEShared
author: Frenkel TUD, wbraun
" author: Frenkel TUD, wbraun
Copy the shared part of an BackendDAE to avoid changes in
vectors."
input BackendDAE.Shared inShared;
Expand Down Expand Up @@ -577,8 +575,7 @@ algorithm
end copyMatching;

public function addBackendDAESharedJacobian
" function: addBackendDAESharedJacobian
author: wbraun"
" author: wbraun"
input BackendDAE.SymbolicJacobian inSymJac;
input BackendDAE.SparsePattern inSparsePattern;
input BackendDAE.SparseColoring inSparseColoring;
Expand Down Expand Up @@ -608,8 +605,7 @@ algorithm
end addBackendDAESharedJacobian;

public function addBackendDAESharedJacobians
" function: addBackendDAESharedJacobians
author: wbraun"
" author: wbraun"
input BackendDAE.SymbolicJacobians inSymJac;
input BackendDAE.Shared inShared;
output BackendDAE.Shared outShared;
Expand All @@ -635,8 +631,7 @@ algorithm
end addBackendDAESharedJacobians;

public function addBackendDAESharedJacobianSparsePattern
" function: addBackendDAESharedJacobianSparsePattern
author: wbraun"
" author: wbraun"
input BackendDAE.SparsePattern inSparsePattern;
input BackendDAE.SparseColoring inSparseColoring;
input Integer inIndex;
Expand Down Expand Up @@ -668,8 +663,7 @@ algorithm
end addBackendDAESharedJacobianSparsePattern;

public function addBackendDAEKnVars
" function: addBackendDAEKnVars
That function replace the KnownVars in BackendDAE.
" That function replace the KnownVars in BackendDAE.
author: wbraun"
input BackendDAE.Variables inKnVars;
input BackendDAE.BackendDAE inBDAE;
Expand All @@ -695,8 +689,7 @@ algorithm
end addBackendDAEKnVars;

public function addBackendDAEFunctionTree
" function: addBackendDAEFunctionTree
That function replace the FunctionTree in BackendDAE.
" That function replace the FunctionTree in BackendDAE.
author: wbraun"
input DAE.FunctionTree inFunctionTree;
input BackendDAE.BackendDAE inBDAE;
Expand Down Expand Up @@ -1297,8 +1290,7 @@ algorithm
end matchcontinue;
end isDiscreteEquation;

public function isDiscreteExp "function: isDiscreteExp
Returns true if expression is a discrete expression."
public function isDiscreteExp " Returns true if expression is a discrete expression."
input DAE.Exp inExp;
input BackendDAE.Variables inVariables;
input BackendDAE.Variables knvars;
Expand All @@ -1318,8 +1310,7 @@ algorithm
end match;
end isDiscreteExp;

protected function isDiscreteExp1 "function: isDiscreteExp1
Returns true if expression is a discrete expression."
protected function isDiscreteExp1 " Returns true if expression is a discrete expression."
input tuple<DAE.Exp,tuple<BackendDAE.Variables,BackendDAE.Variables,Boolean>> inExp;
output tuple<DAE.Exp,tuple<BackendDAE.Variables,BackendDAE.Variables,Boolean>> outExp;
algorithm
Expand Down Expand Up @@ -6517,8 +6508,7 @@ algorithm
end matchcontinue;
end rhsConstant2;

// protected function freeFromAnyVar "function: freeFromAnyVar
// author: PA
// protected function freeFromAnyVar "// author: PA
// Helper function to rhsConstant2
// returns true if expression does not contain
// anyof the variables passed as argument."
Expand Down Expand Up @@ -7476,8 +7466,7 @@ algorithm
end match;
end traverseBackendDAEAttrDistribution;

// protected function traverseBackendDAEExpsSubscript "function: traverseBackendDAEExpsSubscript
// author: Frenkel TUD
// protected function traverseBackendDAEExpsSubscript "// author: Frenkel TUD
// helper for traverseBackendDAEExpsSubscript"
// replaceable type Type_a subtypeof Any;
// input DAE.Subscript inSubscript;
Expand Down Expand Up @@ -7690,8 +7679,7 @@ algorithm
end match;
end traverseBackendDAEExpsOptEqnWithUpdate;

public function traverseAlgorithmExps "function: traverseAlgorithmExps

public function traverseAlgorithmExps "
This function goes through the Algorithm structure and finds all the
expressions and performs the function on them
"
Expand All @@ -7717,8 +7705,7 @@ algorithm
end match;
end traverseAlgorithmExps;

public function traverseAlgorithmExpsWithUpdate "function: traverseAlgorithmExpsWithUpdate

public function traverseAlgorithmExpsWithUpdate "
This function goes through the Algorithm structure and finds all the
expressions and performs the function on them
"
Expand Down Expand Up @@ -7833,8 +7820,7 @@ partial function stateDeselectionFunc
end stateDeselectionFunc;

public function getSolvedSystem
" function: getSolvedSystem
Run the equation system pipeline."
" Run the equation system pipeline."
input BackendDAE.BackendDAE inDAE;
input Option<list<String>> strPreOptModules;
input Option<String> strmatchingAlgorithm;
Expand Down Expand Up @@ -8301,8 +8287,7 @@ end pastoptimiseDAE;
// end countComponents;

public function getSolvedSystemforJacobians
" function: getSolvedSystemforJacobians
Run the equation system pipeline."
" Run the equation system pipeline."
input BackendDAE.BackendDAE inDAE;
input Option<list<String>> strPreOptModules;
input Option<String> strmatchingAlgorithm;
Expand Down
6 changes: 2 additions & 4 deletions Compiler/BackEnd/BackendDump.mo
Expand Up @@ -550,8 +550,7 @@ algorithm
end dumpEquation;

public function dumpTearing
" function: dumpTearing
author: Frenkel TUD
" author: Frenkel TUD
Dump tearing vars and residual equations."
input list<list<Integer>> inResEqn;
input list<list<Integer>> inTearVar;
Expand Down Expand Up @@ -1723,8 +1722,7 @@ algorithm
end matchcontinue;
end printCallFunction2StrDIVISION;

// protected function printVarsStatistics "function: printVarsStatistics
// author: PA
// protected function printVarsStatistics "// author: PA
//
// Prints statistics on variables, etc.
// "
Expand Down
6 changes: 2 additions & 4 deletions Compiler/BackEnd/BackendEquation.mo
Expand Up @@ -1738,8 +1738,7 @@ algorithm
end equationRemove;

public function compressEquations
" function: compressEquations
author: Frenkel TUD 2012-11
" author: Frenkel TUD 2012-11
Closes the gabs "
input BackendDAE.EquationArray inEquationArray;
output BackendDAE.EquationArray outEquationArray;
Expand All @@ -1762,8 +1761,7 @@ algorithm
end compressEquations;

protected function compressEquations1
" function: compressEquations1
author: Frenkel TUD 2012-09"
" author: Frenkel TUD 2012-09"
input Integer index;
input Integer nEqns;
input array<Option<BackendDAE.Equation>> equOptArr;
Expand Down
9 changes: 3 additions & 6 deletions Compiler/BackEnd/BackendQSS.mo
Expand Up @@ -123,8 +123,7 @@ algorithm
end generateStructureCodeQSS;

public function getAllVars
"function: getAllVars
outputs a list with all variables and the subset of state variables contained in DAELow
" outputs a list with all variables and the subset of state variables contained in DAELow
author: XF
"
input BackendDAE.BackendDAE inDAELow1;
Expand All @@ -151,8 +150,7 @@ algorithm
end getAllVars;

public function getStateIndices
"function: getStateIndices
finds the indices of the state indices inside a list with variables.
" finds the indices of the state indices inside a list with variables.
author: XF
"
input list<BackendDAE.Var> allVars;
Expand Down Expand Up @@ -193,8 +191,7 @@ algorithm
end getStateIndices;

public function getDiscreteIndices
"function: getDiscreteIndices
finds the indices of the state indices inside a list with variables.
" finds the indices of the state indices inside a list with variables.
author: XF
"

Expand Down

0 comments on commit b957f4b

Please sign in to comment.