- List optimizations by using dangerous listReverseInPlace.

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

Author: perost

Compiler/FrontEnd/Patternm.mo

@@ -2437,7 +2437,7 @@ public function sortPatternsByComplexity
   input list<DAE.Pattern> inPatterns;
   output list<tuple<DAE.Pattern,Integer>> outPatterns;
 algorithm
-  outPatterns := List.toListWithPositions(inPatterns,0,{});
+  outPatterns := List.toListWithPositions(inPatterns);
   outPatterns := List.sort(outPatterns, sortPatternsByComplexityWork);
 end sortPatternsByComplexity;
 

Compiler/Util/Graph.mo

@@ -1096,7 +1096,7 @@ public function filterGraph
     output Boolean outCond;
   end CondFunc;
 algorithm
-  outGraph := List.accumulateMapAccum1(inGraph, filterGraph2, inCondFunc, {});
+  outGraph := List.accumulateMapAccum1(inGraph, filterGraph2, inCondFunc);
 end filterGraph;
 
 protected function filterGraph2