Free cookie consent management tool by TermsFeed Policy Generator

source: branches/crossvalidation-2434/HeuristicLab.Persistence/3.3/Default/Xml/Compact/NumberArray2XmlSerializerBase.cs @ 13401

Last change on this file since 13401 was 12012, checked in by ascheibe, 10 years ago

#2212 merged r12008, r12009, r12010 back into trunk

File size: 4.6 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
4 *
5 * This file is part of HeuristicLab.
6 *
7 * HeuristicLab is free software: you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation, either version 3 of the License, or
10 * (at your option) any later version.
11 *
12 * HeuristicLab is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License
18 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
19 */
20#endregion
21
22using System;
23using System.Collections;
24using System.Collections.Generic;
25using System.Linq;
26using System.Text;
27using HeuristicLab.Persistence.Auxiliary;
28using HeuristicLab.Persistence.Core;
29using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
30
31namespace HeuristicLab.Persistence.Default.Xml.Compact {
32
33  [StorableClass]
34  internal abstract class NumberArray2XmlSerializerBase<T> : CompactXmlSerializerBase<T> where T : class {
35
36    protected virtual char Separator { get { return ';'; } }
37    protected abstract string FormatValue(object o);
38    protected abstract object ParseValue(string o);
39
40    public override XmlString Format(T t) {
41      Array a = (Array)(object)t;
42      int[] lengths = new int[a.Rank];
43      int[] lowerBounds = new int[a.Rank];
44      StringBuilder sb = new StringBuilder(3 + a.Rank * 3);
45      sb.Append(a.Rank);
46      int nElements = 1;
47      for (int i = 0; i < a.Rank; i++) {
48        sb.Append(Separator);
49        sb.Append(a.GetLength(i));
50        lengths[i] = a.GetLength(i);
51        nElements *= lengths[i];
52      }
53      sb.EnsureCapacity(sb.Length + nElements * 3);
54      for (int i = 0; i < a.Rank; i++) {
55        sb.Append(Separator);
56        sb.Append(a.GetLowerBound(i));
57        lowerBounds[i] = a.GetLowerBound(i);
58      }
59      if (lengths.Any(l => l == 0))
60        return new XmlString(sb.ToString());
61      int[] positions = (int[])lowerBounds.Clone();
62      while (positions[a.Rank - 1] < lengths[a.Rank - 1] + lowerBounds[a.Rank - 1]) {
63        sb.Append(Separator);
64        sb.Append(FormatValue(a.GetValue(positions)));
65        positions[0] += 1;
66        for (int i = 0; i < a.Rank - 1; i++) {
67          if (positions[i] >= lengths[i] + lowerBounds[i]) {
68            positions[i] = lowerBounds[i];
69            positions[i + 1] += 1;
70          } else {
71            break;
72          }
73        }
74      }
75      return new XmlString(sb.ToString());
76    }
77
78    public override T Parse(XmlString x) {
79      try {
80        IEnumerator<string> values = x.Data.GetSplitEnumerator(Separator);
81        values.MoveNext();
82        int rank = int.Parse(values.Current);
83        int[] lengths = new int[rank];
84        for (int i = 0; i < rank; i++) {
85          values.MoveNext();
86          lengths[i] = int.Parse(values.Current);
87        }
88        int[] lowerBounds = new int[rank];
89        for (int i = 0; i < rank; i++) {
90          values.MoveNext();
91          lowerBounds[i] = int.Parse(values.Current);
92        }
93        Array a = Array.CreateInstance(this.SourceType.GetElementType(), lengths, lowerBounds);
94        int[] positions = (int[])lowerBounds.Clone();
95        while (values.MoveNext()) {
96          a.SetValue(ParseValue(values.Current), positions);
97          positions[0] += 1;
98          for (int i = 0; i < rank - 1; i++) {
99            if (positions[i] >= lowerBounds[i] + lengths[i]) {
100              positions[i] = lowerBounds[i];
101              positions[i + 1] += 1;
102            } else {
103              break;
104            }
105          }
106        }
107        if (positions[rank - 1] != lowerBounds[rank - 1] + lengths[rank - 1] && lengths.All(l => l != 0))
108          throw new PersistenceException("Insufficient number of elements while trying to fill number array.");
109        return (T)(object)a;
110      }
111      catch (InvalidOperationException e) {
112        throw new PersistenceException("Insufficient information to rebuild number array.", e);
113      }
114      catch (InvalidCastException e) {
115        throw new PersistenceException("Invalid element data or meta data to reconstruct number array.", e);
116      }
117      catch (OverflowException e) {
118        throw new PersistenceException("Overflow during element parsing while trying to reconstruct number array.", e);
119      }
120    }
121  }
122
123}
Note: See TracBrowser for help on using the repository browser.