[4858] | 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 |
|
---|
| 22 | using System;
|
---|
| 23 |
|
---|
| 24 | namespace HeuristicLab.Problems.DataAnalysis {
|
---|
| 25 | public static class MatrixExtensions<T> {
|
---|
| 26 | public static T[,] Create(T[] first, T[] second) {
|
---|
| 27 | if (first.Length != second.Length)
|
---|
| 28 | throw new ArgumentException("Both arrays must be of same length.");
|
---|
| 29 | T[,] array = new T[first.Length, 2];
|
---|
| 30 | for (int i = 0; i < first.Length; i++) {
|
---|
| 31 | array[i, 0] = first[i];
|
---|
| 32 | array[i, 1] = second[i];
|
---|
| 33 | }
|
---|
| 34 | return array;
|
---|
| 35 | }
|
---|
| 36 |
|
---|
| 37 | public static T[] GetColumn(T[,] matrix, int column) {
|
---|
| 38 | if (column >= matrix.GetLength(1)) throw new ArgumentException("Invalid column index: " + column + ". Matrix has only " + matrix.GetLength(1) + " columns.");
|
---|
| 39 | T[] result = new T[matrix.GetLength(0)];
|
---|
| 40 | for (int i = 0; i < result.Length; i++) {
|
---|
| 41 | result[i] = matrix[i, column];
|
---|
| 42 | }
|
---|
| 43 | return result;
|
---|
| 44 | }
|
---|
| 45 | }
|
---|
| 46 | }
|
---|