Browse Source

LA: clarify 'column-major' in xml docs

v2
Christoph Ruegg 14 years ago
parent
commit
ec483fb874
  1. 6
      src/Numerics/LinearAlgebra/Complex/DenseMatrix.cs
  2. 2
      src/Numerics/LinearAlgebra/Complex/SparseMatrix.cs
  3. 6
      src/Numerics/LinearAlgebra/Complex32/DenseMatrix.cs
  4. 2
      src/Numerics/LinearAlgebra/Complex32/SparseMatrix.cs
  5. 6
      src/Numerics/LinearAlgebra/Double/DenseMatrix.cs
  6. 2
      src/Numerics/LinearAlgebra/Double/SparseMatrix.cs
  7. 6
      src/Numerics/LinearAlgebra/Single/DenseMatrix.cs
  8. 2
      src/Numerics/LinearAlgebra/Single/SparseMatrix.cs

6
src/Numerics/LinearAlgebra/Complex/DenseMatrix.cs

@ -41,7 +41,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex
using System.Numerics;
/// <summary>
/// A Matrix class with dense storage. The underlying storage is a one dimensional array in column-major order.
/// A Matrix class with dense storage. The underlying storage is a one dimensional array in column-major order (column by column).
/// </summary>
[Serializable]
[DebuggerDisplay("DenseMatrix {RowCount}x{ColumnCount}-Complex")]
@ -120,7 +120,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex
/// <summary>
/// Create a new dense matrix with the given number of rows and columns directly binding to a raw array.
/// The array is assumed to be in column-major order and is used directly without copying.
/// The array is assumed to be in column-major order (column by column) and is used directly without copying.
/// Very efficient, but changes to the array and the matrix will affect each other.
/// </summary>
/// <seealso cref="http://en.wikipedia.org/wiki/Row-major_order"/>
@ -148,7 +148,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex
/// <summary>
/// Create a new dense matrix as a copy of the given enumerable.
/// The enumerable is assumed to be in column-major order.
/// The enumerable is assumed to be in column-major order (column by column).
/// This new matrix will be independent from the enumerable.
/// A new memory block will be allocated for storing the vector.
/// </summary>

2
src/Numerics/LinearAlgebra/Complex/SparseMatrix.cs

@ -133,7 +133,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex
/// <summary>
/// Create a new sparse matrix with the given number of rows and columns as a copy of the given array.
/// The array is assumed to be in column-major order.
/// The array is assumed to be in column-major order (column by column).
/// This new matrix will be independent from the provided array.
/// A new memory block will be allocated for storing the matrix.
/// </summary>

6
src/Numerics/LinearAlgebra/Complex32/DenseMatrix.cs

@ -41,7 +41,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32
using System.Diagnostics;
/// <summary>
/// A Matrix class with dense storage. The underlying storage is a one dimensional array in column-major order.
/// A Matrix class with dense storage. The underlying storage is a one dimensional array in column-major order (column by column).
/// </summary>
[Serializable]
[DebuggerDisplay("DenseMatrix {RowCount}x{ColumnCount}-Complex32")]
@ -120,7 +120,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32
/// <summary>
/// Create a new dense matrix with the given number of rows and columns directly binding to a raw array.
/// The array is assumed to be in column-major order and is used directly without copying.
/// The array is assumed to be in column-major order (column by column) and is used directly without copying.
/// Very efficient, but changes to the array and the matrix will affect each other.
/// </summary>
/// <seealso cref="http://en.wikipedia.org/wiki/Row-major_order"/>
@ -148,7 +148,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32
/// <summary>
/// Create a new dense matrix as a copy of the given enumerable.
/// The enumerable is assumed to be in column-major order.
/// The enumerable is assumed to be in column-major order (column by column).
/// This new matrix will be independent from the enumerable.
/// A new memory block will be allocated for storing the vector.
/// </summary>

2
src/Numerics/LinearAlgebra/Complex32/SparseMatrix.cs

@ -133,7 +133,7 @@ namespace MathNet.Numerics.LinearAlgebra.Complex32
/// <summary>
/// Create a new sparse matrix with the given number of rows and columns as a copy of the given array.
/// The array is assumed to be in column-major order.
/// The array is assumed to be in column-major order (column by column).
/// This new matrix will be independent from the provided array.
/// A new memory block will be allocated for storing the matrix.
/// </summary>

6
src/Numerics/LinearAlgebra/Double/DenseMatrix.cs

@ -41,7 +41,7 @@ namespace MathNet.Numerics.LinearAlgebra.Double
using Threading;
/// <summary>
/// A Matrix class with dense storage. The underlying storage is a one dimensional array in column-major order.
/// A Matrix class with dense storage. The underlying storage is a one dimensional array in column-major order (column by column).
/// </summary>
[Serializable]
[DebuggerDisplay("DenseMatrix {RowCount}x{ColumnCount}-Double")]
@ -120,7 +120,7 @@ namespace MathNet.Numerics.LinearAlgebra.Double
/// <summary>
/// Create a new dense matrix with the given number of rows and columns directly binding to a raw array.
/// The array is assumed to be in column-major order and is used directly without copying.
/// The array is assumed to be in column-major order (column by column) and is used directly without copying.
/// Very efficient, but changes to the array and the matrix will affect each other.
/// </summary>
/// <seealso cref="http://en.wikipedia.org/wiki/Row-major_order"/>
@ -148,7 +148,7 @@ namespace MathNet.Numerics.LinearAlgebra.Double
/// <summary>
/// Create a new dense matrix as a copy of the given enumerable.
/// The enumerable is assumed to be in column-major order.
/// The enumerable is assumed to be in column-major order (column by column).
/// This new matrix will be independent from the enumerable.
/// A new memory block will be allocated for storing the vector.
/// </summary>

2
src/Numerics/LinearAlgebra/Double/SparseMatrix.cs

@ -132,7 +132,7 @@ namespace MathNet.Numerics.LinearAlgebra.Double
/// <summary>
/// Create a new sparse matrix with the given number of rows and columns as a copy of the given array.
/// The array is assumed to be in column-major order.
/// The array is assumed to be in column-major order (column by column).
/// This new matrix will be independent from the provided array.
/// A new memory block will be allocated for storing the matrix.
/// </summary>

6
src/Numerics/LinearAlgebra/Single/DenseMatrix.cs

@ -41,7 +41,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single
using Threading;
/// <summary>
/// A Matrix class with dense storage. The underlying storage is a one dimensional array in column-major order.
/// A Matrix class with dense storage. The underlying storage is a one dimensional array in column-major order (column by column).
/// </summary>
[Serializable]
[DebuggerDisplay("DenseMatrix {RowCount}x{ColumnCount}-Single")]
@ -120,7 +120,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single
/// <summary>
/// Create a new dense matrix with the given number of rows and columns directly binding to a raw array.
/// The array is assumed to be in column-major order and is used directly without copying.
/// The array is assumed to be in column-major order (column by column) and is used directly without copying.
/// Very efficient, but changes to the array and the matrix will affect each other.
/// </summary>
/// <seealso cref="http://en.wikipedia.org/wiki/Row-major_order"/>
@ -148,7 +148,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single
/// <summary>
/// Create a new dense matrix as a copy of the given enumerable.
/// The enumerable is assumed to be in column-major order.
/// The enumerable is assumed to be in column-major order (column by column).
/// This new matrix will be independent from the enumerable.
/// A new memory block will be allocated for storing the vector.
/// </summary>

2
src/Numerics/LinearAlgebra/Single/SparseMatrix.cs

@ -132,7 +132,7 @@ namespace MathNet.Numerics.LinearAlgebra.Single
/// <summary>
/// Create a new sparse matrix with the given number of rows and columns as a copy of the given array.
/// The array is assumed to be in column-major order.
/// The array is assumed to be in column-major order (column by column).
/// This new matrix will be independent from the provided array.
/// A new memory block will be allocated for storing the matrix.
/// </summary>

Loading…
Cancel
Save