source: branches/New Persistence Exploration/Persistence/Persistence/Default/Decomposers/ArrayDecomposer.cs @ 1434

using System;
using System.Collections;
using HeuristicLab.Persistence.Core;
using HeuristicLab.Persistence.Interfaces;
using System.Collections.Generic;

namespace HeuristicLab.Persistence.Default.Decomposers {
    
  public class ArrayDecomposer : IDecomposer {

    public bool CanDecompose(Type type) {
      return type.IsArray || type == typeof(Array);
    }

    public IEnumerable<Tag> DeCompose(object array) {
      Array a = (Array)array;
      yield return new Tag("rank", a.Rank);
      for (int i = 0; i < a.Rank; i++) {
        yield return new Tag("length_" + i, a.GetLength(i));
      }
      foreach (object o in (Array)array) {
        yield return new Tag(null, o);
      }
    }

    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.Value;
      int[] lengths = new int[rank];
      for (int i = 0; i < rank; i++) {
        e.MoveNext();
        lengths[i] = (int)e.Current.Value;
      }
      Array a = Array.CreateInstance(t.GetElementType(), lengths);      
      int[] positions = new int[rank];
      while (e.MoveNext()) {
        int[] currentPositions = positions;
        e.Current.SafeSet((value) => a.SetValue(value, currentPositions));        
        positions[0] += 1;
        for (int i = 0; i < rank-1; i++) {
          if (positions[i] >= lengths[i]) {
            positions[i] = 0;
            positions[i + 1] += 1;
          } else {
            break;
          }
        }
      }
      return a;
    }
  }
  
}