Changeset 1419 for branches/New Persistence Exploration/Persistence/Persistence/Default/Decomposers/ArrayDecomposer.cs

Timestamp:

03/25/09 17:16:32 (15 years ago)

Author:

epitzer

Message:

Implement persistence of storables as decomposer. (#506)

File:

• branches/New Persistence Exploration/Persistence/Persistence/Default/Decomposers/ArrayDecomposer.cs (modified) (2 diffs)

branches/New Persistence Exploration/Persistence/Persistence/Default/Decomposers/ArrayDecomposer.cs

@@ -3 +3 @@
 using HeuristicLab.Persistence.Core;
 using HeuristicLab.Persistence.Interfaces;
+using System.Collections.Generic;
 
 namespace HeuristicLab.Persistence.Default.Decomposers {
@@ -13 +14 @@
     }
 
-    public IEnumerable DeCompose(object array) {
+    public IEnumerable<Tag> DeCompose(object array) {
       Array a = (Array)array;
-      yield return a.Rank;
+      yield return new Tag("rank", a.Rank);
       for (int i = 0; i < a.Rank; i++) {
-        yield return a.GetLength(i);
+        yield return new Tag("length_" + i, a.GetLength(i));
       }
       foreach (object o in (Array)array) {
-        yield return o;
+        yield return new Tag(null, o);
       }
     }
 
-    public object Compose(IEnumerable elements, Type t) {
-      IEnumerator e = elements.GetEnumerator();
+    public object CreateInstance(Type t) {
+      return null;
+    }
+
+    public object Populate(object instance, IEnumerable<Tag> elements, Type t) {
+      IEnumerator<Tag> e = elements.GetEnumerator();
       e.MoveNext();
-      int rank = (int)e.Current;
+      int rank = (int)e.Current.Value;
       int[] lengths = new int[rank];
       for (int i = 0; i < rank; i++) {
         e.MoveNext();
-        lengths[i] = (int)e.Current;
+        lengths[i] = (int)e.Current.Value;
       }
       Array a = Array.CreateInstance(t.GetElementType(), lengths);      
       int[] positions = new int[rank];
       while (e.MoveNext()) {
-        a.SetValue(e.Current, positions);
+        a.SetValue(e.Current.Value, positions);
         positions[0] += 1;
         for (int i = 0; i < rank-1; i++) {