Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HeuristicLab.Hive_Milestone2/sources/HeuristicLab.Data/3.3/IntMatrixData.cs @ 4401

Last change on this file since 4401 was 1669, checked in by epitzer, 16 years ago

Migrate HL.Data-3.3 to new persistence library. (#603)

File size: 3.5 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2008 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.Generic;
24using System.Text;
25using System.Xml;
26using HeuristicLab.Core;
27using System.Globalization;
28
29namespace HeuristicLab.Data {
30  /// <summary>
31  /// A two-dimensional matrix of integer values.
32  /// </summary>
33  public class IntMatrixData : ArrayDataBase {
34    /// <summary>
35    /// Gets or sets the int values of the matrix.
36    /// </summary>
37    /// <remarks>Uses property <see cref="ArrayDataBase.Data"/> of base class <see cref="ArrayDataBase"/>.
38    /// No own data storage present.</remarks>
39    public new int[,] Data {
40      get { return (int[,])base.Data; }
41      set { base.Data = value; }
42    }
43
44    /// <summary>
45    /// Initializes a new instance of <see cref="IntMatrixData"/>.
46    /// </summary>
47    public IntMatrixData() {
48      Data = new int[1, 1];
49    }
50    /// <summary>
51    /// Initializes a new instance of <see cref="IntMatrixData"/>.
52    /// <note type="caution"> No CopyConstructor! <paramref name="data"/> is not copied!</note>
53    /// </summary>
54    /// <param name="data">The two-dimensional int matrix the instance should represent.</param>
55    public IntMatrixData(int[,] data) {
56      Data = data;
57    }
58
59    /// <summary>
60    /// Creates a new instance of <see cref="IntMatrixDataView"/>.
61    /// </summary>
62    /// <returns>The created instance as <see cref="IntMatrixDataView"/>.</returns>
63    public override IView CreateView() {
64      return new IntMatrixDataView(this);
65    }
66
67    /// <summary>
68    /// The string representation of the matrix.
69    /// </summary>
70    /// <returns>The elements of the matrix as a string, line by line, each element separated by a
71    /// semicolon and formatted according to the local number format.</returns>
72    public override string ToString() {
73      return ToString(CultureInfo.CurrentCulture.NumberFormat);
74    }
75
76    /// <summary>
77    /// The string representation of the matrix, considering a specified <paramref name="format"/>.
78    /// </summary>
79    /// <param name="format">The <see cref="NumberFormatInfo"/> the int values are formatted accordingly.</param>
80    /// <returns>The elements of the matrix as a string, line by line, each element separated by a
81    /// semicolon and formatted according to the specified <paramref name="format"/>.</returns>
82    private string ToString(NumberFormatInfo format) {
83      StringBuilder builder = new StringBuilder();
84      for (int i = 0; i < Data.GetLength(0); i++) {
85        for (int j = 0; j < Data.GetLength(1); j++) {
86          builder.Append(";");
87          builder.Append(Data[i, j].ToString(format));
88        }
89      }
90      if (builder.Length > 0) builder.Remove(0, 1);
91      return builder.ToString();
92    }
93  }
94}
Note: See TracBrowser for help on using the repository browser.