Append in the fast order

Author: sjoelund

Compiler/BackEnd/BackendVariable.mo

@@ -2907,15 +2907,16 @@ algorithm
   for var in inVars loop
     (_, outIndices) := traversingVarIndexFinder(var, inVariables, outIndices);
   end for;
+  outIndices := listReverse(outIndices);
 end getVarIndexFromVars;
 
 public function getVarIndexFromVariables
   input BackendDAE.Variables inVariables;
   input BackendDAE.Variables inVariables2;
   output list<Integer> v_lst;
 algorithm
-  v_lst := traverseBackendDAEVars(inVariables,
-    function traversingVarIndexFinder(inVars = inVariables2), {});
+  v_lst := listReverse(traverseBackendDAEVars(inVariables,
+    function traversingVarIndexFinder(inVars = inVariables2), {}));
 end getVarIndexFromVariables;
 
 protected function traversingVarIndexFinder
@@ -2932,7 +2933,7 @@ algorithm
   try
     cr := varCref(inVar);
     (_, indices) := getVar(cr, inVars);
-    outIndices := listAppend(inIndices, indices);
+    outIndices := listAppend(listReverse(indices), inIndices);
   else
     outIndices := inIndices;
   end try;