Changeset 1566 for trunk/sources/HeuristicLab.Persistence/3.3/Default/Decomposers/ArrayDecomposer.cs

Timestamp:

04/16/09 12:58:14 (16 years ago)

Author:

epitzer

Message:

Format white space. (Ctrl-K, Ctrl-D) (#548)

File:

• trunk/sources/HeuristicLab.Persistence/3.3/Default/Decomposers/ArrayDecomposer.cs (modified) (6 diffs)

trunk/sources/HeuristicLab.Persistence/3.3/Default/Decomposers/ArrayDecomposer.cs

@@ -5 +5 @@
 
 namespace HeuristicLab.Persistence.Default.Decomposers {
-    
+
   [EmptyStorableClass]
   public class ArrayDecomposer : IDecomposer {
@@ -20 +20 @@
       Array a = (Array)obj;
       yield return new Tag("rank", a.Rank);
-      for (int i = 0; i < a.Rank; i++) {      
+      for (int i = 0; i < a.Rank; i++) {
         yield return new Tag("length_" + i, a.GetLength(i));
       }
-      for (int i = 0; i < a.Rank; i++) {        
+      for (int i = 0; i < a.Rank; i++) {
         yield return new Tag("lowerBound_" + i, a.GetLowerBound(i));
-      }      
+      }
     }
 
     public IEnumerable<Tag> Decompose(object array) {
-      Array a = (Array)array;      
+      Array a = (Array)array;
       int[] lengths = new int[a.Rank];
       int[] lowerBounds = new int[a.Rank];
@@ -67 +67 @@
         lowerBounds[i] = (int)e.Current.Value;
       }
-      return Array.CreateInstance(t.GetElementType(), lengths, lowerBounds);      
+      return Array.CreateInstance(t.GetElementType(), lengths, lowerBounds);
     }
 
-    public void Populate(object instance, IEnumerable<Tag> elements, Type t) {      
+    public void Populate(object instance, IEnumerable<Tag> elements, Type t) {
       Array a = (Array)instance;
       int[] lengths = new int[a.Rank];
@@ -79 +79 @@
       for (int i = 0; i < a.Rank; i++) {
         lowerBounds[i] = a.GetLowerBound(i);
-      }      
+      }
       int[] positions = (int[])lowerBounds.Clone();
       IEnumerator<Tag> e = elements.GetEnumerator();
@@ -86 +86 @@
         a.SetValue(e.Current.Value, currentPositions);
         positions[0] += 1;
-        for (int i = 0; i < a.Rank-1; i++) {
-          if (positions[i] >= lengths[i]+lowerBounds[i]) {
+        for (int i = 0; i < a.Rank - 1; i++) {
+          if (positions[i] >= lengths[i] + lowerBounds[i]) {
             positions[i] = lowerBounds[i];
             positions[i + 1] += 1;
@@ -97 +97 @@
     }
   }
-  
+
 }