[Janitor mode] Fix whitespace

git-svn-id: https://openmodelica.org/svn/OpenModelica/trunk@23276 f25d12d1-65f4-0310-ae8a-bbce733d8d8e
OpenModelica · Nov 7, 2014 · 7dc01b6 · 7dc01b6
1 parent 89f0013
commit 7dc01b6
Show file tree

Hide file tree

Showing 4 changed files with 14 additions and 14 deletions.
diff --git a/Compiler/BackEnd/BackendDAECreate.mo b/Compiler/BackEnd/BackendDAECreate.mo
@@ -254,42 +254,42 @@ algorithm
       case DAE.INITIAL_COMPLEX_EQUATION()
         algorithm
           (outEqns, outREqns, outIEqns) := lowerEqn(el, inFunctions, outEqns, outREqns, outIEqns);
-        then  
+        then
           ();
 
       // array equations
       case DAE.ARRAY_EQUATION()
         algorithm
           (outEqns, outREqns, outIEqns) := lowerEqn(el, inFunctions, outEqns, outREqns, outIEqns);
-        then  
+        then
           ();
 
       // initial array equations
       case DAE.INITIAL_ARRAY_EQUATION()
         algorithm
           (outEqns, outREqns, outIEqns) := lowerEqn(el, inFunctions, outEqns, outREqns, outIEqns);
-        then  
+        then
           ();
 
       // when equations
       case DAE.WHEN_EQUATION()
         algorithm
           (outEqns, outWhenClauses) := lowerWhenEqn(el, inFunctions, outEqns, outWhenClauses);
-        then  
+        then
           ();
 
       // if equation
       case DAE.IF_EQUATION()
         algorithm
           (outEqns, outREqns, outIEqns) := lowerEqn(el, inFunctions, outEqns, outREqns, outIEqns);
-        then  
+        then
           ();
 
       // initial if equation
       case DAE.INITIAL_IF_EQUATION()
         algorithm
           (outEqns, outREqns, outIEqns) := lowerEqn(el, inFunctions, outEqns, outREqns, outIEqns);
-        then  
+        then
           ();
 
       // algorithm
@@ -519,7 +519,7 @@ algorithm
         outEqns := BackendDAE.EQUATION(e1, e2, src, attr) :: outEqns;
       then
         ();
-      
+
     // variables: states and algebraic variables without binding equation
     case DAE.VAR(componentRef = cr, binding = NONE()) guard(isStateOrAlgvar(inElement))
       algorithm
@@ -545,7 +545,7 @@ algorithm
 
   end matchcontinue;
 end lowerVar;
-        
+
 protected function isStateOrAlgvar
   "@author adrpo
    check if this variable is a state or algebraic"

diff --git a/Compiler/BackEnd/BackendDAEUtil.mo b/Compiler/BackEnd/BackendDAEUtil.mo
@@ -882,7 +882,7 @@ algorithm
                  backendDAEType=btp, symjacs=symjacs, info=ei)))
       algorithm
         knvars := BackendVariable.traverseBackendDAEVarsWithUpdate(
-          knvars, function calculateValueTraverser(inEnv = graph), cache); 
+          knvars, function calculateValueTraverser(inEnv = graph), cache);
         // Reverse the order of the known vars in the hashtable. This is stupid,
         // but things break otherwise.
         knvars := BackendVariable.listVar(BackendVariable.varList(knvars));

diff --git a/Compiler/BackEnd/BackendVariable.mo b/Compiler/BackEnd/BackendVariable.mo
@@ -2216,7 +2216,7 @@ algorithm
   outVariables := BackendDAE.VARIABLES(indices, arr, buckets, 0);
 end emptyVars;
 
-public function emptyVarsSized 
+public function emptyVarsSized
   "Returns a Variable datastructure that is empty."
   input Integer size;
   output BackendDAE.Variables outVariables := emptyVars(size);
@@ -2225,7 +2225,7 @@ end emptyVarsSized;
 public function varList
   "Takes a BackendDAE.Variables and returns a list of all variables in it,
    useful for e.g. dumping.
-   
+
    NOTE: This function will fail if the Variables contains more than one set.
      This is because mergeVariables doesn't do a real merging, so if we just
      append all the variables from the sets we might get duplicates."
@@ -2865,7 +2865,7 @@ algorithm
   for i in 1:num_vars loop
     ovar := vars[i];
     if isSome(ovar) then
-      SOME(var) := ovar; 
+      SOME(var) := ovar;
       outVars := addVar(var, outVars);
     end if;
   end for;
@@ -3160,7 +3160,7 @@ protected
   DAE.ComponentRef cr;
 algorithm
   BackendDAE.VARIABLES(crefIndices = indices, varArr = arr,
-    bucketSize = buckets) := inVariables; 
+    bucketSize = buckets) := inVariables;
   hash_idx := ComponentReference.hashComponentRefMod(inCref, buckets) + 1;
   cr_indices := indices[hash_idx];
   BackendDAE.CREFINDEX(index = outIndex) := List.getMemberOnTrue(inCref,

diff --git a/Compiler/Util/BaseHashTable.mo b/Compiler/Util/BaseHashTable.mo
@@ -139,7 +139,7 @@ protected
 algorithm
   (key, _) := entry;
   (hashvec, varr, bsize, n, fntpl as (hashFunc, keyEqual, _, _)) := hashTable;
-  
+
   hash_idx := hashFunc(key, bsize) + 1;
   indices := hashvec[hash_idx];