mirror of
https://github.com/hanzoai/jube-fork.git
synced 2026-10-30 18:33:33 +00:00
richard-churchman
cc0a2bee21
Included open-source Accord.net library code natively to the solution given the deprecated state of that project. Accord.net will be supported inside Jube for own needs (such as upgrading to .Net 7+). Accord.net libraries modified to compile to .Net 6. Modified Accord.net libraries to better support Newtonsoft Json.net serialisation. Included annotations in the Accord.net libraries to house important dependency statistics. Serialised json can be used independently of Jube to recall a Neural Network. Removal of Binary Serializer totally as a precursor to the projects support of .Net 7+. Extensive bug fixing in crucial functions of Neural Network training and recall. While this part of the system remains in Alpha, it is substantially more fit for purpose.
1007 lines
37 KiB
C#
1007 lines
37 KiB
C#
// Accord Math Library
|
|
// The Accord.NET Framework
|
|
// http://accord-framework.net
|
|
//
|
|
// Copyright © César Souza, 2009-2017
|
|
// cesarsouza at gmail.com
|
|
//
|
|
// This library is free software; you can redistribute it and/or
|
|
// modify it under the terms of the GNU Lesser General Public
|
|
// License as published by the Free Software Foundation; either
|
|
// version 2.1 of the License, or (at your option) any later version.
|
|
//
|
|
// This library is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
// Lesser General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU Lesser General Public
|
|
// License along with this library; if not, write to the Free Software
|
|
// Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
//
|
|
|
|
namespace Accord.Math
|
|
{
|
|
using System;
|
|
using System.Collections.Generic;
|
|
|
|
public static partial class Matrix
|
|
{
|
|
|
|
/// <summary>
|
|
/// Returns a sub matrix extracted from the current matrix.
|
|
/// </summary>
|
|
///
|
|
/// <param name="source">The matrix to return the submatrix from.</param>
|
|
/// <param name="startRow">Start row index</param>
|
|
/// <param name="endRow">End row index</param>
|
|
/// <param name="startColumn">Start column index</param>
|
|
/// <param name="endColumn">End column index</param>
|
|
///
|
|
public static T[,] Get<T>(this T[,] source,
|
|
int startRow, int endRow, int startColumn, int endColumn)
|
|
{
|
|
return get(source, null, startRow, endRow, startColumn, endColumn);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Returns a sub matrix extracted from the current matrix.
|
|
/// </summary>
|
|
///
|
|
/// <param name="source">The matrix to return the submatrix from.</param>
|
|
/// <param name="destination">The matrix where results should be stored.</param>
|
|
/// <param name="startRow">Start row index</param>
|
|
/// <param name="endRow">End row index</param>
|
|
/// <param name="startColumn">Start column index</param>
|
|
/// <param name="endColumn">End column index</param>
|
|
///
|
|
public static T[,] Get<T>(this T[,] source, T[,] destination,
|
|
int startRow, int endRow, int startColumn, int endColumn)
|
|
{
|
|
if (destination == null)
|
|
throw new ArgumentNullException("destination");
|
|
|
|
int rows = source.Rows();
|
|
int cols = source.Columns();
|
|
|
|
startRow = index(startRow, rows);
|
|
startColumn = index(startColumn, cols);
|
|
|
|
endRow = end(endRow, rows);
|
|
endColumn = end(endColumn, cols);
|
|
|
|
if (destination.GetLength(0) < endRow - startRow)
|
|
throw new DimensionMismatchException("destination",
|
|
"The destination matrix must be big enough to accommodate the results.");
|
|
|
|
if (destination.GetLength(1) < endColumn - startColumn)
|
|
throw new DimensionMismatchException("destination",
|
|
"The destination matrix must be big enough to accommodate the results.");
|
|
|
|
return get(source, destination, startRow, endRow, startColumn, endColumn);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Returns a sub matrix extracted from the current matrix.
|
|
/// </summary>
|
|
///
|
|
/// <param name="source">The matrix to return the submatrix from.</param>
|
|
/// <param name="rowIndexes">Array of row indices. Pass null to select all indices.</param>
|
|
/// <param name="columnIndexes">Array of column indices. Pass null to select all indices.</param>
|
|
/// <param name="result">An optional matrix where the results should be stored.</param>
|
|
///
|
|
public static T[,] Get<T>(this T[,] source, int[] rowIndexes, int[] columnIndexes, T[,] result = null)
|
|
{
|
|
return get(source, result, rowIndexes, columnIndexes);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Returns a sub matrix extracted from the current matrix.
|
|
/// </summary>
|
|
///
|
|
/// <param name="source">The matrix to return the submatrix from.</param>
|
|
/// <param name="rowMask">Array of row indicators. Pass null to select all indices.</param>
|
|
/// <param name="columnMask">Array of column indicators. Pass null to select all indices.</param>
|
|
/// <param name="result">An optional matrix where the results should be stored.</param>
|
|
///
|
|
public static T[,] Get<T>(this T[,] source, bool[] rowMask, bool[] columnMask, T[,] result = null)
|
|
{
|
|
return get(source, result, rowMask.Find(x => x), columnMask.Find(x => x));
|
|
}
|
|
|
|
/// <summary>
|
|
/// Returns a sub matrix extracted from the current matrix.
|
|
/// </summary>
|
|
///
|
|
/// <param name="source">The matrix to return the submatrix from.</param>
|
|
/// <param name="destination">The matrix where results should be stored.</param>
|
|
/// <param name="rowIndexes">Array of row indices. Pass null to select all indices.</param>
|
|
/// <param name="columnIndexes">Array of column indices. Pass null to select all indices.</param>
|
|
///
|
|
public static T[,] Get<T>(this T[,] source, T[,] destination, int[] rowIndexes, int[] columnIndexes)
|
|
{
|
|
if (destination == null)
|
|
throw new ArgumentNullException("destination");
|
|
|
|
return get(source, destination, rowIndexes, columnIndexes);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Returns a sub matrix extracted from the current matrix.
|
|
/// </summary>
|
|
///
|
|
/// <param name="source">The matrix to return the submatrix from.</param>
|
|
/// <param name="rowIndexes">Array of row indices</param>
|
|
///
|
|
public static T[,] Get<T>(this T[,] source, int[] rowIndexes)
|
|
{
|
|
return get(source, null, rowIndexes, null);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Returns a sub matrix extracted from the current matrix.
|
|
/// </summary>
|
|
///
|
|
/// <param name="source">The matrix to return the submatrix from.</param>
|
|
/// <param name="startRow">Starting row index</param>
|
|
/// <param name="endRow">End row index</param>
|
|
/// <param name="columnIndexes">Array of column indices</param>
|
|
///
|
|
/// <remarks>
|
|
/// Routine adapted from Lutz Roeder's Mapack for .NET, September 2000.
|
|
/// </remarks>
|
|
///
|
|
public static T[,] Get<T>(this T[,] source, int startRow, int endRow, int[] columnIndexes)
|
|
{
|
|
if (source == null)
|
|
throw new ArgumentNullException("source");
|
|
|
|
int rows = source.Rows();
|
|
int cols = source.Columns();
|
|
|
|
startRow = index(startRow, rows);
|
|
endRow = end(endRow, rows);
|
|
|
|
int newRows = endRow - startRow;
|
|
int newCols = cols;
|
|
|
|
if ((startRow > endRow) || (startRow < 0) || (startRow > rows) || (endRow < 0) || (endRow > rows))
|
|
{
|
|
throw new ArgumentException("Argument out of range.");
|
|
}
|
|
|
|
T[,] destination;
|
|
|
|
if (columnIndexes != null)
|
|
{
|
|
newCols = columnIndexes.Length;
|
|
for (int j = 0; j < columnIndexes.Length; j++)
|
|
if ((columnIndexes[j] < 0) || (columnIndexes[j] >= cols))
|
|
throw new ArgumentException("Argument out of range.");
|
|
|
|
destination = new T[newRows, newCols];
|
|
|
|
for (int i = startRow; i < endRow; i++)
|
|
for (int j = 0; j < columnIndexes.Length; j++)
|
|
destination[i - startRow, j] = source[i, columnIndexes[j]];
|
|
}
|
|
else
|
|
{
|
|
if (startRow == 0 && endRow == rows)
|
|
return source;
|
|
|
|
destination = new T[newRows, newCols];
|
|
|
|
for (int i = startRow; i < endRow; i++)
|
|
for (int j = 0; j < newCols; j++)
|
|
destination[i - startRow, j] = source[i, j];
|
|
}
|
|
|
|
return destination;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Returns a sub matrix extracted from the current matrix.
|
|
/// </summary>
|
|
///
|
|
/// <param name="source">The matrix to return the submatrix from.</param>
|
|
/// <param name="rowIndexes">Array of row indices</param>
|
|
/// <param name="startColumn">Start column index</param>
|
|
/// <param name="endColumn">End column index</param>
|
|
///
|
|
/// <remarks>
|
|
/// Routine adapted from Lutz Roeder's Mapack for .NET, September 2000.
|
|
/// </remarks>
|
|
///
|
|
public static T[,] Get<T>(this T[,] source, int[] rowIndexes, int startColumn, int endColumn)
|
|
{
|
|
if (source == null)
|
|
throw new ArgumentNullException("source");
|
|
|
|
int rows = source.Rows();
|
|
int cols = source.Columns();
|
|
|
|
startColumn = index(startColumn, cols);
|
|
endColumn = end(endColumn, cols);
|
|
|
|
int newRows = rows;
|
|
int newCols = endColumn - startColumn;
|
|
|
|
if ((startColumn > endColumn) || (startColumn < 0) || (startColumn > cols) || (endColumn < 0) || (endColumn > cols))
|
|
{
|
|
throw new ArgumentException("Argument out of range.");
|
|
}
|
|
|
|
T[,] destination;
|
|
|
|
if (rowIndexes != null)
|
|
{
|
|
newRows = rowIndexes.Length;
|
|
for (int j = 0; j < rowIndexes.Length; j++)
|
|
if ((rowIndexes[j] < 0) || (rowIndexes[j] >= rows))
|
|
throw new ArgumentException("Argument out of range.");
|
|
|
|
destination = new T[newRows, newCols];
|
|
|
|
for (int i = 0; i < rowIndexes.Length; i++)
|
|
for (int j = startColumn; j < endColumn; j++)
|
|
destination[i, j - startColumn] = source[rowIndexes[i], j];
|
|
}
|
|
else
|
|
{
|
|
if (startColumn == 0 && endColumn == cols)
|
|
return source;
|
|
|
|
destination = new T[newRows, newCols];
|
|
|
|
for (int i = 0; i < newRows; i++)
|
|
for (int j = startColumn; j < endColumn; j++)
|
|
destination[i, j - startColumn] = source[i, j];
|
|
}
|
|
|
|
return destination;
|
|
}
|
|
|
|
private static int end(int end, int length)
|
|
{
|
|
if (end <= 0)
|
|
end = length + end;
|
|
return end;
|
|
}
|
|
|
|
private static int index(int end, int length)
|
|
{
|
|
if (end < 0)
|
|
end = length + end;
|
|
return end;
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/// <summary>
|
|
/// Returns a sub matrix extracted from the current matrix.
|
|
/// </summary>
|
|
///
|
|
/// <param name="source">The matrix to return the submatrix from.</param>
|
|
/// <param name="startRow">Start row index</param>
|
|
/// <param name="endRow">End row index</param>
|
|
/// <param name="startColumn">Start column index</param>
|
|
/// <param name="endColumn">End column index</param>
|
|
///
|
|
public static T[][] Get<T>(this T[][] source,
|
|
int startRow, int endRow, int startColumn, int endColumn)
|
|
{
|
|
return get(source, null, startRow, endRow, startColumn, endColumn, false);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Returns a sub matrix extracted from the current matrix.
|
|
/// </summary>
|
|
///
|
|
/// <param name="destination">The matrix where the values should be stored.</param>
|
|
/// <param name="values">The values to be stored.</param>
|
|
/// <param name="startRow">Start row index in the destination matrix.</param>
|
|
/// <param name="endRow">End row index in the destination matrix.</param>
|
|
/// <param name="startColumn">Start column index in the destination matrix.</param>
|
|
/// <param name="endColumn">End column index in the destination matrix.</param>
|
|
///
|
|
public static T[][] Set<T>(this T[][] destination,
|
|
int startRow, int endRow, int startColumn, int endColumn, T[][] values)
|
|
{
|
|
return set(destination, values, startRow, endRow, startColumn, endColumn);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Sets elements from a matrix to a given value.
|
|
/// </summary>
|
|
///
|
|
/// <param name="values">The matrix of values to be changed.</param>
|
|
/// <param name="match">The function used to determine whether an
|
|
/// element in the matrix should be changed or not.</param>
|
|
/// <param name="value">The values to set the elements to.</param>
|
|
///
|
|
public static T[][] Set<T>(this T[][] values, Func<T, bool> match, T value)
|
|
{
|
|
for (int i = 0; i < values.Length; i++)
|
|
{
|
|
for (int j = 0; j < values[i].Length; j++)
|
|
{
|
|
if (match(values[i][j]))
|
|
values[i][j] = value;
|
|
}
|
|
}
|
|
|
|
return values;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Returns a sub matrix extracted from the current matrix.
|
|
/// </summary>
|
|
///
|
|
/// <param name="source">The matrix to return the submatrix from.</param>
|
|
/// <param name="rowIndexes">Array of row indices. Pass null to select all indices.</param>
|
|
/// <param name="columnIndexes">Array of column indices. Pass null to select all indices.</param>
|
|
/// <param name="reuseMemory">Set to true to avoid memory allocations
|
|
/// when possible. This might result on the shallow copies of some
|
|
/// elements. Default is false (default is to always provide a true,
|
|
/// deep copy of every element in the matrices, using more memory).</param>
|
|
/// <param name="result">An optional matrix where the results should be stored.</param>
|
|
///
|
|
public static T[][] Get<T>(this T[][] source,
|
|
int[] rowIndexes, int[] columnIndexes, bool reuseMemory = false, T[][] result = null)
|
|
{
|
|
return get(source, result, rowIndexes, columnIndexes, reuseMemory);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Returns a sub matrix extracted from the current matrix.
|
|
/// </summary>
|
|
///
|
|
/// <param name="source">The matrix to return the submatrix from.</param>
|
|
/// <param name="rowMask">Array of row indicators. Pass null to select all indices.</param>
|
|
/// <param name="columnMask">Array of column indicators. Pass null to select all indices.</param>
|
|
/// <param name="reuseMemory">Set to true to avoid memory allocations
|
|
/// when possible. This might result on the shallow copies of some
|
|
/// elements. Default is false (default is to always provide a true,
|
|
/// deep copy of every element in the matrices, using more memory).</param>
|
|
/// <param name="result">An optional matrix where the results should be stored.</param>
|
|
///
|
|
public static T[][] Get<T>(this T[][] source,
|
|
bool[] rowMask, bool[] columnMask, bool reuseMemory = false, T[][] result = null)
|
|
{
|
|
return get(source, result, rowMask.Find(x => x), columnMask.Find(x => x), reuseMemory);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Returns a sub matrix extracted from the current matrix.
|
|
/// </summary>
|
|
///
|
|
/// <param name="source">The matrix to return the submatrix from.</param>
|
|
/// <param name="indexes">Array of indices.</param>
|
|
/// <param name="transpose">True to return a transposed matrix; false otherwise.</param>
|
|
///
|
|
public static T[][] Get<T>(this T[][] source, int[] indexes, bool transpose = false)
|
|
{
|
|
if (source == null)
|
|
throw new ArgumentNullException("source");
|
|
if (indexes == null)
|
|
throw new ArgumentNullException("indexes");
|
|
|
|
int rows = source.Length;
|
|
if (rows == 0) return new T[0][];
|
|
int cols = source[0].Length;
|
|
|
|
T[][] destination;
|
|
|
|
if (transpose)
|
|
{
|
|
destination = new T[cols][];
|
|
|
|
for (int j = 0; j < destination.Length; j++)
|
|
{
|
|
destination[j] = new T[indexes.Length];
|
|
for (int i = 0; i < indexes.Length; i++)
|
|
destination[j][i] = source[indexes[i]][j];
|
|
}
|
|
}
|
|
else
|
|
{
|
|
destination = new T[indexes.Length][];
|
|
|
|
for (int i = 0; i < indexes.Length; i++)
|
|
destination[i] = source[indexes[i]];
|
|
}
|
|
|
|
return destination;
|
|
}
|
|
|
|
|
|
/// <summary>
|
|
/// Returns a sub matrix extracted from the current matrix.
|
|
/// </summary>
|
|
///
|
|
/// <param name="source">The matrix to return the submatrix from.</param>
|
|
/// <param name="rowIndexes">Array of row indices</param>
|
|
/// <param name="startColumn">Start column index</param>
|
|
/// <param name="endColumn">End column index</param>
|
|
/// <param name="reuseMemory">Set to true to avoid memory allocations
|
|
/// when possible. This might result on the shallow copies of some
|
|
/// elements. Default is false (default is to always provide a true,
|
|
/// deep copy of every element in the matrices, using more memory).</param>
|
|
///
|
|
/// <remarks>
|
|
/// Routine adapted from Lutz Roeder's Mapack for .NET, September 2000.
|
|
/// </remarks>
|
|
///
|
|
public static T[][] Get<T>(this T[][] source, int[] rowIndexes,
|
|
int startColumn, int endColumn, bool reuseMemory = false)
|
|
{
|
|
if (source == null)
|
|
throw new ArgumentNullException("source");
|
|
|
|
int rows = source.Length;
|
|
if (rows == 0)
|
|
return new T[0][];
|
|
int cols = source[0].Length;
|
|
|
|
startColumn = index(startColumn, cols);
|
|
endColumn = end(endColumn, cols);
|
|
|
|
int newRows = rows;
|
|
int newCols = endColumn - startColumn;
|
|
|
|
if ((startColumn > endColumn) || (startColumn < 0) || (startColumn > cols) || (endColumn < 0) || (endColumn > cols))
|
|
{
|
|
throw new ArgumentException("Argument out of range.");
|
|
}
|
|
|
|
T[][] destination;
|
|
|
|
bool canReuseMemory = startColumn == 0 && endColumn == cols;
|
|
|
|
if (rowIndexes != null)
|
|
{
|
|
newRows = rowIndexes.Length;
|
|
for (int j = 0; j < rowIndexes.Length; j++)
|
|
if ((rowIndexes[j] < 0) || (rowIndexes[j] >= rows))
|
|
throw new ArgumentException("Argument out of range.");
|
|
|
|
destination = new T[newRows][];
|
|
|
|
if (canReuseMemory && reuseMemory)
|
|
{
|
|
for (int i = 0; i < rowIndexes.Length; i++)
|
|
destination[i] = source[rowIndexes[i]];
|
|
}
|
|
else
|
|
{
|
|
for (int i = 0; i < rowIndexes.Length; i++)
|
|
{
|
|
var row = destination[i] = new T[newCols];
|
|
for (int j = startColumn; j < endColumn; j++)
|
|
row[j - startColumn] = source[rowIndexes[i]][j];
|
|
}
|
|
}
|
|
}
|
|
else
|
|
{
|
|
if (startColumn == 0 && endColumn == cols)
|
|
return source;
|
|
|
|
destination = new T[newRows][];
|
|
|
|
for (int i = 0; i < destination.Length; i++)
|
|
{
|
|
var row = destination[i] = new T[newCols];
|
|
for (int j = startColumn; j < endColumn; j++)
|
|
row[j - startColumn] = source[i][j];
|
|
}
|
|
}
|
|
|
|
return destination;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Returns a sub matrix extracted from the current matrix.
|
|
/// </summary>
|
|
///
|
|
/// <param name="source">The matrix to return the submatrix from.</param>
|
|
/// <param name="startRow">Starting row index</param>
|
|
/// <param name="endRow">End row index</param>
|
|
/// <param name="columnIndexes">Array of column indices</param>
|
|
///
|
|
/// <remarks>
|
|
/// Routine adapted from Lutz Roeder's Mapack for .NET, September 2000.
|
|
/// </remarks>
|
|
///
|
|
public static T[][] Get<T>(this T[][] source, int startRow, int endRow, int[] columnIndexes)
|
|
{
|
|
if (source == null)
|
|
throw new ArgumentNullException("source");
|
|
|
|
int rows = source.Length;
|
|
if (rows == 0)
|
|
return new T[0][];
|
|
int cols = source[0].Length;
|
|
|
|
startRow = index(startRow, rows);
|
|
endRow = end(endRow, rows);
|
|
|
|
int newRows = endRow - startRow;
|
|
int newCols = cols;
|
|
|
|
if ((startRow > endRow) || (startRow < 0) || (startRow > rows) || (endRow < 0) || (endRow > rows))
|
|
{
|
|
throw new ArgumentException("Argument out of range");
|
|
}
|
|
|
|
|
|
T[][] destination;
|
|
|
|
if (columnIndexes != null)
|
|
{
|
|
newCols = columnIndexes.Length;
|
|
for (int j = 0; j < columnIndexes.Length; j++)
|
|
if ((columnIndexes[j] < 0) || (columnIndexes[j] >= cols))
|
|
throw new ArgumentException("Argument out of range.");
|
|
|
|
destination = new T[newRows][];
|
|
for (int i = 0; i < destination.Length; i++)
|
|
destination[i] = new T[newCols];
|
|
|
|
for (int i = startRow; i < endRow; i++)
|
|
{
|
|
for (int j = 0; j < columnIndexes.Length; j++)
|
|
destination[i - startRow][j] = source[i][columnIndexes[j]];
|
|
}
|
|
}
|
|
else
|
|
{
|
|
if (startRow == 0 && endRow == rows)
|
|
return source;
|
|
|
|
destination = new T[newRows][];
|
|
for (int i = 0; i < destination.Length; i++)
|
|
destination[i] = new T[newCols];
|
|
|
|
for (int i = startRow; i < endRow; i++)
|
|
for (int j = 0; j < newCols; j++)
|
|
destination[i - startRow][j] = source[i][j];
|
|
}
|
|
|
|
return destination;
|
|
}
|
|
|
|
|
|
|
|
|
|
/// <summary>
|
|
/// Returns a subvector extracted from the current vector.
|
|
/// </summary>
|
|
///
|
|
/// <param name="source">The vector to return the subvector from.</param>
|
|
/// <param name="indexes">Array of indices.</param>
|
|
/// <param name="inPlace">True to return the results in place, changing the
|
|
/// original <paramref name="source"/> vector; false otherwise.</param>
|
|
///
|
|
public static T[] Get<T>(this T[] source, int[] indexes, bool inPlace = false)
|
|
{
|
|
if (source == null)
|
|
throw new ArgumentNullException("source");
|
|
|
|
if (indexes == null)
|
|
throw new ArgumentNullException("indexes");
|
|
|
|
if (inPlace && source.Length != indexes.Length)
|
|
throw new DimensionMismatchException("Source and indexes arrays must have the same dimension for in-place operations.");
|
|
|
|
var destination = new T[indexes.Length];
|
|
for (int i = 0; i < indexes.Length; i++)
|
|
{
|
|
int j = indexes[i];
|
|
if (j >= 0)
|
|
destination[i] = source[j];
|
|
else
|
|
destination[i] = source[source.Length + j];
|
|
}
|
|
|
|
if (inPlace)
|
|
{
|
|
for (int i = 0; i < destination.Length; i++)
|
|
source[i] = destination[i];
|
|
}
|
|
|
|
return destination;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Returns a subvector extracted from the current vector.
|
|
/// </summary>
|
|
///
|
|
/// <param name="source">The vector to return the subvector from.</param>
|
|
/// <param name="indexes">Array of indices.</param>
|
|
///
|
|
public static T[] Get<T>(this T[] source, IList<int> indexes)
|
|
{
|
|
if (source == null)
|
|
throw new ArgumentNullException("source");
|
|
|
|
if (indexes == null)
|
|
throw new ArgumentNullException("indexes");
|
|
|
|
var destination = new T[indexes.Count];
|
|
|
|
int i = 0;
|
|
foreach (var j in indexes)
|
|
destination[i++] = source[j];
|
|
|
|
return destination;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Returns a subvector extracted from the current vector.
|
|
/// </summary>
|
|
///
|
|
/// <param name="source">The vector to return the subvector from.</param>
|
|
/// <param name="startRow">Starting index.</param>
|
|
/// <param name="endRow">End index.</param>
|
|
/// <remarks>
|
|
/// Routine adapted from Lutz Roeder's Mapack for .NET, September 2000.
|
|
/// </remarks>
|
|
///
|
|
public static T[] Get<T>(this T[] source, int startRow, int endRow)
|
|
{
|
|
startRow = index(startRow, source.Length);
|
|
endRow = end(endRow, source.Length);
|
|
|
|
var destination = new T[endRow - startRow];
|
|
for (int i = startRow; i < endRow; i++)
|
|
destination[i - startRow] = source[i];
|
|
return destination;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Returns a value extracted from the current vector.
|
|
/// </summary>
|
|
///
|
|
public static T Get<T>(this T[] source, int index)
|
|
{
|
|
if (source == null)
|
|
throw new ArgumentNullException("source");
|
|
|
|
if (index >= source.Length)
|
|
throw new ArgumentOutOfRangeException("index");
|
|
|
|
index = Matrix.index(index, source.Length);
|
|
|
|
return source[index];
|
|
}
|
|
|
|
/// <summary>
|
|
/// Returns a subvector extracted from the current vector.
|
|
/// </summary>
|
|
///
|
|
/// <param name="source">The vector to return the subvector from.</param>
|
|
/// <param name="indexes">Array of indices.</param>
|
|
///
|
|
public static List<T> Get<T>(this List<T> source, int[] indexes)
|
|
{
|
|
if (source == null)
|
|
throw new ArgumentNullException("source");
|
|
|
|
if (indexes == null)
|
|
throw new ArgumentNullException("indexes");
|
|
|
|
var destination = new List<T>();
|
|
for (int i = 0; i < indexes.Length; i++)
|
|
destination.Add(source[indexes[i]]);
|
|
|
|
return destination;
|
|
}
|
|
|
|
|
|
|
|
|
|
/// <summary>
|
|
/// Extracts a selected area from a matrix.
|
|
/// </summary>
|
|
///
|
|
/// <remarks>
|
|
/// Routine adapted from Lutz Roeder's Mapack for .NET, September 2000.
|
|
/// </remarks>
|
|
///
|
|
private static T[,] get<T>(this T[,] source, T[,] destination,
|
|
int startRow, int endRow, int startColumn, int endColumn)
|
|
{
|
|
if (source == null)
|
|
throw new ArgumentNullException("source");
|
|
|
|
int rows = source.Rows();
|
|
int cols = source.Columns();
|
|
|
|
startRow = index(startRow, rows);
|
|
startColumn = index(startColumn, cols);
|
|
|
|
endRow = end(endRow, rows);
|
|
endColumn = end(endColumn, cols);
|
|
|
|
if ((startRow > endRow) || (startColumn > endColumn) || (startRow < 0) ||
|
|
(startRow > rows) || (endRow < 0) || (endRow > rows) ||
|
|
(startColumn < 0) || (startColumn > cols) || (endColumn < 0) ||
|
|
(endColumn > cols))
|
|
{
|
|
throw new ArgumentException("Argument out of range.");
|
|
}
|
|
|
|
if (destination == null)
|
|
destination = new T[endRow - startRow, endColumn - startColumn];
|
|
|
|
for (int i = startRow; i < endRow; i++)
|
|
for (int j = startColumn; j < endColumn; j++)
|
|
destination[i - startRow, j - startColumn] = source[i, j];
|
|
|
|
return destination;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Extracts a selected area from a matrix.
|
|
/// </summary>
|
|
///
|
|
/// <remarks>
|
|
/// Routine adapted from Lutz Roeder's Mapack for .NET, September 2000.
|
|
/// </remarks>
|
|
///
|
|
private static T[,] get<T>(this T[,] source, T[,] destination, int[] rowIndexes, int[] columnIndexes)
|
|
{
|
|
if (source == null)
|
|
throw new ArgumentNullException("source");
|
|
|
|
int rows = source.GetLength(0);
|
|
int cols = source.GetLength(1);
|
|
|
|
int newRows = rows;
|
|
int newCols = cols;
|
|
|
|
if (rowIndexes == null && columnIndexes == null)
|
|
{
|
|
return source;
|
|
}
|
|
|
|
if (rowIndexes != null)
|
|
{
|
|
newRows = rowIndexes.Length;
|
|
for (int i = 0; i < rowIndexes.Length; i++)
|
|
if ((rowIndexes[i] < 0) || (rowIndexes[i] >= rows))
|
|
throw new ArgumentException("Argument out of range.");
|
|
}
|
|
if (columnIndexes != null)
|
|
{
|
|
newCols = columnIndexes.Length;
|
|
for (int i = 0; i < columnIndexes.Length; i++)
|
|
if ((columnIndexes[i] < 0) || (columnIndexes[i] >= cols))
|
|
throw new ArgumentException("Argument out of range.");
|
|
}
|
|
|
|
|
|
if (destination != null)
|
|
{
|
|
if (destination.GetLength(0) < newRows || destination.GetLength(1) < newCols)
|
|
throw new DimensionMismatchException("destination",
|
|
"The destination matrix must be big enough to accommodate the results.");
|
|
}
|
|
else
|
|
{
|
|
destination = new T[newRows, newCols];
|
|
}
|
|
|
|
if (columnIndexes == null)
|
|
{
|
|
for (int i = 0; i < rowIndexes.Length; i++)
|
|
for (int j = 0; j < cols; j++)
|
|
destination[i, j] = source[rowIndexes[i], j];
|
|
}
|
|
else if (rowIndexes == null)
|
|
{
|
|
for (int i = 0; i < rows; i++)
|
|
for (int j = 0; j < columnIndexes.Length; j++)
|
|
destination[i, j] = source[i, columnIndexes[j]];
|
|
}
|
|
else
|
|
{
|
|
for (int i = 0; i < rowIndexes.Length; i++)
|
|
for (int j = 0; j < columnIndexes.Length; j++)
|
|
destination[i, j] = source[rowIndexes[i], columnIndexes[j]];
|
|
}
|
|
|
|
return destination;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Extracts a selected area from a matrix.
|
|
/// </summary>
|
|
///
|
|
/// <remarks>
|
|
/// Routine adapted from Lutz Roeder's Mapack for .NET, September 2000.
|
|
/// </remarks>
|
|
///
|
|
private static T[][] get<T>(this T[][] source, T[][] destination,
|
|
int[] rowIndexes, int[] columnIndexes, bool reuseMemory)
|
|
{
|
|
if (source == null)
|
|
throw new ArgumentNullException("source");
|
|
|
|
if (source.Length == 0)
|
|
return new T[0][];
|
|
|
|
int rows = source.Length;
|
|
int cols = source[0].Length;
|
|
|
|
int newRows = rows;
|
|
int newCols = cols;
|
|
|
|
if (rowIndexes == null && columnIndexes == null)
|
|
{
|
|
return source;
|
|
}
|
|
|
|
if (rowIndexes != null)
|
|
{
|
|
newRows = rowIndexes.Length;
|
|
for (int i = 0; i < rowIndexes.Length; i++)
|
|
if ((rowIndexes[i] < 0) || (rowIndexes[i] >= rows))
|
|
throw new ArgumentException("Argument out of range.");
|
|
}
|
|
|
|
if (columnIndexes != null)
|
|
{
|
|
newCols = columnIndexes.Length;
|
|
for (int i = 0; i < columnIndexes.Length; i++)
|
|
if ((columnIndexes[i] < 0) || (columnIndexes[i] >= cols))
|
|
throw new ArgumentException("Argument out of range.");
|
|
}
|
|
|
|
|
|
if (destination != null)
|
|
{
|
|
if (destination.Length < newRows)
|
|
throw new DimensionMismatchException("destination",
|
|
"The destination matrix must be big enough to accommodate the results.");
|
|
}
|
|
else
|
|
{
|
|
destination = new T[newRows][];
|
|
if (columnIndexes != null && !reuseMemory)
|
|
{
|
|
for (int i = 0; i < destination.Length; i++)
|
|
destination[i] = new T[newCols];
|
|
}
|
|
}
|
|
|
|
|
|
if (columnIndexes == null)
|
|
{
|
|
if (reuseMemory)
|
|
{
|
|
for (int i = 0; i < rowIndexes.Length; i++)
|
|
destination[i] = source[rowIndexes[i]];
|
|
}
|
|
else
|
|
{
|
|
for (int i = 0; i < rowIndexes.Length; i++)
|
|
destination[i] = (T[])source[rowIndexes[i]].Clone();
|
|
}
|
|
}
|
|
else if (rowIndexes == null)
|
|
{
|
|
for (int i = 0; i < source.Length; i++)
|
|
for (int j = 0; j < columnIndexes.Length; j++)
|
|
destination[i][j] = source[i][columnIndexes[j]];
|
|
}
|
|
else
|
|
{
|
|
for (int i = 0; i < rowIndexes.Length; i++)
|
|
for (int j = 0; j < columnIndexes.Length; j++)
|
|
destination[i][j] = source[rowIndexes[i]][columnIndexes[j]];
|
|
}
|
|
|
|
return destination;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Extracts a selected area from a matrix.
|
|
/// </summary>
|
|
///
|
|
/// <remarks>
|
|
/// Routine adapted from Lutz Roeder's Mapack for .NET, September 2000.
|
|
/// </remarks>
|
|
///
|
|
private static T[][] get<T>(this T[][] source, T[][] destination,
|
|
int startRow, int endRow, int startColumn, int endColumn, bool reuseMemory)
|
|
{
|
|
int rows = source.Length;
|
|
int cols = source[0].Length;
|
|
|
|
startRow = index(startRow, rows);
|
|
startColumn = index(startColumn, cols);
|
|
|
|
endRow = end(endRow, rows);
|
|
endColumn = end(endColumn, cols);
|
|
|
|
if ((startRow > endRow) || (startColumn > endColumn) || (startRow < 0) ||
|
|
(startRow > rows) || (endRow < 0) || (endRow > rows) ||
|
|
(startColumn < 0) || (startColumn > cols) || (endColumn < 0) ||
|
|
(endColumn > cols))
|
|
{
|
|
throw new ArgumentException("Argument out of range.");
|
|
}
|
|
|
|
bool canAvoidAllocation = startColumn == 0 && endColumn == rows;
|
|
|
|
int newCols = endColumn - startColumn;
|
|
|
|
if (destination == null)
|
|
{
|
|
destination = new T[endRow - startRow][];
|
|
|
|
if (!canAvoidAllocation || !reuseMemory)
|
|
{
|
|
for (int i = 0; i < destination.Length; i++)
|
|
destination[i] = new T[newCols];
|
|
}
|
|
}
|
|
|
|
if (reuseMemory && canAvoidAllocation)
|
|
{
|
|
for (int i = startRow; i < endRow; i++)
|
|
destination[i - startRow] = source[i];
|
|
}
|
|
else
|
|
{
|
|
for (int i = startRow; i < endRow; i++)
|
|
for (int j = startColumn; j < endColumn; j++)
|
|
destination[i - startRow][j - startColumn] = source[i][j];
|
|
}
|
|
|
|
return destination;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Extracts a selected area from a matrix.
|
|
/// </summary>
|
|
///
|
|
/// <remarks>
|
|
/// Routine adapted from Lutz Roeder's Mapack for .NET, September 2000.
|
|
/// </remarks>
|
|
///
|
|
private static T[][] set<T>(this T[][] destination, T[][] source,
|
|
int startRow, int endRow, int startColumn, int endColumn)
|
|
{
|
|
int rows = destination.Length;
|
|
int cols = destination[0].Length;
|
|
|
|
startRow = index(startRow, rows);
|
|
startColumn = index(startColumn, cols);
|
|
|
|
endRow = end(endRow, rows);
|
|
endColumn = end(endColumn, cols);
|
|
|
|
if ((startRow > endRow) || (startColumn > endColumn) || (startRow < 0) ||
|
|
(startRow > rows) || (endRow < 0) || (endRow > rows) ||
|
|
(startColumn < 0) || (startColumn > cols) || (endColumn < 0) ||
|
|
(endColumn > cols))
|
|
{
|
|
throw new ArgumentException("Argument out of range.");
|
|
}
|
|
|
|
for (int i = startRow; i < endRow; i++)
|
|
for (int j = startColumn; j < endColumn; j++)
|
|
destination[i - startRow][j - startColumn] = source[i][j];
|
|
|
|
return destination;
|
|
}
|
|
|
|
}
|
|
}
|