- fix commented descriptions

git-svn-id: https://openmodelica.org/svn/OpenModelica/trunk@16944 f25d12d1-65f4-0310-ae8a-bbce733d8d8e

Compiler/BackEnd/BackendDAEUtil.mo

@@ -6508,7 +6508,7 @@ algorithm
   end matchcontinue;
 end rhsConstant2;
 
-// protected 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."
@@ -7466,7 +7466,7 @@ algorithm
  end match;
 end traverseBackendDAEAttrDistribution;
 
-// protected function traverseBackendDAEExpsSubscript "//   author: Frenkel TUD
+// protected function traverseBackendDAEExpsSubscript "author: Frenkel TUD
 //   helper for traverseBackendDAEExpsSubscript"
 //   replaceable type Type_a subtypeof Any;
 //   input DAE.Subscript inSubscript;

Compiler/BackEnd/BackendDump.mo

@@ -1722,7 +1722,7 @@ algorithm
   end matchcontinue;
 end printCallFunction2StrDIVISION;
 
-// protected function printVarsStatistics "//   author: PA
+// protected function printVarsStatistics "author: PA
 // 
 //   Prints statistics on variables, etc.
 // "

Compiler/BackEnd/BinaryTree.mo

@@ -279,7 +279,7 @@ algorithm
   end matchcontinue;
 end treeAdd2;
 
-// protected function treeDelete2 "//   author: PA
+// protected function treeDelete2 "author: PA
 //   This function deletes an entry from the BinTree."
 //   input BinTree inBinTree;
 //   input String keystr;
@@ -344,7 +344,7 @@ end treeAdd2;
 //   end matchcontinue;
 // end treeDelete2;
 
-// protected function treeDeleteRightmostValue "//   author: PA
+// protected function treeDeleteRightmostValue "author: PA
 //   This function takes a BinTree and deletes the rightmost value of the tree.
 //   Tt returns this value and the updated BinTree. This function is used in
 //   the binary tree deletion function \'tree_delete\'.
@@ -391,7 +391,7 @@ end treeAdd2;
 //   end matchcontinue;
 // end treeDeleteRightmostValue;
 
-// protected function treePruneEmptyNodes "//   author: PA
+// protected function treePruneEmptyNodes "author: PA
 //   This function is a helper function to tree_delete
 //   It is used to delete empty nodes of the BinTree
 //   representation, that might be introduced when deleting nodes."
@@ -405,7 +405,7 @@ end treeAdd2;
 //   end matchcontinue;
 // end treePruneEmptyNodes;
 
-// protected function bintreeDepth "//   author: PA
+// protected function bintreeDepth "author: PA
 //   This function calculates the depth of the Binary Tree given
 //   as input. It can be used for debugging purposes to investigate
 //   how balanced binary trees are."

Compiler/BackEnd/BinaryTreeInt.mo

@@ -239,7 +239,7 @@ algorithm
   end matchcontinue;
 end treeAdd;
 
-// protected function treeDelete2 "//   author: PA
+// protected function treeDelete2 "author: PA
 //   This function deletes an entry from the BinTree."
 //   input BinTree inBinTree;
 //   input Integer inKey;
@@ -302,7 +302,7 @@ end treeAdd;
 //   end matchcontinue;
 // end treeDelete2;
 
-// protected function treeDeleteRightmostValue "//   author: PA
+// protected function treeDeleteRightmostValue "author: PA
 //   This function takes a BinTree and deletes the rightmost value of the tree.
 //   Tt returns this value and the updated BinTree. This function is used in
 //   the binary tree deletion function \'tree_delete\'.
@@ -349,7 +349,7 @@ end treeAdd;
 //   end matchcontinue;
 // end treeDeleteRightmostValue;
 
-// protected function treePruneEmptyNodes "//   author: PA
+// protected function treePruneEmptyNodes "author: PA
 //   This function is a helper function to tree_delete
 //   It is used to delete empty nodes of the BinTree
 //   representation, that might be introduced when deleting nodes."
@@ -363,7 +363,7 @@ end treeAdd;
 //   end matchcontinue;
 // end treePruneEmptyNodes;
 
-// protected function bintreeDepth "//   author: PA
+// protected function bintreeDepth "author: PA
 //   This function calculates the depth of the Binary Tree given
 //   as input. It can be used for debugging purposes to investigate
 //   how balanced binary trees are."

Compiler/BackEnd/DAEQuery.mo

@@ -534,7 +534,7 @@ algorithm
   end matchcontinue;
 end incidenceRow;
 
-// protected function incidenceRowStmts "//   author: PA
+// protected function incidenceRowStmts "author: PA
 //   Helper function to incidenceRow, investigates statements for
 //   variables, returning variable indexes."
 //   input list<DAE.Statement> inAlgorithmStatementLst;

Compiler/BackEnd/IndexReduction.mo

@@ -5192,8 +5192,7 @@ algorithm
   end match;
 end generateSelectEquations;
 
-// protected function generateCondition
-// "//   author: Frenkel TUD 2012-08"
+// protected function generateCondition "author: Frenkel TUD 2012-08"
 //   input Integer indx;
 //   input Integer size;
 //   input array<DAE.Exp> inExps;
@@ -8021,8 +8020,7 @@ algorithm
   end matchcontinue;
 end addStateOrder;
 
-// protected function addAliasStateOrder
-// "//   author: Frenkel TUD 2012-06
+// protected function addAliasStateOrder "author: Frenkel TUD 2012-06
 //   add state and replace alias state in the
 //   stateorder."
 //   input DAE.ComponentRef cr;
@@ -8095,8 +8093,7 @@ end addStateOrder;
 //   end matchcontinue;
 // end addAliasStateOrder;
 
-// protected function replaceDerStateOrder
-// "//   author: Frenkel TUD 2012-06
+// protected function replaceDerStateOrder "author: Frenkel TUD 2012-06
 //   replace a state  in the
 //   stateorder."
 //   input DAE.ComponentRef cr;

Compiler/Main/Main.mo

@@ -712,8 +712,7 @@ algorithm
   end matchcontinue;
 end optimizeDae;
 
-// protected function modpar
-// "//   The automatic paralellzation module."
+// protected function modpar "The automatic paralellzation module."
 //   input BackendDAE.BackendDAE inBackendDAE;
 // algorithm
 //   _ := matchcontinue inBackendDAE