diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/README.md b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/README.md
new file mode 100644
index 000000000000..a38a786e272d
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/README.md
@@ -0,0 +1,372 @@
+
+
+# dcombinations
+
+> Compute combinations of a specified length from double-precision floating-point strided array elements.
+
+
+
+## Usage
+
+```javascript
+var dcombinations = require( '@stdlib/blas/ext/base/dcombinations' );
+```
+
+
+
+#### dcombinations( order, N, k, replacement, x, strideX, out, LDO, workspace, strideW )
+
+
+
+Computes combinations of a specified length from double-precision floating-point strided array elements.
+
+```javascript
+var Float64Array = require( '@stdlib/array/float64' );
+var Int32Array = require( '@stdlib/array/int32' );
+
+var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+var out = new Float64Array( 12 );
+var workspace = new Int32Array( 2 );
+
+dcombinations( 'row-major', x.length, 2, false, x, 1, out, 2, workspace, 1 );
+// out => [ 1.0, 2.0, 1.0, 3.0, 1.0, 4.0, 2.0, 3.0, 2.0, 4.0, 3.0, 4.0 ]
+```
+
+The function has the following parameters:
+
+- **order**: storage layout. Must be either `'row-major'` or `'column-major'`.
+- **N**: number of indexed elements.
+- **k**: number of elements to combine.
+- **replacement**: boolean indicating whether to allow duplication in combination.
+- **x**: input [`Float64Array`][@stdlib/array/float64].
+- **strideX**: stride length for `x`.
+- **out**: output [`Float64Array`][@stdlib/array/float64].
+- **LDO**: stride length between successive contiguous vectors of the matrix `out` (a.k.a., leading dimension of `out`).
+- **workspace**: workspace [`Int32Array`][@stdlib/array/int32]. Must have at least `k` elements.
+- **strideW**: stride length for `workspace`.
+
+The `N`, `k`, and stride parameters determine which elements in the strided arrays are accessed at runtime. For example, to operate on every other element:
+
+```javascript
+var Float64Array = require( '@stdlib/array/float64' );
+var Int32Array = require( '@stdlib/array/int32' );
+
+var x = new Float64Array( [ 1.0, 0.0, 2.0, 0.0, 3.0 ] );
+var out = new Float64Array( 6 );
+var workspace = new Int32Array( 2 );
+
+dcombinations( 'row-major', 3, 2, false, x, 2, out, 2, workspace, 1 );
+// out => [ 1.0, 2.0, 1.0, 3.0, 2.0, 3.0 ]
+```
+
+Note that indexing is relative to the first index. To introduce an offset, use [`typed array`][mdn-typed-array] views.
+
+```javascript
+var Float64Array = require( '@stdlib/array/float64' );
+var Int32Array = require( '@stdlib/array/int32' );
+
+// Initial array:
+var x0 = new Float64Array( [ 0.0, 1.0, 2.0, 3.0 ] );
+
+// Create an offset view:
+var x1 = new Float64Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); // start at 2nd element
+
+var out = new Float64Array( 6 );
+var workspace = new Int32Array( 2 );
+
+dcombinations( 'row-major', 3, 2, false, x1, 1, out, 2, workspace, 1 );
+// out => [ 1.0, 2.0, 1.0, 3.0, 2.0, 3.0 ]
+```
+
+
+
+#### dcombinations.ndarray( N, k, replacement, x, strideX, offsetX, out, strideOut1, strideOut2, offsetOut, workspace, strideW, offsetW )
+
+
+
+Computes combinations of a specified length from double-precision floating-point strided array elements using alternative indexing semantics.
+
+
+
+```javascript
+var Float64Array = require( '@stdlib/array/float64' );
+var Int32Array = require( '@stdlib/array/int32' );
+
+var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+var out = new Float64Array( 12 );
+var workspace = new Int32Array( 2 );
+
+dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 );
+// out => [ 1.0, 2.0, 1.0, 3.0, 1.0, 4.0, 2.0, 3.0, 2.0, 4.0, 3.0, 4.0 ]
+```
+
+The function has the following additional parameters:
+
+- **offsetX**: starting index for `x`.
+- **strideOut1**: stride length for the first dimension of `out`.
+- **strideOut2**: stride length for the second dimension of `out`.
+- **offsetOut**: starting index for `out`.
+- **workspace**: workspace [`Int32Array`][@stdlib/array/int32]. Must have at least `k` elements.
+- **strideW**: stride length for `workspace`.
+- **offsetW**: starting index for `workspace`.
+
+While [`typed array`][mdn-typed-array] views mandate a view offset based on the underlying buffer, the offset parameters support indexing semantics based on a starting index. For example, to access only the last three elements:
+
+```javascript
+var Float64Array = require( '@stdlib/array/float64' );
+var Int32Array = require( '@stdlib/array/int32' );
+
+var x = new Float64Array( [ 0.0, 0.0, 1.0, 2.0, 3.0 ] );
+var out = new Float64Array( 6 );
+var workspace = new Int32Array( 2 );
+
+dcombinations.ndarray( 3, 2, false, x, 1, 2, out, 2, 1, 0, workspace, 1, 0 );
+// out => [ 1.0, 2.0, 1.0, 3.0, 2.0, 3.0 ]
+```
+
+
+
+
+
+
+
+## Notes
+
+- If `N <= 0` or `k <= 0`, both functions return `out` unchanged.
+- If `replacement` is `false` and `k > N`, both functions return `out` unchanged.
+- For an input array `x` of length `N`, the output array `out` must contain at least `C(N, k) * k` elements if `replacement` is `false`, or `C(N+k-1, k) * k` elements if `replacement` is `true`.
+- For row-major order, the `LDO` parameter must be greater than or equal to `k`. For column-major order, the `LDO` parameter must be greater than or equal to `max(1,C(N,k))` if `replacement` is `false`, or `max(1,C(N+k-1,k))` if `replacement` is `true`.
+
+
+
+
+
+
+
+## Examples
+
+
+
+```javascript
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var Float64Array = require( '@stdlib/array/float64' );
+var Int32Array = require( '@stdlib/array/int32' );
+var dcombinations = require( '@stdlib/blas/ext/base/dcombinations' );
+
+var N = 5;
+var k = 2;
+var x = discreteUniform( N, 1, 10, {
+ 'dtype': 'float64'
+});
+console.log( x );
+
+var out = new Float64Array( 20 );
+
+var workspace = new Int32Array( k );
+
+dcombinations( 'row-major', N, k, false, x, 1, out, 2, workspace, 1 );
+console.log( out );
+```
+
+
+
+
+
+
+
+* * *
+
+
+
+## C APIs
+
+
+
+
+
+
+
+
+
+
+
+### Usage
+
+```c
+#include "stdlib/blas/ext/base/dcombinations.h"
+```
+
+
+
+#### stdlib_strided_dcombinations( order, N, k, replacement, \*X, strideX, \*Out, LDO, \*Workspace, strideW )
+
+
+
+Computes combinations of a specified length from double-precision floating-point strided array elements.
+
+```c
+#include "stdlib/blas/base/shared.h"
+
+const double x[] = { 1.0, 2.0, 3.0, 4.0 };
+double out[] = { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 };
+int32_t workspace[] = { 0, 0 };
+
+stdlib_strided_dcombinations( CblasRowMajor, 4, 2, false, x, 1, out, 2, workspace, 1 );
+```
+
+The function accepts the following arguments:
+
+- **order**: `[in] CBLAS_LAYOUT` storage layout.
+- **N**: `[in] CBLAS_INT` number of indexed elements.
+- **k**: `[in] CBLAS_INT` number of elements to combine.
+- **replacement**: `[in] bool` boolean indicating whether to allow duplication in combination.
+- **X**: `[in] double*` input array.
+- **strideX**: `[in] CBLAS_INT` stride length for `X`.
+- **Out**: `[out] double*` output array.
+- **LDO**: `[in] CBLAS_INT` stride length between successive contiguous vectors of the matrix `Out` (a.k.a., leading dimension of `Out`). For row-major order, must be greater than or equal to `k`. For column-major order, must be greater than or equal to `max(1,C(N,k))` if `replacement` is `false`, or `max(1,C(N+k-1,k))` if `replacement` is `true`.
+- **Workspace**: `[out] int32_t*` workspace array. Must have at least `k` elements.
+- **strideW**: `[in] CBLAS_INT` stride length for `Workspace`.
+
+```c
+void stdlib_strided_dcombinations( const CBLAS_LAYOUT order, const CBLAS_INT N, const CBLAS_INT k, const bool replacement, const double *X, const CBLAS_INT strideX, double *Out, const CBLAS_INT LDO, int32_t *Workspace, const CBLAS_INT strideW );
+```
+
+
+
+#### stdlib_strided_dcombinations_ndarray( N, k, replacement, \*X, strideX, offsetX, \*Out, strideOut1, strideOut2, offsetOut, \*Workspace, strideW, offsetW )
+
+
+
+Computes combinations of a specified length from double-precision floating-point strided array elements using alternative indexing semantics.
+
+```c
+const double x[] = { 1.0, 2.0, 3.0, 4.0 };
+double out[] = { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 };
+int32_t workspace[] = { 0, 0 };
+
+stdlib_strided_dcombinations_ndarray( 4, 2, false, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 );
+```
+
+The function accepts the following arguments:
+
+- **N**: `[in] CBLAS_INT` number of indexed elements.
+- **k**: `[in] CBLAS_INT` number of elements to combine.
+- **replacement**: `[in] bool` boolean indicating whether to allow duplication in combination.
+- **X**: `[in] double*` input array.
+- **strideX**: `[in] CBLAS_INT` stride length for `X`.
+- **offsetX**: `[in] CBLAS_INT` starting index for `X`.
+- **Out**: `[out] double*` output array.
+- **strideOut1**: `[in] CBLAS_INT` stride length for the first dimension of `Out`.
+- **strideOut2**: `[in] CBLAS_INT` stride length for the second dimension of `Out`.
+- **offsetOut**: `[in] CBLAS_INT` starting index for `Out`.
+- **Workspace**: `[out] int32_t*` workspace array. Must have at least `k` elements.
+- **strideW**: `[in] CBLAS_INT` stride length for `Workspace`.
+- **offsetW**: `[in] CBLAS_INT` starting index for `Workspace`.
+
+```c
+void stdlib_strided_dcombinations_ndarray( const CBLAS_INT N, const CBLAS_INT k, const bool replacement, const double *X, const CBLAS_INT strideX, const CBLAS_INT offsetX, double *Out, const CBLAS_INT strideOut1, const CBLAS_INT strideOut2, const CBLAS_INT offsetOut, int32_t *Workspace, const CBLAS_INT strideW, const CBLAS_INT offsetW );
+```
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+### Examples
+
+```c
+#include "stdlib/blas/ext/base/dcombinations.h"
+#include "stdlib/blas/base/shared.h"
+#include
+#include
+#include
+
+int main( void ) {
+ // Create a strided array:
+ const double x[] = { 1.0, 2.0, 3.0, 4.0 };
+
+ // Create an output array:
+ double out[] = { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 };
+
+ // Create a workspace array:
+ int32_t workspace[] = { 0, 0 };
+
+ // Specify strides:
+ const int strideX = 1;
+ const int strideW = 1;
+ const int LDO = 2;
+
+ // Compute combinations:
+ stdlib_strided_dcombinations( CblasRowMajor, 4, 2, false, x, strideX, out, LDO, workspace, strideW );
+
+ // Print each combination:
+ for ( int i = 0; i < 6; i++ ) {
+ printf( " [ %lf, %lf ]\n", out[ i*2 ], out[ (i*2)+1 ] );
+ }
+}
+```
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+[@stdlib/array/float64]: https://github.com/stdlib-js/stdlib/tree/develop/lib/node_modules/%40stdlib/array/float64
+
+[@stdlib/array/int32]: https://github.com/stdlib-js/stdlib/tree/develop/lib/node_modules/%40stdlib/array/int32
+
+[mdn-typed-array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray
+
+
+
+
+
+
+
+
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/benchmark/benchmark.js b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/benchmark/benchmark.js
new file mode 100644
index 000000000000..786bb080442c
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/benchmark/benchmark.js
@@ -0,0 +1,113 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2026 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 bench = require( '@stdlib/bench' );
+var uniform = require( '@stdlib/random/array/uniform' );
+var isnan = require( '@stdlib/math/base/assert/is-nan' );
+var pow = require( '@stdlib/math/base/special/pow' );
+var Float64Array = require( '@stdlib/array/float64' );
+var Int32Array = require( '@stdlib/array/int32' );
+var format = require( '@stdlib/string/format' );
+var pkg = require( './../package.json' ).name;
+var dcombinations = require( './../lib/dcombinations.js' );
+
+
+// VARIABLES //
+
+var options = {
+ 'dtype': 'float64'
+};
+
+
+// FUNCTIONS //
+
+/**
+* Create a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - array length
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len ) {
+ var out;
+ var x;
+ var C;
+ var w;
+
+ x = uniform( len, -10.0, 10.0, options );
+ C = ( len * ( len - 1 ) ) / 2; // C(len, 2) for k=2 without replacement
+ out = new Float64Array( C * 2 );
+ w = new Int32Array( 2 );
+ return benchmark;
+
+ /**
+ * Benchmark function.
+ *
+ * @private
+ * @param {Benchmark} b - benchmark instance
+ */
+ function benchmark( b ) {
+ var z;
+ var i;
+
+ b.tic();
+ for ( i = 0; i < b.iterations; i++ ) {
+ z = dcombinations( 'row-major', x.length, 2, false, x, 1, out, 2, w, 1 );
+ if ( isnan( z[ 0 ] ) ) {
+ b.fail( 'should not return NaN' );
+ }
+ }
+ b.toc();
+ if ( isnan( z[ 0 ] ) ) {
+ b.fail( 'should not return NaN' );
+ }
+ b.pass( 'benchmark finished' );
+ b.end();
+ }
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+ var len;
+ var min;
+ var max;
+ var f;
+ var i;
+
+ min = 1; // 10^min
+ max = 3; // 10^max
+
+ for ( i = min; i <= max; i++ ) {
+ len = pow( 10, i );
+ f = createBenchmark( len );
+ bench( format( '%s:len=%d', pkg, len ), f );
+ }
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/benchmark/benchmark.native.js b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/benchmark/benchmark.native.js
new file mode 100644
index 000000000000..80b990919e47
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/benchmark/benchmark.native.js
@@ -0,0 +1,118 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2026 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 resolve = require( 'path' ).resolve;
+var bench = require( '@stdlib/bench' );
+var uniform = require( '@stdlib/random/array/uniform' );
+var isnan = require( '@stdlib/math/base/assert/is-nan' );
+var pow = require( '@stdlib/math/base/special/pow' );
+var Float64Array = require( '@stdlib/array/float64' );
+var Int32Array = require( '@stdlib/array/int32' );
+var tryRequire = require( '@stdlib/utils/try-require' );
+var format = require( '@stdlib/string/format' );
+var pkg = require( './../package.json' ).name;
+
+
+// VARIABLES //
+
+var dcombinations = tryRequire( resolve( __dirname, './../lib/dcombinations.native.js' ) );
+var opts = {
+ 'skip': ( dcombinations instanceof Error )
+};
+var options = {
+ 'dtype': 'float64'
+};
+
+
+// FUNCTIONS //
+
+/**
+* Create a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - array length
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len ) {
+ var out;
+ var x;
+ var C;
+ var w;
+
+ x = uniform( len, -10.0, 10.0, options );
+ C = ( len * ( len - 1 ) ) / 2; // C(len, 2) for k=2 without replacement
+ out = new Float64Array( C * 2 );
+ w = new Int32Array( 2 );
+ return benchmark;
+
+ /**
+ * Benchmark function.
+ *
+ * @private
+ * @param {Benchmark} b - benchmark instance
+ */
+ function benchmark( b ) {
+ var z;
+ var i;
+
+ b.tic();
+ for ( i = 0; i < b.iterations; i++ ) {
+ z = dcombinations( 'row-major', x.length, 2, false, x, 1, out, 2, w, 1 );
+ if ( isnan( z[ 0 ] ) ) {
+ b.fail( 'should not return NaN' );
+ }
+ }
+ b.toc();
+ if ( isnan( z[ 0 ] ) ) {
+ b.fail( 'should not return NaN' );
+ }
+ b.pass( 'benchmark finished' );
+ b.end();
+ }
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+ var len;
+ var min;
+ var max;
+ var f;
+ var i;
+
+ min = 1; // 10^min
+ max = 3; // 10^max
+
+ for ( i = min; i <= max; i++ ) {
+ len = pow( 10, i );
+ f = createBenchmark( len );
+ bench( format( '%s::native:len=%d', pkg, len ), opts, f );
+ }
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/benchmark/benchmark.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/benchmark/benchmark.ndarray.js
new file mode 100644
index 000000000000..6f26b8792f5e
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/benchmark/benchmark.ndarray.js
@@ -0,0 +1,113 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2026 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 bench = require( '@stdlib/bench' );
+var uniform = require( '@stdlib/random/array/uniform' );
+var isnan = require( '@stdlib/math/base/assert/is-nan' );
+var pow = require( '@stdlib/math/base/special/pow' );
+var Float64Array = require( '@stdlib/array/float64' );
+var Int32Array = require( '@stdlib/array/int32' );
+var format = require( '@stdlib/string/format' );
+var pkg = require( './../package.json' ).name;
+var dcombinations = require( './../lib/ndarray.js' );
+
+
+// VARIABLES //
+
+var options = {
+ 'dtype': 'float64'
+};
+
+
+// FUNCTIONS //
+
+/**
+* Create a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - array length
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len ) {
+ var out;
+ var x;
+ var C;
+ var w;
+
+ x = uniform( len, -10.0, 10.0, options );
+ C = ( len * ( len - 1 ) ) / 2; // C(len, 2) for k=2 without replacement
+ out = new Float64Array( C * 2 );
+ w = new Int32Array( 2 );
+ return benchmark;
+
+ /**
+ * Benchmark function.
+ *
+ * @private
+ * @param {Benchmark} b - benchmark instance
+ */
+ function benchmark( b ) {
+ var z;
+ var i;
+
+ b.tic();
+ for ( i = 0; i < b.iterations; i++ ) {
+ z = dcombinations( x.length, 2, false, x, 1, 0, out, 2, 1, 0, w, 1, 0 ); // eslint-disable-line max-len
+ if ( isnan( z[ 0 ] ) ) {
+ b.fail( 'should not return NaN' );
+ }
+ }
+ b.toc();
+ if ( isnan( z[ 0 ] ) ) {
+ b.fail( 'should not return NaN' );
+ }
+ b.pass( 'benchmark finished' );
+ b.end();
+ }
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+ var len;
+ var min;
+ var max;
+ var f;
+ var i;
+
+ min = 1; // 10^min
+ max = 3; // 10^max
+
+ for ( i = min; i <= max; i++ ) {
+ len = pow( 10, i );
+ f = createBenchmark( len );
+ bench( format( '%s:ndarray:len=%d', pkg, len ), f );
+ }
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/benchmark/benchmark.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/benchmark/benchmark.ndarray.native.js
new file mode 100644
index 000000000000..1b54a949a7fe
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/benchmark/benchmark.ndarray.native.js
@@ -0,0 +1,118 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2026 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 resolve = require( 'path' ).resolve;
+var bench = require( '@stdlib/bench' );
+var uniform = require( '@stdlib/random/array/uniform' );
+var isnan = require( '@stdlib/math/base/assert/is-nan' );
+var pow = require( '@stdlib/math/base/special/pow' );
+var Float64Array = require( '@stdlib/array/float64' );
+var Int32Array = require( '@stdlib/array/int32' );
+var tryRequire = require( '@stdlib/utils/try-require' );
+var format = require( '@stdlib/string/format' );
+var pkg = require( './../package.json' ).name;
+
+
+// VARIABLES //
+
+var dcombinations = tryRequire( resolve( __dirname, './../lib/ndarray.native.js' ) );
+var opts = {
+ 'skip': ( dcombinations instanceof Error )
+};
+var options = {
+ 'dtype': 'float64'
+};
+
+
+// FUNCTIONS //
+
+/**
+* Create a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - array length
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len ) {
+ var out;
+ var x;
+ var C;
+ var w;
+
+ x = uniform( len, -10.0, 10.0, options );
+ C = ( len * ( len - 1 ) ) / 2; // C(len, 2) for k=2 without replacement
+ out = new Float64Array( C * 2 );
+ w = new Int32Array( 2 );
+ return benchmark;
+
+ /**
+ * Benchmark function.
+ *
+ * @private
+ * @param {Benchmark} b - benchmark instance
+ */
+ function benchmark( b ) {
+ var z;
+ var i;
+
+ b.tic();
+ for ( i = 0; i < b.iterations; i++ ) {
+ z = dcombinations( x.length, 2, false, x, 1, 0, out, 2, 1, 0, w, 1, 0 ); // eslint-disable-line max-len
+ if ( isnan( z[ 0 ] ) ) {
+ b.fail( 'should not return NaN' );
+ }
+ }
+ b.toc();
+ if ( isnan( z[ 0 ] ) ) {
+ b.fail( 'should not return NaN' );
+ }
+ b.pass( 'benchmark finished' );
+ b.end();
+ }
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+ var len;
+ var min;
+ var max;
+ var f;
+ var i;
+
+ min = 1; // 10^min
+ max = 3; // 10^max
+
+ for ( i = min; i <= max; i++ ) {
+ len = pow( 10, i );
+ f = createBenchmark( len );
+ bench( format( '%s::native:ndarray:len=%d', pkg, len ), opts, f );
+ }
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/benchmark/c/Makefile b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/benchmark/c/Makefile
new file mode 100644
index 000000000000..0756dc7da20a
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/benchmark/c/Makefile
@@ -0,0 +1,146 @@
+#/
+# @license Apache-2.0
+#
+# Copyright (c) 2026 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.
+#/
+
+# VARIABLES #
+
+ifndef VERBOSE
+ QUIET := @
+else
+ QUIET :=
+endif
+
+# Determine the OS ([1][1], [2][2]).
+#
+# [1]: https://en.wikipedia.org/wiki/Uname#Examples
+# [2]: http://stackoverflow.com/a/27776822/2225624
+OS ?= $(shell uname)
+ifneq (, $(findstring MINGW,$(OS)))
+ OS := WINNT
+else
+ifneq (, $(findstring MSYS,$(OS)))
+ OS := WINNT
+else
+ifneq (, $(findstring CYGWIN,$(OS)))
+ OS := WINNT
+else
+ifneq (, $(findstring Windows_NT,$(OS)))
+ OS := WINNT
+endif
+endif
+endif
+endif
+
+# Define the program used for compiling C source files:
+ifdef C_COMPILER
+ CC := $(C_COMPILER)
+else
+ CC := gcc
+endif
+
+# Define the command-line options when compiling C files:
+CFLAGS ?= \
+ -std=c99 \
+ -O3 \
+ -Wall \
+ -pedantic
+
+# Determine whether to generate position independent code ([1][1], [2][2]).
+#
+# [1]: https://gcc.gnu.org/onlinedocs/gcc/Code-Gen-Options.html#Code-Gen-Options
+# [2]: http://stackoverflow.com/questions/5311515/gcc-fpic-option
+ifeq ($(OS), WINNT)
+ fPIC ?=
+else
+ fPIC ?= -fPIC
+endif
+
+# List of includes (e.g., `-I /foo/bar -I /beep/boop/include`):
+INCLUDE ?=
+
+# List of source files:
+SOURCE_FILES ?=
+
+# List of libraries (e.g., `-lopenblas -lpthread`):
+LIBRARIES ?=
+
+# List of library paths (e.g., `-L /foo/bar -L /beep/boop`):
+LIBPATH ?=
+
+# List of C targets:
+c_targets := benchmark.length.out
+
+
+# RULES #
+
+#/
+# Compiles source files.
+#
+# @param {string} [C_COMPILER] - C compiler (e.g., `gcc`)
+# @param {string} [CFLAGS] - C compiler options
+# @param {(string|void)} [fPIC] - compiler flag determining whether to generate position independent code (e.g., `-fPIC`)
+# @param {string} [INCLUDE] - list of includes (e.g., `-I /foo/bar -I /beep/boop/include`)
+# @param {string} [SOURCE_FILES] - list of source files
+# @param {string} [LIBPATH] - list of library paths (e.g., `-L /foo/bar -L /beep/boop`)
+# @param {string} [LIBRARIES] - list of libraries (e.g., `-lopenblas -lpthread`)
+#
+# @example
+# make
+#
+# @example
+# make all
+#/
+all: $(c_targets)
+
+.PHONY: all
+
+#/
+# Compiles C source files.
+#
+# @private
+# @param {string} CC - C compiler (e.g., `gcc`)
+# @param {string} CFLAGS - C compiler options
+# @param {(string|void)} fPIC - compiler flag determining whether to generate position independent code (e.g., `-fPIC`)
+# @param {string} INCLUDE - list of includes (e.g., `-I /foo/bar`)
+# @param {string} SOURCE_FILES - list of source files
+# @param {string} LIBPATH - list of library paths (e.g., `-L /foo/bar`)
+# @param {string} LIBRARIES - list of libraries (e.g., `-lopenblas`)
+#/
+$(c_targets): %.out: %.c
+ $(QUIET) $(CC) $(CFLAGS) $(fPIC) $(INCLUDE) -o $@ $(SOURCE_FILES) $< $(LIBPATH) -lm $(LIBRARIES)
+
+#/
+# Runs compiled benchmarks.
+#
+# @example
+# make run
+#/
+run: $(c_targets)
+ $(QUIET) ./$<
+
+.PHONY: run
+
+#/
+# Removes generated files.
+#
+# @example
+# make clean
+#/
+clean:
+ $(QUIET) -rm -f *.o *.out
+
+.PHONY: clean
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/benchmark/c/benchmark.length.c
new file mode 100644
index 000000000000..30183af14646
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/benchmark/c/benchmark.length.c
@@ -0,0 +1,210 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2026 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.
+*/
+
+#include "stdlib/blas/ext/base/dcombinations.h"
+#include "stdlib/blas/base/shared.h"
+#include
+#include
+#include
+#include
+#include
+#include
+#include
+
+#define NAME "dcombinations"
+#define ITERATIONS 1000000
+#define REPEATS 3
+#define MIN 1
+#define MAX 3
+
+/**
+* Prints the TAP version.
+*/
+static void print_version( void ) {
+ printf( "TAP version 13\n" );
+}
+
+/**
+* Prints the TAP summary.
+*
+* @param total total number of tests
+* @param passing total number of passing tests
+*/
+static void print_summary( int total, int passing ) {
+ printf( "#\n" );
+ printf( "1..%d\n", total ); // TAP plan
+ printf( "# total %d\n", total );
+ printf( "# pass %d\n", passing );
+ printf( "#\n" );
+ printf( "# ok\n" );
+}
+
+/**
+* Prints benchmarks results.
+*
+* @param iterations number of iterations
+* @param elapsed elapsed time in seconds
+*/
+static void print_results( int iterations, double elapsed ) {
+ double rate = (double)iterations / elapsed;
+ printf( " ---\n" );
+ printf( " iterations: %d\n", iterations );
+ printf( " elapsed: %0.9f\n", elapsed );
+ printf( " rate: %0.9f\n", rate );
+ printf( " ...\n" );
+}
+
+/**
+* Returns a clock time.
+*
+* @return clock time
+*/
+static double tic( void ) {
+ struct timeval now;
+ gettimeofday( &now, NULL );
+ return (double)now.tv_sec + (double)now.tv_usec/1.0e6;
+}
+
+/**
+* Generates a random number on the interval [0,1).
+*
+* @return random number
+*/
+static double rand_double( void ) {
+ int r = rand();
+ return (double)r / ( (double)RAND_MAX + 1.0 );
+}
+
+/**
+* Runs a benchmark.
+*
+* @param iterations number of iterations
+* @param len array length
+* @return elapsed time in seconds
+*/
+static double benchmark1( int iterations, int len ) {
+ double elapsed;
+ double *out;
+ double *x;
+ int32_t *w;
+ double t;
+ int C;
+ int i;
+
+ x = (double *) malloc( len * sizeof( double ) );
+ C = ( len * ( len - 1 ) ) / 2;
+ out = (double *) malloc( C * 2 * sizeof( double ) );
+ w = (int32_t *) malloc( 2 * sizeof( int32_t ) );
+ for ( i = 0; i < len; i++ ) {
+ x[ i ] = ( rand_double()*200.0 ) - 100.0;
+ }
+ t = tic();
+ for ( i = 0; i < iterations; i++ ) {
+ stdlib_strided_dcombinations( CblasRowMajor, len, 2, false, x, 1, out, 2, w, 1 );
+ if ( out[ 0 ] != out[ 0 ] ) {
+ printf( "should not return NaN\n" );
+ break;
+ }
+ }
+ elapsed = tic() - t;
+ if ( out[ 0 ] != out[ 0 ] ) {
+ printf( "should not return NaN\n" );
+ }
+ free( x );
+ free( out );
+ free( w );
+ return elapsed;
+}
+
+/**
+* Runs a benchmark.
+*
+* @param iterations number of iterations
+* @param len array length
+* @return elapsed time in seconds
+*/
+static double benchmark2( int iterations, int len ) {
+ double elapsed;
+ double *out;
+ double *x;
+ int32_t *w;
+ double t;
+ int C;
+ int i;
+
+ x = (double *) malloc( len * sizeof( double ) );
+ C = ( len * ( len - 1 ) ) / 2;
+ out = (double *) malloc( C * 2 * sizeof( double ) );
+ w = (int32_t *) malloc( 2 * sizeof( int32_t ) );
+ for ( i = 0; i < len; i++ ) {
+ x[ i ] = ( rand_double()*200.0 ) - 100.0;
+ }
+ t = tic();
+ for ( i = 0; i < iterations; i++ ) {
+ stdlib_strided_dcombinations_ndarray( len, 2, false, x, 1, 0, out, 2, 1, 0, w, 1, 0 );
+ if ( out[ 0 ] != out[ 0 ] ) {
+ printf( "should not return NaN\n" );
+ break;
+ }
+ }
+ elapsed = tic() - t;
+ if ( out[ 0 ] != out[ 0 ] ) {
+ printf( "should not return NaN\n" );
+ }
+ free( x );
+ free( out );
+ free( w );
+ return elapsed;
+}
+
+/**
+* Main execution sequence.
+*/
+int main( void ) {
+ double elapsed;
+ int count;
+ int iter;
+ int len;
+ int i;
+ int j;
+
+ // Use the current time to seed the random number generator:
+ srand( time( NULL ) );
+
+ print_version();
+ count = 0;
+ for ( i = MIN; i <= MAX; i++ ) {
+ len = (int) pow( 10, i );
+ iter = ITERATIONS / (int) pow( 10, i-1 );
+ for ( j = 0; j < REPEATS; j++ ) {
+ count += 1;
+ printf( "# c::native::%s:len=%d\n", NAME, len );
+ elapsed = benchmark1( iter, len );
+ print_results( iter, elapsed );
+ printf( "ok %d benchmark finished\n", count );
+ }
+ for ( j = 0; j < REPEATS; j++ ) {
+ count += 1;
+ printf( "# c::native::%s:ndarray:len=%d\n", NAME, len );
+ elapsed = benchmark2( iter, len );
+ print_results( iter, elapsed );
+ printf( "ok %d benchmark finished\n", count );
+ }
+ }
+ print_summary( count, count );
+}
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/binding.gyp b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/binding.gyp
new file mode 100644
index 000000000000..60dce9d0b31a
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/binding.gyp
@@ -0,0 +1,265 @@
+# @license Apache-2.0
+#
+# Copyright (c) 2026 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.
+
+# A `.gyp` file for building a Node.js native add-on.
+#
+# [1]: https://gyp.gsrc.io/docs/InputFormatReference.md
+# [2]: https://gyp.gsrc.io/docs/UserDocumentation.md
+{
+ # List of files to include in this file:
+ 'includes': [
+ './include.gypi',
+ ],
+
+ # Define variables to be used throughout the configuration for all targets:
+ 'variables': {
+ # Target name should match the add-on export name:
+ 'addon_target_name%': 'addon',
+
+ # Fortran compiler (to override -Dfortran_compiler=):
+ 'fortran_compiler%': 'gfortran',
+
+ # Fortran compiler flags:
+ 'fflags': [
+ # Specify the Fortran standard to which a program is expected to conform:
+ '-std=f95',
+
+ # Indicate that the layout is free-form source code:
+ '-ffree-form',
+
+ # Aggressive optimization:
+ '-O3',
+
+ # Enable commonly used warning options:
+ '-Wall',
+
+ # Warn if source code contains problematic language features:
+ '-Wextra',
+
+ # Warn if a procedure is called without an explicit interface:
+ '-Wimplicit-interface',
+
+ # Do not transform names of entities specified in Fortran source files by appending underscores (i.e., don't mangle names, thus allowing easier usage in C wrappers):
+ '-fno-underscoring',
+
+ # Warn if source code contains Fortran 95 extensions and C-language constructs:
+ '-pedantic',
+
+ # Compile but do not link (output is an object file):
+ '-c',
+ ],
+
+ # Set variables based on the host OS:
+ 'conditions': [
+ [
+ 'OS=="win"',
+ {
+ # Define the object file suffix:
+ 'obj': 'obj',
+ },
+ {
+ # Define the object file suffix:
+ 'obj': 'o',
+ }
+ ], # end condition (OS=="win")
+ ], # end conditions
+ }, # end variables
+
+ # Define compile targets:
+ 'targets': [
+
+ # Target to generate an add-on:
+ {
+ # The target name should match the add-on export name:
+ 'target_name': '<(addon_target_name)',
+
+ # Define dependencies:
+ 'dependencies': [],
+
+ # Define directories which contain relevant include headers:
+ 'include_dirs': [
+ # Local include directory:
+ '<@(include_dirs)',
+ ],
+
+ # List of source files:
+ 'sources': [
+ '<@(src_files)',
+ ],
+
+ # Settings which should be applied when a target's object files are used as linker input:
+ 'link_settings': {
+ # Define libraries:
+ 'libraries': [
+ '<@(libraries)',
+ ],
+
+ # Define library directories:
+ 'library_dirs': [
+ '<@(library_dirs)',
+ ],
+ },
+
+ # C/C++ compiler flags:
+ 'cflags': [
+ # Enable commonly used warning options:
+ '-Wall',
+
+ # Aggressive optimization:
+ '-O3',
+ ],
+
+ # C specific compiler flags:
+ 'cflags_c': [
+ # Specify the C standard to which a program is expected to conform:
+ '-std=c99',
+ ],
+
+ # C++ specific compiler flags:
+ 'cflags_cpp': [
+ # Specify the C++ standard to which a program is expected to conform:
+ '-std=c++11',
+ ],
+
+ # Linker flags:
+ 'ldflags': [],
+
+ # Apply conditions based on the host OS:
+ 'conditions': [
+ [
+ 'OS=="mac"',
+ {
+ # Linker flags:
+ 'ldflags': [
+ '-undefined dynamic_lookup',
+ '-Wl,-no-pie',
+ '-Wl,-search_paths_first',
+ ],
+ },
+ ], # end condition (OS=="mac")
+ [
+ 'OS!="win"',
+ {
+ # C/C++ flags:
+ 'cflags': [
+ # Generate platform-independent code:
+ '-fPIC',
+ ],
+ },
+ ], # end condition (OS!="win")
+ ], # end conditions
+
+ # Define custom build actions for particular inputs:
+ 'rules': [
+ {
+ # Define a rule for processing Fortran files:
+ 'extension': 'f',
+
+ # Define the pathnames to be used as inputs when performing processing:
+ 'inputs': [
+ # Full path of the current input:
+ '<(RULE_INPUT_PATH)'
+ ],
+
+ # Define the outputs produced during processing:
+ 'outputs': [
+ # Store an output object file in a directory for placing intermediate results (only accessible within a single target):
+ '<(INTERMEDIATE_DIR)/<(RULE_INPUT_ROOT).<(obj)'
+ ],
+
+ # Define the rule for compiling Fortran based on the host OS:
+ 'conditions': [
+ [
+ 'OS=="win"',
+
+ # Rule to compile Fortran on Windows:
+ {
+ 'rule_name': 'compile_fortran_windows',
+ 'message': 'Compiling Fortran file <(RULE_INPUT_PATH) on Windows...',
+
+ 'process_outputs_as_sources': 0,
+
+ # Define the command-line invocation:
+ 'action': [
+ '<(fortran_compiler)',
+ '<@(fflags)',
+ '<@(_inputs)',
+ '-o',
+ '<@(_outputs)',
+ ],
+ },
+
+ # Rule to compile Fortran on non-Windows:
+ {
+ 'rule_name': 'compile_fortran_linux',
+ 'message': 'Compiling Fortran file <(RULE_INPUT_PATH) on Linux...',
+
+ 'process_outputs_as_sources': 1,
+
+ # Define the command-line invocation:
+ 'action': [
+ '<(fortran_compiler)',
+ '<@(fflags)',
+ '-fPIC', # generate platform-independent code
+ '<@(_inputs)',
+ '-o',
+ '<@(_outputs)',
+ ],
+ }
+ ], # end condition (OS=="win")
+ ], # end conditions
+ }, # end rule (extension=="f")
+ ], # end rules
+ }, # end target <(addon_target_name)
+
+ # Target to copy a generated add-on to a standard location:
+ {
+ 'target_name': 'copy_addon',
+
+ # Declare that the output of this target is not linked:
+ 'type': 'none',
+
+ # Define dependencies:
+ 'dependencies': [
+ # Require that the add-on be generated before building this target:
+ '<(addon_target_name)',
+ ],
+
+ # Define a list of actions:
+ 'actions': [
+ {
+ 'action_name': 'copy_addon',
+ 'message': 'Copying addon...',
+
+ # Explicitly list the inputs in the command-line invocation below:
+ 'inputs': [],
+
+ # Declare the expected outputs:
+ 'outputs': [
+ '<(addon_output_dir)/<(addon_target_name).node',
+ ],
+
+ # Define the command-line invocation:
+ 'action': [
+ 'cp',
+ '<(PRODUCT_DIR)/<(addon_target_name).node',
+ '<(addon_output_dir)/<(addon_target_name).node',
+ ],
+ },
+ ], # end actions
+ }, # end target copy_addon
+ ], # end targets
+}
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/docs/repl.txt b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/docs/repl.txt
new file mode 100644
index 000000000000..72d0731137ab
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/docs/repl.txt
@@ -0,0 +1,133 @@
+
+{{alias}}( order, N, k, replacement, x, sx, out, LDO, w, sw )
+ Computes combinations of a specified length from double-precision floating-
+ point strided array elements.
+
+ The `N` and stride parameters determine which elements in the strided array
+ are accessed at runtime.
+
+ Indexing is relative to the first index. To introduce an offset, use typed
+ array views.
+
+ If `N <= 0` or `k <= 0`, the function returns the output array unchanged.
+
+ If `replacement` is `false` and `k > N`, the function returns the output
+ array unchanged.
+
+ The output array `out` must contain at least `C(N, k) * k` elements if
+ `replacement` is `false`, or `C(N+k-1, k) * k` elements if `replacement`
+ is `true`.
+
+ The workspace array `w` must contain at least `k` elements.
+
+ Parameters
+ ----------
+ order: string
+ Storage layout.
+
+ N: integer
+ Number of indexed elements.
+
+ k: integer
+ Number of elements to combine.
+
+ replacement: boolean
+ Boolean indicating whether to allow duplication in combination.
+
+ x: Float64Array
+ Input array.
+
+ sx: integer
+ Stride length for `x`.
+
+ out: Float64Array
+ Output array.
+
+ LDO: integer
+ Stride length between successive contiguous vectors of the matrix `out`
+ (a.k.a., leading dimension of `out`).
+
+ w: Int32Array
+ Workspace array.
+
+ sw: integer
+ Stride length for `w`.
+
+ Returns
+ -------
+ out: Float64Array
+ Output array.
+
+ Examples
+ --------
+ > var x = new {{alias:@stdlib/array/float64}}( [ 1.0, 2.0, 3.0 ] );
+ > var out = new {{alias:@stdlib/array/float64}}( 6 );
+ > var w = new {{alias:@stdlib/array/int32}}( 2 );
+ > {{alias}}( 'row-major', 3, 2, false, x, 1, out, 2, w, 1 )
+ [ 1.0, 2.0, 1.0, 3.0, 2.0, 3.0 ]
+
+
+{{alias}}.ndarray( N, k, replacement, x, sx, ox, out, so1, so2, oo, w, sw, ow )
+ Computes combinations of a specified length from double-precision floating-
+ point strided array elements using alternative indexing semantics.
+
+ While typed array views mandate a view offset based on the underlying
+ buffer, the offset parameters support indexing semantics based on a
+ starting index.
+
+ Parameters
+ ----------
+ N: integer
+ Number of indexed elements.
+
+ k: integer
+ Number of elements to combine.
+
+ replacement: boolean
+ Boolean indicating whether to allow duplication in combination.
+
+ x: Float64Array
+ Input array.
+
+ sx: integer
+ Stride length for `x`.
+
+ ox: integer
+ Starting index for `x`.
+
+ out: Float64Array
+ Output array.
+
+ so1: integer
+ Stride length for the first dimension of `out`.
+
+ so2: integer
+ Stride length for the second dimension of `out`.
+
+ oo: integer
+ Starting index for `out`.
+
+ w: Int32Array
+ Workspace array.
+
+ sw: integer
+ Stride length for `w`.
+
+ ow: integer
+ Starting index for `w`.
+
+ Returns
+ -------
+ out: Float64Array
+ Output array.
+
+ Examples
+ --------
+ > var x = new {{alias:@stdlib/array/float64}}( [ 1.0, 2.0, 3.0 ] );
+ > var out = new {{alias:@stdlib/array/float64}}( 6 );
+ > var w = new {{alias:@stdlib/array/int32}}( 2 );
+ > {{alias}}.ndarray( 3, 2, false, x, 1, 0, out, 2, 1, 0, w, 1, 0 )
+ [ 1.0, 2.0, 1.0, 3.0, 2.0, 3.0 ]
+
+ See Also
+ --------
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/docs/types/index.d.ts b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/docs/types/index.d.ts
new file mode 100644
index 000000000000..0ef8274f9ae6
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/docs/types/index.d.ts
@@ -0,0 +1,131 @@
+/*
+* @license Apache-2.0
+*
+* Copyright (c) 2026 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.
+*/
+
+// TypeScript Version: 4.1
+
+///
+
+import { Layout } from '@stdlib/types/blas';
+
+/**
+* Interface describing `dcombinations`.
+*/
+interface Routine {
+ /**
+ * Computes combinations of a specified length from double-precision floating-point strided array elements.
+ *
+ * @param order - storage layout
+ * @param N - number of indexed elements
+ * @param k - number of elements to combine
+ * @param replacement - boolean indicating whether to allow duplication in combination
+ * @param x - input array
+ * @param strideX - stride length for `x`
+ * @param out - output array
+ * @param LDO - stride length between successive contiguous vectors of the matrix `out` (a.k.a., leading dimension of `out`)
+ * @param workspace - workspace array
+ * @param strideW - stride length for `workspace`
+ * @returns output array
+ *
+ * @example
+ * var Float64Array = require( `@stdlib/array/float64` );
+ * var Int32Array = require( `@stdlib/array/int32` );
+ *
+ * var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ * var out = new Float64Array( 12 );
+ * var workspace = new Int32Array( 2 );
+ *
+ * dcombinations( 'row-major', 4, 2, false, x, 1, out, 2, workspace, 1 );
+ * // out => [ 1.0, 2.0, 1.0, 3.0, 1.0, 4.0, 2.0, 3.0, 2.0, 4.0, 3.0, 4.0 ]
+ */
+ ( order: Layout, N: number, k: number, replacement: boolean, x: Float64Array, strideX: number, out: Float64Array, LDO: number, workspace: Int32Array, strideW: number ): Float64Array;
+
+ /**
+ * Computes combinations of a specified length from double-precision floating-point strided array elements using alternative indexing semantics.
+ *
+ * @param N - number of indexed elements
+ * @param k - number of elements to combine
+ * @param replacement - boolean indicating whether to allow duplication in combination
+ * @param x - input array
+ * @param strideX - stride length for `x`
+ * @param offsetX - starting index for `x`
+ * @param out - output array
+ * @param strideOut1 - stride length for the first dimension of `out`
+ * @param strideOut2 - stride length for the second dimension of `out`
+ * @param offsetOut - starting index for `out`
+ * @param workspace - workspace array
+ * @param strideW - stride length for `workspace`
+ * @param offsetW - starting index for `workspace`
+ * @returns output array
+ *
+ * @example
+ * var Float64Array = require( `@stdlib/array/float64` );
+ * var Int32Array = require( `@stdlib/array/int32` );
+ *
+ * var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ * var out = new Float64Array( 12 );
+ * var workspace = new Int32Array( 2 );
+ *
+ * dcombinations.ndarray( 4, 2, false, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 );
+ * // out => [ 1.0, 2.0, 1.0, 3.0, 1.0, 4.0, 2.0, 3.0, 2.0, 4.0, 3.0, 4.0 ]
+ */
+ ndarray( N: number, k: number, replacement: boolean, x: Float64Array, strideX: number, offsetX: number, out: Float64Array, strideOut1: number, strideOut2: number, offsetOut: number, workspace: Int32Array, strideW: number, offsetW: number ): Float64Array;
+}
+
+/**
+* Computes combinations of a specified length from double-precision floating-point strided array elements.
+*
+* @param order - storage layout
+* @param N - number of indexed elements
+* @param k - number of elements to combine
+* @param replacement - boolean indicating whether to allow duplication in combination
+* @param x - input array
+* @param strideX - stride length for `x`
+* @param out - output array
+* @param LDO - stride length between successive contiguous vectors of the matrix `out` (a.k.a., leading dimension of `out`)
+* @param workspace - workspace array
+* @param strideW - stride length for `workspace`
+* @returns output array
+*
+* @example
+* var Float64Array = require( `@stdlib/array/float64` );
+* var Int32Array = require( `@stdlib/array/int32` );
+*
+* var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+* var out = new Float64Array( 12 );
+* var workspace = new Int32Array( 2 );
+*
+* dcombinations( 'row-major', 4, 2, false, x, 1, out, 2, workspace, 1 );
+* // out => [ 1.0, 2.0, 1.0, 3.0, 1.0, 4.0, 2.0, 3.0, 2.0, 4.0, 3.0, 4.0 ]
+*
+* @example
+* var Float64Array = require( `@stdlib/array/float64` );
+* var Int32Array = require( `@stdlib/array/int32` );
+*
+* var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+* var out = new Float64Array( 12 );
+* var workspace = new Int32Array( 2 );
+*
+* dcombinations.ndarray( 4, 2, false, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 );
+* // out => [ 1.0, 2.0, 1.0, 3.0, 1.0, 4.0, 2.0, 3.0, 2.0, 4.0, 3.0, 4.0 ]
+*/
+declare var dcombinations: Routine;
+
+
+// EXPORTS //
+
+export = dcombinations;
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/docs/types/test.ts b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/docs/types/test.ts
new file mode 100644
index 000000000000..2bc981435e46
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/docs/types/test.ts
@@ -0,0 +1,447 @@
+/*
+* @license Apache-2.0
+*
+* Copyright (c) 2026 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.
+*/
+
+import dcombinations = require( './index' );
+
+
+// TESTS //
+
+// The function returns a Float64Array...
+{
+ const x = new Float64Array( 4 );
+ const out = new Float64Array( 12 );
+ const workspace = new Int32Array( 2 );
+
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, 2, workspace, 1 ); // $ExpectType Float64Array
+}
+
+// The compiler throws an error if the function is provided a first argument which is not a string...
+{
+ const x = new Float64Array( 4 );
+ const out = new Float64Array( 12 );
+ const workspace = new Int32Array( 2 );
+
+ dcombinations( 10, x.length, 2, false, x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( true, x.length, 2, false, x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( false, x.length, 2, false, x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( null, x.length, 2, false, x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( undefined, x.length, 2, false, x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( [], x.length, 2, false, x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( {}, x.length, 2, false, x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( ( x: number ): number => x, x.length, 2, false, x, 1, out, 2, workspace, 1 ); // $ExpectError
+}
+
+// The compiler throws an error if the function is provided a second argument which is not a number...
+{
+ const x = new Float64Array( 4 );
+ const out = new Float64Array( 12 );
+ const workspace = new Int32Array( 2 );
+
+ dcombinations( 'row-major', '10', 2, false, x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', true, 2, false, x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', false, 2, false, x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', null, 2, false, x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', undefined, 2, false, x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', [], 2, false, x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', {}, 2, false, x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', ( x: number ): number => x, 2, false, x, 1, out, 2, workspace, 1 ); // $ExpectError
+}
+
+// The compiler throws an error if the function is provided a third argument which is not a number...
+{
+ const x = new Float64Array( 4 );
+ const out = new Float64Array( 12 );
+ const workspace = new Int32Array( 2 );
+
+ dcombinations( 'row-major', x.length, '10', false, x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, true, false, x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, false, false, x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, null, false, x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, undefined, false, x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, [], false, x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, {}, false, x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, ( x: number ): number => x, false, x, 1, out, 2, workspace, 1 ); // $ExpectError
+}
+
+// The compiler throws an error if the function is provided a fourth argument which is not a boolean...
+{
+ const x = new Float64Array( 4 );
+ const out = new Float64Array( 12 );
+ const workspace = new Int32Array( 2 );
+
+ dcombinations( 'row-major', x.length, 2, '10', x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, 10, x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, null, x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, undefined, x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, [], x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, {}, x, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, ( x: number ): number => x, x, 1, out, 2, workspace, 1 ); // $ExpectError
+}
+
+// The compiler throws an error if the function is provided a fifth argument which is not a Float64Array...
+{
+ const out = new Float64Array( 12 );
+ const workspace = new Int32Array( 2 );
+
+ dcombinations( 'row-major', 4, 2, false, 10, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', 4, 2, false, '10', 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', 4, 2, false, true, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', 4, 2, false, false, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', 4, 2, false, null, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', 4, 2, false, undefined, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', 4, 2, false, [], 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', 4, 2, false, {}, 1, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', 4, 2, false, ( x: number ): number => x, 1, out, 2, workspace, 1 ); // $ExpectError
+}
+
+// The compiler throws an error if the function is provided a sixth argument which is not a number...
+{
+ const x = new Float64Array( 4 );
+ const out = new Float64Array( 12 );
+ const workspace = new Int32Array( 2 );
+
+ dcombinations( 'row-major', x.length, 2, false, x, '10', out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, true, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, false, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, null, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, undefined, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, [], out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, {}, out, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, ( x: number ): number => x, out, 2, workspace, 1 ); // $ExpectError
+}
+
+// The compiler throws an error if the function is provided a seventh argument which is not a Float64Array...
+{
+ const x = new Float64Array( 4 );
+ const workspace = new Int32Array( 2 );
+
+ dcombinations( 'row-major', x.length, 2, false, x, 1, 10, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, '10', 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, true, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, false, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, null, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, undefined, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, [], 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, {}, 2, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, ( x: number ): number => x, 2, workspace, 1 ); // $ExpectError
+}
+
+// The compiler throws an error if the function is provided an eighth argument which is not a number...
+{
+ const x = new Float64Array( 4 );
+ const out = new Float64Array( 12 );
+ const workspace = new Int32Array( 2 );
+
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, '10', workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, true, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, false, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, null, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, undefined, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, [], workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, {}, workspace, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, ( x: number ): number => x, workspace, 1 ); // $ExpectError
+}
+
+// The compiler throws an error if the function is provided a ninth argument which is not an Int32Array...
+{
+ const x = new Float64Array( 4 );
+ const out = new Float64Array( 12 );
+
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, 2, 10, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, 2, '10', 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, 2, true, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, 2, false, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, 2, null, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, 2, undefined, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, 2, [], 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, 2, {}, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, 2, ( x: number ): number => x, 1 ); // $ExpectError
+}
+
+// The compiler throws an error if the function is provided a tenth argument which is not a number...
+{
+ const x = new Float64Array( 4 );
+ const out = new Float64Array( 12 );
+ const workspace = new Int32Array( 2 );
+
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, 2, workspace, '10' ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, 2, workspace, true ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, 2, workspace, false ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, 2, workspace, null ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, 2, workspace, undefined ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, 2, workspace, [] ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, 2, workspace, {} ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, 2, workspace, ( x: number ): number => x ); // $ExpectError
+}
+
+// The compiler throws an error if the function is provided an unsupported number of arguments...
+{
+ const x = new Float64Array( 4 );
+ const out = new Float64Array( 12 );
+ const workspace = new Int32Array( 2 );
+
+ dcombinations(); // $ExpectError
+ dcombinations( 'row-major' ); // $ExpectError
+ dcombinations( 'row-major', x.length ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, 2 ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, 2, workspace ); // $ExpectError
+ dcombinations( 'row-major', x.length, 2, false, x, 1, out, 2, workspace, 1, 1 ); // $ExpectError
+}
+
+// Attached to main export is an `ndarray` method which returns a Float64Array...
+{
+ const x = new Float64Array( 4 );
+ const out = new Float64Array( 12 );
+ const workspace = new Int32Array( 2 );
+
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectType Float64Array
+}
+
+// The compiler throws an error if the `ndarray` method is provided a first argument which is not a number...
+{
+ const x = new Float64Array( 4 );
+ const out = new Float64Array( 12 );
+ const workspace = new Int32Array( 2 );
+
+ dcombinations.ndarray( '10', 2, false, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( true, 2, false, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( false, 2, false, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( null, 2, false, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( undefined, 2, false, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( [], 2, false, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( {}, 2, false, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( ( x: number ): number => x, 2, false, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+}
+
+// The compiler throws an error if the `ndarray` method is provided a second argument which is not a number...
+{
+ const x = new Float64Array( 4 );
+ const out = new Float64Array( 12 );
+ const workspace = new Int32Array( 2 );
+
+ dcombinations.ndarray( x.length, '10', false, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, true, false, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, false, false, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, null, false, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, undefined, false, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, [], false, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, {}, false, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, ( x: number ): number => x, false, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+}
+
+// The compiler throws an error if the `ndarray` method is provided a third argument which is not a boolean...
+{
+ const x = new Float64Array( 4 );
+ const out = new Float64Array( 12 );
+ const workspace = new Int32Array( 2 );
+
+ dcombinations.ndarray( x.length, 2, '10', x, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, 10, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, null, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, undefined, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, [], x, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, {}, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, ( x: number ): number => x, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+}
+
+// The compiler throws an error if the `ndarray` method is provided a fourth argument which is not a Float64Array...
+{
+ const out = new Float64Array( 12 );
+ const workspace = new Int32Array( 2 );
+
+ dcombinations.ndarray( 4, 2, false, 10, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( 4, 2, false, '10', 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( 4, 2, false, true, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( 4, 2, false, false, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( 4, 2, false, null, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( 4, 2, false, undefined, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( 4, 2, false, [], 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( 4, 2, false, {}, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( 4, 2, false, ( x: number ): number => x, 1, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+}
+
+// The compiler throws an error if the `ndarray` method is provided a fifth argument which is not a number...
+{
+ const x = new Float64Array( 4 );
+ const out = new Float64Array( 12 );
+ const workspace = new Int32Array( 2 );
+
+ dcombinations.ndarray( x.length, 2, false, x, '10', 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, true, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, false, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, null, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, undefined, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, [], 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, {}, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, ( x: number ): number => x, 0, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+}
+
+// The compiler throws an error if the `ndarray` method is provided a sixth argument which is not a number...
+{
+ const x = new Float64Array( 4 );
+ const out = new Float64Array( 12 );
+ const workspace = new Int32Array( 2 );
+
+ dcombinations.ndarray( x.length, 2, false, x, 1, '10', out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, true, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, false, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, null, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, undefined, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, [], out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, {}, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, ( x: number ): number => x, out, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+}
+
+// The compiler throws an error if the `ndarray` method is provided a seventh argument which is not a Float64Array...
+{
+ const x = new Float64Array( 4 );
+ const workspace = new Int32Array( 2 );
+
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, 10, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, '10', 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, true, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, false, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, null, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, undefined, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, [], 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, {}, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, ( x: number ): number => x, 2, 1, 0, workspace, 1, 0 ); // $ExpectError
+}
+
+// The compiler throws an error if the `ndarray` method is provided an eighth argument which is not a number...
+{
+ const x = new Float64Array( 4 );
+ const out = new Float64Array( 12 );
+ const workspace = new Int32Array( 2 );
+
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, '10', 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, true, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, false, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, null, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, undefined, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, [], 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, {}, 1, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, ( x: number ): number => x, 1, 0, workspace, 1, 0 ); // $ExpectError
+}
+
+// The compiler throws an error if the `ndarray` method is provided a ninth argument which is not a number...
+{
+ const x = new Float64Array( 4 );
+ const out = new Float64Array( 12 );
+ const workspace = new Int32Array( 2 );
+
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, '10', 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, true, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, false, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, null, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, undefined, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, [], 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, {}, 0, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, ( x: number ): number => x, 0, workspace, 1, 0 ); // $ExpectError
+}
+
+// The compiler throws an error if the `ndarray` method is provided a tenth argument which is not a number...
+{
+ const x = new Float64Array( 4 );
+ const out = new Float64Array( 12 );
+ const workspace = new Int32Array( 2 );
+
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, '10', workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, true, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, false, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, null, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, undefined, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, [], workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, {}, workspace, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, ( x: number ): number => x, workspace, 1, 0 ); // $ExpectError
+}
+
+// The compiler throws an error if the `ndarray` method is provided an eleventh argument which is not an Int32Array...
+{
+ const x = new Float64Array( 4 );
+ const out = new Float64Array( 12 );
+
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, 10, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, '10', 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, true, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, false, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, null, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, undefined, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, [], 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, {}, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, ( x: number ): number => x, 1, 0 ); // $ExpectError
+}
+
+// The compiler throws an error if the `ndarray` method is provided a twelfth argument which is not a number...
+{
+ const x = new Float64Array( 4 );
+ const out = new Float64Array( 12 );
+ const workspace = new Int32Array( 2 );
+
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, workspace, '10', 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, workspace, true, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, workspace, false, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, workspace, null, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, workspace, undefined, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, workspace, [], 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, workspace, {}, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, workspace, ( x: number ): number => x, 0 ); // $ExpectError
+}
+
+// The compiler throws an error if the `ndarray` method is provided a thirteenth argument which is not a number...
+{
+ const x = new Float64Array( 4 );
+ const out = new Float64Array( 12 );
+ const workspace = new Int32Array( 2 );
+
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, workspace, 1, '10' ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, workspace, 1, true ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, workspace, 1, false ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, workspace, 1, null ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, workspace, 1, undefined ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, workspace, 1, [] ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, workspace, 1, {} ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, workspace, 1, ( x: number ): number => x ); // $ExpectError
+}
+
+// The compiler throws an error if the `ndarray` method is provided an unsupported number of arguments...
+{
+ const x = new Float64Array( 4 );
+ const out = new Float64Array( 12 );
+ const workspace = new Int32Array( 2 );
+
+ dcombinations.ndarray(); // $ExpectError
+ dcombinations.ndarray( x.length ); // $ExpectError
+ dcombinations.ndarray( x.length, 2 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, workspace ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, workspace, 1 ); // $ExpectError
+ dcombinations.ndarray( x.length, 2, false, x, 1, 0, out, 2, 1, 0, workspace, 1, 0, 10 ); // $ExpectError
+}
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/examples/c/Makefile b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/examples/c/Makefile
new file mode 100644
index 000000000000..c8f8e9a1517b
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/examples/c/Makefile
@@ -0,0 +1,146 @@
+#/
+# @license Apache-2.0
+#
+# Copyright (c) 2026 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.
+#/
+
+# VARIABLES #
+
+ifndef VERBOSE
+ QUIET := @
+else
+ QUIET :=
+endif
+
+# Determine the OS ([1][1], [2][2]).
+#
+# [1]: https://en.wikipedia.org/wiki/Uname#Examples
+# [2]: http://stackoverflow.com/a/27776822/2225624
+OS ?= $(shell uname)
+ifneq (, $(findstring MINGW,$(OS)))
+ OS := WINNT
+else
+ifneq (, $(findstring MSYS,$(OS)))
+ OS := WINNT
+else
+ifneq (, $(findstring CYGWIN,$(OS)))
+ OS := WINNT
+else
+ifneq (, $(findstring Windows_NT,$(OS)))
+ OS := WINNT
+endif
+endif
+endif
+endif
+
+# Define the program used for compiling C source files:
+ifdef C_COMPILER
+ CC := $(C_COMPILER)
+else
+ CC := gcc
+endif
+
+# Define the command-line options when compiling C files:
+CFLAGS ?= \
+ -std=c99 \
+ -O3 \
+ -Wall \
+ -pedantic
+
+# Determine whether to generate position independent code ([1][1], [2][2]).
+#
+# [1]: https://gcc.gnu.org/onlinedocs/gcc/Code-Gen-Options.html#Code-Gen-Options
+# [2]: http://stackoverflow.com/questions/5311515/gcc-fpic-option
+ifeq ($(OS), WINNT)
+ fPIC ?=
+else
+ fPIC ?= -fPIC
+endif
+
+# List of includes (e.g., `-I /foo/bar -I /beep/boop/include`):
+INCLUDE ?=
+
+# List of source files:
+SOURCE_FILES ?=
+
+# List of libraries (e.g., `-lopenblas -lpthread`):
+LIBRARIES ?=
+
+# List of library paths (e.g., `-L /foo/bar -L /beep/boop`):
+LIBPATH ?=
+
+# List of C targets:
+c_targets := example.out
+
+
+# RULES #
+
+#/
+# Compiles source files.
+#
+# @param {string} [C_COMPILER] - C compiler (e.g., `gcc`)
+# @param {string} [CFLAGS] - C compiler options
+# @param {(string|void)} [fPIC] - compiler flag determining whether to generate position independent code (e.g., `-fPIC`)
+# @param {string} [INCLUDE] - list of includes (e.g., `-I /foo/bar -I /beep/boop/include`)
+# @param {string} [SOURCE_FILES] - list of source files
+# @param {string} [LIBPATH] - list of library paths (e.g., `-L /foo/bar -L /beep/boop`)
+# @param {string} [LIBRARIES] - list of libraries (e.g., `-lopenblas -lpthread`)
+#
+# @example
+# make
+#
+# @example
+# make all
+#/
+all: $(c_targets)
+
+.PHONY: all
+
+#/
+# Compiles C source files.
+#
+# @private
+# @param {string} CC - C compiler (e.g., `gcc`)
+# @param {string} CFLAGS - C compiler options
+# @param {(string|void)} fPIC - compiler flag determining whether to generate position independent code (e.g., `-fPIC`)
+# @param {string} INCLUDE - list of includes (e.g., `-I /foo/bar`)
+# @param {string} SOURCE_FILES - list of source files
+# @param {string} LIBPATH - list of library paths (e.g., `-L /foo/bar`)
+# @param {string} LIBRARIES - list of libraries (e.g., `-lopenblas`)
+#/
+$(c_targets): %.out: %.c
+ $(QUIET) $(CC) $(CFLAGS) $(fPIC) $(INCLUDE) -o $@ $(SOURCE_FILES) $< $(LIBPATH) -lm $(LIBRARIES)
+
+#/
+# Runs compiled examples.
+#
+# @example
+# make run
+#/
+run: $(c_targets)
+ $(QUIET) ./$<
+
+.PHONY: run
+
+#/
+# Removes generated files.
+#
+# @example
+# make clean
+#/
+clean:
+ $(QUIET) -rm -f *.o *.out
+
+.PHONY: clean
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/examples/c/example.c b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/examples/c/example.c
new file mode 100644
index 000000000000..0665c22028d2
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/examples/c/example.c
@@ -0,0 +1,47 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2026 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.
+*/
+
+#include "stdlib/blas/ext/base/dcombinations.h"
+#include "stdlib/blas/base/shared.h"
+#include
+#include
+#include
+
+int main( void ) {
+ // Create a strided array:
+ const double x[] = { 1.0, 2.0, 3.0, 4.0 };
+
+ // Create an output array:
+ double out[] = { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 };
+
+ // Create a workspace array:
+ int32_t workspace[] = { 0, 0 };
+
+ // Specify strides:
+ const int strideX = 1;
+ const int strideW = 1;
+ const int LDO = 2;
+
+ // Compute combinations:
+ stdlib_strided_dcombinations( CblasRowMajor, 4, 2, false, x, strideX, out, LDO, workspace, strideW );
+
+ // Print each combination:
+ for ( int i = 0; i < 6; i++ ) {
+ printf( " [ %lf, %lf ]\n", out[ i*2 ], out[ (i*2)+1 ] );
+ }
+}
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/examples/index.js b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/examples/index.js
new file mode 100644
index 000000000000..6e75e560e3ab
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/examples/index.js
@@ -0,0 +1,40 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2026 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';
+
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var Float64Array = require( '@stdlib/array/float64' );
+var Int32Array = require( '@stdlib/array/int32' );
+var dcombinations = require( './../lib' );
+
+var N = 5;
+var k = 2;
+
+var x = discreteUniform( N, 1, 10, {
+ 'dtype': 'float64'
+});
+console.log( x );
+
+var out = new Float64Array( 20 );
+console.log( out );
+
+var workspace = new Int32Array( k );
+
+dcombinations( 'row-major', N, k, false, x, 1, out, 2, workspace, 1 );
+console.log( out );
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/include.gypi b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/include.gypi
new file mode 100644
index 000000000000..bee8d41a2caf
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/include.gypi
@@ -0,0 +1,53 @@
+# @license Apache-2.0
+#
+# Copyright (c) 2026 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.
+
+# A GYP include file for building a Node.js native add-on.
+#
+# Main documentation:
+#
+# [1]: https://gyp.gsrc.io/docs/InputFormatReference.md
+# [2]: https://gyp.gsrc.io/docs/UserDocumentation.md
+{
+ # Define variables to be used throughout the configuration for all targets:
+ 'variables': {
+ # Source directory:
+ 'src_dir': './src',
+
+ # Include directories:
+ 'include_dirs': [
+ '
+#include
+
+/*
+* If C++, prevent name mangling so that the compiler emits a binary file having undecorated names, thus mirroring the behavior of a C compiler.
+*/
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/**
+* Computes combinations of a specified length from double-precision floating-point strided array elements.
+*/
+void API_SUFFIX(stdlib_strided_dcombinations)( const CBLAS_LAYOUT order, const CBLAS_INT N, const CBLAS_INT k, const bool replacement, const double *X, const CBLAS_INT strideX, double *Out, const CBLAS_INT LDO, int32_t *Workspace, const CBLAS_INT strideW );
+
+/**
+* Computes combinations of a specified length from double-precision floating-point strided array elements using alternative indexing semantics.
+*/
+void API_SUFFIX(stdlib_strided_dcombinations_ndarray)( const CBLAS_INT N, const CBLAS_INT k, const bool replacement, const double *X, const CBLAS_INT strideX, const CBLAS_INT offsetX, double *Out, const CBLAS_INT strideOut1, const CBLAS_INT strideOut2, const CBLAS_INT offsetOut, int32_t *Workspace, const CBLAS_INT strideW, const CBLAS_INT offsetW );
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif // !STDLIB_BLAS_EXT_BASE_DCOMBINATIONS_H
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/lib/dcombinations.js b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/lib/dcombinations.js
new file mode 100644
index 000000000000..7db0ce7d4a93
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/lib/dcombinations.js
@@ -0,0 +1,99 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2026 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 isLayout = require( '@stdlib/blas/base/assert/is-layout' );
+var isColumnMajor = require( '@stdlib/ndarray/base/assert/is-column-major-string' );
+var stride2offset = require( '@stdlib/strided/base/stride2offset' );
+var binomcoef = require( '@stdlib/math/base/special/binomcoef' );
+var max = require( '@stdlib/math/base/special/fast/max' );
+var format = require( '@stdlib/string/format' );
+var ndarray = require( './ndarray.js' );
+
+
+// MAIN //
+
+/**
+* Computes combinations of a specified length from double-precision floating-point strided array elements.
+*
+* @param {string} order - storage layout
+* @param {NonNegativeInteger} N - number of indexed elements
+* @param {NonNegativeInteger} k - number of elements to combine
+* @param {boolean} replacement - boolean indicating whether to allow duplication in combination
+* @param {Float64Array} x - input array
+* @param {integer} strideX - stride length for `x`
+* @param {Float64Array} out - output array
+* @param {integer} LDO - stride length between successive contiguous vectors of the matrix `out` (a.k.a., leading dimension of `out`)
+* @param {Int32Array} workspace - workspace array
+* @param {integer} strideW - stride length for `workspace`
+* @throws {TypeError} first argument must be a valid order
+* @throws {RangeError} eighth argument must be a valid stride length
+* @returns {Float64Array} output array
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+* var Int32Array = require( '@stdlib/array/int32' );
+*
+* var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+* var out = new Float64Array( 12 );
+* var workspace = new Int32Array( 2 );
+*
+* dcombinations( 'row-major', 4, 2, false, x, 1, out, 2, workspace, 1 );
+* // out => [ 1.0, 2.0, 1.0, 3.0, 1.0, 4.0, 2.0, 3.0, 2.0, 4.0, 3.0, 4.0 ]
+*/
+function dcombinations( order, N, k, replacement, x, strideX, out, LDO, workspace, strideW ) { // eslint-disable-line max-len
+ var so1;
+ var so2;
+ var ox;
+ var ow;
+ var C;
+
+ if ( !isLayout( order ) ) {
+ throw new TypeError( format( 'invalid argument. First argument must be a valid order. Value: `%s`.', order ) );
+ }
+ if ( isColumnMajor( order ) ) {
+ // For column-major order, the leading dimension is the stride between successive combinations (i.e., the columns of the output matrix), and, thus, must be large enough to avoid overlapping combinations...
+ if ( replacement ) {
+ C = binomcoef( N + k - 1, k );
+ } else {
+ C = binomcoef( N, k );
+ }
+ if ( LDO < max( 1, C ) ) {
+ throw new RangeError( format( 'invalid argument. Eighth argument must be greater than or equal to max(1,%d). Value: `%d`.', C, LDO ) );
+ }
+ so1 = 1;
+ so2 = LDO;
+ } else { // order === 'row-major'
+ if ( LDO < max( 1, k ) ) {
+ throw new RangeError( format( 'invalid argument. Eighth argument must be greater than or equal to max(1,%d). Value: `%d`.', k, LDO ) );
+ }
+ so1 = LDO;
+ so2 = 1;
+ }
+ ox = stride2offset( N, strideX );
+ ow = stride2offset( k, strideW );
+ return ndarray( N, k, replacement, x, strideX, ox, out, so1, so2, 0, workspace, strideW, ow ); // eslint-disable-line max-len
+}
+
+
+// EXPORTS //
+
+module.exports = dcombinations;
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/lib/dcombinations.native.js b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/lib/dcombinations.native.js
new file mode 100644
index 000000000000..f63da4fb36ac
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/lib/dcombinations.native.js
@@ -0,0 +1,96 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2026 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.
+*/
+
+/* eslint-disable max-len */
+
+'use strict';
+
+// MODULES //
+
+var isLayout = require( '@stdlib/blas/base/assert/is-layout' );
+var isColumnMajor = require( '@stdlib/ndarray/base/assert/is-column-major-string' );
+var resolveOrder = require( '@stdlib/blas/base/layout-resolve-enum' );
+var binomcoef = require( '@stdlib/math/base/special/binomcoef' );
+var max = require( '@stdlib/math/base/special/fast/max' );
+var format = require( '@stdlib/string/format' );
+var addon = require( './../src/addon.node' );
+
+
+// MAIN //
+
+/**
+* Computes combinations of a specified length from double-precision floating-point strided array elements.
+*
+* @param {string} order - storage layout
+* @param {NonNegativeInteger} N - number of indexed elements
+* @param {NonNegativeInteger} k - number of elements to combine
+* @param {boolean} replacement - boolean indicating whether to allow duplication in combination
+* @param {Float64Array} x - input array
+* @param {integer} strideX - stride length for `x`
+* @param {Float64Array} out - output array
+* @param {integer} LDO - stride length between successive contiguous vectors of the matrix `out` (a.k.a., leading dimension of `out`)
+* @param {Int32Array} workspace - workspace array
+* @param {integer} strideW - stride length for `workspace`
+* @throws {TypeError} first argument must be a valid order
+* @throws {RangeError} eighth argument must be a valid stride length
+* @returns {Float64Array} output array
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+* var Int32Array = require( '@stdlib/array/int32' );
+*
+* var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+* var out = new Float64Array( 12 );
+* var workspace = new Int32Array( 2 );
+*
+* dcombinations( 'row-major', 4, 2, false, x, 1, out, 2, workspace, 1 );
+* // out => [ 1.0, 2.0, 1.0, 3.0, 1.0, 4.0, 2.0, 3.0, 2.0, 4.0, 3.0, 4.0 ]
+*/
+function dcombinations( order, N, k, replacement, x, strideX, out, LDO, workspace, strideW ) {
+ var C;
+
+ if ( !isLayout( order ) ) {
+ throw new TypeError( format( 'invalid argument. First argument must be a valid order. Value: `%s`.', order ) );
+ }
+ if ( isColumnMajor( order ) ) {
+ // For column-major order, the leading dimension is the stride between successive combinations (i.e., the columns of the output matrix), and, thus, must be large enough to avoid overlapping combinations...
+ if ( replacement ) {
+ C = binomcoef( N + k - 1, k );
+ } else {
+ C = binomcoef( N, k );
+ }
+ if ( LDO < max( 1, C ) ) {
+ throw new RangeError( format( 'invalid argument. Eighth argument must be greater than or equal to max(1,%d). Value: `%d`.', C, LDO ) );
+ }
+ } else if ( LDO < max( 1, k ) ) { // order === 'row-major'
+ throw new RangeError( format( 'invalid argument. Eighth argument must be greater than or equal to max(1,%d). Value: `%d`.', k, LDO ) );
+ }
+ if ( N <= 0 || k <= 0 ) {
+ return out;
+ }
+ if ( !replacement && k > N ) {
+ return out;
+ }
+ addon( resolveOrder( order ), N, k, replacement, x, strideX, out, LDO, workspace, strideW );
+ return out;
+}
+
+
+// EXPORTS //
+
+module.exports = dcombinations;
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/lib/index.js b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/lib/index.js
new file mode 100644
index 000000000000..0eb447619ce0
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/lib/index.js
@@ -0,0 +1,74 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2026 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';
+
+/**
+* Compute combinations of a specified length from double-precision floating-point strided array elements.
+*
+* @module @stdlib/blas/ext/base/dcombinations
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+* var Int32Array = require( '@stdlib/array/int32' );
+* var dcombinations = require( '@stdlib/blas/ext/base/dcombinations' );
+*
+* var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+* var out = new Float64Array( 12 );
+* var workspace = new Int32Array( 2 );
+*
+* dcombinations( 'row-major', 4, 2, false, x, 1, out, 2, workspace, 1 );
+* // out => [ 1.0, 2.0, 1.0, 3.0, 1.0, 4.0, 2.0, 3.0, 2.0, 4.0, 3.0, 4.0 ]
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+* var Int32Array = require( '@stdlib/array/int32' );
+* var dcombinations = require( '@stdlib/blas/ext/base/dcombinations' );
+*
+* var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+* var out = new Float64Array( 12 );
+* var workspace = new Int32Array( 2 );
+*
+* dcombinations.ndarray( 4, 2, false, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 );
+* // out => [ 1.0, 2.0, 1.0, 3.0, 1.0, 4.0, 2.0, 3.0, 2.0, 4.0, 3.0, 4.0 ]
+*/
+
+// MODULES //
+
+var join = require( 'path' ).join;
+var tryRequire = require( '@stdlib/utils/try-require' );
+var isError = require( '@stdlib/assert/is-error' );
+var main = require( './main.js' );
+
+
+// MAIN //
+
+var dcombinations;
+var tmp = tryRequire( join( __dirname, './native.js' ) );
+if ( isError( tmp ) ) {
+ dcombinations = main;
+} else {
+ dcombinations = tmp;
+}
+
+
+// EXPORTS //
+
+module.exports = dcombinations;
+
+// exports: { "ndarray": "dcombinations.ndarray" }
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/lib/main.js b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/lib/main.js
new file mode 100644
index 000000000000..56913d14ecbf
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/lib/main.js
@@ -0,0 +1,35 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2026 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 setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );
+var dcombinations = require( './dcombinations.js' );
+var ndarray = require( './ndarray.js' );
+
+
+// MAIN //
+
+setReadOnly( dcombinations, 'ndarray', ndarray );
+
+
+// EXPORTS //
+
+module.exports = dcombinations;
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/lib/native.js b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/lib/native.js
new file mode 100644
index 000000000000..66f36d0e6c9d
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/lib/native.js
@@ -0,0 +1,35 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2026 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 setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );
+var dcombinations = require( './dcombinations.native.js' );
+var ndarray = require( './ndarray.native.js' );
+
+
+// MAIN //
+
+setReadOnly( dcombinations, 'ndarray', ndarray );
+
+
+// EXPORTS //
+
+module.exports = dcombinations;
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/lib/ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/lib/ndarray.js
new file mode 100644
index 000000000000..730cd1cb7460
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/lib/ndarray.js
@@ -0,0 +1,235 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2026 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 binomcoef = require( '@stdlib/math/base/special/binomcoef' );
+var dcopy = require( '@stdlib/blas/base/dcopy' ).ndarray;
+var dfill = require( '@stdlib/blas/ext/base/dfill' ).ndarray;
+
+
+// FUNCTIONS //
+
+/**
+* Initializes a workspace with the indices of the first combination of a specified length.
+*
+* @private
+* @param {NonNegativeInteger} k - combination length
+* @param {boolean} replacement - boolean indicating whether to allow duplication in combination
+* @param {Int32Array} workspace - workspace array
+* @param {integer} strideW - stride length for `workspace`
+* @param {NonNegativeInteger} offsetW - starting index for `workspace`
+*/
+function firstCombination( k, replacement, workspace, strideW, offsetW ) {
+ var iw;
+ var p;
+
+ iw = offsetW;
+ if ( replacement ) {
+ for ( p = 0; p < k; p++ ) {
+ workspace[ iw ] = 0;
+ iw += strideW;
+ }
+ } else {
+ for ( p = 0; p < k; p++ ) {
+ workspace[ iw ] = p;
+ iw += strideW;
+ }
+ }
+}
+
+/**
+* Advances a workspace to the indices of the next combination of a specified length.
+*
+* ## Notes
+*
+* - If a workspace contains the last combination, the workspace is left unchanged.
+*
+* @private
+* @param {NonNegativeInteger} k - combination length
+* @param {NonNegativeInteger} N - number of indexed elements
+* @param {boolean} replacement - boolean indicating whether to allow duplication in combination
+* @param {Int32Array} workspace - workspace array
+* @param {integer} strideW - stride length for `workspace`
+* @param {NonNegativeInteger} offsetW - starting index for `workspace`
+*/
+function nextCombination( k, N, replacement, workspace, strideW, offsetW ) {
+ var val;
+ var iw;
+ var i;
+ var p;
+
+ // Starting from the rightmost index, find the rightmost index which can be incremented...
+ iw = offsetW + ( ( k-1 ) * strideW );
+ i = k - 1;
+ if ( replacement ) {
+ while ( i >= 0 && workspace[ iw ] === N - 1 ) {
+ i -= 1;
+ iw -= strideW;
+ }
+ if ( i >= 0 ) {
+ val = workspace[ iw ] + 1;
+ for ( p = i; p < k; p++ ) {
+ workspace[ iw ] = val;
+ iw += strideW;
+ }
+ }
+ } else {
+ while ( i >= 0 && workspace[ iw ] === N - k + i ) {
+ i -= 1;
+ iw -= strideW;
+ }
+ if ( i >= 0 ) {
+ workspace[ iw ] += 1;
+ val = workspace[ iw ];
+ for ( p = i + 1; p < k; p++ ) {
+ iw += strideW;
+ val += 1;
+ workspace[ iw ] = val;
+ }
+ }
+ }
+}
+
+
+// MAIN //
+
+/**
+* Computes combinations of a specified length from double-precision floating-point strided array elements using alternative indexing semantics.
+*
+* @param {NonNegativeInteger} N - number of indexed elements
+* @param {NonNegativeInteger} k - number of elements to combine
+* @param {boolean} replacement - boolean indicating whether to allow duplication in combination
+* @param {Float64Array} x - input array
+* @param {integer} strideX - stride length for `x`
+* @param {NonNegativeInteger} offsetX - starting index for `x`
+* @param {Float64Array} out - output array
+* @param {integer} strideOut1 - stride length for the first dimension of `out`
+* @param {integer} strideOut2 - stride length for the second dimension of `out`
+* @param {NonNegativeInteger} offsetOut - starting index for `out`
+* @param {Int32Array} workspace - workspace array
+* @param {integer} strideW - stride length for `workspace`
+* @param {NonNegativeInteger} offsetW - starting index for `workspace`
+* @returns {Float64Array} output array
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+* var Int32Array = require( '@stdlib/array/int32' );
+*
+* var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+* var out = new Float64Array( 12 );
+* var workspace = new Int32Array( 2 );
+*
+* dcombinations( 4, 2, false, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 );
+* // out => [ 1.0, 2.0, 1.0, 3.0, 1.0, 4.0, 2.0, 3.0, 2.0, 4.0, 3.0, 4.0 ]
+*/
+function dcombinations( N, k, replacement, x, strideX, offsetX, out, strideOut1, strideOut2, offsetOut, workspace, strideW, offsetW ) { // eslint-disable-line max-len, max-params
+ var runLen;
+ var rem;
+ var io;
+ var iw;
+ var oj;
+ var np;
+ var C;
+ var L;
+ var c;
+ var j;
+ var v;
+
+ if ( N <= 0 || k <= 0 ) {
+ return out;
+ }
+ if ( !replacement && k > N ) {
+ return out;
+ }
+ // For `k` equal to one, each combination consists of a single element, and, thus, we can directly copy the input array elements to the output array (i.e., no need for a workspace)...
+ if ( k === 1 ) {
+ dcopy( N, x, strideX, offsetX, out, strideOut1, offsetOut );
+ return out;
+ }
+ if ( isRowMajor( [ strideOut1, strideOut2 ] ) ) {
+ // For row-major order, combinations are stored as contiguous rows, and, thus, we resolve one combination at a time, writing each combination's elements consecutively...
+
+ // Compute the total number of combinations:
+ if ( replacement ) {
+ C = binomcoef( N + k - 1, k );
+ } else {
+ C = binomcoef( N, k );
+ }
+ firstCombination( k, replacement, workspace, strideW, offsetW );
+ io = offsetOut;
+ for ( c = 0; c < C; c++ ) {
+ // Resolve the current combination's indices to input array values and write them to the output array:
+ iw = offsetW;
+ oj = io;
+ for ( j = 0; j < k; j++ ) {
+ out[ oj ] = x[ offsetX + ( workspace[ iw ] * strideX ) ];
+ oj += strideOut2;
+ iw += strideW;
+ }
+ io += strideOut1;
+ nextCombination( k, N, replacement, workspace, strideW, offsetW );
+ }
+ } else {
+ // For column-major order, the elements at a given combination position are stored contiguously within a column. As consecutive combinations share long prefixes, each column consists of runs of repeated elements (with run lengths equal to binomial coefficients), and, thus, we can fill each column as a sequence of contiguous runs...
+ for ( j = 0; j < k; j++ ) {
+ // The `j`-th column is determined by the `(j+1)`-element prefixes of each combination, enumerated in lexicographic order:
+ L = j + 1;
+ rem = k - 1 - j;
+
+ // Enumerate only those prefixes which can be completed to a full combination. Without replacement, a prefix is extendable only if its last index leaves room for the remaining `rem` elements, and, thus, we restrict enumeration to a reduced universe of `N-rem` indices in order to avoid generating zero-length runs:
+ if ( replacement ) {
+ np = N;
+ C = binomcoef( N + L - 1, L );
+ } else {
+ np = N - rem;
+ C = binomcoef( np, L );
+ }
+ firstCombination( L, replacement, workspace, strideW, offsetW );
+ io = offsetOut + ( j * strideOut2 );
+
+ // Resolve the workspace index of each prefix's last element (i.e., the column's index value), which is invariant across prefixes:
+ iw = offsetW + ( ( L-1 ) * strideW );
+ for ( c = 0; c < C; c++ ) {
+ v = workspace[ iw ];
+
+ // Resolve the run length (i.e., the number of ways to complete the remaining `rem` positions with indices not less than `v`):
+ if ( rem === 0 ) {
+ runLen = 1;
+ } else if ( replacement ) {
+ runLen = binomcoef( N - v + rem - 1, rem );
+ } else {
+ runLen = binomcoef( N - 1 - v, rem );
+ }
+ // Write a run of the resolved input array value down the column:
+ dfill( runLen, x[ offsetX + ( v * strideX ) ], out, strideOut1, io ); // eslint-disable-line max-len
+ io += runLen * strideOut1;
+ nextCombination( L, np, replacement, workspace, strideW, offsetW ); // eslint-disable-line max-len
+ }
+ }
+ }
+ return out;
+}
+
+
+// EXPORTS //
+
+module.exports = dcombinations;
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/lib/ndarray.native.js
new file mode 100644
index 000000000000..9cae46d0b01b
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/lib/ndarray.native.js
@@ -0,0 +1,73 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2026 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.
+*/
+
+/* eslint-disable max-params, max-len */
+
+'use strict';
+
+// MODULES //
+
+var addon = require( './../src/addon.node' );
+
+
+// MAIN //
+
+/**
+* Computes combinations of a specified length from double-precision floating-point strided array elements using alternative indexing semantics.
+*
+* @param {NonNegativeInteger} N - number of indexed elements
+* @param {NonNegativeInteger} k - number of elements to combine
+* @param {boolean} replacement - boolean indicating whether to allow duplication in combination
+* @param {Float64Array} x - input array
+* @param {integer} strideX - stride length for `x`
+* @param {NonNegativeInteger} offsetX - starting index for `x`
+* @param {Float64Array} out - output array
+* @param {integer} strideOut1 - stride length for the first dimension of `out`
+* @param {integer} strideOut2 - stride length for the second dimension of `out`
+* @param {NonNegativeInteger} offsetOut - starting index for `out`
+* @param {Int32Array} workspace - workspace array
+* @param {integer} strideW - stride length for `workspace`
+* @param {NonNegativeInteger} offsetW - starting index for `workspace`
+* @returns {Float64Array} output array
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+* var Int32Array = require( '@stdlib/array/int32' );
+*
+* var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+* var out = new Float64Array( 12 );
+* var workspace = new Int32Array( 2 );
+*
+* dcombinations( 4, 2, false, x, 1, 0, out, 2, 1, 0, workspace, 1, 0 );
+* // out => [ 1.0, 2.0, 1.0, 3.0, 1.0, 4.0, 2.0, 3.0, 2.0, 4.0, 3.0, 4.0 ]
+*/
+function dcombinations( N, k, replacement, x, strideX, offsetX, out, strideOut1, strideOut2, offsetOut, workspace, strideW, offsetW ) {
+ if ( N <= 0 || k <= 0 ) {
+ return out;
+ }
+ if ( !replacement && k > N ) {
+ return out;
+ }
+ addon.ndarray( N, k, replacement, x, strideX, offsetX, out, strideOut1, strideOut2, offsetOut, workspace, strideW, offsetW );
+ return out;
+}
+
+
+// EXPORTS //
+
+module.exports = dcombinations;
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/manifest.json b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/manifest.json
new file mode 100644
index 000000000000..20fb209613e2
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/manifest.json
@@ -0,0 +1,94 @@
+{
+ "options": {
+ "task": "build"
+ },
+ "fields": [
+ {
+ "field": "src",
+ "resolve": true,
+ "relative": true
+ },
+ {
+ "field": "include",
+ "resolve": true,
+ "relative": true
+ },
+ {
+ "field": "libraries",
+ "resolve": false,
+ "relative": false
+ },
+ {
+ "field": "libpath",
+ "resolve": true,
+ "relative": false
+ }
+ ],
+ "confs": [
+ {
+ "task": "build",
+ "src": [
+ "./src/main.c"
+ ],
+ "include": [
+ "./include"
+ ],
+ "libraries": [],
+ "libpath": [],
+ "dependencies": [
+ "@stdlib/blas/base/dcopy",
+ "@stdlib/blas/ext/base/dfill",
+ "@stdlib/blas/base/shared",
+ "@stdlib/ndarray/base/assert/is-row-major",
+ "@stdlib/strided/base/stride2offset",
+ "@stdlib/napi/export",
+ "@stdlib/napi/argv",
+ "@stdlib/napi/argv-int32",
+ "@stdlib/napi/argv-bool",
+ "@stdlib/napi/argv-int64",
+ "@stdlib/napi/argv-strided-float64array",
+ "@stdlib/napi/argv-strided-float64array2d",
+ "@stdlib/napi/argv-strided-int32array",
+ "@stdlib/math/base/special/binomcoef"
+ ]
+ },
+ {
+ "task": "benchmark",
+ "src": [
+ "./src/main.c"
+ ],
+ "include": [
+ "./include"
+ ],
+ "libraries": [],
+ "libpath": [],
+ "dependencies": [
+ "@stdlib/blas/base/dcopy",
+ "@stdlib/blas/ext/base/dfill",
+ "@stdlib/blas/base/shared",
+ "@stdlib/ndarray/base/assert/is-row-major",
+ "@stdlib/strided/base/stride2offset",
+ "@stdlib/math/base/special/binomcoef"
+ ]
+ },
+ {
+ "task": "examples",
+ "src": [
+ "./src/main.c"
+ ],
+ "include": [
+ "./include"
+ ],
+ "libraries": [],
+ "libpath": [],
+ "dependencies": [
+ "@stdlib/blas/base/dcopy",
+ "@stdlib/blas/ext/base/dfill",
+ "@stdlib/blas/base/shared",
+ "@stdlib/ndarray/base/assert/is-row-major",
+ "@stdlib/strided/base/stride2offset",
+ "@stdlib/math/base/special/binomcoef"
+ ]
+ }
+ ]
+}
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/package.json b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/package.json
new file mode 100644
index 000000000000..0f1e2ed2c376
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/package.json
@@ -0,0 +1,74 @@
+{
+ "name": "@stdlib/blas/ext/base/dcombinations",
+ "version": "0.0.0",
+ "description": "Compute combinations of a specified length from double-precision floating-point strided array elements.",
+ "license": "Apache-2.0",
+ "author": {
+ "name": "The Stdlib Authors",
+ "url": "https://github.com/stdlib-js/stdlib/graphs/contributors"
+ },
+ "contributors": [
+ {
+ "name": "The Stdlib Authors",
+ "url": "https://github.com/stdlib-js/stdlib/graphs/contributors"
+ }
+ ],
+ "main": "./lib",
+ "browser": "./lib/main.js",
+ "gypfile": true,
+ "directories": {
+ "benchmark": "./benchmark",
+ "doc": "./docs",
+ "example": "./examples",
+ "include": "./include",
+ "lib": "./lib",
+ "src": "./src",
+ "test": "./test"
+ },
+ "types": "./docs/types",
+ "scripts": {},
+ "homepage": "https://github.com/stdlib-js/stdlib",
+ "repository": {
+ "type": "git",
+ "url": "git://github.com/stdlib-js/stdlib.git"
+ },
+ "bugs": {
+ "url": "https://github.com/stdlib-js/stdlib/issues"
+ },
+ "dependencies": {},
+ "devDependencies": {},
+ "engines": {
+ "node": ">=0.10.0",
+ "npm": ">2.7.0"
+ },
+ "os": [
+ "aix",
+ "darwin",
+ "freebsd",
+ "linux",
+ "macos",
+ "openbsd",
+ "sunos",
+ "win32",
+ "windows"
+ ],
+ "keywords": [
+ "stdlib",
+ "stdmath",
+ "mathematics",
+ "math",
+ "blas",
+ "extended",
+ "combinations",
+ "combinatorics",
+ "strided",
+ "array",
+ "ndarray",
+ "float64",
+ "double",
+ "float64array"
+ ],
+ "__stdlib__": {
+ "wasm": false
+ }
+}
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/src/Makefile b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/src/Makefile
new file mode 100644
index 000000000000..2caf905cedbe
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/src/Makefile
@@ -0,0 +1,70 @@
+#/
+# @license Apache-2.0
+#
+# Copyright (c) 2026 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.
+#/
+
+# VARIABLES #
+
+ifndef VERBOSE
+ QUIET := @
+else
+ QUIET :=
+endif
+
+# Determine the OS ([1][1], [2][2]).
+#
+# [1]: https://en.wikipedia.org/wiki/Uname#Examples
+# [2]: http://stackoverflow.com/a/27776822/2225624
+OS ?= $(shell uname)
+ifneq (, $(findstring MINGW,$(OS)))
+ OS := WINNT
+else
+ifneq (, $(findstring MSYS,$(OS)))
+ OS := WINNT
+else
+ifneq (, $(findstring CYGWIN,$(OS)))
+ OS := WINNT
+else
+ifneq (, $(findstring Windows_NT,$(OS)))
+ OS := WINNT
+endif
+endif
+endif
+endif
+
+
+# RULES #
+
+#/
+# Removes generated files for building an add-on.
+#
+# @example
+# make clean-addon
+#/
+clean-addon:
+ $(QUIET) -rm -f *.o *.node
+
+.PHONY: clean-addon
+
+#/
+# Removes generated files.
+#
+# @example
+# make clean
+#/
+clean: clean-addon
+
+.PHONY: clean
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/src/addon.c b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/src/addon.c
new file mode 100644
index 000000000000..d38670d69081
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/src/addon.c
@@ -0,0 +1,114 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2026 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.
+*/
+
+#include "stdlib/blas/ext/base/dcombinations.h"
+#include "stdlib/blas/base/shared.h"
+#include "stdlib/napi/export.h"
+#include "stdlib/napi/argv.h"
+#include "stdlib/napi/argv_int32.h"
+#include "stdlib/napi/argv_int64.h"
+#include "stdlib/napi/argv_bool.h"
+#include "stdlib/napi/argv_strided_float64array.h"
+#include "stdlib/napi/argv_strided_float64array2d.h"
+#include "stdlib/napi/argv_strided_int32array.h"
+#include "stdlib/math/base/special/binomcoef.h"
+#include
+#include
+#include
+
+
+// MAIN //
+
+/**
+* Receives JavaScript callback invocation data.
+*
+* @param env environment under which the function is invoked
+* @param info callback data
+* @return Node-API value
+*/
+static napi_value addon( napi_env env, napi_callback_info info ) {
+ STDLIB_NAPI_ARGV( env, info, argv, argc, 10 );
+ STDLIB_NAPI_ARGV_INT32( env, order, argv, 0 );
+ STDLIB_NAPI_ARGV_INT64( env, N, argv, 1 );
+ STDLIB_NAPI_ARGV_INT64( env, k, argv, 2 );
+ STDLIB_NAPI_ARGV_BOOL( env, replacement, argv, 3 );
+ STDLIB_NAPI_ARGV_INT64( env, strideX, argv, 5 );
+ STDLIB_NAPI_ARGV_INT64( env, LDO, argv, 7 );
+ STDLIB_NAPI_ARGV_INT64( env, strideW, argv, 9 );
+
+ int64_t C = 0;
+ if ( replacement ) {
+ C = (int64_t)stdlib_base_binomcoef( N+k-1, k );
+ } else {
+ C = (int64_t)stdlib_base_binomcoef( N, k );
+ }
+
+ CBLAS_INT so1;
+ CBLAS_INT so2;
+ if ( order == CblasColMajor ) {
+ so1 = 1;
+ so2 = LDO;
+ } else { // order == CblasRowMajor
+ so1 = LDO;
+ so2 = 1;
+ }
+
+ STDLIB_NAPI_ARGV_STRIDED_FLOAT64ARRAY( env, X, N, strideX, argv, 4 );
+ STDLIB_NAPI_ARGV_STRIDED_FLOAT64ARRAY2D( env, Out, C, k, so1, so2, argv, 6 );
+ STDLIB_NAPI_ARGV_STRIDED_INT32ARRAY( env, Workspace, k, strideW, argv, 8 );
+ API_SUFFIX(stdlib_strided_dcombinations)( order, N, k, replacement, X, strideX, Out, LDO, Workspace, strideW );
+
+ return NULL;
+}
+
+/**
+* Receives JavaScript callback invocation data.
+*
+* @param env environment under which the function is invoked
+* @param info callback data
+* @return Node-API value
+*/
+static napi_value addon_method( napi_env env, napi_callback_info info ) {
+ STDLIB_NAPI_ARGV( env, info, argv, argc, 13 );
+ STDLIB_NAPI_ARGV_INT64( env, N, argv, 0 );
+ STDLIB_NAPI_ARGV_INT64( env, k, argv, 1 );
+ STDLIB_NAPI_ARGV_BOOL( env, replacement, argv, 2 );
+ STDLIB_NAPI_ARGV_INT64( env, strideX, argv, 4 );
+ STDLIB_NAPI_ARGV_INT64( env, offsetX, argv, 5 );
+ STDLIB_NAPI_ARGV_INT64( env, strideOut1, argv, 7 );
+ STDLIB_NAPI_ARGV_INT64( env, strideOut2, argv, 8 );
+ STDLIB_NAPI_ARGV_INT64( env, offsetOut, argv, 9 );
+ STDLIB_NAPI_ARGV_INT64( env, strideW, argv, 11 );
+ STDLIB_NAPI_ARGV_INT64( env, offsetW, argv, 12 );
+
+ int64_t C = 0;
+ if ( replacement ) {
+ C = (int64_t)stdlib_base_binomcoef( N+k-1, k );
+ } else {
+ C = (int64_t)stdlib_base_binomcoef( N, k );
+ }
+
+ STDLIB_NAPI_ARGV_STRIDED_FLOAT64ARRAY( env, X, N, strideX, argv, 3 );
+ STDLIB_NAPI_ARGV_STRIDED_FLOAT64ARRAY2D( env, Out, C, k, strideOut1, strideOut2, argv, 6 );
+ STDLIB_NAPI_ARGV_STRIDED_INT32ARRAY( env, Workspace, k, strideW, argv, 10 );
+ API_SUFFIX(stdlib_strided_dcombinations_ndarray)( N, k, replacement, X, strideX, offsetX, Out, strideOut1, strideOut2, offsetOut, Workspace, strideW, offsetW );
+
+ return NULL;
+}
+
+STDLIB_NAPI_MODULE_EXPORT_FCN_WITH_METHOD( addon, "ndarray", addon_method )
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/src/main.c b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/src/main.c
new file mode 100644
index 000000000000..ef560b8b25ee
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/src/main.c
@@ -0,0 +1,253 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2026 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.
+*/
+
+#include "stdlib/blas/ext/base/dcombinations.h"
+#include "stdlib/ndarray/base/assert/is_row_major.h"
+#include "stdlib/blas/base/dcopy.h"
+#include "stdlib/blas/ext/base/dfill.h"
+#include "stdlib/blas/base/shared.h"
+#include "stdlib/strided/base/stride2offset.h"
+#include "stdlib/math/base/special/binomcoef.h"
+#include
+#include
+
+
+// FUNCTIONS //
+
+/**
+* Initializes a workspace with the indices of the first combination of a specified length.
+*
+* @private
+* @param k combination length
+* @param replacement boolean indicating whether to allow duplication in combination
+* @param Workspace workspace array
+* @param strideW stride length for Workspace
+* @param offsetW starting index for Workspace
+*/
+static void API_SUFFIX(stdlib_strided_internal_dcombinations_first_combination)( const CBLAS_INT k, const bool replacement, int32_t *Workspace, const CBLAS_INT strideW, const CBLAS_INT offsetW ) {
+ CBLAS_INT iw;
+ CBLAS_INT p;
+
+ iw = offsetW;
+ if ( replacement ) {
+ for ( p = 0; p < k; p++ ) {
+ Workspace[ iw ] = 0;
+ iw += strideW;
+ }
+ } else {
+ for ( p = 0; p < k; p++ ) {
+ Workspace[ iw ] = p;
+ iw += strideW;
+ }
+ }
+}
+
+/**
+* Advances a workspace to the indices of the next combination of a specified length.
+*
+* ## Notes
+*
+* - If a workspace contains the last combination, the workspace is left unchanged.
+*
+* @private
+* @param k combination length
+* @param N number of indexed elements
+* @param replacement boolean indicating whether to allow duplication in combination
+* @param Workspace workspace array
+* @param strideW stride length for Workspace
+* @param offsetW starting index for Workspace
+*/
+static void API_SUFFIX(stdlib_strided_internal_dcombinations_next_combination)( const CBLAS_INT k, const CBLAS_INT N, const bool replacement, int32_t *Workspace, const CBLAS_INT strideW, const CBLAS_INT offsetW ) {
+ CBLAS_INT val;
+ CBLAS_INT iw;
+ CBLAS_INT i;
+ CBLAS_INT p;
+
+ // Starting from the rightmost index, find the rightmost index which can be incremented...
+ iw = offsetW + ( ( k-1 ) * strideW );
+ i = k - 1;
+ if ( replacement ) {
+ while ( i >= 0 && Workspace[ iw ] == N - 1 ) {
+ i -= 1;
+ iw -= strideW;
+ }
+ if ( i >= 0 ) {
+ val = Workspace[ iw ] + 1;
+ for ( p = i; p < k; p++ ) {
+ Workspace[ iw ] = val;
+ iw += strideW;
+ }
+ }
+ } else {
+ while ( i >= 0 && Workspace[ iw ] == N - k + i ) {
+ i -= 1;
+ iw -= strideW;
+ }
+ if ( i >= 0 ) {
+ Workspace[ iw ] += 1;
+ val = Workspace[ iw ];
+ for ( p = i + 1; p < k; p++ ) {
+ iw += strideW;
+ val += 1;
+ Workspace[ iw ] = val;
+ }
+ }
+ }
+}
+
+
+// MAIN //
+
+/**
+* Computes combinations of a specified length from double-precision floating-point strided array elements.
+*
+* @param order storage layout
+* @param N number of indexed elements
+* @param k number of elements to combine
+* @param replacement boolean indicating whether to allow duplication in combination
+* @param X input array
+* @param strideX stride length for X
+* @param Out output array
+* @param LDO stride length between successive contiguous vectors of the matrix Out (a.k.a., leading dimension of Out)
+* @param Workspace workspace array
+* @param strideW stride length for Workspace
+*/
+void API_SUFFIX(stdlib_strided_dcombinations)( const CBLAS_LAYOUT order, const CBLAS_INT N, const CBLAS_INT k, const bool replacement, const double *X, const CBLAS_INT strideX, double *Out, const CBLAS_INT LDO, int32_t *Workspace, const CBLAS_INT strideW ) {
+ CBLAS_INT so1;
+ CBLAS_INT so2;
+ int64_t ox;
+ int64_t ow;
+
+ if ( order == CblasColMajor ) {
+ so1 = 1;
+ so2 = LDO;
+ } else { // order == CblasRowMajor
+ so1 = LDO;
+ so2 = 1;
+ }
+ ox = (int64_t)stdlib_strided_stride2offset( N, strideX );
+ ow = (int64_t)stdlib_strided_stride2offset( k, strideW );
+ API_SUFFIX(stdlib_strided_dcombinations_ndarray)( N, k, replacement, X, strideX, ox, Out, so1, so2, 0, Workspace, strideW, ow );
+}
+
+/**
+* Computes combinations of a specified length from double-precision floating-point strided array elements using alternative indexing semantics.
+*
+* @param N number of indexed elements
+* @param k number of elements to combine
+* @param replacement boolean indicating whether to allow duplication in combination
+* @param X input array
+* @param strideX stride length for X
+* @param offsetX starting index for X
+* @param Out output array
+* @param strideOut1 stride length for the first dimension of Out
+* @param strideOut2 stride length for the second dimension of Out
+* @param offsetOut starting index for Out
+* @param Workspace workspace array
+* @param strideW stride length for Workspace
+* @param offsetW starting index for Workspace
+*/
+void API_SUFFIX(stdlib_strided_dcombinations_ndarray)( const CBLAS_INT N, const CBLAS_INT k, const bool replacement, const double *X, const CBLAS_INT strideX, const CBLAS_INT offsetX, double *Out, const CBLAS_INT strideOut1, const CBLAS_INT strideOut2, const CBLAS_INT offsetOut, int32_t *Workspace, const CBLAS_INT strideW, const CBLAS_INT offsetW ) {
+ int64_t sa[ 2 ];
+ int64_t runLen;
+ CBLAS_INT rem;
+ CBLAS_INT io;
+ CBLAS_INT iw;
+ CBLAS_INT oj;
+ CBLAS_INT np;
+ CBLAS_INT L;
+ CBLAS_INT j;
+ CBLAS_INT v;
+ int64_t C;
+ int64_t c;
+
+ if ( N <= 0 || k <= 0 ) {
+ return;
+ }
+ if ( !replacement && k > N ) {
+ return;
+ }
+ // For `k` equal to one, each combination consists of a single element, and, thus, we can directly copy the input array elements to the output array (i.e., no need for a workspace)...
+ if ( k == 1 ) {
+ API_SUFFIX(c_dcopy_ndarray)( N, X, strideX, offsetX, Out, strideOut1, offsetOut );
+ return;
+ }
+ sa[ 0 ] = strideOut1;
+ sa[ 1 ] = strideOut2;
+ if ( stdlib_ndarray_is_row_major( 2, sa ) ) {
+ // For row-major order, combinations are stored as contiguous rows, and, thus, we resolve one combination at a time, writing each combination's elements consecutively...
+
+ // Compute the total number of combinations:
+ if ( replacement ) {
+ C = (int64_t)stdlib_base_binomcoef( N + k - 1, k );
+ } else {
+ C = (int64_t)stdlib_base_binomcoef( N, k );
+ }
+ API_SUFFIX(stdlib_strided_internal_dcombinations_first_combination)( k, replacement, Workspace, strideW, offsetW );
+ io = offsetOut;
+ for ( c = 0; c < C; c++ ) {
+ // Resolve the current combination's indices to input array values and write them to the output array:
+ iw = offsetW;
+ oj = io;
+ for ( j = 0; j < k; j++ ) {
+ Out[ oj ] = X[ offsetX + ( Workspace[ iw ] * strideX ) ];
+ oj += strideOut2;
+ iw += strideW;
+ }
+ io += strideOut1;
+ API_SUFFIX(stdlib_strided_internal_dcombinations_next_combination)( k, N, replacement, Workspace, strideW, offsetW );
+ }
+ } else {
+ // For column-major order, the elements at a given combination position are stored contiguously within a column. As consecutive combinations share long prefixes, each column consists of runs of repeated elements (with run lengths equal to binomial coefficients), and, thus, we can fill each column as a sequence of contiguous runs...
+ for ( j = 0; j < k; j++ ) {
+ // The `j`-th column is determined by the `(j+1)`-element prefixes of each combination, enumerated in lexicographic order:
+ L = j + 1;
+ rem = k - 1 - j;
+
+ // Enumerate only those prefixes which can be completed to a full combination. Without replacement, a prefix is extendable only if its last index leaves room for the remaining `rem` elements, and, thus, we restrict enumeration to a reduced universe of `N-rem` indices in order to avoid generating zero-length runs:
+ if ( replacement ) {
+ np = N;
+ C = (int64_t)stdlib_base_binomcoef( N + L - 1, L );
+ } else {
+ np = N - rem;
+ C = (int64_t)stdlib_base_binomcoef( np, L );
+ }
+ API_SUFFIX(stdlib_strided_internal_dcombinations_first_combination)( L, replacement, Workspace, strideW, offsetW );
+ io = offsetOut + ( j * strideOut2 );
+
+ // Resolve the workspace index of each prefix's last element (i.e., the column's index value), which is invariant across prefixes:
+ iw = offsetW + ( ( L-1 ) * strideW );
+ for ( c = 0; c < C; c++ ) {
+ v = Workspace[ iw ];
+
+ // Resolve the run length (i.e., the number of ways to complete the remaining `rem` positions with indices not less than `v`):
+ if ( rem == 0 ) {
+ runLen = 1;
+ } else if ( replacement ) {
+ runLen = (int64_t)stdlib_base_binomcoef( N - v + rem - 1, rem );
+ } else {
+ runLen = (int64_t)stdlib_base_binomcoef( N - 1 - v, rem );
+ }
+ // Write a run of the resolved input array value down the column:
+ API_SUFFIX(stdlib_strided_dfill_ndarray)( (CBLAS_INT)runLen, X[ offsetX + ( v * strideX ) ], Out, strideOut1, io );
+ io += (CBLAS_INT)runLen * strideOut1;
+ API_SUFFIX(stdlib_strided_internal_dcombinations_next_combination)( L, np, replacement, Workspace, strideW, offsetW );
+ }
+ }
+ }
+}
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/test/test.dcombinations.js b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/test/test.dcombinations.js
new file mode 100644
index 000000000000..ec07580a9e17
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/test/test.dcombinations.js
@@ -0,0 +1,667 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2026 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 tape = require( 'tape' );
+var Float64Array = require( '@stdlib/array/float64' );
+var Int32Array = require( '@stdlib/array/int32' );
+var dcombinations = require( './../lib/dcombinations.js' );
+
+
+// TESTS //
+
+tape( 'main export is a function', function test( t ) {
+ t.ok( true, __filename );
+ t.strictEqual( typeof dcombinations, 'function', 'main export is a function' );
+ t.end();
+});
+
+tape( 'the function has an arity of 10', function test( t ) {
+ t.strictEqual( dcombinations.length, 10, 'has expected arity' );
+ t.end();
+});
+
+tape( 'the function throws if the first argument is not a valid order', function test( t ) {
+ var values;
+ var i;
+
+ values = [
+ 'foo',
+ 'bar',
+ 1,
+ 0,
+ null,
+ true,
+ false,
+ void 0,
+ [],
+ {}
+ ];
+ for ( i = 0; i < values.length; i++ ) {
+ t.throws( badValue( values[ i ] ), TypeError, 'throws an error when provided ' + values[ i ] );
+ }
+ t.end();
+
+ function badValue( value ) {
+ return function badValue() {
+ var out = new Float64Array( 12 );
+ var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ var w = new Int32Array( 2 );
+ dcombinations( value, 4, 2, false, x, 1, out, 2, w, 1 );
+ };
+ }
+});
+
+tape( 'the function throws if the eighth argument is less than max(1,k) (row-major)', function test( t ) {
+ t.throws( badValue, RangeError, 'throws a range error' );
+ t.end();
+
+ function badValue() {
+ var out = new Float64Array( 12 );
+ var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ var w = new Int32Array( 2 );
+ dcombinations( 'row-major', 4, 2, false, x, 1, out, 1, w, 1 );
+ }
+});
+
+tape( 'the function throws if the eighth argument is less than max(1,C(N,k)) (column-major)', function test( t ) {
+ t.throws( badValue, RangeError, 'throws a range error' );
+ t.end();
+
+ function badValue() {
+ var out = new Float64Array( 12 );
+ var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ var w = new Int32Array( 2 );
+ dcombinations( 'column-major', 4, 2, false, x, 1, out, 5, w, 1 );
+ }
+});
+
+tape( 'the function computes combinations without replacement', function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 2.0,
+ 1.0,
+ 3.0,
+ 1.0,
+ 4.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 4.0,
+ 3.0,
+ 4.0
+ ]);
+
+ dcombinations( 'row-major', 4, 2, false, x, 1, out, 2, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( 6 );
+ w = new Int32Array( 1 );
+ expected = new Float64Array([
+ 1.0,
+ 0.0,
+ 2.0,
+ 0.0,
+ 3.0,
+ 0.0
+ ]);
+
+ dcombinations( 'row-major', 3, 1, false, x, 1, out, 2, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 5.0 ] );
+ out = new Float64Array( 1 );
+ w = new Int32Array( 1 );
+ expected = new Float64Array( [ 5.0 ] );
+
+ dcombinations( 'row-major', 1, 1, false, x, 1, out, 1, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+ w = new Int32Array( 4 );
+ expected = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+
+ dcombinations( 'row-major', 3, 4, false, x, 1, out, 4, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 3.0,
+ 4.0,
+ 3.0,
+ 4.0,
+ 4.0
+ ]);
+
+ dcombinations( 'column-major', 4, 2, false, x, 1, out, 6, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( 6 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 3.0
+ ]);
+
+ dcombinations( 'column-major', 3, 2, false, x, 1, out, 3, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 5.0 ] );
+ out = new Float64Array( 1 );
+ w = new Int32Array( 1 );
+ expected = new Float64Array( [ 5.0 ] );
+
+ dcombinations( 'column-major', 1, 1, false, x, 1, out, 1, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+ w = new Int32Array( 4 );
+ expected = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+
+ dcombinations( 'column-major', 3, 4, false, x, 1, out, 4, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function computes combinations with replacement', function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 1.0,
+ 3.0,
+ 2.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 3.0,
+ 3.0
+ ]);
+
+ dcombinations( 'row-major', 3, 2, true, x, 1, out, 2, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0 ] );
+ out = new Float64Array( 6 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 2.0
+ ]);
+
+ dcombinations( 'row-major', 2, 2, true, x, 1, out, 2, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 3 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 2.0,
+ 2.0,
+ 2.0
+ ]);
+
+ dcombinations( 'row-major', 2, 3, true, x, 1, out, 3, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 1.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 3.0,
+ 3.0
+ ]);
+
+ dcombinations( 'column-major', 3, 2, true, x, 1, out, 6, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0 ] );
+ out = new Float64Array( 6 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 2.0,
+ 1.0,
+ 2.0,
+ 2.0
+ ]);
+
+ dcombinations( 'column-major', 2, 2, true, x, 1, out, 3, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 3 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 2.0
+ ]);
+
+ dcombinations( 'column-major', 2, 3, true, x, 1, out, 4, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function returns a reference to the output array', function test( t ) {
+ var out;
+ var x;
+ var z;
+ var w;
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ z = dcombinations( 'row-major', 4, 2, false, x, 1, out, 2, w, 1 );
+
+ t.strictEqual( z, out, 'same reference' );
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ z = dcombinations( 'column-major', 4, 2, false, x, 1, out, 6, w, 1 );
+
+ t.strictEqual( z, out, 'same reference' );
+
+ t.end();
+});
+
+tape( 'if provided an `N` parameter equal to `0`, the function returns the output array unchanged', function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+ w = new Int32Array( 2 );
+ expected = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+
+ dcombinations( 'row-major', 0, 2, false, x, 1, out, 2, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+ w = new Int32Array( 2 );
+ expected = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+
+ dcombinations( 'column-major', 0, 2, false, x, 1, out, 2, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'if provided a `k` parameter equal to `0`, the function returns the output array unchanged', function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+ w = new Int32Array( 0 );
+ expected = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+
+ dcombinations( 'row-major', 3, 0, false, x, 1, out, 2, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+ w = new Int32Array( 0 );
+ expected = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+
+ dcombinations( 'column-major', 3, 0, false, x, 1, out, 2, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function supports specifying a stride for `x`', function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major:
+ x = new Float64Array([
+ 1.0, // 0
+ 0.0,
+ 2.0, // 1
+ 0.0,
+ 3.0, // 2
+ 0.0,
+ 4.0 // 3
+ ]);
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 2.0,
+ 1.0,
+ 3.0,
+ 1.0,
+ 4.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 4.0,
+ 3.0,
+ 4.0
+ ]);
+
+ dcombinations( 'row-major', 4, 2, false, x, 2, out, 2, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major:
+ x = new Float64Array([
+ 1.0, // 0
+ 0.0,
+ 2.0, // 1
+ 0.0,
+ 3.0, // 2
+ 0.0,
+ 4.0 // 3
+ ]);
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 3.0,
+ 4.0,
+ 3.0,
+ 4.0,
+ 4.0
+ ]);
+
+ dcombinations( 'column-major', 4, 2, false, x, 2, out, 6, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function supports specifying a negative stride for `x`', function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major:
+ x = new Float64Array([
+ 4.0, // 3
+ 3.0, // 2
+ 2.0, // 1
+ 1.0 // 0
+ ]);
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 2.0,
+ 1.0,
+ 3.0,
+ 1.0,
+ 4.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 4.0,
+ 3.0,
+ 4.0
+ ]);
+
+ dcombinations( 'row-major', 4, 2, false, x, -1, out, 2, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major:
+ x = new Float64Array([
+ 4.0, // 3
+ 3.0, // 2
+ 2.0, // 1
+ 1.0 // 0
+ ]);
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 3.0,
+ 4.0,
+ 3.0,
+ 4.0,
+ 4.0
+ ]);
+
+ dcombinations( 'column-major', 4, 2, false, x, -1, out, 6, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function supports specifying a leading dimension stride for the output array', function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 24 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 2.0,
+ 0.0,
+ 0.0,
+ 1.0,
+ 3.0,
+ 0.0,
+ 0.0,
+ 1.0,
+ 4.0,
+ 0.0,
+ 0.0,
+ 2.0,
+ 3.0,
+ 0.0,
+ 0.0,
+ 2.0,
+ 4.0,
+ 0.0,
+ 0.0,
+ 3.0,
+ 4.0,
+ 0.0,
+ 0.0
+ ]);
+
+ dcombinations( 'row-major', 4, 2, false, x, 1, out, 4, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 16 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 0.0,
+ 0.0,
+ 2.0,
+ 3.0,
+ 4.0,
+ 3.0,
+ 4.0,
+ 4.0,
+ 0.0,
+ 0.0
+ ]);
+
+ dcombinations( 'column-major', 4, 2, false, x, 1, out, 8, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function supports view offsets', function test( t ) {
+ var expected;
+ var out;
+ var x0;
+ var x1;
+ var w;
+
+ // Row-major:
+ x0 = new Float64Array( [ 0.0, 1.0, 2.0, 3.0, 4.0 ] );
+ x1 = new Float64Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 );
+
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 2.0,
+ 1.0,
+ 3.0,
+ 1.0,
+ 4.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 4.0,
+ 3.0,
+ 4.0
+ ]);
+
+ dcombinations( 'row-major', 4, 2, false, x1, 1, out, 2, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major:
+ x0 = new Float64Array( [ 0.0, 1.0, 2.0, 3.0, 4.0 ] );
+ x1 = new Float64Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 );
+
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 3.0,
+ 4.0,
+ 3.0,
+ 4.0,
+ 4.0
+ ]);
+
+ dcombinations( 'column-major', 4, 2, false, x1, 1, out, 6, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/test/test.dcombinations.native.js b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/test/test.dcombinations.native.js
new file mode 100644
index 000000000000..fddd69ca3952
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/test/test.dcombinations.native.js
@@ -0,0 +1,676 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2026 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 resolve = require( 'path' ).resolve;
+var tape = require( 'tape' );
+var Float64Array = require( '@stdlib/array/float64' );
+var Int32Array = require( '@stdlib/array/int32' );
+var tryRequire = require( '@stdlib/utils/try-require' );
+
+
+// VARIABLES //
+
+var dcombinations = tryRequire( resolve( __dirname, './../lib/dcombinations.native.js' ) );
+var opts = {
+ 'skip': ( dcombinations instanceof Error )
+};
+
+
+// TESTS //
+
+tape( 'main export is a function', opts, function test( t ) {
+ t.ok( true, __filename );
+ t.strictEqual( typeof dcombinations, 'function', 'main export is a function' );
+ t.end();
+});
+
+tape( 'the function has an arity of 10', opts, function test( t ) {
+ t.strictEqual( dcombinations.length, 10, 'has expected arity' );
+ t.end();
+});
+
+tape( 'the function throws if the first argument is not a valid order', opts, function test( t ) {
+ var values;
+ var i;
+
+ values = [
+ 'foo',
+ 'bar',
+ 1,
+ 0,
+ null,
+ true,
+ false,
+ void 0,
+ [],
+ {}
+ ];
+ for ( i = 0; i < values.length; i++ ) {
+ t.throws( badValue( values[ i ] ), TypeError, 'throws an error when provided ' + values[ i ] );
+ }
+ t.end();
+
+ function badValue( value ) {
+ return function badValue() {
+ var out = new Float64Array( 12 );
+ var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ var w = new Int32Array( 2 );
+ dcombinations( value, 4, 2, false, x, 1, out, 2, w, 1 );
+ };
+ }
+});
+
+tape( 'the function throws if the eighth argument is less than max(1,k) (row-major)', opts, function test( t ) {
+ t.throws( badValue, RangeError, 'throws a range error' );
+ t.end();
+
+ function badValue() {
+ var out = new Float64Array( 12 );
+ var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ var w = new Int32Array( 2 );
+ dcombinations( 'row-major', 4, 2, false, x, 1, out, 1, w, 1 );
+ }
+});
+
+tape( 'the function throws if the eighth argument is less than max(1,C(N,k)) (column-major)', opts, function test( t ) {
+ t.throws( badValue, RangeError, 'throws a range error' );
+ t.end();
+
+ function badValue() {
+ var out = new Float64Array( 12 );
+ var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ var w = new Int32Array( 2 );
+ dcombinations( 'column-major', 4, 2, false, x, 1, out, 5, w, 1 );
+ }
+});
+
+tape( 'the function computes combinations without replacement', opts, function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 2.0,
+ 1.0,
+ 3.0,
+ 1.0,
+ 4.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 4.0,
+ 3.0,
+ 4.0
+ ]);
+
+ dcombinations( 'row-major', 4, 2, false, x, 1, out, 2, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( 6 );
+ w = new Int32Array( 1 );
+ expected = new Float64Array([
+ 1.0,
+ 0.0,
+ 2.0,
+ 0.0,
+ 3.0,
+ 0.0
+ ]);
+
+ dcombinations( 'row-major', 3, 1, false, x, 1, out, 2, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 5.0 ] );
+ out = new Float64Array( 1 );
+ w = new Int32Array( 1 );
+ expected = new Float64Array( [ 5.0 ] );
+
+ dcombinations( 'row-major', 1, 1, false, x, 1, out, 1, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+ w = new Int32Array( 4 );
+ expected = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+
+ dcombinations( 'row-major', 3, 4, false, x, 1, out, 4, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 3.0,
+ 4.0,
+ 3.0,
+ 4.0,
+ 4.0
+ ]);
+
+ dcombinations( 'column-major', 4, 2, false, x, 1, out, 6, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( 6 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 3.0
+ ]);
+
+ dcombinations( 'column-major', 3, 2, false, x, 1, out, 3, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 5.0 ] );
+ out = new Float64Array( 1 );
+ w = new Int32Array( 1 );
+ expected = new Float64Array( [ 5.0 ] );
+
+ dcombinations( 'column-major', 1, 1, false, x, 1, out, 1, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+ w = new Int32Array( 4 );
+ expected = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+
+ dcombinations( 'column-major', 3, 4, false, x, 1, out, 4, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function computes combinations with replacement', opts, function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 1.0,
+ 3.0,
+ 2.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 3.0,
+ 3.0
+ ]);
+
+ dcombinations( 'row-major', 3, 2, true, x, 1, out, 2, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0 ] );
+ out = new Float64Array( 6 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 2.0
+ ]);
+
+ dcombinations( 'row-major', 2, 2, true, x, 1, out, 2, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 3 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 2.0,
+ 2.0,
+ 2.0
+ ]);
+
+ dcombinations( 'row-major', 2, 3, true, x, 1, out, 3, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 1.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 3.0,
+ 3.0
+ ]);
+
+ dcombinations( 'column-major', 3, 2, true, x, 1, out, 6, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0 ] );
+ out = new Float64Array( 6 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 2.0,
+ 1.0,
+ 2.0,
+ 2.0
+ ]);
+
+ dcombinations( 'column-major', 2, 2, true, x, 1, out, 3, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 3 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 2.0
+ ]);
+
+ dcombinations( 'column-major', 2, 3, true, x, 1, out, 4, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function returns a reference to the output array', opts, function test( t ) {
+ var out;
+ var x;
+ var z;
+ var w;
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ z = dcombinations( 'row-major', 4, 2, false, x, 1, out, 2, w, 1 );
+
+ t.strictEqual( z, out, 'same reference' );
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ z = dcombinations( 'column-major', 4, 2, false, x, 1, out, 6, w, 1 );
+
+ t.strictEqual( z, out, 'same reference' );
+
+ t.end();
+});
+
+tape( 'if provided an `N` parameter equal to `0`, the function returns the output array unchanged', opts, function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+ w = new Int32Array( 2 );
+ expected = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+
+ dcombinations( 'row-major', 0, 2, false, x, 1, out, 2, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+ w = new Int32Array( 2 );
+ expected = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+
+ dcombinations( 'column-major', 0, 2, false, x, 1, out, 2, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'if provided a `k` parameter equal to `0`, the function returns the output array unchanged', opts, function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+ w = new Int32Array( 0 );
+ expected = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+
+ dcombinations( 'row-major', 3, 0, false, x, 1, out, 2, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+ w = new Int32Array( 0 );
+ expected = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+
+ dcombinations( 'column-major', 3, 0, false, x, 1, out, 2, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function supports specifying a stride for `x`', opts, function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major:
+ x = new Float64Array([
+ 1.0, // 0
+ 0.0,
+ 2.0, // 1
+ 0.0,
+ 3.0, // 2
+ 0.0,
+ 4.0 // 3
+ ]);
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 2.0,
+ 1.0,
+ 3.0,
+ 1.0,
+ 4.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 4.0,
+ 3.0,
+ 4.0
+ ]);
+
+ dcombinations( 'row-major', 4, 2, false, x, 2, out, 2, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major:
+ x = new Float64Array([
+ 1.0, // 0
+ 0.0,
+ 2.0, // 1
+ 0.0,
+ 3.0, // 2
+ 0.0,
+ 4.0 // 3
+ ]);
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 3.0,
+ 4.0,
+ 3.0,
+ 4.0,
+ 4.0
+ ]);
+
+ dcombinations( 'column-major', 4, 2, false, x, 2, out, 6, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function supports specifying a negative stride for `x`', opts, function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major:
+ x = new Float64Array([
+ 4.0, // 3
+ 3.0, // 2
+ 2.0, // 1
+ 1.0 // 0
+ ]);
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 2.0,
+ 1.0,
+ 3.0,
+ 1.0,
+ 4.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 4.0,
+ 3.0,
+ 4.0
+ ]);
+
+ dcombinations( 'row-major', 4, 2, false, x, -1, out, 2, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major:
+ x = new Float64Array([
+ 4.0, // 3
+ 3.0, // 2
+ 2.0, // 1
+ 1.0 // 0
+ ]);
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 3.0,
+ 4.0,
+ 3.0,
+ 4.0,
+ 4.0
+ ]);
+
+ dcombinations( 'column-major', 4, 2, false, x, -1, out, 6, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function supports specifying a leading dimension stride for the output array', opts, function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 24 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 2.0,
+ 0.0,
+ 0.0,
+ 1.0,
+ 3.0,
+ 0.0,
+ 0.0,
+ 1.0,
+ 4.0,
+ 0.0,
+ 0.0,
+ 2.0,
+ 3.0,
+ 0.0,
+ 0.0,
+ 2.0,
+ 4.0,
+ 0.0,
+ 0.0,
+ 3.0,
+ 4.0,
+ 0.0,
+ 0.0
+ ]);
+
+ dcombinations( 'row-major', 4, 2, false, x, 1, out, 4, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 16 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 0.0,
+ 0.0,
+ 2.0,
+ 3.0,
+ 4.0,
+ 3.0,
+ 4.0,
+ 4.0,
+ 0.0,
+ 0.0
+ ]);
+
+ dcombinations( 'column-major', 4, 2, false, x, 1, out, 8, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function supports view offsets', opts, function test( t ) {
+ var expected;
+ var out;
+ var x0;
+ var x1;
+ var w;
+
+ // Row-major:
+ x0 = new Float64Array( [ 0.0, 1.0, 2.0, 3.0, 4.0 ] );
+ x1 = new Float64Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 );
+
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 2.0,
+ 1.0,
+ 3.0,
+ 1.0,
+ 4.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 4.0,
+ 3.0,
+ 4.0
+ ]);
+
+ dcombinations( 'row-major', 4, 2, false, x1, 1, out, 2, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major:
+ x0 = new Float64Array( [ 0.0, 1.0, 2.0, 3.0, 4.0 ] );
+ x1 = new Float64Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 );
+
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 3.0,
+ 4.0,
+ 3.0,
+ 4.0,
+ 4.0
+ ]);
+
+ dcombinations( 'column-major', 4, 2, false, x1, 1, out, 6, w, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/test/test.js b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/test/test.js
new file mode 100644
index 000000000000..0d396d2dd730
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/test/test.js
@@ -0,0 +1,82 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2026 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 tape = require( 'tape' );
+var proxyquire = require( 'proxyquire' );
+var IS_BROWSER = require( '@stdlib/assert/is-browser' );
+var dcombinations = require( './../lib' );
+
+
+// VARIABLES //
+
+var opts = {
+ 'skip': IS_BROWSER
+};
+
+
+// TESTS //
+
+tape( 'main export is a function', function test( t ) {
+ t.ok( true, __filename );
+ t.strictEqual( typeof dcombinations, 'function', 'main export is a function' );
+ t.end();
+});
+
+tape( 'attached to the main export is a method providing an ndarray interface', function test( t ) {
+ t.strictEqual( typeof dcombinations.ndarray, 'function', 'method is a function' );
+ t.end();
+});
+
+tape( 'if a native implementation is available, the main export is the native implementation', opts, function test( t ) {
+ var dcombinations = proxyquire( './../lib', {
+ '@stdlib/utils/try-require': tryRequire
+ });
+
+ t.strictEqual( dcombinations, mock, 'returns native implementation' );
+ t.end();
+
+ function tryRequire() {
+ return mock;
+ }
+
+ function mock() {
+ // Mock...
+ }
+});
+
+tape( 'if a native implementation is not available, the main export is a JavaScript implementation', opts, function test( t ) {
+ var dcombinations;
+ var main;
+
+ main = require( './../lib/main.js' );
+
+ dcombinations = proxyquire( './../lib', {
+ '@stdlib/utils/try-require': tryRequire
+ });
+
+ t.strictEqual( dcombinations, main, 'returns JavaScript implementation' );
+ t.end();
+
+ function tryRequire() {
+ return new Error( 'Cannot find module' );
+ }
+});
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/test/test.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/test/test.ndarray.js
new file mode 100644
index 000000000000..dbce2d32ebf1
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/test/test.ndarray.js
@@ -0,0 +1,812 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2026 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 tape = require( 'tape' );
+var Float64Array = require( '@stdlib/array/float64' );
+var Int32Array = require( '@stdlib/array/int32' );
+var dcombinations = require( './../lib/ndarray.js' );
+
+
+// TESTS //
+
+tape( 'main export is a function', function test( t ) {
+ t.ok( true, __filename );
+ t.strictEqual( typeof dcombinations, 'function', 'main export is a function' );
+ t.end();
+});
+
+tape( 'the function has an arity of 13', function test( t ) {
+ t.strictEqual( dcombinations.length, 13, 'has expected arity' );
+ t.end();
+});
+
+tape( 'the function computes combinations without replacement', function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major (so1=2, so2=1):
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 2.0,
+ 1.0,
+ 3.0,
+ 1.0,
+ 4.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 4.0,
+ 3.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 0, out, 2, 1, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // `k=1` (each combination is a single element):
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 8 );
+ w = new Int32Array( 1 );
+ expected = new Float64Array( [ 1.0, 0.0, 2.0, 0.0, 3.0, 0.0, 4.0, 0.0 ] );
+
+ dcombinations( 4, 1, false, x, 1, 0, out, 2, 1, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+ w = new Int32Array( 4 );
+ expected = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+
+ dcombinations( 3, 4, false, x, 1, 0, out, 2, 1, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major (so1=1, so2=6):
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 3.0,
+ 4.0,
+ 3.0,
+ 4.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 0, out, 1, 6, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( 6 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 3.0
+ ]);
+
+ dcombinations( 3, 2, false, x, 1, 0, out, 1, 3, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // `k=1` with an offset (each combination is a single element):
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 6 );
+ w = new Int32Array( 1 );
+ expected = new Float64Array( [ 0.0, 0.0, 1.0, 2.0, 3.0, 4.0 ] );
+
+ dcombinations( 4, 1, false, x, 1, 0, out, 1, 1, 2, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+ w = new Int32Array( 4 );
+ expected = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+
+ dcombinations( 3, 4, false, x, 1, 0, out, 1, 2, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function computes combinations with replacement', function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major (so1=2, so2=1):
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 1.0,
+ 3.0,
+ 2.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 3.0,
+ 3.0
+ ]);
+
+ dcombinations( 3, 2, true, x, 1, 0, out, 2, 1, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0 ] );
+ out = new Float64Array( 6 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 2.0
+ ]);
+
+ dcombinations( 2, 2, true, x, 1, 0, out, 2, 1, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 3 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 2.0,
+ 2.0,
+ 2.0
+ ]);
+
+ dcombinations( 2, 3, true, x, 1, 0, out, 3, 1, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major (so1=1, so2=6):
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 1.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 3.0,
+ 3.0
+ ]);
+
+ dcombinations( 3, 2, true, x, 1, 0, out, 1, 6, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0 ] );
+ out = new Float64Array( 6 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 2.0,
+ 1.0,
+ 2.0,
+ 2.0
+ ]);
+
+ dcombinations( 2, 2, true, x, 1, 0, out, 1, 3, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 3 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 2.0
+ ]);
+
+ dcombinations( 2, 3, true, x, 1, 0, out, 1, 4, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function returns a reference to the output array', function test( t ) {
+ var out;
+ var x;
+ var z;
+ var w;
+
+ // Row-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ z = dcombinations( 4, 2, false, x, 1, 0, out, 2, 1, 0, w, 1, 0 );
+
+ t.strictEqual( z, out, 'same reference' );
+
+ // Column-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ z = dcombinations( 4, 2, false, x, 1, 0, out, 1, 6, 0, w, 1, 0 );
+
+ t.strictEqual( z, out, 'same reference' );
+
+ t.end();
+});
+
+tape( 'if provided an `N` parameter equal to `0`, the function returns the output array unchanged', function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+ w = new Int32Array( 2 );
+ expected = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+
+ dcombinations( 0, 2, false, x, 1, 0, out, 2, 1, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+ w = new Int32Array( 2 );
+ expected = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+
+ dcombinations( 0, 2, false, x, 1, 0, out, 1, 2, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'if provided a `k` parameter equal to `0`, the function returns the output array unchanged', function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+ w = new Int32Array( 0 );
+ expected = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+
+ dcombinations( 3, 0, false, x, 1, 0, out, 2, 1, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+ w = new Int32Array( 0 );
+ expected = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+
+ dcombinations( 3, 0, false, x, 1, 0, out, 1, 2, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function supports specifying a stride for `x`', function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major:
+ x = new Float64Array([
+ 1.0, // 0
+ 0.0,
+ 2.0, // 1
+ 0.0,
+ 3.0, // 2
+ 0.0,
+ 4.0 // 3
+ ]);
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 2.0,
+ 1.0,
+ 3.0,
+ 1.0,
+ 4.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 4.0,
+ 3.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 2, 0, out, 2, 1, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major:
+ x = new Float64Array([
+ 1.0, // 0
+ 0.0,
+ 2.0, // 1
+ 0.0,
+ 3.0, // 2
+ 0.0,
+ 4.0 // 3
+ ]);
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 3.0,
+ 4.0,
+ 3.0,
+ 4.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 2, 0, out, 1, 6, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function supports specifying a negative stride for `x`', function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major:
+ x = new Float64Array([
+ 4.0, // 3
+ 3.0, // 2
+ 2.0, // 1
+ 1.0 // 0
+ ]);
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 2.0,
+ 1.0,
+ 3.0,
+ 1.0,
+ 4.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 4.0,
+ 3.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, -1, 3, out, 2, 1, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major:
+ x = new Float64Array([
+ 4.0, // 3
+ 3.0, // 2
+ 2.0, // 1
+ 1.0 // 0
+ ]);
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 3.0,
+ 4.0,
+ 3.0,
+ 4.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, -1, 3, out, 1, 6, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function supports specifying a stride for the output array', function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 24 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 2.0,
+ 0.0,
+ 0.0,
+ 1.0,
+ 3.0,
+ 0.0,
+ 0.0,
+ 1.0,
+ 4.0,
+ 0.0,
+ 0.0,
+ 2.0,
+ 3.0,
+ 0.0,
+ 0.0,
+ 2.0,
+ 4.0,
+ 0.0,
+ 0.0,
+ 3.0,
+ 4.0,
+ 0.0,
+ 0.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 0, out, 4, 1, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 16 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 0.0,
+ 0.0,
+ 2.0,
+ 3.0,
+ 4.0,
+ 3.0,
+ 4.0,
+ 4.0,
+ 0.0,
+ 0.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 0, out, 1, 8, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function supports specifying negative strides for the output array', function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Negative stride for the first dimension:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 3.0,
+ 4.0,
+ 2.0,
+ 4.0,
+ 2.0,
+ 3.0,
+ 1.0,
+ 4.0,
+ 1.0,
+ 3.0,
+ 1.0,
+ 2.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 0, out, -2, 1, 10, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Negative stride for the second dimension:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 2.0,
+ 1.0,
+ 3.0,
+ 1.0,
+ 4.0,
+ 1.0,
+ 3.0,
+ 2.0,
+ 4.0,
+ 2.0,
+ 4.0,
+ 3.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 0, out, 2, -1, 1, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function supports an `offsetX` parameter', function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major:
+ x = new Float64Array( [ 0.0, 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 2.0,
+ 1.0,
+ 3.0,
+ 1.0,
+ 4.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 4.0,
+ 3.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 1, out, 2, 1, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major:
+ x = new Float64Array( [ 0.0, 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 3.0,
+ 4.0,
+ 3.0,
+ 4.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 1, out, 1, 6, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function supports an `offsetOut` parameter', function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 14 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 0.0,
+ 0.0,
+ 1.0,
+ 2.0,
+ 1.0,
+ 3.0,
+ 1.0,
+ 4.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 4.0,
+ 3.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 0, out, 2, 1, 2, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 14 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 0.0,
+ 0.0,
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 3.0,
+ 4.0,
+ 3.0,
+ 4.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 0, out, 1, 6, 2, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function supports specifying a stride for `workspace`', function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 4 );
+ expected = new Float64Array([
+ 1.0,
+ 2.0,
+ 1.0,
+ 3.0,
+ 1.0,
+ 4.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 4.0,
+ 3.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 0, out, 2, 1, 0, w, 2, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 4 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 3.0,
+ 4.0,
+ 3.0,
+ 4.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 0, out, 1, 6, 0, w, 2, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function supports an `offsetW` parameter', function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 4 );
+ expected = new Float64Array([
+ 1.0,
+ 2.0,
+ 1.0,
+ 3.0,
+ 1.0,
+ 4.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 4.0,
+ 3.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 0, out, 2, 1, 0, w, 1, 2 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 4 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 3.0,
+ 4.0,
+ 3.0,
+ 4.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 0, out, 1, 6, 0, w, 1, 2 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcombinations/test/test.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/test/test.ndarray.native.js
new file mode 100644
index 000000000000..759833865841
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcombinations/test/test.ndarray.native.js
@@ -0,0 +1,821 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2026 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 resolve = require( 'path' ).resolve;
+var tape = require( 'tape' );
+var Float64Array = require( '@stdlib/array/float64' );
+var Int32Array = require( '@stdlib/array/int32' );
+var tryRequire = require( '@stdlib/utils/try-require' );
+
+
+// VARIABLES //
+
+var dcombinations = tryRequire( resolve( __dirname, './../lib/ndarray.native.js' ) );
+var opts = {
+ 'skip': ( dcombinations instanceof Error )
+};
+
+
+// TESTS //
+
+tape( 'main export is a function', opts, function test( t ) {
+ t.ok( true, __filename );
+ t.strictEqual( typeof dcombinations, 'function', 'main export is a function' );
+ t.end();
+});
+
+tape( 'the function has an arity of 13', opts, function test( t ) {
+ t.strictEqual( dcombinations.length, 13, 'has expected arity' );
+ t.end();
+});
+
+tape( 'the function computes combinations without replacement', opts, function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major (so1=2, so2=1):
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 2.0,
+ 1.0,
+ 3.0,
+ 1.0,
+ 4.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 4.0,
+ 3.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 0, out, 2, 1, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // `k=1` (each combination is a single element):
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 8 );
+ w = new Int32Array( 1 );
+ expected = new Float64Array( [ 1.0, 0.0, 2.0, 0.0, 3.0, 0.0, 4.0, 0.0 ] );
+
+ dcombinations( 4, 1, false, x, 1, 0, out, 2, 1, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+ w = new Int32Array( 4 );
+ expected = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+
+ dcombinations( 3, 4, false, x, 1, 0, out, 2, 1, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major (so1=1, so2=6):
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 3.0,
+ 4.0,
+ 3.0,
+ 4.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 0, out, 1, 6, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( 6 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 3.0
+ ]);
+
+ dcombinations( 3, 2, false, x, 1, 0, out, 1, 3, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // `k=1` with an offset (each combination is a single element):
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 6 );
+ w = new Int32Array( 1 );
+ expected = new Float64Array( [ 0.0, 0.0, 1.0, 2.0, 3.0, 4.0 ] );
+
+ dcombinations( 4, 1, false, x, 1, 0, out, 1, 1, 2, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+ w = new Int32Array( 4 );
+ expected = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+
+ dcombinations( 3, 4, false, x, 1, 0, out, 1, 2, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function computes combinations with replacement', opts, function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major (so1=2, so2=1):
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 1.0,
+ 3.0,
+ 2.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 3.0,
+ 3.0
+ ]);
+
+ dcombinations( 3, 2, true, x, 1, 0, out, 2, 1, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0 ] );
+ out = new Float64Array( 6 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 2.0
+ ]);
+
+ dcombinations( 2, 2, true, x, 1, 0, out, 2, 1, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 3 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 2.0,
+ 2.0,
+ 2.0
+ ]);
+
+ dcombinations( 2, 3, true, x, 1, 0, out, 3, 1, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major (so1=1, so2=6):
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 1.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 3.0,
+ 3.0
+ ]);
+
+ dcombinations( 3, 2, true, x, 1, 0, out, 1, 6, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0 ] );
+ out = new Float64Array( 6 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 2.0,
+ 1.0,
+ 2.0,
+ 2.0
+ ]);
+
+ dcombinations( 2, 2, true, x, 1, 0, out, 1, 3, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 3 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 2.0
+ ]);
+
+ dcombinations( 2, 3, true, x, 1, 0, out, 1, 4, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function returns a reference to the output array', opts, function test( t ) {
+ var out;
+ var x;
+ var z;
+ var w;
+
+ // Row-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ z = dcombinations( 4, 2, false, x, 1, 0, out, 2, 1, 0, w, 1, 0 );
+
+ t.strictEqual( z, out, 'same reference' );
+
+ // Column-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ z = dcombinations( 4, 2, false, x, 1, 0, out, 1, 6, 0, w, 1, 0 );
+
+ t.strictEqual( z, out, 'same reference' );
+
+ t.end();
+});
+
+tape( 'if provided an `N` parameter equal to `0`, the function returns the output array unchanged', opts, function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+ w = new Int32Array( 2 );
+ expected = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+
+ dcombinations( 0, 2, false, x, 1, 0, out, 2, 1, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+ w = new Int32Array( 2 );
+ expected = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+
+ dcombinations( 0, 2, false, x, 1, 0, out, 1, 2, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'if provided a `k` parameter equal to `0`, the function returns the output array unchanged', opts, function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+ w = new Int32Array( 0 );
+ expected = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+
+ dcombinations( 3, 0, false, x, 1, 0, out, 2, 1, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
+ out = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+ w = new Int32Array( 0 );
+ expected = new Float64Array( [ 5.0, 6.0, 7.0, 8.0 ] );
+
+ dcombinations( 3, 0, false, x, 1, 0, out, 1, 2, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function supports specifying a stride for `x`', opts, function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major:
+ x = new Float64Array([
+ 1.0, // 0
+ 0.0,
+ 2.0, // 1
+ 0.0,
+ 3.0, // 2
+ 0.0,
+ 4.0 // 3
+ ]);
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 2.0,
+ 1.0,
+ 3.0,
+ 1.0,
+ 4.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 4.0,
+ 3.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 2, 0, out, 2, 1, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major:
+ x = new Float64Array([
+ 1.0, // 0
+ 0.0,
+ 2.0, // 1
+ 0.0,
+ 3.0, // 2
+ 0.0,
+ 4.0 // 3
+ ]);
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 3.0,
+ 4.0,
+ 3.0,
+ 4.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 2, 0, out, 1, 6, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function supports specifying a negative stride for `x`', opts, function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major:
+ x = new Float64Array([
+ 4.0, // 3
+ 3.0, // 2
+ 2.0, // 1
+ 1.0 // 0
+ ]);
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 2.0,
+ 1.0,
+ 3.0,
+ 1.0,
+ 4.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 4.0,
+ 3.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, -1, 3, out, 2, 1, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major:
+ x = new Float64Array([
+ 4.0, // 3
+ 3.0, // 2
+ 2.0, // 1
+ 1.0 // 0
+ ]);
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 3.0,
+ 4.0,
+ 3.0,
+ 4.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, -1, 3, out, 1, 6, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function supports specifying a stride for the output array', opts, function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 24 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 2.0,
+ 0.0,
+ 0.0,
+ 1.0,
+ 3.0,
+ 0.0,
+ 0.0,
+ 1.0,
+ 4.0,
+ 0.0,
+ 0.0,
+ 2.0,
+ 3.0,
+ 0.0,
+ 0.0,
+ 2.0,
+ 4.0,
+ 0.0,
+ 0.0,
+ 3.0,
+ 4.0,
+ 0.0,
+ 0.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 0, out, 4, 1, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 16 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 0.0,
+ 0.0,
+ 2.0,
+ 3.0,
+ 4.0,
+ 3.0,
+ 4.0,
+ 4.0,
+ 0.0,
+ 0.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 0, out, 1, 8, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function supports specifying negative strides for the output array', opts, function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Negative stride for the first dimension:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 3.0,
+ 4.0,
+ 2.0,
+ 4.0,
+ 2.0,
+ 3.0,
+ 1.0,
+ 4.0,
+ 1.0,
+ 3.0,
+ 1.0,
+ 2.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 0, out, -2, 1, 10, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Negative stride for the second dimension:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 2.0,
+ 1.0,
+ 3.0,
+ 1.0,
+ 4.0,
+ 1.0,
+ 3.0,
+ 2.0,
+ 4.0,
+ 2.0,
+ 4.0,
+ 3.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 0, out, 2, -1, 1, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function supports an `offsetX` parameter', opts, function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major:
+ x = new Float64Array( [ 0.0, 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 2.0,
+ 1.0,
+ 3.0,
+ 1.0,
+ 4.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 4.0,
+ 3.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 1, out, 2, 1, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major:
+ x = new Float64Array( [ 0.0, 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 3.0,
+ 4.0,
+ 3.0,
+ 4.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 1, out, 1, 6, 0, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function supports an `offsetOut` parameter', opts, function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 14 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 0.0,
+ 0.0,
+ 1.0,
+ 2.0,
+ 1.0,
+ 3.0,
+ 1.0,
+ 4.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 4.0,
+ 3.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 0, out, 2, 1, 2, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 14 );
+ w = new Int32Array( 2 );
+ expected = new Float64Array([
+ 0.0,
+ 0.0,
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 3.0,
+ 4.0,
+ 3.0,
+ 4.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 0, out, 1, 6, 2, w, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function supports specifying a stride for `workspace`', opts, function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 4 );
+ expected = new Float64Array([
+ 1.0,
+ 2.0,
+ 1.0,
+ 3.0,
+ 1.0,
+ 4.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 4.0,
+ 3.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 0, out, 2, 1, 0, w, 2, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 4 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 3.0,
+ 4.0,
+ 3.0,
+ 4.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 0, out, 1, 6, 0, w, 2, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function supports an `offsetW` parameter', opts, function test( t ) {
+ var expected;
+ var out;
+ var x;
+ var w;
+
+ // Row-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 4 );
+ expected = new Float64Array([
+ 1.0,
+ 2.0,
+ 1.0,
+ 3.0,
+ 1.0,
+ 4.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 4.0,
+ 3.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 0, out, 2, 1, 0, w, 1, 2 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ // Column-major:
+ x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
+ out = new Float64Array( 12 );
+ w = new Int32Array( 4 );
+ expected = new Float64Array([
+ 1.0,
+ 1.0,
+ 1.0,
+ 2.0,
+ 2.0,
+ 3.0,
+ 2.0,
+ 3.0,
+ 4.0,
+ 3.0,
+ 4.0,
+ 4.0
+ ]);
+
+ dcombinations( 4, 2, false, x, 1, 0, out, 1, 6, 0, w, 1, 2 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});