The ArrayTools package is an efficient set of programmer tools used for low level manipulation of rectangular storage Matrices, Vectors, and Arrays.

Note: This package contains tools for storage manipulation only. For mathematical operations on Matrices and Vectors, see the LinearAlgebra and VectorCalculus packages.

As a programmer package, the key focus is on efficient computation. Use of the package requires a fair understanding of internal representation of Matrix and Array data structures. For information on internal storage of Matrices and Arrays, see C_order and Fortran_order.

The package is primarily external (compiled code), and contains highly efficient functions for common Array related programming tasks. Some of these tasks would be impossible to program at the Maple level (for example, ComplexAsFloat), while others would be merely time consuming (for example, Fill) or require additional storage allocation (for example, DataTranspose).

At this time, all functions are restricted to rectangular storage Array objects.

Most functions in the package work for Matrices of any data type, and exceptions are noted on a by command basis.

Each command in the ArrayTools package can be accessed by using either the long form or the short form of the command name in the command calling sequence.

The long form, ArrayTools:-command, is always available.  The short form can be used after loading the package.

The following is a list of available commands.

Constructing Arrays

Querying Array Properties

Modifying Arrays

Computing with Arrays

To display the help page for a particular ArrayTools command, see Getting Help with a Command in a Package.

$\mathrm{with}\left(\mathrm{ArrayTools}\right)$

$\left[\mathrm{AddAlongDimension}\,\mathrm{Alias}\,\mathrm{AllNonZero}\,\mathrm{AnyNonZeros}\,\mathrm{Append}\,\mathrm{BlockCopy}\,\mathrm{CircularShift}\,\mathrm{ComplexAsFloat}\,\mathrm{Compress}\,\mathrm{Concatenate}\,\mathrm{Copy}\,\mathrm{DataTranspose}\,\mathrm{Diagonal}\,\mathrm{Dimensions}\,\mathrm{ElementDivide}\,\mathrm{ElementMultiply}\,\mathrm{ElementPower}\,\mathrm{Extend}\,\mathrm{Fill}\,\mathrm{FlipDimension}\,\mathrm{GeneralInnerProduct}\,\mathrm{GeneralOuterProduct}\,\mathrm{HasNonZero}\,\mathrm{HasZero}\,\mathrm{Insert}\,\mathrm{IsEqual}\,\mathrm{IsMonotonic}\,\mathrm{IsSubsequence}\,\mathrm{IsZero}\,\mathrm{Lookup}\,\mathrm{LowerTriangle}\,\mathrm{MultiplyAlongDimension}\,\mathrm{NumElems}\,\mathrm{Partition}\,\mathrm{Permute}\,\mathrm{PermuteInverse}\,\mathrm{RandomArray}\,\mathrm{ReduceAlongDimension}\,\mathrm{RegularArray}\,\mathrm{Remove}\,\mathrm{RemoveSingletonDimensions}\,\mathrm{Replicate}\,\mathrm{Reshape}\,\mathrm{Reverse}\,\mathrm{ScanAlongDimension}\,\mathrm{SearchArray}\,\mathrm{Size}\,\mathrm{SortBy}\,\mathrm{SuggestedDatatype}\,\mathrm{SuggestedOrder}\,\mathrm{SuggestedSubtype}\,\mathrm{Uncompress}\,\mathrm{UpperTriangle}\right]$

$M≔\mathrm{Vector}\left[\mathrm{row}\right]\left(10\,i\mapsto i\right)$

$M≔\left[\begin{array}{cccccccccc}1& 2& 3& 4& 5& 6& 7& 8& 9& 10\end{array}\right]$

$\mathrm{Copy}\left(5\,M\,M\,5\right),M$

$\left[\begin{array}{cccccccccc}1& 2& 3& 4& 5& 1& 2& 3& 4& 5\end{array}\right]$

$\mathrm{Fill}\left(0\,M\,1\,2\right),M$

$\left[\begin{array}{cccccccccc}1& 0& 3& 0& 5& 0& 2& 0& 4& 0\end{array}\right]$

$\mathrm{Alias}\left(M\,\left[2\,5\right]\,\mathrm{C\_order}\right)$

$\left[\begin{array}{ccccc}1& 0& 3& 0& 5\\ 0& 2& 0& 4& 0\end{array}\right]$

$M≔\mathrm{Matrix}\left(2\,3\,\left(i\,j\right)\mapsto i+\mathrm{I}\cdot j\,\mathrm{datatype}=\mathrm{complex}\left[8\right]\,\mathrm{order}=\mathrm{C\_order}\right)$

$M≔\left[\begin{array}{ccc}1.+\mathrm{I}& 1.+2.\mathrm{I}& 1.+3.\mathrm{I}\\ 2.+\mathrm{I}& 2.+2.\mathrm{I}& 2.+3.\mathrm{I}\end{array}\right]$

$\mathrm{Mr}≔\mathrm{ComplexAsFloat}\left(M\right)$

$\mathrm{Mr}≔\left[\begin{array}{cccccc}1.& 1.& 1.& 2.& 1.& 3.\\ 2.& 1.& 2.& 2.& 2.& 3.\end{array}\right]$

$\mathrm{Fill}\left(0\,\mathrm{Mr}\,0\,2\right),M$

$\left[\begin{array}{ccc}0.+\mathrm{I}& 0.+2.\mathrm{I}& 0.+3.\mathrm{I}\\ 0.+\mathrm{I}& 0.+2.\mathrm{I}& 0.+3.\mathrm{I}\end{array}\right]$