source: trunk/sources/HeuristicLab.Persistence/3.3/Default/Xml/Compact/NumberArray2XmlSerializerBase.cs @ 3937

Last change on this file since 3937 was 3937, checked in by epitzer, 9 years ago

Estimate or calculate StringBuffer sizes in advance, use iterator over string splits instead of arrays. (#1138)

File size: 4.4 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2010 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.Collections;
23using System.Text;
24using HeuristicLab.Persistence.Interfaces;
25using System;
26using HeuristicLab.Persistence.Core;
27using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
28using HeuristicLab.Persistence.Auxiliary;
29
30namespace HeuristicLab.Persistence.Default.Xml.Compact {
31
32  [StorableClass]
33  internal abstract class NumberArray2XmlSerializerBase<T> : CompactXmlSerializerBase<T> where T : class {
34
35    protected virtual char Separator { get { return ';'; } }
36    protected abstract string FormatValue(object o);
37    protected abstract object ParseValue(string o);
38
39    public override XmlString Format(T t) {
40      Array a = (Array)(object)t;
41      int[] lengths = new int[a.Rank];
42      int[] lowerBounds = new int[a.Rank];
43      StringBuilder sb = new StringBuilder(a.Rank * 3);
44      sb.Append(a.Rank);
45      int capacity = 1;
46      for (int i = 0; i < a.Rank; i++) {
47        sb.Append(Separator);
48        sb.Append(a.GetLength(i));
49        lengths[i] = a.GetLength(i);
50        capacity *= lengths[i];
51      }
52      sb.EnsureCapacity(capacity * 3);
53      for (int i = 0; i < a.Rank; i++) {
54        sb.Append(Separator);
55        sb.Append(a.GetLowerBound(i));
56        lowerBounds[i] = a.GetLowerBound(i);
57      }
58      int[] positions = (int[])lowerBounds.Clone();
59      while (positions[a.Rank - 1] < lengths[a.Rank - 1] + lowerBounds[a.Rank - 1]) {
60        sb.Append(Separator);
61        sb.Append(FormatValue(a.GetValue(positions)));
62        positions[0] += 1;
63        for (int i = 0; i < a.Rank - 1; i++) {
64          if (positions[i] >= lengths[i] + lowerBounds[i]) {
65            positions[i] = lowerBounds[i];
66            positions[i + 1] += 1;
67          } else {
68            break;
69          }
70        }
71      }
72      return new XmlString(sb.ToString());
73    }
74
75    public override T Parse(XmlString x) {
76      try {
77        IEnumerator values = x.Data.GetSplitEnumerator(Separator);
78        values.MoveNext();
79        int rank = int.Parse((string)values.Current);
80        int[] lengths = new int[rank];
81        for (int i = 0; i < rank; i++) {
82          values.MoveNext();
83          lengths[i] = int.Parse((string)values.Current);
84        }
85        int[] lowerBounds = new int[rank];
86        for (int i = 0; i < rank; i++) {
87          values.MoveNext();
88          lowerBounds[i] = int.Parse((string)values.Current);
89        }
90        Array a = Array.CreateInstance(this.SourceType.GetElementType(), lengths, lowerBounds);
91        int[] positions = (int[])lowerBounds.Clone();
92        while (values.MoveNext()) {
93          a.SetValue(ParseValue((string)values.Current), positions);
94          positions[0] += 1;
95          for (int i = 0; i < rank - 1; i++) {
96            if (positions[i] >= lengths[i]) {
97              positions[i] = 0;
98              positions[i + 1] += 1;
99            } else {
100              break;
101            }
102          }
103        }
104        if (positions[rank - 1] != lowerBounds[rank - 1] + lengths[rank - 1])
105          throw new PersistenceException("Insufficient number of elements while trying to fill number array.");
106        return (T)(object)a;
107      } catch (InvalidOperationException e) {
108        throw new PersistenceException("Insufficient information to rebuild number array.", e);
109      } catch (InvalidCastException e) {
110        throw new PersistenceException("Invalid element data or meta data to reconstruct number array.", e);
111      } catch (OverflowException e) {
112        throw new PersistenceException("Overflow during element parsing while trying to reconstruct number array.", e);
113      }
114    }
115  }
116
117}
Note: See TracBrowser for help on using the repository browser.