diff --git a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/README.md b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/README.md index 1ce3983051bc..ab423bd8cc6f 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/README.md +++ b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/README.md @@ -22,6 +22,12 @@ limitations under the License. > Return the index of the first row in an input matrix which has the same elements as a provided search vector. +
+ +
+ + +
## Usage @@ -30,7 +36,7 @@ limitations under the License. var gindexOfRow = require( '@stdlib/blas/ext/base/gindex-of-row' ); ``` -#### gindexOfRow( order, M, N, A, LDA, x, strideX ) +#### gindexOfRow( order, M, N, A, LDA, x, strideX, workspace, strideW ) Returns the index of the first row in an input matrix which has the same elements as a provided search vector. @@ -45,7 +51,8 @@ Returns the index of the first row in an input matrix which has the same element var A = [ 1.0, 2.0, 3.0, 4.0, 0.0, 0.0 ]; var x = [ 3.0, 4.0 ]; -var out = gindexOfRow( 'row-major', 3, 2, A, 2, x, 1 ); +var workspace = [ 0, 0, 0 ]; +var out = gindexOfRow( 'row-major', 3, 2, A, 2, x, 1, workspace, 1 ); // returns 1 ``` @@ -55,9 +62,29 @@ The function has the following parameters: - **M**: number of rows in `A`. - **N**: number of columns in `A`. - **A**: input matrix as a linear array. -- **LDA**: stride of the first dimension of `A` (a.k.a., leading dimension of the matrix `A`). +- **LDA**: stride length for the first dimension of `A` (a.k.a., leading dimension of the matrix `A`). - **x**: search vector. -- **strideX**: stride length of `x`. +- **strideX**: stride length for `x`. +- **workspace**: workspace array for tracking row match candidates. This parameter is ignored if the input matrix is stored in row-major order. +- **strideW**: stride length for `workspace`. + +When an input matrix is stored in row-major order, the workspace parameter is ignored, and, thus, one may provide an empty workspace array. + +```javascript +/* + A = [ + [ 1.0, 2.0 ], + [ 3.0, 4.0 ], + [ 0.0, 0.0 ] + ] +*/ +var A = [ 1.0, 2.0, 3.0, 4.0, 0.0, 0.0 ]; + +var x = [ 3.0, 4.0 ]; +var workspace = []; +var out = gindexOfRow( 'row-major', 3, 2, A, 2, x, 1, workspace, 1 ); +// returns 1 +``` If the function is unable to find a matching row, the function returns `-1`. @@ -65,7 +92,8 @@ If the function is unable to find a matching row, the function returns `-1`. var A = [ 1.0, 2.0, 3.0, 4.0, 0.0, 0.0 ]; var x = [ -3.0, -4.0 ]; -var out = gindexOfRow( 'row-major', 3, 2, A, 2, x, 1 ); +var workspace = [ 0, 0, 0 ]; +var out = gindexOfRow( 'row-major', 3, 2, A, 2, x, 1, workspace, 1 ); // returns -1 ``` @@ -84,11 +112,16 @@ var x0 = new Float64Array( [ 9999.0, 3.0, 4.0 ] ); var A1 = new Float64Array( A0.buffer, A0.BYTES_PER_ELEMENT*1 ); // start at 2nd element var x1 = new Float64Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); // start at 2nd element -var out = gindexOfRow( 'row-major', 3, 2, A1, 2, x1, 1 ); +var workspace = [ 0, 0, 0 ]; +var out = gindexOfRow( 'row-major', 3, 2, A1, 2, x1, 1, workspace, 1 ); // returns 1 ``` -#### gindexOfRow.ndarray( M, N, A, strideA1, strideA2, offsetA, x, strideX, offsetX ) + + +#### gindexOfRow.ndarray( M, N, A, strideA1, strideA2, offsetA, x, strideX, offsetX, workspace, strideW, offsetW ) + + Returns the index of the first row in an input matrix which has the same elements as a provided search vector using alternative indexing semantics. @@ -103,7 +136,8 @@ Returns the index of the first row in an input matrix which has the same element var A = [ 1.0, 2.0, 3.0, 4.0, 0.0, 0.0 ]; var x = [ 3.0, 4.0 ]; -var out = gindexOfRow.ndarray( 3, 2, A, 2, 1, 0, x, 1, 0 ); +var workspace = [ 0, 0, 0 ]; +var out = gindexOfRow.ndarray( 3, 2, A, 2, 1, 0, x, 1, 0, workspace, 1, 0 ); // returns 1 ``` @@ -112,12 +146,33 @@ The function has the following parameters: - **M**: number of rows in `A`. - **N**: number of columns in `A`. - **A**: input matrix as a linear array. -- **strideA1**: stride of the first dimension of `A`. -- **strideA2**: stride of the second dimension of `A`. +- **strideA1**: stride length for the first dimension of `A`. +- **strideA2**: stride length for the second dimension of `A`. - **offsetA**: starting index for `A`. - **x**: search vector. -- **strideX**: stride length of `x`. +- **strideX**: stride length for `x`. - **offsetX**: starting index for `x`. +- **workspace**: workspace array for tracking row match candidates. This parameter is ignored if the input matrix is stored in row-major order. +- **strideW**: stride length for `workspace`. +- **offsetW**: starting index for `workspace`. + +When an input matrix is stored in row-major order, the workspace parameter is ignored, and, thus, one may provide an empty workspace array. + +```javascript +/* + A = [ + [ 1.0, 2.0 ], + [ 3.0, 4.0 ], + [ 0.0, 0.0 ] + ] +*/ +var A = [ 1.0, 2.0, 3.0, 4.0, 0.0, 0.0 ]; + +var x = [ 3.0, 4.0 ]; +var workspace = []; +var out = gindexOfRow.ndarray( 3, 2, A, 2, 1, 0, x, 1, 0, workspace, 1, 0 ); +// returns 1 +``` While [`typed array`][mdn-typed-array] views mandate a view offset based on the underlying buffer, offset parameters support indexing semantics based on starting indices. For example, @@ -132,7 +187,8 @@ While [`typed array`][mdn-typed-array] views mandate a view offset based on the var A = [ 9999.0, 1.0, 2.0, 3.0, 4.0, 0.0, 0.0 ]; var x = [ 9999.0, 3.0, 4.0 ]; -var out = gindexOfRow.ndarray( 3, 2, A, 2, 1, 1, x, 1, 1 ); +var workspace = [ 0, 0, 0 ]; +var out = gindexOfRow.ndarray( 3, 2, A, 2, 1, 1, x, 1, 1, workspace, 1, 0 ); // returns 1 ``` @@ -144,6 +200,7 @@ var out = gindexOfRow.ndarray( 3, 2, A, 2, 1, 1, x, 1, 1 ); ## Notes +- If `M <= 0` or `N <= 0`, both functions return `-1`. - When searching for a matching row, the function checks for equality using the strict equality operator `===`. As a consequence, `NaN` values are considered distinct, and `-0` and `+0` are considered the same. - Both functions support array-like objects having getter and setter accessors for array element access (e.g., [`@stdlib/array/base/accessor`][@stdlib/array/base/accessor]). @@ -174,7 +231,9 @@ console.log( ndarray2array( A, shape, strides, 0, order ) ); var x = [ 4.0, 5.0, 6.0 ]; console.log( x ); -var out = gindexOfRow( order, shape[ 0 ], shape[ 1 ], A, strides[ 0 ], x, 1, 0 ); +var workspace = [ 0, 0, 0 ]; + +var out = gindexOfRow( order, shape[ 0 ], shape[ 1 ], A, strides[ 0 ], x, 1, workspace, 1 ); console.log( out ); ``` diff --git a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/benchmark/benchmark.js b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/benchmark/benchmark.js index a537ceb8f851..b8766b5c0f09 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/benchmark/benchmark.js +++ b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/benchmark/benchmark.js @@ -49,6 +49,7 @@ var LAYOUTS = [ * @returns {Function} benchmark function */ function createBenchmark( order, N ) { + var workspace = zeros( N, 'generic' ); var A = zeros( N*N, 'generic' ); var x = zeros( N, 'generic' ); return benchmark; @@ -66,7 +67,7 @@ function createBenchmark( order, N ) { b.tic(); for ( i = 0; i < b.iterations; i++ ) { x[ N-1 ] += 1; - z = gindexOfRow( order, N, N, A, N, x, 1 ); + z = gindexOfRow( order, N, N, A, N, x, 1, workspace, 1 ); if ( isnan( z ) ) { b.fail( 'should not return NaN' ); } diff --git a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/benchmark/benchmark.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/benchmark/benchmark.ndarray.js index d58ed05dbfeb..03ea75d122c2 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/benchmark/benchmark.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/benchmark/benchmark.ndarray.js @@ -50,6 +50,7 @@ var LAYOUTS = [ * @returns {Function} benchmark function */ function createBenchmark( order, N ) { + var workspace = zeros( N, 'generic' ); var A = zeros( N*N, 'generic' ); var x = zeros( N, 'generic' ); return benchmark; @@ -77,7 +78,7 @@ function createBenchmark( order, N ) { b.tic(); for ( i = 0; i < b.iterations; i++ ) { x[ N-1 ] += 1; - z = gindexOfRow( N, N, A, sa1, sa2, 0, x, 1, 0 ); + z = gindexOfRow( N, N, A, sa1, sa2, 0, x, 1, 0, workspace, 1, 0 ); if ( isnan( z ) ) { b.fail( 'should not return NaN' ); } diff --git a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/docs/repl.txt b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/docs/repl.txt index 0949dad6afe3..b7c5c314b7ed 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/docs/repl.txt +++ b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/docs/repl.txt @@ -1,5 +1,5 @@ -{{alias}}( order, M, N, A, LDA, x, strideX ) +{{alias}}( order, M, N, A, LDA, x, strideX, workspace, strideW ) Returns the index of the first row in an input matrix which has the same elements as a provided search vector. @@ -25,15 +25,22 @@ Input matrix `A`. LDA: integer - Stride of the first dimension of `A` (a.k.a., leading dimension of the - matrix `A`). + Stride length for the first dimension of `A` (a.k.a., leading dimension + of the matrix `A`). x: Array|TypedArray Search vector. - strideX: + strideX: integer Stride length for `x`. + workspace: Array|TypedArray + Workspace array for tracking row match candidates. This parameter is + ignored if the input matrix is stored in row-major order. + + strideW: integer + Stride length for `workspace`. + Returns ------- out: integer @@ -43,11 +50,12 @@ -------- > var A = [ 1.0, 2.0, 3.0, 4.0, 0.0, 0.0 ]; > var x = [ 3.0, 4.0 ]; - > {{alias}}( 'row-major', 2, 2, A, 2, x, 1 ) + > var w = [ 0, 0, 0 ]; + > {{alias}}( 'row-major', 3, 2, A, 2, x, 1, w, 1 ) 1 -{{alias}}.ndarray( M, N, A, strideA1, strideA2, offsetA, x, strideX, offsetX ) +{{alias}}.ndarray( M, N, A, sa1, sa2, oa, x, sx, ox, w, sw, ow ) Returns the index of the first row in an input matrix which has the same elements as a provided search vector using alternative indexing semantics. @@ -69,24 +77,34 @@ A: Array|TypedArray Input matrix `A`. - strideA1: integer - Stride of the first dimension of `A`. + sa1: integer + Stride length for the first dimension of `A`. - strideA2: integer - Stride of the second dimension of `A`. + sa2: integer + Stride length for the second dimension of `A`. - offsetA: integer + oa: integer Starting index for `A`. x: Array|TypedArray Search vector. - strideX: + sx: integer Stride length for `x`. - offsetX: + ox: integer Starting index for `x`. + w: Array|TypedArray + Workspace array for tracking row match candidates. This parameter is + ignored if the input matrix is stored in row-major order. + + sw: integer + Stride length for `w`. + + ow: integer + Starting index for `w`. + Returns ------- out: integer @@ -94,9 +112,10 @@ Examples -------- - > var A =[ 1.0, 2.0, 3.0, 4.0, 0.0, 0.0 ]; + > var A = [ 1.0, 2.0, 3.0, 4.0, 0.0, 0.0 ]; > var x = [ 3.0, 4.0 ]; - > {{alias}}.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0 ) + > var w = [ 0, 0, 0 ]; + > {{alias}}.ndarray( 3, 2, A, 2, 1, 0, x, 1, 0, w, 1, 0 ) 1 See Also diff --git a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/docs/types/index.d.ts b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/docs/types/index.d.ts index e89bf0ef345a..db6ca2141aa6 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/docs/types/index.d.ts +++ b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/docs/types/index.d.ts @@ -28,6 +28,11 @@ import { Layout } from '@stdlib/types/blas'; */ type InputArray = Collection | AccessorArrayLike; +/** +* Workspace array. +*/ +type WorkspaceArray = Collection | AccessorArrayLike; + /** * Interface describing `gindexOfRow`. */ @@ -38,24 +43,28 @@ interface Routine { * ## Notes * * - If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index). + * - The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored. * * @param order - storage layout * @param M - number of rows in `A` * @param N - number of columns in `A` * @param A - input matrix - * @param LDA - stride of the first dimension of `A` (a.k.a., leading dimension of the matrix `A`) + * @param LDA - stride length for the first dimension of `A` (a.k.a., leading dimension of the matrix `A`) * @param x - search vector * @param strideX - stride length for `x` + * @param workspace - workspace array for tracking row match candidates + * @param strideW - stride length for `workspace` * @returns row index * * @example * var A = [ 1.0, 2.0, 3.0, 4.0, 0.0, 0.0 ]; // => [ [ 1.0, 2.0 ], [ 3.0, 4.0 ], [ 0.0, 0.0 ] ] * var x = [ 3.0, 4.0 ]; + * var workspace = [ 0, 0, 0 ]; * - * var out = gindexOfRow( 'row-major', 3, 2, A, 2, x, 1 ); + * var out = gindexOfRow( 'row-major', 3, 2, A, 2, x, 1, workspace, 1 ); * // returns 1 */ - ( order: Layout, M: number, N: number, A: InputArray, LDA: number, x: InputArray, strideX: number ): number; + ( order: Layout, M: number, N: number, A: InputArray, LDA: number, x: InputArray, strideX: number, workspace: WorkspaceArray, strideW: number ): number; /** * Returns the index of the first row in an input matrix which has the same elements as a provided search vector using alternative indexing semantics. @@ -63,26 +72,31 @@ interface Routine { * ## Notes * * - If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index). + * - The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored. * * @param M - number of rows in `A` * @param N - number of columns in `A` * @param A - input matrix - * @param strideA1 - stride of the first dimension of `A` - * @param strideA2 - stride of the second dimension of `A` + * @param strideA1 - stride length for the first dimension of `A` + * @param strideA2 - stride length for the second dimension of `A` * @param offsetA - starting index for `A` * @param x - search vector * @param strideX - stride length for `x` * @param offsetX - starting index for `x` + * @param workspace - workspace array for tracking row match candidates + * @param strideW - stride length for `workspace` + * @param offsetW - starting index for `workspace` * @returns row index * * @example * var A = [ 1.0, 2.0, 3.0, 4.0, 0.0, 0.0 ]; // => [ [ 1.0, 2.0 ], [ 3.0, 4.0 ], [ 0.0, 0.0 ] ] * var x = [ 3.0, 4.0 ]; + * var workspace = [ 0, 0, 0 ]; * - * var out = gindexOfRow.ndarray( 3, 2, A, 2, 1, 0, x, 1, 0 ); + * var out = gindexOfRow.ndarray( 3, 2, A, 2, 1, 0, x, 1, 0, workspace, 1, 0 ); * // returns 1 */ - ndarray( M: number, N: number, A: InputArray, strideA1: number, strideA2: number, offsetA: number, x: InputArray, strideX: number, offsetX: number ): number; + ndarray( M: number, N: number, A: InputArray, strideA1: number, strideA2: number, offsetA: number, x: InputArray, strideX: number, offsetX: number, workspace: WorkspaceArray, strideW: number, offsetW: number ): number; } /** @@ -91,28 +105,33 @@ interface Routine { * ## Notes * * - If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored. * * @param order - storage layout * @param M - number of rows in `A` * @param N - number of columns in `A` * @param A - input matrix -* @param LDA - stride of the first dimension of `A` (a.k.a., leading dimension of the matrix `A`) +* @param LDA - stride length for the first dimension of `A` (a.k.a., leading dimension of the matrix `A`) * @param x - search vector * @param strideX - stride length for `x` +* @param workspace - workspace array for tracking row match candidates +* @param strideW - stride length for `workspace` * @returns row index * * @example * var A = [ 1.0, 2.0, 3.0, 4.0, 0.0, 0.0 ]; // => [ [ 1.0, 2.0 ], [ 3.0, 4.0 ], [ 0.0, 0.0 ] ] * var x = [ 3.0, 4.0 ]; +* var workspace = [ 0, 0, 0 ]; * -* var out = gindexOfRow( 'row-major', 3, 2, A, 2, x, 1 ); +* var out = gindexOfRow( 'row-major', 3, 2, A, 2, x, 1, workspace, 1 ); * // returns 1 * * @example * var A = [ 1.0, 2.0, 3.0, 4.0, 0.0, 0.0 ]; // => [ [ 1.0, 2.0 ], [ 3.0, 4.0 ], [ 0.0, 0.0 ] ] * var x = [ 3.0, 4.0 ]; +* var workspace = [ 0, 0, 0 ]; * -* var out = gindexOfRow.ndarray( 3, 2, A, 2, 1, 0, x, 1, 0 ); +* var out = gindexOfRow.ndarray( 3, 2, A, 2, 1, 0, x, 1, 0, workspace, 1, 0 ); * // returns 1 */ declare var gindexOfRow: Routine; diff --git a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/docs/types/test.ts b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/docs/types/test.ts index eeb8ce79a3de..c58d539733aa 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/docs/types/test.ts +++ b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/docs/types/test.ts @@ -25,115 +25,154 @@ import gindexOfRow = require( './index' ); { const A = [ 1.0, 2.0, 3.0, 4.0 ]; const x = [ 3.0, 4.0 ]; + const w = [ 0, 0 ]; - gindexOfRow( 'row-major', 2, 2, A, 2, x, 1 ); // $ExpectType number + gindexOfRow( 'row-major', 2, 2, A, 2, x, 1, w, 1 ); // $ExpectType number } // The compiler throws an error if the function is provided a first argument which is not a string... { const A = [ 1.0, 2.0, 3.0, 4.0 ]; const x = [ 3.0, 4.0 ]; - - gindexOfRow( 5, 2, 2, A, 2, x, 1 ); // $ExpectError - gindexOfRow( true, 2, 2, A, 2, x, 1 ); // $ExpectError - gindexOfRow( false, 2, 2, A, 2, x, 1 ); // $ExpectError - gindexOfRow( null, 2, 2, A, 2, x, 1 ); // $ExpectError - gindexOfRow( void 0, 2, 2, A, 2, x, 1 ); // $ExpectError - gindexOfRow( [], 2, 2, A, 2, x, 1 ); // $ExpectError - gindexOfRow( {}, 2, 2, A, 2, x, 1 ); // $ExpectError - gindexOfRow( ( x: number ): number => x, 2, 2, A, 2, x, 1 ); // $ExpectError + const w = [ 0, 0 ]; + + gindexOfRow( 5, 2, 2, A, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( true, 2, 2, A, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( false, 2, 2, A, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( null, 2, 2, A, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( void 0, 2, 2, A, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( [], 2, 2, A, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( {}, 2, 2, A, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( ( x: number ): number => x, 2, 2, A, 2, x, 1, w, 1 ); // $ExpectError } // The compiler throws an error if the function is provided a second argument which is not a number... { const A = [ 1.0, 2.0, 3.0, 4.0 ]; const x = [ 3.0, 4.0 ]; - - gindexOfRow( 'row-major', '5', 2, A, 2, x, 1 ); // $ExpectError - gindexOfRow( 'row-major', true, 2, A, 2, x, 1 ); // $ExpectError - gindexOfRow( 'row-major', false, 2, A, 2, x, 1 ); // $ExpectError - gindexOfRow( 'row-major', null, 2, A, 2, x, 1 ); // $ExpectError - gindexOfRow( 'row-major', void 0, 2, A, 2, x, 1 ); // $ExpectError - gindexOfRow( 'row-major', [], 2, A, 2, x, 1 ); // $ExpectError - gindexOfRow( 'row-major', {}, 2, A, 2, x, 1 ); // $ExpectError - gindexOfRow( 'row-major', ( x: number ): number => x, 2, A, 2, x, 1 ); // $ExpectError + const w = [ 0, 0 ]; + + gindexOfRow( 'row-major', '5', 2, A, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', true, 2, A, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', false, 2, A, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', null, 2, A, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', void 0, 2, A, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', [], 2, A, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', {}, 2, A, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', ( x: number ): number => x, 2, A, 2, x, 1, w, 1 ); // $ExpectError } // The compiler throws an error if the function is provided a third argument which is not a number... { const A = [ 1.0, 2.0, 3.0, 4.0 ]; const x = [ 3.0, 4.0 ]; - - gindexOfRow( 'row-major', 2, '5', A, 2, x, 1 ); // $ExpectError - gindexOfRow( 'row-major', 2, true, A, 2, x, 1 ); // $ExpectError - gindexOfRow( 'row-major', 2, false, A, 2, x, 1 ); // $ExpectError - gindexOfRow( 'row-major', 2, null, A, 2, x, 1 ); // $ExpectError - gindexOfRow( 'row-major', 2, void 0, A, 2, x, 1 ); // $ExpectError - gindexOfRow( 'row-major', 2, [], A, 2, x, 1 ); // $ExpectError - gindexOfRow( 'row-major', 2, {}, A, 2, x, 1 ); // $ExpectError - gindexOfRow( 'row-major', 2, ( x: number ): number => x, A, 2, x, 1 ); // $ExpectError + const w = [ 0, 0 ]; + + gindexOfRow( 'row-major', 2, '5', A, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, true, A, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, false, A, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, null, A, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, void 0, A, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, [], A, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, {}, A, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, ( x: number ): number => x, A, 2, x, 1, w, 1 ); // $ExpectError } // The compiler throws an error if the function is provided a fourth argument which is not a collection... { const x = [ 3.0, 4.0 ]; - - gindexOfRow( 'row-major', 2, 2, 5, 2, x, 1 ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, true, 2, x, 1 ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, false, 2, x, 1 ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, null, 2, x, 1 ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, void 0, 2, x, 1 ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, {}, 2, x, 1 ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, ( x: number ): number => x, 2, x, 1 ); // $ExpectError + const w = [ 0, 0 ]; + + gindexOfRow( 'row-major', 2, 2, 5, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, true, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, false, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, null, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, void 0, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, {}, 2, x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, ( x: number ): number => x, 2, x, 1, w, 1 ); // $ExpectError } // The compiler throws an error if the function is provided a fifth argument which is not a number... { const A = [ 1.0, 2.0, 3.0, 4.0 ]; const x = [ 3.0, 4.0 ]; - - gindexOfRow( 'row-major', 2, 2, A, '5', x, 1 ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, A, true, x, 1 ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, A, false, x, 1 ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, A, null, x, 1 ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, A, void 0, x, 1 ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, A, [], x, 1 ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, A, {}, x, 1 ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, A, ( x: number ): number => x, x, 1 ); // $ExpectError + const w = [ 0, 0 ]; + + gindexOfRow( 'row-major', 2, 2, A, '5', x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, true, x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, false, x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, null, x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, void 0, x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, [], x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, {}, x, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, ( x: number ): number => x, x, 1, w, 1 ); // $ExpectError } // The compiler throws an error if the function is provided a sixth argument which is not a collection... { const A = [ 1.0, 2.0, 3.0, 4.0 ]; - - gindexOfRow( 'row-major', 2, 2, A, 2, 5, 1 ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, A, 2, true, 1 ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, A, 2, false, 1 ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, A, 2, null, 1 ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, A, 2, void 0, 1 ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, A, 2, {}, 1 ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, A, 2, ( x: number ): number => x, 1 ); // $ExpectError + const w = [ 0, 0 ]; + + gindexOfRow( 'row-major', 2, 2, A, 2, 5, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, true, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, false, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, null, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, void 0, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, {}, 1, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, ( x: number ): number => x, 1, w, 1 ); // $ExpectError } // The compiler throws an error if the function is provided a seventh argument which is not a number... { const A = [ 1.0, 2.0, 3.0, 4.0 ]; const x = [ 3.0, 4.0 ]; + const w = [ 0, 0 ]; + + gindexOfRow( 'row-major', 2, 2, A, 2, x, '5', w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, x, true, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, x, false, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, x, null, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, x, void 0, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, x, [], w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, x, {}, w, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, x, ( x: number ): number => x, w, 1 ); // $ExpectError +} + +// The compiler throws an error if the function is provided an eighth argument which is not a collection... +{ + const A = [ 1.0, 2.0, 3.0, 4.0 ]; + const x = [ 3.0, 4.0 ]; + + gindexOfRow( 'row-major', 2, 2, A, 2, x, 1, 5, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, x, 1, true, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, x, 1, false, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, x, 1, null, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, x, 1, void 0, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, x, 1, {}, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, x, 1, ( x: number ): number => x, 1 ); // $ExpectError +} - gindexOfRow( 'row-major', 2, 2, A, 2, x, '5' ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, A, 2, x, true ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, A, 2, x, false ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, A, 2, x, null ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, A, 2, x, void 0 ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, A, 2, x, [] ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, A, 2, x, {} ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, A, 2, x, ( x: number ): number => x ); // $ExpectError +// The compiler throws an error if the function is provided a ninth argument which is not a number... +{ + const A = [ 1.0, 2.0, 3.0, 4.0 ]; + const x = [ 3.0, 4.0 ]; + const w = [ 0, 0 ]; + + gindexOfRow( 'row-major', 2, 2, A, 2, x, 1, w, '5' ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, x, 1, w, true ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, x, 1, w, false ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, x, 1, w, null ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, x, 1, w, void 0 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, x, 1, w, [] ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, x, 1, w, {} ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, x, 1, w, ( x: number ): number => x ); // $ExpectError } // The compiler throws an error if the function is provided an unsupported number of arguments... { const A = [ 1.0, 2.0, 3.0, 4.0 ]; const x = [ 3.0, 4.0 ]; + const w = [ 0, 0 ]; gindexOfRow(); // $ExpectError gindexOfRow( 'row-major' ); // $ExpectError @@ -142,152 +181,211 @@ import gindexOfRow = require( './index' ); gindexOfRow( 'row-major', 2, 2, A ); // $ExpectError gindexOfRow( 'row-major', 2, 2, A, 2 ); // $ExpectError gindexOfRow( 'row-major', 2, 2, A, 2, x ); // $ExpectError - gindexOfRow( 'row-major', 2, 2, A, 2, x, 1, 0 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, x, 1 ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, x, 1, w ); // $ExpectError + gindexOfRow( 'row-major', 2, 2, A, 2, x, 1, w, 1, 0 ); // $ExpectError } // Attached to main export is an `ndarray` method which returns a number... { const A = [ 1.0, 2.0, 3.0, 4.0 ]; const x = [ 3.0, 4.0 ]; + const w = [ 0, 0 ]; - gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0 ); // $ExpectType number + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectType number } // The compiler throws an error if the function is provided a first argument which is not a number... { const A = [ 1.0, 2.0, 3.0, 4.0 ]; const x = [ 3.0, 4.0 ]; - - gindexOfRow.ndarray( '5', 2, A, 2, 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( true, 2, A, 2, 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( false, 2, A, 2, 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( null, 2, A, 2, 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( void 0, 2, A, 2, 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( [], 2, A, 2, 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( {}, 2, A, 2, 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( ( x: number ): number => x, 2, A, 2, 1, 0, x, 1, 0 ); // $ExpectError + const w = [ 0, 0 ]; + + gindexOfRow.ndarray( '5', 2, A, 2, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( true, 2, A, 2, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( false, 2, A, 2, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( null, 2, A, 2, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( void 0, 2, A, 2, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( [], 2, A, 2, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( {}, 2, A, 2, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( ( x: number ): number => x, 2, A, 2, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError } // The compiler throws an error if the function is provided a second argument which is not a number... { const A = [ 1.0, 2.0, 3.0, 4.0 ]; const x = [ 3.0, 4.0 ]; - - gindexOfRow.ndarray( 2, '5', A, 2, 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, true, A, 2, 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, false, A, 2, 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, null, A, 2, 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, void 0, A, 2, 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, [], A, 2, 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, {}, A, 2, 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, ( x: number ): number => x, A, 2, 1, 0, x, 1, 0 ); // $ExpectError + const w = [ 0, 0 ]; + + gindexOfRow.ndarray( 2, '5', A, 2, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, true, A, 2, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, false, A, 2, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, null, A, 2, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, void 0, A, 2, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, [], A, 2, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, {}, A, 2, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, ( x: number ): number => x, A, 2, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError } // The compiler throws an error if the function is provided a third argument which is not a collection... { const x = [ 3.0, 4.0 ]; - - gindexOfRow.ndarray( 2, 2, 5, 2, 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, true, 2, 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, false, 2, 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, null, 2, 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, void 0, 2, 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, {}, 2, 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, ( x: number ): number => x, 2, 1, 0, x, 1, 0 ); // $ExpectError + const w = [ 0, 0 ]; + + gindexOfRow.ndarray( 2, 2, 5, 2, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, true, 2, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, false, 2, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, null, 2, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, void 0, 2, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, {}, 2, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, ( x: number ): number => x, 2, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError } // The compiler throws an error if the function is provided a fourth argument which is not a number... { const A = [ 1.0, 2.0, 3.0, 4.0 ]; const x = [ 3.0, 4.0 ]; - - gindexOfRow.ndarray( 2, 2, A, '5', 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, true, 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, false, 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, null, 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, void 0, 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, [], 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, {}, 1, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, ( x: number ): number => x, 1, 0, x, 1, 0 ); // $ExpectError + const w = [ 0, 0 ]; + + gindexOfRow.ndarray( 2, 2, A, '5', 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, true, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, false, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, null, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, void 0, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, [], 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, {}, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, ( x: number ): number => x, 1, 0, x, 1, 0, w, 1, 0 ); // $ExpectError } // The compiler throws an error if the function is provided a fifth argument which is not a number... { const A = [ 1.0, 2.0, 3.0, 4.0 ]; const x = [ 3.0, 4.0 ]; - - gindexOfRow.ndarray( 2, 2, A, 2, '5', 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, true, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, false, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, null, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, void 0, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, [], 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, {}, 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, ( x: number ): number => x, 0, x, 1, 0 ); // $ExpectError + const w = [ 0, 0 ]; + + gindexOfRow.ndarray( 2, 2, A, 2, '5', 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, true, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, false, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, null, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, void 0, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, [], 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, {}, 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, ( x: number ): number => x, 0, x, 1, 0, w, 1, 0 ); // $ExpectError } // The compiler throws an error if the function is provided a sixth argument which is not a number... { const A = [ 1.0, 2.0, 3.0, 4.0 ]; const x = [ 3.0, 4.0 ]; - - gindexOfRow.ndarray( 2, 2, A, 2, 1, '5', x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, true, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, false, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, null, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, void 0, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, [], x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, {}, x, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, ( x: number ): number => x, x, 1, 0 ); // $ExpectError + const w = [ 0, 0 ]; + + gindexOfRow.ndarray( 2, 2, A, 2, 1, '5', x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, true, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, false, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, null, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, void 0, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, [], x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, {}, x, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, ( x: number ): number => x, x, 1, 0, w, 1, 0 ); // $ExpectError } // The compiler throws an error if the function is provided a seventh argument which is not a collection... { const A = [ 1.0, 2.0, 3.0, 4.0 ]; - - gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, 5, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, true, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, false, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, null, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, void 0, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, {}, 1, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, ( x: number ): number => x, 1, 0 ); // $ExpectError + const w = [ 0, 0 ]; + + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, 5, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, true, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, false, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, null, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, void 0, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, {}, 1, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, ( x: number ): number => x, 1, 0, w, 1, 0 ); // $ExpectError } // The compiler throws an error if the function is provided an eighth argument which is not a number... { const A = [ 1.0, 2.0, 3.0, 4.0 ]; const x = [ 3.0, 4.0 ]; - - gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, '5', 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, true, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, false, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, null, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, void 0, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, [], 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, {}, 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, ( x: number ): number => x, 0 ); // $ExpectError + const w = [ 0, 0 ]; + + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, '5', 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, true, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, false, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, null, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, void 0, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, [], 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, {}, 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, ( x: number ): number => x, 0, w, 1, 0 ); // $ExpectError } // The compiler throws an error if the function is provided a ninth argument which is not a number... +{ + const A = [ 1.0, 2.0, 3.0, 4.0 ]; + const x = [ 3.0, 4.0 ]; + const w = [ 0, 0 ]; + + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, '5', w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, true, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, false, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, null, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, void 0, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, [], w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, {}, w, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, ( x: number ): number => x, w, 1, 0 ); // $ExpectError +} + +// The compiler throws an error if the function is provided a tenth argument which is not a collection... { const A = [ 1.0, 2.0, 3.0, 4.0 ]; const x = [ 3.0, 4.0 ]; - gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, '5' ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, true ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, false ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, null ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, void 0 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, [] ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, {} ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, ( x: number ): number => x ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, 5, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, true, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, false, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, null, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, void 0, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, {}, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, ( x: number ): number => x, 1, 0 ); // $ExpectError +} + +// The compiler throws an error if the function is provided an eleventh argument which is not a number... +{ + const A = [ 1.0, 2.0, 3.0, 4.0 ]; + const x = [ 3.0, 4.0 ]; + const w = [ 0, 0 ]; + + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, w, '5', 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, w, true, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, w, false, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, w, null, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, w, void 0, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, w, [], 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, w, {}, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, w, ( x: number ): number => x, 0 ); // $ExpectError +} + +// The compiler throws an error if the function is provided a twelfth argument which is not a number... +{ + const A = [ 1.0, 2.0, 3.0, 4.0 ]; + const x = [ 3.0, 4.0 ]; + const w = [ 0, 0 ]; + + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, w, 1, '5' ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, w, 1, true ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, w, 1, false ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, w, 1, null ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, w, 1, void 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, w, 1, [] ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, w, 1, {} ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, w, 1, ( x: number ): number => x ); // $ExpectError } // The compiler throws an error if the `ndarray` method is provided an unsupported number of arguments... { const A = [ 1.0, 2.0, 3.0, 4.0 ]; const x = [ 3.0, 4.0 ]; + const w = [ 0, 0 ]; gindexOfRow.ndarray(); // $ExpectError gindexOfRow.ndarray( 2 ); // $ExpectError @@ -298,5 +396,8 @@ import gindexOfRow = require( './index' ); gindexOfRow.ndarray( 2, 2, A, 2, 1, 0 ); // $ExpectError gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x ); // $ExpectError gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1 ); // $ExpectError - gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, w ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, w, 1 ); // $ExpectError + gindexOfRow.ndarray( 2, 2, A, 2, 1, 0, x, 1, 0, w, 1, 0, 0 ); // $ExpectError } diff --git a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/examples/index.js b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/examples/index.js index f5c73990871d..64af82dc8972 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/examples/index.js +++ b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/examples/index.js @@ -32,5 +32,7 @@ console.log( ndarray2array( A, shape, strides, 0, order ) ); var x = [ 4.0, 5.0, 6.0 ]; console.log( x ); -var out = gindexOfRow( order, shape[ 0 ], shape[ 1 ], A, strides[ 0 ], x, 1, 0 ); +var workspace = [ 0, 0, 0 ]; + +var out = gindexOfRow( order, shape[ 0 ], shape[ 1 ], A, strides[ 0 ], x, 1, workspace, 1 ); // eslint-disable-line max-len console.log( out ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/lib/accessors.js b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/lib/accessors.js index 2e8a7c7b63fb..7b193d0a5e29 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/lib/accessors.js +++ b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/lib/accessors.js @@ -16,12 +16,13 @@ * limitations under the License. */ +/* eslint-disable max-params */ + 'use strict'; // MODULES // var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major' ); -var ones = require( '@stdlib/array/base/ones' ); // MAIN // @@ -32,6 +33,7 @@ var ones = require( '@stdlib/array/base/ones' ); * ## Notes * * - If the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored. * * @private * @param {PositiveInteger} M - number of rows in `A` @@ -39,14 +41,19 @@ var ones = require( '@stdlib/array/base/ones' ); * @param {Object} A - input matrix object * @param {Collection} A.data - input matrix data * @param {Array} A.accessors - matrix element accessors -* @param {integer} strideA1 - stride of the first dimension of `A` -* @param {integer} strideA2 - stride of the second dimension of `A` -* @param {NonNegativeInteger} offsetA - index offset for `A` +* @param {integer} strideA1 - stride length for the first dimension of `A` +* @param {integer} strideA2 - stride length for the second dimension of `A` +* @param {NonNegativeInteger} offsetA - starting index for `A` * @param {Object} x - search vector object * @param {Collection} x.data - search vector data * @param {Array} x.accessors - search vector element accessors * @param {integer} strideX - stride length for `x` -* @param {NonNegativeInteger} offsetX - index offset for `x` +* @param {NonNegativeInteger} offsetX - starting index for `x` +* @param {Object} workspace - workspace array object +* @param {Collection} workspace.data - workspace array data +* @param {Array} workspace.accessors - workspace element accessors +* @param {integer} strideW - stride length for `workspace` +* @param {NonNegativeInteger} offsetW - starting index for `workspace` * @returns {integer} row index * * @example @@ -55,8 +62,9 @@ var ones = require( '@stdlib/array/base/ones' ); * * var A = [ 1.0, 2.0, 3.0, 4.0, 0.0, 0.0 ]; // => [ [ 1.0, 2.0 ], [ 3.0, 4.0 ], [ 0.0, 0.0 ] ] * var x = [ 3.0, 4.0 ]; +* var workspace = [ 0, 0, 0 ]; * -* var out = gindexOfRow( 3, 2, arraylike2object( toAccessorArray( A ) ), 2, 1, 0, arraylike2object( toAccessorArray( x ) ), 1, 0 ); +* var out = gindexOfRow( 3, 2, arraylike2object( toAccessorArray( A ) ), 2, 1, 0, arraylike2object( toAccessorArray( x ) ), 1, 0, arraylike2object( toAccessorArray( workspace ) ), 1, 0 ); * // returns 1 * * @example @@ -65,8 +73,9 @@ var ones = require( '@stdlib/array/base/ones' ); * * var A = [ 1.0, 3.0, 0.0, 2.0, 4.0, 0.0 ]; // => [ [ 1.0, 2.0 ], [ 3.0, 4.0 ], [ 0.0, 0.0 ] ] * var x = [ 3.0, 4.0 ]; +* var workspace = [ 0, 0, 0 ]; * -* var out = gindexOfRow( 3, 2, arraylike2object( toAccessorArray( A ) ), 1, 3, 0, arraylike2object( toAccessorArray( x ) ), 1, 0 ); +* var out = gindexOfRow( 3, 2, arraylike2object( toAccessorArray( A ) ), 1, 3, 0, arraylike2object( toAccessorArray( x ) ), 1, 0, arraylike2object( toAccessorArray( workspace ) ), 1, 0 ); * // returns 1 * * @example @@ -75,8 +84,9 @@ var ones = require( '@stdlib/array/base/ones' ); * * var A = [ 1.0, 3.0, 0.0, 2.0, 4.0, 0.0 ]; // => [ [ 1.0, 2.0 ], [ 3.0, 4.0 ], [ 0.0, 0.0 ] ] * var x = [ 1.0, 2.0 ]; +* var workspace = [ 0, 0, 0 ]; * -* var out = gindexOfRow( 3, 2, arraylike2object( toAccessorArray( A ) ), 1, 3, 0, arraylike2object( toAccessorArray( x ) ), 1, 0 ); +* var out = gindexOfRow( 3, 2, arraylike2object( toAccessorArray( A ) ), 1, 3, 0, arraylike2object( toAccessorArray( x ) ), 1, 0, arraylike2object( toAccessorArray( workspace ) ), 1, 0 ); * // returns 0 * * @example @@ -85,8 +95,9 @@ var ones = require( '@stdlib/array/base/ones' ); * * var A = [ 1.0, 3.0, 0.0, 2.0, 4.0, 0.0 ]; // => [ [ 1.0, 2.0 ], [ 3.0, 4.0 ], [ 0.0, 0.0 ] ] * var x = [ 0.0, 0.0 ]; +* var workspace = [ 0, 0, 0 ]; * -* var out = gindexOfRow( 3, 2, arraylike2object( toAccessorArray( A ) ), 1, 3, 0, arraylike2object( toAccessorArray( x ) ), 1, 0 ); +* var out = gindexOfRow( 3, 2, arraylike2object( toAccessorArray( A ) ), 1, 3, 0, arraylike2object( toAccessorArray( x ) ), 1, 0, arraylike2object( toAccessorArray( workspace ) ), 1, 0 ); * // returns 2 * * @example @@ -95,21 +106,25 @@ var ones = require( '@stdlib/array/base/ones' ); * * var A = [ 1.0, 3.0, 0.0, 2.0, 4.0, 0.0 ]; // => [ [ 1.0, 2.0 ], [ 3.0, 4.0 ], [ 0.0, 0.0 ] ] * var x = [ -3.0, -4.0 ]; +* var workspace = [ 0, 0, 0 ]; * -* var out = gindexOfRow( 3, 2, arraylike2object( toAccessorArray( A ) ), 1, 3, 0, arraylike2object( toAccessorArray( x ) ), 1, 0 ); +* var out = gindexOfRow( 3, 2, arraylike2object( toAccessorArray( A ) ), 1, 3, 0, arraylike2object( toAccessorArray( x ) ), 1, 0, arraylike2object( toAccessorArray( workspace ) ), 1, 0 ); * // returns -1 */ -function gindexOfRow( M, N, A, strideA1, strideA2, offsetA, x, strideX, offsetX ) { // eslint-disable-line max-len - var matches; +function gindexOfRow( M, N, A, strideA1, strideA2, offsetA, x, strideX, offsetX, workspace, strideW, offsetW ) { // eslint-disable-line max-len + var wbuf; var abuf; var xbuf; var aget; var xget; + var wget; + var wset; var da0; var da1; var S0; var S1; var ia; + var iw; var ix; var i0; var i1; @@ -117,10 +132,13 @@ function gindexOfRow( M, N, A, strideA1, strideA2, offsetA, x, strideX, offsetX // Cache references to array data: abuf = A.data; xbuf = x.data; + wbuf = workspace.data; // Cache references to the element accessors: aget = A.accessors[ 0 ]; xget = x.accessors[ 0 ]; + wget = workspace.accessors[ 0 ]; + wset = workspace.accessors[ 1 ]; // Search for the first row matching the search vector... if ( isRowMajor( [ strideA1, strideA2 ] ) ) { @@ -155,29 +173,37 @@ function gindexOfRow( M, N, A, strideA1, strideA2, offsetA, x, strideX, offsetX da0 = strideA1; da1 = strideA2 - ( S0*strideA1 ); - // Create an array for tracking which rows contain matching elements: - matches = ones( M ); + // Initialize the workspace array for tracking which rows contain matching elements: + iw = offsetW; + for ( i0 = 0; i0 < S0; i0++ ) { + wset( wbuf, iw, 1 ); + iw += strideW; + } // Finding the first matching row when a matrix is stored in column-major order requires effectively performing a full linear scan. In order to ensure cache-efficient traversal, scan down each column (otherwise, if we went row-by-row, we'd hop around linear memory, resulting in poor cache behavior)... ia = offsetA; ix = offsetX; for ( i1 = 0; i1 < S1; i1++ ) { // Scan down the rows in a column looking for a matching element... + iw = offsetW; for ( i0 = 0; i0 < S0; i0++ ) { if ( aget( abuf, ia ) !== xget( xbuf, ix ) ) { // We found a non-matching element, which means we can exclude this row from the list of row candidates... - matches[ i0 ] = 0; + wset( wbuf, iw, 0 ); } ia += da0; + iw += strideW; } ia += da1; ix += strideX; } // Search for the first matching row... + iw = offsetW; for ( i0 = 0; i0 < S0; i0++ ) { - if ( matches[ i0 ] === 1 ) { + if ( wget( wbuf, iw ) === 1 ) { break; } + iw += strideW; } return ( i0 === S0 ) ? -1 : i0; } diff --git a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/lib/base.js b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/lib/base.js deleted file mode 100644 index d864eebc50f1..000000000000 --- a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/lib/base.js +++ /dev/null @@ -1,170 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2025 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -'use strict'; - -// MODULES // - -var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major' ); -var arraylike2object = require( '@stdlib/array/base/arraylike2object' ); -var ones = require( '@stdlib/array/base/ones' ); -var accessors = require( './accessors.js' ); - - -// MAIN // - -/** -* Returns the index of the first row in an input matrix which has the same elements as a provided search vector. -* -* ## Notes -* -* - If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index). -* -* @private -* @param {PositiveInteger} M - number of rows in `A` -* @param {PositiveInteger} N - number of columns in `A` -* @param {Collection} A - input matrix -* @param {integer} strideA1 - stride of the first dimension of `A` -* @param {integer} strideA2 - stride of the second dimension of `A` -* @param {NonNegativeInteger} offsetA - index offset for `A` -* @param {Collection} x - search vector -* @param {integer} strideX - stride length for `x` -* @param {NonNegativeInteger} offsetX - index offset for `x` -* @returns {integer} row index -* -* @example -* var A = [ 1.0, 2.0, 3.0, 4.0, 0.0, 0.0 ]; // => [ [ 1.0, 2.0 ], [ 3.0, 4.0 ], [ 0.0, 0.0 ] ] -* var x = [ 3.0, 4.0 ]; -* -* var out = gindexOfRow( 3, 2, A, 2, 1, 0, x, 1, 0 ); -* // returns 1 -* -* @example -* var A = [ 1.0, 3.0, 0.0, 2.0, 4.0, 0.0 ]; // => [ [ 1.0, 2.0 ], [ 3.0, 4.0 ], [ 0.0, 0.0 ] ] -* var x = [ 3.0, 4.0 ]; -* -* var out = gindexOfRow( 3, 2, A, 1, 3, 0, x, 1, 0 ); -* // returns 1 -* -* @example -* var A = [ 1.0, 3.0, 0.0, 2.0, 4.0, 0.0 ]; // => [ [ 1.0, 2.0 ], [ 3.0, 4.0 ], [ 0.0, 0.0 ] ] -* var x = [ 1.0, 2.0 ]; -* -* var out = gindexOfRow( 3, 2, A, 1, 3, 0, x, 1, 0 ); -* // returns 0 -* -* @example -* var A = [ 1.0, 3.0, 0.0, 2.0, 4.0, 0.0 ]; // => [ [ 1.0, 2.0 ], [ 3.0, 4.0 ], [ 0.0, 0.0 ] ] -* var x = [ 0.0, 0.0 ]; -* -* var out = gindexOfRow( 3, 2, A, 1, 3, 0, x, 1, 0 ); -* // returns 2 -* -* @example -* var A = [ 1.0, 3.0, 0.0, 2.0, 4.0, 0.0 ]; // => [ [ 1.0, 2.0 ], [ 3.0, 4.0 ], [ 0.0, 0.0 ] ] -* var x = [ -3.0, -4.0 ]; -* -* var out = gindexOfRow( 3, 2, A, 1, 3, 0, x, 1, 0 ); -* // returns -1 -*/ -function gindexOfRow( M, N, A, strideA1, strideA2, offsetA, x, strideX, offsetX ) { // eslint-disable-line max-len - var matches; - var da0; - var da1; - var S0; - var S1; - var ia; - var ix; - var i0; - var i1; - var oa; - var ox; - - // Check whether the matrix is an empty matrix... - if ( M <= 0 || N <= 0 ) { - return -1; - } - oa = arraylike2object( A ); - ox = arraylike2object( x ); - if ( oa.accessorProtocol || ox.accessorProtocol ) { - return accessors( M, N, oa, strideA1, strideA2, offsetA, ox, strideX, offsetX ); // eslint-disable-line max-len - } - // Search for the first row matching the search vector... - if ( isRowMajor( [ strideA1, strideA2 ] ) ) { - S0 = N; - S1 = M; - - // Scan a row-major linear buffer from the first indexed element to the last indexed element, always moving in the same direction when both strides are the same sign, thus ensuring cache optimal traversal... - for ( i1 = 0; i1 < S1; i1++ ) { - ia = offsetA + ( i1*strideA1 ); - ix = offsetX; - for ( i0 = 0; i0 < S0; i0++ ) { - if ( A[ ia ] !== x[ ix ] ) { - // We found an element which is not in the search vector... - break; - } - ia += strideA2; - ix += strideX; - } - // If we successfully iterated over all columns, then that means we've found a match... - if ( i0 === S0 ) { - return i1; - } - } - // If we've made it here, then no rows match the search vector: - return -1; - } - // Column-major... - S0 = M; - S1 = N; - - // Resolve loop offset (pointer) increments: - da0 = strideA1; - da1 = strideA2 - ( S0*strideA1 ); - - // Create an array for tracking which rows contain matching elements: - matches = ones( M ); - - // Finding the first matching row when a matrix is stored in column-major order requires effectively performing a full linear scan. In order to ensure cache-efficient traversal, scan down each column (otherwise, if we went row-by-row, we'd hop around linear memory, resulting in poor cache behavior)... - ia = offsetA; - ix = offsetX; - for ( i1 = 0; i1 < S1; i1++ ) { - // Scan down the rows in a column looking for a matching element... - for ( i0 = 0; i0 < S0; i0++ ) { - if ( A[ ia ] !== x[ ix ] ) { - // We found a non-matching element, which means we can exclude this row from the list of row candidates... - matches[ i0 ] = 0; - } - ia += da0; - } - ia += da1; - ix += strideX; - } - // Search for the first matching row... - for ( i0 = 0; i0 < S0; i0++ ) { - if ( matches[ i0 ] === 1 ) { - break; - } - } - return ( i0 === S0 ) ? -1 : i0; -} - - -// EXPORTS // - -module.exports = gindexOfRow; diff --git a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/lib/index.js b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/lib/index.js index 3b588eda5ba2..54a9145e7e12 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/lib/index.js +++ b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/lib/index.js @@ -28,8 +28,19 @@ * * var A = [ 1.0, 2.0, 3.0, 4.0, 0.0, 0.0 ]; // => [ [ 1.0, 2.0 ], [ 3.0, 4.0 ], [ 0.0, 0.0 ] ] * var x = [ 3.0, 4.0 ]; +* var workspace = [ 0, 0, 0 ]; * -* var out = gindexOfRow( 'row-major', 3, 2, A, 2, x, 1 ); +* var out = gindexOfRow( 'row-major', 3, 2, A, 2, x, 1, workspace, 1 ); +* // returns 1 +* +* @example +* var gindexOfRow = require( '@stdlib/blas/ext/base/gindex-of-row' ); +* +* var A = [ 1.0, 2.0, 3.0, 4.0, 0.0, 0.0 ]; // => [ [ 1.0, 2.0 ], [ 3.0, 4.0 ], [ 0.0, 0.0 ] ] +* var x = [ 3.0, 4.0 ]; +* var workspace = [ 0, 0, 0 ]; +* +* var out = gindexOfRow.ndarray( 3, 2, A, 2, 1, 0, x, 1, 0, workspace, 1, 0 ); * // returns 1 */ diff --git a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/lib/main.js b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/lib/main.js index 1e911fd1fda0..e03f0d7beda7 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/lib/main.js +++ b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/lib/main.js @@ -26,7 +26,7 @@ var isColumnMajor = require( '@stdlib/ndarray/base/assert/is-column-major-string var stride2offset = require( '@stdlib/strided/base/stride2offset' ); var max = require( '@stdlib/math/base/special/fast/max' ); var format = require( '@stdlib/string/format' ); -var base = require( './base.js' ); +var ndarray = require( './ndarray.js' ); // MAIN // @@ -37,26 +37,30 @@ var base = require( './base.js' ); * ## Notes * * - If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored. * * @param {string} order - storage layout * @param {PositiveInteger} M - number of rows in `A` * @param {PositiveInteger} N - number of columns in `A` * @param {Collection} A - input matrix -* @param {integer} LDA - stride of the first dimension of `A` (a.k.a., leading dimension of the matrix `A`) +* @param {integer} LDA - stride length for the first dimension of `A` (a.k.a., leading dimension of the matrix `A`) * @param {Collection} x - search vector * @param {integer} strideX - stride length for `x` +* @param {Collection} workspace - workspace array for tracking row match candidates +* @param {integer} strideW - stride length for `workspace` * @throws {TypeError} first argument must be a valid order -* @throws {RangeError} fifth argument must be greater than or equal to max(1,N) +* @throws {RangeError} fifth argument must be a valid stride * @returns {integer} row index * * @example * var A = [ 1.0, 2.0, 3.0, 4.0, 0.0, 0.0 ]; // => [ [ 1.0, 2.0 ], [ 3.0, 4.0 ], [ 0.0, 0.0 ] ] * var x = [ 3.0, 4.0 ]; +* var workspace = [ 0, 0, 0 ]; * -* var out = gindexOfRow( 'row-major', 3, 2, A, 2, x, 1 ); +* var out = gindexOfRow( 'row-major', 3, 2, A, 2, x, 1, workspace, 1 ); * // returns 1 */ -function gindexOfRow( order, M, N, A, LDA, x, strideX ) { +function gindexOfRow( order, M, N, A, LDA, x, strideX, workspace, strideW ) { var sa1; var sa2; var s; @@ -78,7 +82,7 @@ function gindexOfRow( order, M, N, A, LDA, x, strideX ) { sa1 = LDA; sa2 = 1; } - return base( M, N, A, sa1, sa2, 0, x, strideX, stride2offset( N, strideX ) ); // eslint-disable-line max-len + return ndarray( M, N, A, sa1, sa2, 0, x, strideX, stride2offset( N, strideX ), workspace, strideW, stride2offset( M, strideW ) ); // eslint-disable-line max-len } diff --git a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/lib/ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/lib/ndarray.js index 368d80421416..80fa79de94b4 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/lib/ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/lib/ndarray.js @@ -16,11 +16,15 @@ * limitations under the License. */ +/* eslint-disable max-params, max-len */ + 'use strict'; // MODULES // -var base = require( './base.js' ); +var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major' ); +var arraylike2object = require( '@stdlib/array/base/arraylike2object' ); +var accessors = require( './accessors.js' ); // MAIN // @@ -31,27 +35,152 @@ var base = require( './base.js' ); * ## Notes * * - If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored. * * @param {PositiveInteger} M - number of rows in `A` * @param {PositiveInteger} N - number of columns in `A` * @param {Collection} A - input matrix -* @param {integer} strideA1 - stride of the first dimension of `A` -* @param {integer} strideA2 - stride of the second dimension of `A` -* @param {NonNegativeInteger} offsetA - index offset for `A` +* @param {integer} strideA1 - stride length for the first dimension of `A` +* @param {integer} strideA2 - stride length for the second dimension of `A` +* @param {NonNegativeInteger} offsetA - starting index for `A` * @param {Collection} x - search vector * @param {integer} strideX - stride length for `x` -* @param {NonNegativeInteger} offsetX - index offset for `x` +* @param {NonNegativeInteger} offsetX - starting index for `x` +* @param {Collection} workspace - workspace array for tracking row match candidates +* @param {integer} strideW - stride length for `workspace` +* @param {NonNegativeInteger} offsetW - starting index for `workspace` * @returns {integer} row index * * @example * var A = [ 1.0, 2.0, 3.0, 4.0, 0.0, 0.0 ]; // => [ [ 1.0, 2.0 ], [ 3.0, 4.0 ], [ 0.0, 0.0 ] ] * var x = [ 3.0, 4.0 ]; +* var workspace = [ 0, 0, 0 ]; +* +* var out = gindexOfRow( 3, 2, A, 2, 1, 0, x, 1, 0, workspace, 1, 0 ); +* // returns 1 +* +* @example +* var A = [ 1.0, 3.0, 0.0, 2.0, 4.0, 0.0 ]; // => [ [ 1.0, 2.0 ], [ 3.0, 4.0 ], [ 0.0, 0.0 ] ] +* var x = [ 3.0, 4.0 ]; +* var workspace = [ 0, 0, 0 ]; * -* var out = gindexOfRow( 3, 2, A, 2, 1, 0, x, 1, 0 ); +* var out = gindexOfRow( 3, 2, A, 1, 3, 0, x, 1, 0, workspace, 1, 0 ); * // returns 1 +* +* @example +* var A = [ 1.0, 3.0, 0.0, 2.0, 4.0, 0.0 ]; // => [ [ 1.0, 2.0 ], [ 3.0, 4.0 ], [ 0.0, 0.0 ] ] +* var x = [ 1.0, 2.0 ]; +* var workspace = [ 0, 0, 0 ]; +* +* var out = gindexOfRow( 3, 2, A, 1, 3, 0, x, 1, 0, workspace, 1, 0 ); +* // returns 0 +* +* @example +* var A = [ 1.0, 3.0, 0.0, 2.0, 4.0, 0.0 ]; // => [ [ 1.0, 2.0 ], [ 3.0, 4.0 ], [ 0.0, 0.0 ] ] +* var x = [ 0.0, 0.0 ]; +* var workspace = [ 0, 0, 0 ]; +* +* var out = gindexOfRow( 3, 2, A, 1, 3, 0, x, 1, 0, workspace, 1, 0 ); +* // returns 2 +* +* @example +* var A = [ 1.0, 3.0, 0.0, 2.0, 4.0, 0.0 ]; // => [ [ 1.0, 2.0 ], [ 3.0, 4.0 ], [ 0.0, 0.0 ] ] +* var x = [ -3.0, -4.0 ]; +* var workspace = [ 0, 0, 0 ]; +* +* var out = gindexOfRow( 3, 2, A, 1, 3, 0, x, 1, 0, workspace, 1, 0 ); +* // returns -1 */ -function gindexOfRow( M, N, A, strideA1, strideA2, offsetA, x, strideX, offsetX ) { // eslint-disable-line max-len - return base( M, N, A, strideA1, strideA2, offsetA, x, strideX, offsetX ); +function gindexOfRow( M, N, A, strideA1, strideA2, offsetA, x, strideX, offsetX, workspace, strideW, offsetW ) { + var da0; + var da1; + var S0; + var S1; + var ia; + var iw; + var ix; + var i0; + var i1; + var oa; + var ow; + var ox; + + // Check whether the matrix is an empty matrix... + if ( M <= 0 || N <= 0 ) { + return -1; + } + oa = arraylike2object( A ); + ox = arraylike2object( x ); + ow = arraylike2object( workspace ); + if ( oa.accessorProtocol || ox.accessorProtocol || ow.accessorProtocol ) { + return accessors( M, N, oa, strideA1, strideA2, offsetA, ox, strideX, offsetX, ow, strideW, offsetW ); + } + // Search for the first row matching the search vector... + if ( isRowMajor( [ strideA1, strideA2 ] ) ) { + S0 = N; + S1 = M; + + // Scan a row-major linear buffer from the first indexed element to the last indexed element, always moving in the same direction when both strides are the same sign, thus ensuring cache optimal traversal... + for ( i1 = 0; i1 < S1; i1++ ) { + ia = offsetA + ( i1*strideA1 ); + ix = offsetX; + for ( i0 = 0; i0 < S0; i0++ ) { + if ( A[ ia ] !== x[ ix ] ) { + // We found an element which is not in the search vector... + break; + } + ia += strideA2; + ix += strideX; + } + // If we successfully iterated over all columns, then that means we've found a match... + if ( i0 === S0 ) { + return i1; + } + } + // If we've made it here, then no rows match the search vector: + return -1; + } + // Column-major... + S0 = M; + S1 = N; + + // Resolve loop offset (pointer) increments: + da0 = strideA1; + da1 = strideA2 - ( S0*strideA1 ); + + // Initialize the workspace array for tracking which rows contain matching elements: + iw = offsetW; + for ( i0 = 0; i0 < S0; i0++ ) { + workspace[ iw ] = 1; + iw += strideW; + } + + // Finding the first matching row when a matrix is stored in column-major order requires effectively performing a full linear scan. In order to ensure cache-efficient traversal, scan down each column (otherwise, if we went row-by-row, we'd hop around linear memory, resulting in poor cache behavior)... + ia = offsetA; + ix = offsetX; + for ( i1 = 0; i1 < S1; i1++ ) { + // Scan down the rows in a column looking for a matching element... + iw = offsetW; + for ( i0 = 0; i0 < S0; i0++ ) { + if ( A[ ia ] !== x[ ix ] ) { + // We found a non-matching element, which means we can exclude this row from the list of row candidates... + workspace[ iw ] = 0; + } + ia += da0; + iw += strideW; + } + ia += da1; + ix += strideX; + } + // Search for the first matching row... + iw = offsetW; + for ( i0 = 0; i0 < S0; i0++ ) { + if ( workspace[ iw ] === 1 ) { + break; + } + iw += strideW; + } + return ( i0 === S0 ) ? -1 : i0; } diff --git a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/large-strides/column_major.json b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/large-strides/column_major.json index b76888a50e24..5162a2758c84 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/large-strides/column_major.json +++ b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/large-strides/column_major.json @@ -1,7 +1,9 @@ { "order": "column-major", "A": [ - 1, + 1.0, + 9999.0, + 2.0, 9999.0, 2.0, 9999.0, @@ -11,18 +13,21 @@ 9999.0, 4.0, 9999.0, + 4.0, + 9999.0, 0.0, 9999.0 ], - "M": 3, + "M": 4, "N": 2, "strideA1": 2, - "strideA2": 6, + "strideA2": 8, "offsetA": 0, - "LDA": 3, + "LDA": 4, "A_mat": [ [ 1.0, 3.0 ], [ 2.0, 4.0 ], + [ 2.0, 4.0 ], [ 0.0, 0.0 ] ], "x": [ 2.0, 9999.0, 4.0, 9999.0 ], diff --git a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/large-strides/row_major.json b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/large-strides/row_major.json index cc7f7a6ddf0a..0563e6b69f01 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/large-strides/row_major.json +++ b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/large-strides/row_major.json @@ -9,12 +9,16 @@ 9999.0, 4.0, 9999.0, + 3.0, + 9999.0, + 4.0, + 9999.0, 0.0, 9999.0, 0.0, 9999.0 ], - "M": 3, + "M": 4, "N": 2, "strideA1": 4, "strideA2": 2, @@ -23,6 +27,7 @@ "A_mat": [ [ 1.0, 2.0 ], [ 3.0, 4.0 ], + [ 3.0, 4.0 ], [ 0.0, 0.0 ] ], "x": [ 3.0, 9999.0, 4.0, 9999.0 ], diff --git a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/mixed-strides/column_major.json b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/mixed-strides/column_major.json index aaa21b653d14..c8710371b776 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/mixed-strides/column_major.json +++ b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/mixed-strides/column_major.json @@ -3,20 +3,23 @@ "A": [ 3.0, 4.0, + 4.0, 0.0, 1.0, 2.0, + 2.0, 0.0 ], - "M": 3, + "M": 4, "N": 2, "strideA1": 1, - "strideA2": -3, - "offsetA": 3, - "LDA": 3, + "strideA2": -4, + "offsetA": 4, + "LDA": 4, "A_mat": [ [ 1.0, 3.0 ], [ 2.0, 4.0 ], + [ 2.0, 4.0 ], [ 0.0, 0.0 ] ], "x": [ 4.0, 9999.0, 2.0, 9999.0 ], diff --git a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/mixed-strides/row_major.json b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/mixed-strides/row_major.json index d7fe9ee838da..fe1591832656 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/mixed-strides/row_major.json +++ b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/mixed-strides/row_major.json @@ -5,18 +5,21 @@ 0.0, 3.0, 4.0, + 3.0, + 4.0, 1.0, 2.0 ], - "M": 3, + "M": 4, "N": 2, "strideA1": -2, "strideA2": 1, - "offsetA": 4, + "offsetA": 6, "LDA": 2, "A_mat": [ [ 1.0, 2.0 ], [ 3.0, 4.0 ], + [ 3.0, 4.0 ], [ 0.0, 0.0 ] ], "x": [ 9999.0, 4.0, 9999.0, 3.0, 9999.0 ], diff --git a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/negative-strides/column_major.json b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/negative-strides/column_major.json index fd8c1de70614..c1d97ce4a974 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/negative-strides/column_major.json +++ b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/negative-strides/column_major.json @@ -3,20 +3,23 @@ "A": [ 0.0, 4.0, + 4.0, 3.0, 0.0, 2.0, + 2.0, 1.0 ], - "M": 3, + "M": 4, "N": 2, "strideA1": -1, - "strideA2": -3, - "offsetA": 5, - "LDA": 3, + "strideA2": -4, + "offsetA": 7, + "LDA": 4, "A_mat": [ [ 1.0, 3.0 ], [ 2.0, 4.0 ], + [ 2.0, 4.0 ], [ 0.0, 0.0 ] ], "x": [ 2.0, 9999.0, 4.0, 9999.0 ], diff --git a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/negative-strides/row_major.json b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/negative-strides/row_major.json index a3b47eb643bc..fc4c071ef990 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/negative-strides/row_major.json +++ b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/negative-strides/row_major.json @@ -5,18 +5,21 @@ 0.0, 4.0, 3.0, + 4.0, + 3.0, 2.0, 1.0 ], - "M": 3, + "M": 4, "N": 2, "strideA1": -2, "strideA2": -1, - "offsetA": 5, + "offsetA": 7, "LDA": 2, "A_mat": [ [ 1.0, 2.0 ], [ 3.0, 4.0 ], + [ 3.0, 4.0 ], [ 0.0, 0.0 ] ], "x": [ 3.0, 9999.0, 4.0, 9999.0 ], diff --git a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/offsets/column_major.json b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/offsets/column_major.json index b2d0a6cf1acc..b17bddd652e3 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/offsets/column_major.json +++ b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/offsets/column_major.json @@ -4,20 +4,23 @@ 9999.0, 1.0, 2.0, + 2.0, 0.0, 3.0, 4.0, + 4.0, 0.0 ], - "M": 3, + "M": 4, "N": 2, "strideA1": 1, - "strideA2": 3, + "strideA2": 4, "offsetA": 1, - "LDA": 3, + "LDA": 4, "A_mat": [ [ 1.0, 3.0 ], [ 2.0, 4.0 ], + [ 2.0, 4.0 ], [ 0.0, 0.0 ] ], "x": [ 9999.0, 2.0, 4.0 ], diff --git a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/offsets/row_major.json b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/offsets/row_major.json index ab70c2763ce6..48c145822eb8 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/offsets/row_major.json +++ b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/fixtures/offsets/row_major.json @@ -6,10 +6,12 @@ 2.0, 3.0, 4.0, + 3.0, + 4.0, 0.0, 0.0 ], - "M": 3, + "M": 4, "N": 2, "strideA1": 2, "strideA2": 1, @@ -18,6 +20,7 @@ "A_mat": [ [ 1.0, 2.0 ], [ 3.0, 4.0 ], + [ 3.0, 4.0 ], [ 0.0, 0.0 ] ], "x": [ 9999.0, 3.0, 4.0 ], diff --git a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/test.main.js b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/test.main.js index f15899257ba0..abd5cccdf8e0 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/test.main.js +++ b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/test.main.js @@ -23,6 +23,8 @@ // MODULES // var tape = require( 'tape' ); +var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' ); +var zeros = require( '@stdlib/array/base/zeros' ); var gindexOfRow = require( './../lib' ); @@ -42,8 +44,8 @@ tape( 'main export is a function', function test( t ) { t.end(); }); -tape( 'the function has an arity of 7', function test( t ) { - t.strictEqual( gindexOfRow.length, 7, 'returns expected value' ); +tape( 'the function has an arity of 9', function test( t ) { + t.strictEqual( gindexOfRow.length, 9, 'returns expected value' ); t.end(); }); @@ -77,7 +79,7 @@ tape( 'the function throws an error if provided a first argument which is not a function badValue( value ) { return function badValue() { - gindexOfRow( value, data.M, data.N, data.A, data.LDA, data.x, data.strideX ); + gindexOfRow( value, data.M, data.N, data.A, data.LDA, data.x, data.strideX, zeros( data.M ), 1 ); }; } }); @@ -101,7 +103,7 @@ tape( 'the function throws an error if provided a fifth argument which is not a function badValue( value ) { return function badValue() { - gindexOfRow( data.order, data.M, data.N, data.A, value, data.x, data.strideX ); + gindexOfRow( data.order, data.M, data.N, data.A, value, data.x, data.strideX, zeros( data.M ), 1 ); }; } }); @@ -125,7 +127,7 @@ tape( 'the function throws an error if provided a fifth argument which is not a function badValue( value ) { return function badValue() { - gindexOfRow( data.order, data.M, data.N, data.A, value, data.x, data.strideX ); + gindexOfRow( data.order, data.M, data.N, data.A, value, data.x, data.strideX, zeros( data.M ), 1 ); }; } }); @@ -135,7 +137,7 @@ tape( 'the function returns an invalid index when M is less than or equal to zer var out; data = ROW_MAJOR_DATA; - out = gindexOfRow( data.order, 0, data.N, data.A, data.LDA, data.x, data.strideX ); + out = gindexOfRow( data.order, 0, data.N, data.A, data.LDA, data.x, data.strideX, zeros( data.M ), 1 ); t.strictEqual( out, -1, 'returns expected value' ); t.end(); @@ -146,7 +148,7 @@ tape( 'the function returns an invalid index when N is less than or equal to zer var out; data = ROW_MAJOR_DATA; - out = gindexOfRow( data.order, data.M, 0, data.A, data.LDA, data.x, data.strideX ); + out = gindexOfRow( data.order, data.M, 0, data.A, data.LDA, data.x, data.strideX, zeros( data.M ), 1 ); t.strictEqual( out, -1, 'returns expected value' ); t.end(); @@ -157,7 +159,7 @@ tape( 'the function returns the index of the first row matching a search vector var out; data = ROW_MAJOR_DATA; - out = gindexOfRow( data.order, data.M, data.N, data.A, data.LDA, data.x, data.strideX ); + out = gindexOfRow( data.order, data.M, data.N, data.A, data.LDA, data.x, data.strideX, zeros( data.M ), 1 ); t.strictEqual( out, data.expected, 'returns expected value' ); t.end(); @@ -168,7 +170,7 @@ tape( 'the function returns the index of the first row matching a search vector var out; data = COLUMN_MAJOR_DATA; - out = gindexOfRow( data.order, data.M, data.N, data.A, data.LDA, data.x, data.strideX ); + out = gindexOfRow( data.order, data.M, data.N, data.A, data.LDA, data.x, data.strideX, zeros( data.M ), 1 ); t.strictEqual( out, data.expected, 'returns expected value' ); t.end(); @@ -179,7 +181,7 @@ tape( 'the function returns an invalid index if unable to find a search vector ( var out; data = ROW_MAJOR_NO_MATCH; - out = gindexOfRow( data.order, data.M, data.N, data.A, data.LDA, data.x, data.strideX ); + out = gindexOfRow( data.order, data.M, data.N, data.A, data.LDA, data.x, data.strideX, zeros( data.M ), 1 ); t.strictEqual( out, -1, 'returns expected value' ); t.end(); @@ -190,7 +192,51 @@ tape( 'the function returns an invalid index if unable to find a search vector ( var out; data = COLUMN_MAJOR_NO_MATCH; - out = gindexOfRow( data.order, data.M, data.N, data.A, data.LDA, data.x, data.strideX ); + out = gindexOfRow( data.order, data.M, data.N, data.A, data.LDA, data.x, data.strideX, zeros( data.M ), 1 ); + + t.strictEqual( out, -1, 'returns expected value' ); + t.end(); +}); + +tape( 'the function returns the index of the first row matching a search vector (row-major, accessors)', function test( t ) { + var data; + var out; + + data = ROW_MAJOR_DATA; + out = gindexOfRow( data.order, data.M, data.N, toAccessorArray( data.A ), data.LDA, toAccessorArray( data.x ), data.strideX, toAccessorArray( zeros( data.M ) ), 1 ); + + t.strictEqual( out, data.expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function returns the index of the first row matching a search vector (column-major, accessors)', function test( t ) { + var data; + var out; + + data = COLUMN_MAJOR_DATA; + out = gindexOfRow( data.order, data.M, data.N, toAccessorArray( data.A ), data.LDA, toAccessorArray( data.x ), data.strideX, toAccessorArray( zeros( data.M ) ), 1 ); + + t.strictEqual( out, data.expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function returns an invalid index if unable to find a search vector (row-major, accessors)', function test( t ) { + var data; + var out; + + data = ROW_MAJOR_NO_MATCH; + out = gindexOfRow( data.order, data.M, data.N, toAccessorArray( data.A ), data.LDA, toAccessorArray( data.x ), data.strideX, toAccessorArray( zeros( data.M ) ), 1 ); + + t.strictEqual( out, -1, 'returns expected value' ); + t.end(); +}); + +tape( 'the function returns an invalid index if unable to find a search vector (column-major, accessors)', function test( t ) { + var data; + var out; + + data = COLUMN_MAJOR_NO_MATCH; + out = gindexOfRow( data.order, data.M, data.N, toAccessorArray( data.A ), data.LDA, toAccessorArray( data.x ), data.strideX, toAccessorArray( zeros( data.M ) ), 1 ); t.strictEqual( out, -1, 'returns expected value' ); t.end(); diff --git a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/test.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/test.ndarray.js index cc8d42b21400..54df895b6229 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/test.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/gindex-of-row/test/test.ndarray.js @@ -23,6 +23,8 @@ // MODULES // var tape = require( 'tape' ); +var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' ); +var zeros = require( '@stdlib/array/base/zeros' ); var gindexOfRow = require( './../lib/ndarray.js' ); @@ -58,8 +60,8 @@ tape( 'main export is a function', function test( t ) { t.end(); }); -tape( 'the function has an arity of 9', function test( t ) { - t.strictEqual( gindexOfRow.length, 9, 'returns expected value' ); +tape( 'the function has an arity of 12', function test( t ) { + t.strictEqual( gindexOfRow.length, 12, 'returns expected value' ); t.end(); }); @@ -68,7 +70,7 @@ tape( 'the function returns an invalid index when M is less than or equal to zer var out; data = ROW_MAJOR_DATA; - out = gindexOfRow( data.order, 0, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX ); + out = gindexOfRow( 0, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX, zeros( data.M ), 1, 0 ); t.strictEqual( out, -1, 'returns expected value' ); t.end(); @@ -79,7 +81,7 @@ tape( 'the function returns an invalid index when N is less than or equal to zer var out; data = ROW_MAJOR_DATA; - out = gindexOfRow( data.order, data.M, 0, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX ); + out = gindexOfRow( data.M, 0, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX, zeros( data.M ), 1, 0 ); t.strictEqual( out, -1, 'returns expected value' ); t.end(); @@ -89,8 +91,8 @@ tape( 'the function returns an invalid index when M is less than or equal to zer var data; var out; - data =COLUMN_MAJOR_DATA; - out = gindexOfRow( data.order, 0, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX ); + data = COLUMN_MAJOR_DATA; + out = gindexOfRow( 0, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX, zeros( data.M ), 1, 0 ); t.strictEqual( out, -1, 'returns expected value' ); t.end(); @@ -100,8 +102,8 @@ tape( 'the function returns an invalid index when N is less than or equal to zer var data; var out; - data =COLUMN_MAJOR_DATA; - out = gindexOfRow( data.order, data.M, 0, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX ); + data = COLUMN_MAJOR_DATA; + out = gindexOfRow( data.M, 0, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX, zeros( data.M ), 1, 0 ); t.strictEqual( out, -1, 'returns expected value' ); t.end(); @@ -112,7 +114,7 @@ tape( 'the function returns the index of the first row matching a search vector var out; data = ROW_MAJOR_DATA; - out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX ); + out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX, zeros( data.M ), 1, 0 ); t.strictEqual( out, data.expected, 'returns expected value' ); t.end(); @@ -123,7 +125,7 @@ tape( 'the function returns the index of the first row matching a search vector var out; data = COLUMN_MAJOR_DATA; - out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX ); + out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX, zeros( data.M ), 1, 0 ); t.strictEqual( out, data.expected, 'returns expected value' ); t.end(); @@ -134,7 +136,7 @@ tape( 'the function returns an invalid index if unable to find a search vector ( var out; data = ROW_MAJOR_NO_MATCH; - out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX ); + out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX, zeros( data.M ), 1, 0 ); t.strictEqual( out, data.expected, 'returns expected value' ); t.end(); @@ -145,7 +147,7 @@ tape( 'the function returns an invalid index if unable to find a search vector ( var out; data = COLUMN_MAJOR_NO_MATCH; - out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX ); + out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX, zeros( data.M ), 1, 0 ); t.strictEqual( out, data.expected, 'returns expected value' ); t.end(); @@ -156,7 +158,7 @@ tape( 'the function returns the index of the first row matching a search vector var out; data = OFFSET_ROW_MAJOR_DATA; - out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX ); + out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX, zeros( data.M ), 1, 0 ); t.strictEqual( out, data.expected, 'returns expected value' ); t.end(); @@ -167,7 +169,7 @@ tape( 'the function returns the index of the first row matching a search vector var out; data = OFFSET_COLUMN_MAJOR_DATA; - out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX ); + out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX, zeros( data.M ), 1, 0 ); t.strictEqual( out, data.expected, 'returns expected value' ); t.end(); @@ -178,7 +180,7 @@ tape( 'the function returns an invalid index if unable to find a search vector ( var out; data = OFFSET_ROW_MAJOR_NO_MATCH; - out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX ); + out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX, zeros( data.M ), 1, 0 ); t.strictEqual( out, data.expected, 'returns expected value' ); t.end(); @@ -189,7 +191,7 @@ tape( 'the function returns an invalid index if unable to find a search vector ( var out; data = OFFSET_COLUMN_MAJOR_NO_MATCH; - out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX ); + out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX, zeros( data.M ), 1, 0 ); t.strictEqual( out, data.expected, 'returns expected value' ); t.end(); @@ -200,7 +202,7 @@ tape( 'the function returns the index of the first row matching a search vector var out; data = MIXED_STRIDES_ROW_MAJOR_DATA; - out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX ); + out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX, zeros( data.M ), 1, 0 ); t.strictEqual( out, data.expected, 'returns expected value' ); t.end(); @@ -211,7 +213,7 @@ tape( 'the function returns the index of the first row matching a search vector var out; data = MIXED_STRIDES_COLUMN_MAJOR_DATA; - out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX ); + out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX, zeros( data.M ), 1, 0 ); t.strictEqual( out, data.expected, 'returns expected value' ); t.end(); @@ -222,7 +224,7 @@ tape( 'the function returns an invalid index if unable to find a search vector ( var out; data = MIXED_STRIDES_ROW_MAJOR_NO_MATCH; - out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX ); + out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX, zeros( data.M ), 1, 0 ); t.strictEqual( out, data.expected, 'returns expected value' ); t.end(); @@ -233,7 +235,7 @@ tape( 'the function returns an invalid index if unable to find a search vector ( var out; data = MIXED_STRIDES_COLUMN_MAJOR_NO_MATCH; - out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX ); + out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX, zeros( data.M ), 1, 0 ); t.strictEqual( out, data.expected, 'returns expected value' ); t.end(); @@ -244,7 +246,7 @@ tape( 'the function returns the index of the first row matching a search vector var out; data = NEGATIVE_STRIDES_ROW_MAJOR_DATA; - out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX ); + out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX, zeros( data.M ), 1, 0 ); t.strictEqual( out, data.expected, 'returns expected value' ); t.end(); @@ -255,7 +257,7 @@ tape( 'the function returns the index of the first row matching a search vector var out; data = NEGATIVE_STRIDES_COLUMN_MAJOR_DATA; - out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX ); + out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX, zeros( data.M ), 1, 0 ); t.strictEqual( out, data.expected, 'returns expected value' ); t.end(); @@ -266,7 +268,7 @@ tape( 'the function returns an invalid index if unable to find a search vector ( var out; data = NEGATIVE_STRIDES_ROW_MAJOR_NO_MATCH; - out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX ); + out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX, zeros( data.M ), 1, 0 ); t.strictEqual( out, data.expected, 'returns expected value' ); t.end(); @@ -277,7 +279,7 @@ tape( 'the function returns an invalid index if unable to find a search vector ( var out; data = NEGATIVE_STRIDES_COLUMN_MAJOR_NO_MATCH; - out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX ); + out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX, zeros( data.M ), 1, 0 ); t.strictEqual( out, data.expected, 'returns expected value' ); t.end(); @@ -288,7 +290,7 @@ tape( 'the function returns the index of the first row matching a search vector var out; data = LARGE_STRIDES_ROW_MAJOR_DATA; - out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX ); + out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX, zeros( data.M ), 1, 0 ); t.strictEqual( out, data.expected, 'returns expected value' ); t.end(); @@ -299,7 +301,7 @@ tape( 'the function returns the index of the first row matching a search vector var out; data = LARGE_STRIDES_COLUMN_MAJOR_DATA; - out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX ); + out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX, zeros( data.M ), 1, 0 ); t.strictEqual( out, data.expected, 'returns expected value' ); t.end(); @@ -310,7 +312,7 @@ tape( 'the function returns an invalid index if unable to find a search vector ( var out; data = LARGE_STRIDES_ROW_MAJOR_NO_MATCH; - out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX ); + out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX, zeros( data.M ), 1, 0 ); t.strictEqual( out, data.expected, 'returns expected value' ); t.end(); @@ -321,7 +323,227 @@ tape( 'the function returns an invalid index if unable to find a search vector ( var out; data = LARGE_STRIDES_COLUMN_MAJOR_NO_MATCH; - out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX ); + out = gindexOfRow( data.M, data.N, data.A, data.strideA1, data.strideA2, data.offsetA, data.x, data.strideX, data.offsetX, zeros( data.M ), 1, 0 ); + + t.strictEqual( out, data.expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function returns the index of the first row matching a search vector (row-major, accessors)', function test( t ) { + var data; + var out; + + data = ROW_MAJOR_DATA; + out = gindexOfRow( data.M, data.N, toAccessorArray( data.A ), data.strideA1, data.strideA2, data.offsetA, toAccessorArray( data.x ), data.strideX, data.offsetX, toAccessorArray( zeros( data.M ) ), 1, 0 ); + + t.strictEqual( out, data.expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function returns the index of the first row matching a search vector (column-major, accessors)', function test( t ) { + var data; + var out; + + data = COLUMN_MAJOR_DATA; + out = gindexOfRow( data.M, data.N, toAccessorArray( data.A ), data.strideA1, data.strideA2, data.offsetA, toAccessorArray( data.x ), data.strideX, data.offsetX, toAccessorArray( zeros( data.M ) ), 1, 0 ); + + t.strictEqual( out, data.expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function returns an invalid index if unable to find a search vector (row-major, accessors)', function test( t ) { + var data; + var out; + + data = ROW_MAJOR_NO_MATCH; + out = gindexOfRow( data.M, data.N, toAccessorArray( data.A ), data.strideA1, data.strideA2, data.offsetA, toAccessorArray( data.x ), data.strideX, data.offsetX, toAccessorArray( zeros( data.M ) ), 1, 0 ); + + t.strictEqual( out, data.expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function returns an invalid index if unable to find a search vector (column-major, accessors)', function test( t ) { + var data; + var out; + + data = COLUMN_MAJOR_NO_MATCH; + out = gindexOfRow( data.M, data.N, toAccessorArray( data.A ), data.strideA1, data.strideA2, data.offsetA, toAccessorArray( data.x ), data.strideX, data.offsetX, toAccessorArray( zeros( data.M ) ), 1, 0 ); + + t.strictEqual( out, data.expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function returns the index of the first row matching a search vector (row-major, offsets, accessors)', function test( t ) { + var data; + var out; + + data = OFFSET_ROW_MAJOR_DATA; + out = gindexOfRow( data.M, data.N, toAccessorArray( data.A ), data.strideA1, data.strideA2, data.offsetA, toAccessorArray( data.x ), data.strideX, data.offsetX, toAccessorArray( zeros( data.M ) ), 1, 0 ); + + t.strictEqual( out, data.expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function returns the index of the first row matching a search vector (column-major, offsets, accessors)', function test( t ) { + var data; + var out; + + data = OFFSET_COLUMN_MAJOR_DATA; + out = gindexOfRow( data.M, data.N, toAccessorArray( data.A ), data.strideA1, data.strideA2, data.offsetA, toAccessorArray( data.x ), data.strideX, data.offsetX, toAccessorArray( zeros( data.M ) ), 1, 0 ); + + t.strictEqual( out, data.expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function returns an invalid index if unable to find a search vector (row-major, offsets, accessors)', function test( t ) { + var data; + var out; + + data = OFFSET_ROW_MAJOR_NO_MATCH; + out = gindexOfRow( data.M, data.N, toAccessorArray( data.A ), data.strideA1, data.strideA2, data.offsetA, toAccessorArray( data.x ), data.strideX, data.offsetX, toAccessorArray( zeros( data.M ) ), 1, 0 ); + + t.strictEqual( out, data.expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function returns an invalid index if unable to find a search vector (column-major, offsets, accessors)', function test( t ) { + var data; + var out; + + data = OFFSET_COLUMN_MAJOR_NO_MATCH; + out = gindexOfRow( data.M, data.N, toAccessorArray( data.A ), data.strideA1, data.strideA2, data.offsetA, toAccessorArray( data.x ), data.strideX, data.offsetX, toAccessorArray( zeros( data.M ) ), 1, 0 ); + + t.strictEqual( out, data.expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function returns the index of the first row matching a search vector (row-major, mixed strides, accessors)', function test( t ) { + var data; + var out; + + data = MIXED_STRIDES_ROW_MAJOR_DATA; + out = gindexOfRow( data.M, data.N, toAccessorArray( data.A ), data.strideA1, data.strideA2, data.offsetA, toAccessorArray( data.x ), data.strideX, data.offsetX, toAccessorArray( zeros( data.M ) ), 1, 0 ); + + t.strictEqual( out, data.expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function returns the index of the first row matching a search vector (column-major, mixed strides, accessors)', function test( t ) { + var data; + var out; + + data = MIXED_STRIDES_COLUMN_MAJOR_DATA; + out = gindexOfRow( data.M, data.N, toAccessorArray( data.A ), data.strideA1, data.strideA2, data.offsetA, toAccessorArray( data.x ), data.strideX, data.offsetX, toAccessorArray( zeros( data.M ) ), 1, 0 ); + + t.strictEqual( out, data.expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function returns an invalid index if unable to find a search vector (row-major, mixed strides, accessors)', function test( t ) { + var data; + var out; + + data = MIXED_STRIDES_ROW_MAJOR_NO_MATCH; + out = gindexOfRow( data.M, data.N, toAccessorArray( data.A ), data.strideA1, data.strideA2, data.offsetA, toAccessorArray( data.x ), data.strideX, data.offsetX, toAccessorArray( zeros( data.M ) ), 1, 0 ); + + t.strictEqual( out, data.expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function returns an invalid index if unable to find a search vector (column-major, mixed strides, accessors)', function test( t ) { + var data; + var out; + + data = MIXED_STRIDES_COLUMN_MAJOR_NO_MATCH; + out = gindexOfRow( data.M, data.N, toAccessorArray( data.A ), data.strideA1, data.strideA2, data.offsetA, toAccessorArray( data.x ), data.strideX, data.offsetX, toAccessorArray( zeros( data.M ) ), 1, 0 ); + + t.strictEqual( out, data.expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function returns the index of the first row matching a search vector (row-major, negative strides, accessors)', function test( t ) { + var data; + var out; + + data = NEGATIVE_STRIDES_ROW_MAJOR_DATA; + out = gindexOfRow( data.M, data.N, toAccessorArray( data.A ), data.strideA1, data.strideA2, data.offsetA, toAccessorArray( data.x ), data.strideX, data.offsetX, toAccessorArray( zeros( data.M ) ), 1, 0 ); + + t.strictEqual( out, data.expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function returns the index of the first row matching a search vector (column-major, negative strides, accessors)', function test( t ) { + var data; + var out; + + data = NEGATIVE_STRIDES_COLUMN_MAJOR_DATA; + out = gindexOfRow( data.M, data.N, toAccessorArray( data.A ), data.strideA1, data.strideA2, data.offsetA, toAccessorArray( data.x ), data.strideX, data.offsetX, toAccessorArray( zeros( data.M ) ), 1, 0 ); + + t.strictEqual( out, data.expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function returns an invalid index if unable to find a search vector (row-major, negative strides, accessors)', function test( t ) { + var data; + var out; + + data = NEGATIVE_STRIDES_ROW_MAJOR_NO_MATCH; + out = gindexOfRow( data.M, data.N, toAccessorArray( data.A ), data.strideA1, data.strideA2, data.offsetA, toAccessorArray( data.x ), data.strideX, data.offsetX, toAccessorArray( zeros( data.M ) ), 1, 0 ); + + t.strictEqual( out, data.expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function returns an invalid index if unable to find a search vector (column-major, negative strides, accessors)', function test( t ) { + var data; + var out; + + data = NEGATIVE_STRIDES_COLUMN_MAJOR_NO_MATCH; + out = gindexOfRow( data.M, data.N, toAccessorArray( data.A ), data.strideA1, data.strideA2, data.offsetA, toAccessorArray( data.x ), data.strideX, data.offsetX, toAccessorArray( zeros( data.M ) ), 1, 0 ); + + t.strictEqual( out, data.expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function returns the index of the first row matching a search vector (row-major, large strides, accessors)', function test( t ) { + var data; + var out; + + data = LARGE_STRIDES_ROW_MAJOR_DATA; + out = gindexOfRow( data.M, data.N, toAccessorArray( data.A ), data.strideA1, data.strideA2, data.offsetA, toAccessorArray( data.x ), data.strideX, data.offsetX, toAccessorArray( zeros( data.M ) ), 1, 0 ); + + t.strictEqual( out, data.expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function returns the index of the first row matching a search vector (column-major, large strides, accessors)', function test( t ) { + var data; + var out; + + data = LARGE_STRIDES_COLUMN_MAJOR_DATA; + out = gindexOfRow( data.M, data.N, toAccessorArray( data.A ), data.strideA1, data.strideA2, data.offsetA, toAccessorArray( data.x ), data.strideX, data.offsetX, toAccessorArray( zeros( data.M ) ), 1, 0 ); + + t.strictEqual( out, data.expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function returns an invalid index if unable to find a search vector (row-major, large strides, accessors)', function test( t ) { + var data; + var out; + + data = LARGE_STRIDES_ROW_MAJOR_NO_MATCH; + out = gindexOfRow( data.M, data.N, toAccessorArray( data.A ), data.strideA1, data.strideA2, data.offsetA, toAccessorArray( data.x ), data.strideX, data.offsetX, toAccessorArray( zeros( data.M ) ), 1, 0 ); + + t.strictEqual( out, data.expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function returns an invalid index if unable to find a search vector (column-major, large strides, accessors)', function test( t ) { + var data; + var out; + + data = LARGE_STRIDES_COLUMN_MAJOR_NO_MATCH; + out = gindexOfRow( data.M, data.N, toAccessorArray( data.A ), data.strideA1, data.strideA2, data.offsetA, toAccessorArray( data.x ), data.strideX, data.offsetX, toAccessorArray( zeros( data.M ) ), 1, 0 ); t.strictEqual( out, data.expected, 'returns expected value' ); t.end();