diff --git a/lib/node_modules/@stdlib/blas/ext/base/gfiedler/README.md b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/README.md
new file mode 100644
index 000000000000..895ec4c497f8
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/README.md
@@ -0,0 +1,191 @@
+
+
+# gfiedler
+
+> Generate a Fiedler matrix.
+
+
+
+
+
+
+
+## Usage
+
+```javascript
+var gfiedler = require( '@stdlib/blas/ext/base/gfiedler' );
+```
+
+#### gfiedler( order, N, x, strideX, out, ldo )
+
+Generates a Fiedler matrix.
+
+```javascript
+var x = [ 1.0, 4.0, 12.0 ];
+var out = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];
+
+gfiedler( 'row-major', 3, x, 1, out, 3 );
+// out => [ 0.0, 3.0, 11.0, 3.0, 0.0, 8.0, 11.0, 8.0, 0.0 ]
+```
+
+The function has the following parameters:
+
+- **order**: row-major (C-style) or column-major (Fortran-style) order.
+- **N**: number of indexed elements in `x`.
+- **x**: input [`Array`][mdn-array] or [`typed array`][mdn-typed-array] containing coefficients.
+- **strideX**: stride length for `x`.
+- **out**: output matrix.
+- **ldo**: stride between successive contiguous vectors of the matrix `out` (a.k.a., leading dimension of the matrix `out`). Must be greater than or equal to `max(1,N)`.
+
+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' );
+
+// Initial arrays:
+var x0 = new Float64Array( [ 999.0, 1.0, 4.0 ] );
+var out0 = new Float64Array( [ 0.0, 0.0, 0.0, 0.0, 0.0 ] );
+
+// Create offset views:
+var x1 = new Float64Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); // start at 2nd element
+var out1 = new Float64Array( out0.buffer, out0.BYTES_PER_ELEMENT*1 ); // start at 2nd element
+
+gfiedler( 'row-major', 2, x1, 1, out1, 2 );
+// out0 => [ 0.0, 0.0, 3.0, 3.0, 0.0 ]
+```
+
+
+
+#### gfiedler.ndarray( N, x, strideX, offsetX, out, strideOut1, strideOut2, offsetOut )
+
+
+
+Generates a Fiedler matrix using alternative indexing semantics.
+
+```javascript
+var x = [ 1.0, 4.0, 12.0 ];
+var out = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];
+
+gfiedler.ndarray( 3, x, 1, 0, out, 3, 1, 0 );
+// out => [ 0.0, 3.0, 11.0, 3.0, 0.0, 8.0, 11.0, 8.0, 0.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`.
+
+While [`typed array`][mdn-typed-array] views mandate a view offset based on the underlying buffer, the offset parameters support indexing semantics based on starting indices. For example, to start writing matrix elements from the second element of the output array:
+
+```javascript
+var x = [ 1.0, 4.0 ];
+var out = [ 0.0, 0.0, 0.0, 0.0, 0.0 ];
+
+gfiedler.ndarray( 2, x, 1, 0, out, 2, 1, 1 );
+// out => [ 0.0, 0.0, 3.0, 3.0, 0.0 ]
+```
+
+
+
+
+
+
+
+## Notes
+
+- If `N <= 0`, both functions return `out` unchanged.
+- Given `N` coefficients, both functions generate an `N`-by-`N` symmetric matrix in which the element at row `i` and column `j` is the absolute difference between the coefficients at indices `i` and `j`.
+- Both functions support array-like objects having getter and setter accessors for array element access (e.g., [`@stdlib/array/base/accessor`][@stdlib/array/base/accessor]).
+
+
+
+
+
+
+
+## Examples
+
+
+
+```javascript
+var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var zeros = require( '@stdlib/array/zeros' );
+var gfiedler = require( '@stdlib/blas/ext/base/gfiedler' );
+
+var N = 5;
+var order = 'row-major';
+var shape = [ N, N ];
+var strides = shape2strides( shape, order );
+
+var x = discreteUniform( N, 1, 10, {
+ 'dtype': 'generic'
+});
+console.log( x );
+
+var out = zeros( N*N, 'generic' );
+
+gfiedler( order, N, x, 1, out, N );
+console.log( ndarray2array( out, shape, strides, 0, order ) );
+```
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+[mdn-array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array
+
+[mdn-typed-array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray
+
+[@stdlib/array/base/accessor]: https://github.com/stdlib-js/stdlib/tree/develop/lib/node_modules/%40stdlib/array/base/accessor
+
+
+
+
+
+
+
+
diff --git a/lib/node_modules/@stdlib/blas/ext/base/gfiedler/benchmark/benchmark.js b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/benchmark/benchmark.js
new file mode 100644
index 000000000000..771e4dc9c853
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/benchmark/benchmark.js
@@ -0,0 +1,110 @@
+/**
+* @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 isnan = require( '@stdlib/math/base/assert/is-nan' );
+var pow = require( '@stdlib/math/base/special/pow' );
+var uniform = require( '@stdlib/random/array/uniform' );
+var zeros = require( '@stdlib/array/zeros' );
+var format = require( '@stdlib/string/format' );
+var pkg = require( './../package.json' ).name;
+var gfiedler = require( './../lib/main.js' );
+
+
+// VARIABLES //
+
+var options = {
+ 'dtype': 'generic'
+};
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - array length
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len ) {
+ var out;
+ var x;
+
+ x = uniform( len, 1.0, 10.0, options );
+ out = zeros( len * len, options.dtype );
+
+ return benchmark;
+
+ /**
+ * Benchmark function.
+ *
+ * @private
+ * @param {Benchmark} b - benchmark instance
+ */
+ function benchmark( b ) {
+ var v;
+ var i;
+
+ b.tic();
+ for ( i = 0; i < b.iterations; i++ ) {
+ x[ 0 ] += 0.1;
+ v = gfiedler( 'row-major', len, x, 1, out, len );
+ if ( isnan( v[ i%v.length ] ) ) {
+ b.fail( 'should not return NaN' );
+ }
+ }
+ b.toc();
+ if ( isnan( v[ i%v.length ] ) ) {
+ 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/gfiedler/benchmark/benchmark.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/benchmark/benchmark.ndarray.js
new file mode 100644
index 000000000000..bf7348fcb05e
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/benchmark/benchmark.ndarray.js
@@ -0,0 +1,110 @@
+/**
+* @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 isnan = require( '@stdlib/math/base/assert/is-nan' );
+var pow = require( '@stdlib/math/base/special/pow' );
+var uniform = require( '@stdlib/random/array/uniform' );
+var zeros = require( '@stdlib/array/zeros' );
+var format = require( '@stdlib/string/format' );
+var pkg = require( './../package.json' ).name;
+var gfiedler = require( './../lib/ndarray.js' );
+
+
+// VARIABLES //
+
+var options = {
+ 'dtype': 'generic'
+};
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - array length
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len ) {
+ var out;
+ var x;
+
+ x = uniform( len, 1.0, 10.0, options );
+ out = zeros( len * len, options.dtype );
+
+ return benchmark;
+
+ /**
+ * Benchmark function.
+ *
+ * @private
+ * @param {Benchmark} b - benchmark instance
+ */
+ function benchmark( b ) {
+ var v;
+ var i;
+
+ b.tic();
+ for ( i = 0; i < b.iterations; i++ ) {
+ x[ 0 ] += 0.1;
+ v = gfiedler( len, x, 1, 0, out, len, 1, 0 );
+ if ( isnan( v[ i%v.length ] ) ) {
+ b.fail( 'should not return NaN' );
+ }
+ }
+ b.toc();
+ if ( isnan( v[ i%v.length ] ) ) {
+ 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/gfiedler/docs/repl.txt b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/docs/repl.txt
new file mode 100644
index 000000000000..856a858cb286
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/docs/repl.txt
@@ -0,0 +1,107 @@
+
+{{alias}}( order, N, x, strideX, out, ldo )
+ Generates a Fiedler matrix.
+
+ Given `N` coefficients, the function generates an `N`-by-`N` symmetric
+ matrix in which the element at row `i` and column `j` is the absolute
+ difference between the coefficients at indices `i` and `j`.
+
+ The `N` and stride parameters determine which elements in the strided array
+ are accessed at runtime.
+
+ If `N` is less than or equal to `0`, the function returns `out` unchanged.
+
+ Parameters
+ ----------
+ order: string
+ Storage layout.
+
+ N: integer
+ Number of indexed elements in `x`.
+
+ x: ArrayLikeObject
+ Input array containing coefficients.
+
+ strideX: integer
+ Stride length for `x`.
+
+ out: ArrayLikeObject
+ Output array.
+
+ ldo: integer
+ Stride length between successive contiguous vectors of the matrix
+ `out` (a.k.a., leading dimension of `out`). Must be greater than or
+ equal to `max(1,N)`.
+
+ Returns
+ -------
+ out: ArrayLikeObject
+ Output array.
+
+ Examples
+ --------
+ // Standard Usage:
+ > var x = [ 1.0, 4.0 ];
+ > var out = [ 0.0, 0.0, 0.0, 0.0 ];
+ > {{alias}}( 'row-major', 2, x, 1, out, 2 )
+ [ 0.0, 3.0, 3.0, 0.0 ]
+
+ // Using a leading dimension greater than `N`:
+ > out = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];
+ > {{alias}}( 'row-major', 2, x, 1, out, 3 )
+ [ 0.0, 3.0, 0.0, 3.0, 0.0, 0.0 ]
+
+
+{{alias}}.ndarray( N, x, sx, ox, out, so1, so2, oo )
+ Generates a Fiedler matrix 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 starting
+ indices.
+
+ Parameters
+ ----------
+ N: integer
+ Number of indexed elements in `x`.
+
+ x: ArrayLikeObject
+ Input array containing coefficients.
+
+ sx: integer
+ Stride length for `x`.
+
+ ox: integer
+ Starting index for `x`.
+
+ out: ArrayLikeObject
+ 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`.
+
+ Returns
+ -------
+ out: ArrayLikeObject
+ Output array.
+
+ Examples
+ --------
+ // Standard Usage:
+ > var x = [ 1.0, 4.0 ];
+ > var out = [ 0.0, 0.0, 0.0, 0.0 ];
+ > {{alias}}.ndarray( 2, x, 1, 0, out, 2, 1, 0 )
+ [ 0.0, 3.0, 3.0, 0.0 ]
+
+ // Using an index offset:
+ > out = [ 0.0, 0.0, 0.0, 0.0, 0.0 ];
+ > {{alias}}.ndarray( 2, x, 1, 0, out, 2, 1, 1 )
+ [ 0.0, 0.0, 3.0, 3.0, 0.0 ]
+
+ See Also
+ --------
diff --git a/lib/node_modules/@stdlib/blas/ext/base/gfiedler/docs/types/index.d.ts b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/docs/types/index.d.ts
new file mode 100644
index 000000000000..ab28d79a3a7d
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/docs/types/index.d.ts
@@ -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.
+*/
+
+// TypeScript Version: 4.1
+
+///
+
+import { Collection, AccessorArrayLike } from '@stdlib/types/array';
+import { Layout } from '@stdlib/types/blas';
+
+/**
+* Input array.
+*/
+type InputArray = Collection | AccessorArrayLike;
+
+/**
+* Output array.
+*/
+type OutputArray = Collection | AccessorArrayLike;
+
+/**
+* Interface describing `gfiedler`.
+*/
+interface Routine {
+ /**
+ * Generates a Fiedler matrix.
+ *
+ * @param order - storage layout
+ * @param N - number of indexed elements in `x`
+ * @param x - input array containing coefficients
+ * @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`)
+ * @returns output array
+ *
+ * @example
+ * var x = [ 1.0, 4.0, 12.0 ];
+ * var out = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];
+ *
+ * gfiedler( 'row-major', 3, x, 1, out, 3 );
+ * // out => [ 0.0, 3.0, 11.0, 3.0, 0.0, 8.0, 11.0, 8.0, 0.0 ]
+ */
+ = OutputArray>( order: Layout, N: number, x: InputArray, strideX: number, out: V, ldo: number ): V;
+
+ /**
+ * Generates a Fiedler matrix using alternative indexing semantics.
+ *
+ * @param N - number of indexed elements in `x`
+ * @param x - input array containing coefficients
+ * @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`
+ * @returns output array
+ *
+ * @example
+ * var x = [ 1.0, 4.0, 12.0 ];
+ * var out = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];
+ *
+ * gfiedler.ndarray( 3, x, 1, 0, out, 3, 1, 0 );
+ * // out => [ 0.0, 3.0, 11.0, 3.0, 0.0, 8.0, 11.0, 8.0, 0.0 ]
+ */
+ ndarray = OutputArray>( N: number, x: InputArray, strideX: number, offsetX: number, out: V, strideOut1: number, strideOut2: number, offsetOut: number ): V;
+}
+
+/**
+* Generates a Fiedler matrix.
+*
+* @param order - storage layout
+* @param N - number of indexed elements in `x`
+* @param x - input array containing coefficients
+* @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`)
+* @returns output array
+*
+* @example
+* var x = [ 1.0, 4.0, 12.0 ];
+* var out = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];
+*
+* gfiedler( 'row-major', 3, x, 1, out, 3 );
+* // out => [ 0.0, 3.0, 11.0, 3.0, 0.0, 8.0, 11.0, 8.0, 0.0 ]
+*
+* @example
+* var x = [ 1.0, 4.0, 12.0 ];
+* var out = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];
+*
+* gfiedler.ndarray( 3, x, 1, 0, out, 3, 1, 0 );
+* // out => [ 0.0, 3.0, 11.0, 3.0, 0.0, 8.0, 11.0, 8.0, 0.0 ]
+*/
+declare var gfiedler: Routine;
+
+
+// EXPORTS //
+
+export = gfiedler;
diff --git a/lib/node_modules/@stdlib/blas/ext/base/gfiedler/docs/types/test.ts b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/docs/types/test.ts
new file mode 100644
index 000000000000..9f31c83d2a86
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/docs/types/test.ts
@@ -0,0 +1,275 @@
+/*
+* @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 space-in-parens */
+
+import AccessorArray = require( '@stdlib/array/base/accessor' );
+import gfiedler = require( './index' );
+
+
+// TESTS //
+
+// The function returns a collection...
+{
+ const x = new Float64Array( 3 );
+ const out = new Float64Array( 9 );
+
+ gfiedler( 'row-major', 3, x, 1, out, 3 ); // $ExpectType Float64Array
+ gfiedler( 'row-major', 3, x, 1, new AccessorArray( out ), 3 ); // $ExpectType AccessorArray
+}
+
+// The compiler throws an error if the function is provided a first argument which is not a valid order...
+{
+ const x = new Float64Array( 3 );
+ const out = new Float64Array( 9 );
+
+ gfiedler( 10, 3, x, 1, out, 3 ); // $ExpectError
+ gfiedler( true, 3, x, 1, out, 3 ); // $ExpectError
+ gfiedler( false, 3, x, 1, out, 3 ); // $ExpectError
+ gfiedler( null, 3, x, 1, out, 3 ); // $ExpectError
+ gfiedler( undefined, 3, x, 1, out, 3 ); // $ExpectError
+ gfiedler( [], 3, x, 1, out, 3 ); // $ExpectError
+ gfiedler( {}, 3, x, 1, out, 3 ); // $ExpectError
+ gfiedler( ( x: number ): number => x, 3, x, 1, out, 3 ); // $ExpectError
+}
+
+// The compiler throws an error if the function is provided a second argument which is not a number...
+{
+ const x = new Float64Array( 3 );
+ const out = new Float64Array( 9 );
+
+ gfiedler( 'row-major', '10', x, 1, out, 3 ); // $ExpectError
+ gfiedler( 'row-major', true, x, 1, out, 3 ); // $ExpectError
+ gfiedler( 'row-major', false, x, 1, out, 3 ); // $ExpectError
+ gfiedler( 'row-major', null, x, 1, out, 3 ); // $ExpectError
+ gfiedler( 'row-major', undefined, x, 1, out, 3 ); // $ExpectError
+ gfiedler( 'row-major', [], x, 1, out, 3 ); // $ExpectError
+ gfiedler( 'row-major', {}, x, 1, out, 3 ); // $ExpectError
+ gfiedler( 'row-major', ( x: number ): number => x, x, 1, out, 3 ); // $ExpectError
+}
+
+// The compiler throws an error if the function is provided a third argument which is not a collection...
+{
+ const out = new Float64Array( 9 );
+
+ gfiedler( 'row-major', 3, 10, 1, out, 3 ); // $ExpectError
+ gfiedler( 'row-major', 3, true, 1, out, 3 ); // $ExpectError
+ gfiedler( 'row-major', 3, false, 1, out, 3 ); // $ExpectError
+ gfiedler( 'row-major', 3, null, 1, out, 3 ); // $ExpectError
+ gfiedler( 'row-major', 3, undefined, 1, out, 3 ); // $ExpectError
+ gfiedler( 'row-major', 3, {}, 1, out, 3 ); // $ExpectError
+ gfiedler( 'row-major', 3, ( x: number ): number => x, 1, out, 3 ); // $ExpectError
+}
+
+// The compiler throws an error if the function is provided a fourth argument which is not a number...
+{
+ const x = new Float64Array( 3 );
+ const out = new Float64Array( 9 );
+
+ gfiedler( 'row-major', 3, x, '10', out, 3 ); // $ExpectError
+ gfiedler( 'row-major', 3, x, true, out, 3 ); // $ExpectError
+ gfiedler( 'row-major', 3, x, false, out, 3 ); // $ExpectError
+ gfiedler( 'row-major', 3, x, null, out, 3 ); // $ExpectError
+ gfiedler( 'row-major', 3, x, undefined, out, 3 ); // $ExpectError
+ gfiedler( 'row-major', 3, x, [], out, 3 ); // $ExpectError
+ gfiedler( 'row-major', 3, x, {}, out, 3 ); // $ExpectError
+ gfiedler( 'row-major', 3, x, ( x: number ): number => x, out, 3 ); // $ExpectError
+}
+
+// The compiler throws an error if the function is provided a fifth argument which is not a collection...
+{
+ const x = new Float64Array( 3 );
+
+ gfiedler( 'row-major', 3, x, 1, 10, 3 ); // $ExpectError
+ gfiedler( 'row-major', 3, x, 1, true, 3 ); // $ExpectError
+ gfiedler( 'row-major', 3, x, 1, false, 3 ); // $ExpectError
+ gfiedler( 'row-major', 3, x, 1, null, 3 ); // $ExpectError
+ gfiedler( 'row-major', 3, x, 1, undefined, 3 ); // $ExpectError
+ gfiedler( 'row-major', 3, x, 1, {}, 3 ); // $ExpectError
+ gfiedler( 'row-major', 3, x, 1, ( x: number ): number => x, 3 ); // $ExpectError
+}
+
+// The compiler throws an error if the function is provided a sixth argument which is not a number...
+{
+ const x = new Float64Array( 3 );
+ const out = new Float64Array( 9 );
+
+ gfiedler( 'row-major', 3, x, 1, out, '10' ); // $ExpectError
+ gfiedler( 'row-major', 3, x, 1, out, true ); // $ExpectError
+ gfiedler( 'row-major', 3, x, 1, out, false ); // $ExpectError
+ gfiedler( 'row-major', 3, x, 1, out, null ); // $ExpectError
+ gfiedler( 'row-major', 3, x, 1, out, undefined ); // $ExpectError
+ gfiedler( 'row-major', 3, x, 1, out, [] ); // $ExpectError
+ gfiedler( 'row-major', 3, x, 1, out, {} ); // $ExpectError
+ gfiedler( 'row-major', 3, x, 1, out, ( x: number ): number => x ); // $ExpectError
+}
+
+// The compiler throws an error if the function is provided an unsupported number of arguments...
+{
+ const x = new Float64Array( 3 );
+ const out = new Float64Array( 9 );
+
+ gfiedler(); // $ExpectError
+ gfiedler( 'row-major' ); // $ExpectError
+ gfiedler( 'row-major', 3 ); // $ExpectError
+ gfiedler( 'row-major', 3, x ); // $ExpectError
+ gfiedler( 'row-major', 3, x, 1 ); // $ExpectError
+ gfiedler( 'row-major', 3, x, 1, out ); // $ExpectError
+ gfiedler( 'row-major', 3, x, 1, out, 3, 10 ); // $ExpectError
+}
+
+// Attached to the main export is an `ndarray` method which returns a collection...
+{
+ const x = new Float64Array( 3 );
+ const out = new Float64Array( 9 );
+
+ gfiedler.ndarray( 3, x, 1, 0, out, 3, 1, 0 ); // $ExpectType Float64Array
+ gfiedler.ndarray( 3, x, 1, 0, new AccessorArray( out ), 3, 1, 0 ); // $ExpectType AccessorArray
+}
+
+// The compiler throws an error if the `ndarray` method is provided a first argument which is not a number...
+{
+ const x = new Float64Array( 3 );
+ const out = new Float64Array( 9 );
+
+ gfiedler.ndarray( '10', x, 1, 0, out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( true, x, 1, 0, out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( false, x, 1, 0, out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( null, x, 1, 0, out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( undefined, x, 1, 0, out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( [], x, 1, 0, out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( {}, x, 1, 0, out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( ( x: number ): number => x, x, 1, 0, out, 3, 1, 0 ); // $ExpectError
+}
+
+// The compiler throws an error if the `ndarray` method is provided a second argument which is not a collection...
+{
+ const out = new Float64Array( 9 );
+
+ gfiedler.ndarray( 3, 10, 1, 0, out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, true, 1, 0, out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, false, 1, 0, out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, null, 1, 0, out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, undefined, 1, 0, out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, {}, 1, 0, out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, ( x: number ): number => x, 1, 0, out, 3, 1, 0 ); // $ExpectError
+}
+
+// The compiler throws an error if the `ndarray` method is provided a third argument which is not a number...
+{
+ const x = new Float64Array( 3 );
+ const out = new Float64Array( 9 );
+
+ gfiedler.ndarray( 3, x, '10', 0, out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, true, 0, out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, false, 0, out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, null, 0, out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, undefined, 0, out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, [], 0, out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, {}, 0, out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, ( x: number ): number => x, 0, out, 3, 1, 0 ); // $ExpectError
+}
+
+// The compiler throws an error if the `ndarray` method is provided a fourth argument which is not a number...
+{
+ const x = new Float64Array( 3 );
+ const out = new Float64Array( 9 );
+
+ gfiedler.ndarray( 3, x, 1, '10', out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, true, out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, false, out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, null, out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, undefined, out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, [], out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, {}, out, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, ( x: number ): number => x, out, 3, 1, 0 ); // $ExpectError
+}
+
+// The compiler throws an error if the `ndarray` method is provided a fifth argument which is not a collection...
+{
+ const x = new Float64Array( 3 );
+
+ gfiedler.ndarray( 3, x, 1, 0, 10, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, true, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, false, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, null, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, undefined, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, {}, 3, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, ( x: number ): number => x, 3, 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( 3 );
+ const out = new Float64Array( 9 );
+
+ gfiedler.ndarray( 3, x, 1, 0, out, '10', 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, out, true, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, out, false, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, out, null, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, out, undefined, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, out, [], 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, out, {}, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, out, ( x: number ): number => x, 1, 0 ); // $ExpectError
+}
+
+// The compiler throws an error if the `ndarray` method is provided a seventh argument which is not a number...
+{
+ const x = new Float64Array( 3 );
+ const out = new Float64Array( 9 );
+
+ gfiedler.ndarray( 3, x, 1, 0, out, 3, '10', 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, out, 3, true, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, out, 3, false, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, out, 3, null, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, out, 3, undefined, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, out, 3, [], 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, out, 3, {}, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, out, 3, ( x: number ): number => x, 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( 3 );
+ const out = new Float64Array( 9 );
+
+ gfiedler.ndarray( 3, x, 1, 0, out, 3, 1, '10' ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, out, 3, 1, true ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, out, 3, 1, false ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, out, 3, 1, null ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, out, 3, 1, undefined ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, out, 3, 1, [] ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, out, 3, 1, {} ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, out, 3, 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( 3 );
+ const out = new Float64Array( 9 );
+
+ gfiedler.ndarray(); // $ExpectError
+ gfiedler.ndarray( 3 ); // $ExpectError
+ gfiedler.ndarray( 3, x ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, out ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, out, 3 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, out, 3, 1 ); // $ExpectError
+ gfiedler.ndarray( 3, x, 1, 0, out, 3, 1, 0, 10 ); // $ExpectError
+}
diff --git a/lib/node_modules/@stdlib/blas/ext/base/gfiedler/examples/index.js b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/examples/index.js
new file mode 100644
index 000000000000..a84c248332a1
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/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 ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var zeros = require( '@stdlib/array/zeros' );
+var gfiedler = require( './../lib' );
+
+var N = 5;
+var order = 'row-major';
+var shape = [ N, N ];
+var strides = shape2strides( shape, order );
+
+var x = discreteUniform( N, 1, 10, {
+ 'dtype': 'generic'
+});
+console.log( x );
+
+var out = zeros( N*N, 'generic' );
+
+gfiedler( order, N, x, 1, out, N );
+console.log( ndarray2array( out, shape, strides, 0, order ) );
diff --git a/lib/node_modules/@stdlib/blas/ext/base/gfiedler/lib/accessors.js b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/lib/accessors.js
new file mode 100644
index 000000000000..f9ec6093651d
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/lib/accessors.js
@@ -0,0 +1,98 @@
+/**
+* @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 abs = require( '@stdlib/math/base/special/abs' );
+
+
+// MAIN //
+
+/**
+* Generates a Fiedler matrix using accessor arrays.
+*
+* @private
+* @param {NonNegativeInteger} N - number of indexed elements in `x`
+* @param {Object} x - input array object
+* @param {Collection} x.data - input array data
+* @param {Array} x.accessors - array element accessors
+* @param {integer} strideX - stride length for `x`
+* @param {NonNegativeInteger} offsetX - starting index for `x`
+* @param {Object} out - output array object
+* @param {Collection} out.data - output array data
+* @param {Array} out.accessors - array element accessors
+* @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`
+* @returns {Object} output array object
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );
+*
+* var x = [ 1.0, 4.0, 12.0 ];
+* var out = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];
+*
+* gfiedler( 3, arraylike2object( toAccessorArray( x ) ), 1, 0, arraylike2object( toAccessorArray( out ) ), 3, 1, 0 );
+* // out => [ 0.0, 3.0, 11.0, 3.0, 0.0, 8.0, 11.0, 8.0, 0.0 ]
+*/
+function gfiedler( N, x, strideX, offsetX, out, strideOut1, strideOut2, offsetOut ) { // eslint-disable-line max-len
+ var xbuf;
+ var obuf;
+ var getX;
+ var oset;
+ var ix0;
+ var ix1;
+ var io;
+ var ij;
+ var v;
+ var i;
+ var j;
+
+ // Cache references to array data:
+ xbuf = x.data;
+ obuf = out.data;
+
+ // Cache references to element accessors:
+ getX = x.accessors[ 0 ];
+ oset = out.accessors[ 1 ];
+
+ // Fill the matrix with the pairwise absolute differences between the coefficients...
+ ix0 = offsetX;
+ io = offsetOut;
+ for ( i = 0; i < N; i++ ) {
+ v = getX( xbuf, ix0 );
+ ix1 = offsetX;
+ ij = io;
+ for ( j = 0; j < N; j++ ) {
+ oset( obuf, ij, abs( v - getX( xbuf, ix1 ) ) );
+ ix1 += strideX;
+ ij += strideOut2;
+ }
+ ix0 += strideX;
+ io += strideOut1;
+ }
+ return out;
+}
+
+
+// EXPORTS //
+
+module.exports = gfiedler;
diff --git a/lib/node_modules/@stdlib/blas/ext/base/gfiedler/lib/index.js b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/lib/index.js
new file mode 100644
index 000000000000..fde35765e5b0
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/lib/index.js
@@ -0,0 +1,59 @@
+/**
+* @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';
+
+/**
+* Generate a Fiedler matrix.
+*
+* @module @stdlib/blas/ext/base/gfiedler
+*
+* @example
+* var gfiedler = require( '@stdlib/blas/ext/base/gfiedler' );
+*
+* var x = [ 1.0, 4.0, 12.0 ];
+* var out = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];
+*
+* gfiedler( 'row-major', 3, x, 1, out, 3 );
+* // out => [ 0.0, 3.0, 11.0, 3.0, 0.0, 8.0, 11.0, 8.0, 0.0 ]
+*
+* @example
+* var gfiedler = require( '@stdlib/blas/ext/base/gfiedler' );
+*
+* var x = [ 1.0, 4.0, 12.0 ];
+* var out = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];
+*
+* gfiedler.ndarray( 3, x, 1, 0, out, 3, 1, 0 );
+* // out => [ 0.0, 3.0, 11.0, 3.0, 0.0, 8.0, 11.0, 8.0, 0.0 ]
+*/
+
+// MODULES //
+
+var setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );
+var main = require( './main.js' );
+var ndarray = require( './ndarray.js' );
+
+
+// MAIN //
+
+setReadOnly( main, 'ndarray', ndarray );
+
+
+// EXPORTS //
+
+module.exports = main;
diff --git a/lib/node_modules/@stdlib/blas/ext/base/gfiedler/lib/main.js b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/lib/main.js
new file mode 100644
index 000000000000..7574d56cd34f
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/lib/main.js
@@ -0,0 +1,85 @@
+/**
+* @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 isColumnMajor = require( '@stdlib/ndarray/base/assert/is-column-major-string' );
+var resolveLayout = require( '@stdlib/blas/base/layout-resolve-str' );
+var stride2offset = require( '@stdlib/strided/base/stride2offset' );
+var max = require( '@stdlib/math/base/special/fast/max' );
+var format = require( '@stdlib/string/format' );
+var ndarray = require( './ndarray.js' );
+
+
+// MAIN //
+
+/**
+* Generates a Fiedler matrix.
+*
+* @param {(integer|string)} order - storage layout
+* @param {NonNegativeInteger} N - number of indexed elements in `x`
+* @param {Collection} x - input array containing coefficients
+* @param {integer} strideX - stride length for `x`
+* @param {Collection} out - output array
+* @param {PositiveInteger} ldo - stride between successive contiguous vectors of the matrix `out` (a.k.a., leading dimension of the matrix `out`)
+* @throws {TypeError} first argument must be a valid order
+* @throws {RangeError} sixth argument must be a valid stride
+* @returns {Collection} output matrix
+*
+* @example
+* var x = [ 1.0, 4.0, 12.0 ];
+* var out = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];
+*
+* gfiedler( 'row-major', 3, x, 1, out, 3 );
+* // out => [ 0.0, 3.0, 11.0, 3.0, 0.0, 8.0, 11.0, 8.0, 0.0 ]
+*/
+function gfiedler( order, N, x, strideX, out, ldo ) {
+ var iscm;
+ var sa1;
+ var sa2;
+ var ox;
+ var l;
+
+ l = resolveLayout( order );
+ if ( l === null ) {
+ throw new TypeError( format( 'invalid argument. First argument must be a valid order. Value: `%s`.', order ) );
+ }
+ if ( ldo < max( 1, N ) ) {
+ throw new RangeError( format( 'invalid argument. Sixth argument must be greater than or equal to max(1,%d). Value: `%d`.', N, ldo ) );
+ }
+ if ( N <= 0 ) {
+ return out;
+ }
+ ox = stride2offset( N, strideX );
+ iscm = isColumnMajor( l );
+ if ( iscm ) {
+ sa1 = 1;
+ sa2 = ldo;
+ } else { // order === 'row-major'
+ sa1 = ldo;
+ sa2 = 1;
+ }
+ return ndarray( N, x, strideX, ox, out, sa1, sa2, 0 );
+}
+
+
+// EXPORTS //
+
+module.exports = gfiedler;
diff --git a/lib/node_modules/@stdlib/blas/ext/base/gfiedler/lib/ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/lib/ndarray.js
new file mode 100644
index 000000000000..500f62c00036
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/lib/ndarray.js
@@ -0,0 +1,102 @@
+/**
+* @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 arraylike2object = require( '@stdlib/array/base/arraylike2object' );
+var abs = require( '@stdlib/math/base/special/abs' );
+var accessors = require( './accessors.js' );
+
+
+// MAIN //
+
+/**
+* Generates a Fiedler matrix using alternative indexing semantics.
+*
+* @param {NonNegativeInteger} N - number of indexed elements in `x`
+* @param {Collection} x - input array containing coefficients
+* @param {integer} strideX - stride length for `x`
+* @param {NonNegativeInteger} offsetX - starting index for `x`
+* @param {Collection} 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`
+* @returns {Collection} output matrix
+*
+* @example
+* var x = [ 1.0, 4.0, 12.0 ];
+* var out = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];
+*
+* gfiedler( 3, x, 1, 0, out, 3, 1, 0 );
+* // out => [ 0.0, 3.0, 11.0, 3.0, 0.0, 8.0, 11.0, 8.0, 0.0 ]
+*/
+function gfiedler( N, x, strideX, offsetX, out, strideOut1, strideOut2, offsetOut ) { // eslint-disable-line max-len
+ var ix0;
+ var ix1;
+ var so1;
+ var so2;
+ var ox;
+ var oo;
+ var io;
+ var ij;
+ var v;
+ var i;
+ var j;
+
+ if ( N <= 0 ) {
+ return out;
+ }
+ // As a Fiedler matrix is symmetric, generating the transposed matrix yields the same matrix, and, thus, when the output matrix is stored in column-major order, we can swap the strides so that the innermost loop always moves over contiguous memory, thus ensuring cache optimal traversal...
+ if ( isRowMajor( [ strideOut1, strideOut2 ] ) ) {
+ so1 = strideOut1;
+ so2 = strideOut2;
+ } else { // column-major
+ so1 = strideOut2;
+ so2 = strideOut1;
+ }
+ ox = arraylike2object( x );
+ oo = arraylike2object( out );
+ if ( ox.accessorProtocol || oo.accessorProtocol ) {
+ accessors( N, ox, strideX, offsetX, oo, so1, so2, offsetOut );
+ return out;
+ }
+ // Fill the matrix with the pairwise absolute differences between the coefficients...
+ ix0 = offsetX;
+ io = offsetOut;
+ for ( i = 0; i < N; i++ ) {
+ v = x[ ix0 ];
+ ix1 = offsetX;
+ ij = io;
+ for ( j = 0; j < N; j++ ) {
+ out[ ij ] = abs( v - x[ ix1 ] );
+ ix1 += strideX;
+ ij += so2;
+ }
+ ix0 += strideX;
+ io += so1;
+ }
+ return out;
+}
+
+
+// EXPORTS //
+
+module.exports = gfiedler;
diff --git a/lib/node_modules/@stdlib/blas/ext/base/gfiedler/package.json b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/package.json
new file mode 100644
index 000000000000..e38acd850885
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/package.json
@@ -0,0 +1,70 @@
+{
+ "name": "@stdlib/blas/ext/base/gfiedler",
+ "version": "0.0.0",
+ "description": "Generate a Fiedler matrix.",
+ "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",
+ "directories": {
+ "benchmark": "./benchmark",
+ "doc": "./docs",
+ "example": "./examples",
+ "lib": "./lib",
+ "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",
+ "fiedler",
+ "symmetric",
+ "matrix",
+ "strided",
+ "strided array",
+ "typed",
+ "array",
+ "ndarray",
+ "vector",
+ "gfiedler"
+ ],
+ "__stdlib__": {}
+}
diff --git a/lib/node_modules/@stdlib/blas/ext/base/gfiedler/test/test.js b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/test/test.js
new file mode 100644
index 000000000000..c471db44a6db
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/test/test.js
@@ -0,0 +1,38 @@
+/**
+* @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 gfiedler = require( './../lib' );
+
+
+// TESTS //
+
+tape( 'main export is a function', function test( t ) {
+ t.ok( true, __filename );
+ t.strictEqual( typeof gfiedler, '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 gfiedler.ndarray, 'function', 'method is a function' );
+ t.end();
+});
diff --git a/lib/node_modules/@stdlib/blas/ext/base/gfiedler/test/test.main.js b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/test/test.main.js
new file mode 100644
index 000000000000..a4916eed8db2
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/test/test.main.js
@@ -0,0 +1,831 @@
+/**
+* @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 toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+var Float64Array = require( '@stdlib/array/float64' );
+var gfiedler = require( './../lib' );
+
+
+// TESTS //
+
+tape( 'main export is a function', function test( t ) {
+ t.ok( true, __filename );
+ t.strictEqual( typeof gfiedler, 'function', 'main export is a function' );
+ t.end();
+});
+
+tape( 'the function has an arity of 6', function test( t ) {
+ t.strictEqual( gfiedler.length, 6, 'has expected arity' );
+ t.end();
+});
+
+tape( 'the function throws an error if provided an invalid first argument', function test( t ) {
+ var values;
+ var i;
+
+ values = [
+ 'foo',
+ 'bar',
+ 'beep',
+ 'boop'
+ ];
+
+ 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() {
+ gfiedler( value, 3, [ 1.0, 4.0, 12.0 ], 1, [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ], 3 );
+ };
+ }
+});
+
+tape( 'the function throws an error if provided an invalid first argument (accessors)', function test( t ) {
+ var values;
+ var i;
+
+ values = [
+ 'foo',
+ 'bar',
+ 'beep',
+ 'boop'
+ ];
+
+ 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() {
+ gfiedler( value, 3, toAccessorArray( [ 1.0, 4.0, 12.0 ] ), 1, toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] ), 3 );
+ };
+ }
+});
+
+tape( 'the function throws an error if provided an invalid sixth argument', function test( t ) {
+ var values;
+ var i;
+
+ values = [
+ -2,
+ -1,
+ 0,
+ 2
+ ];
+
+ for ( i = 0; i < values.length; i++ ) {
+ t.throws( badValue( values[ i ] ), RangeError, 'throws an error when provided ' + values[ i ] );
+ }
+ t.end();
+
+ function badValue( value ) {
+ return function badValue() {
+ gfiedler( 'row-major', 3, [ 1.0, 4.0, 12.0 ], 1, [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ], value );
+ };
+ }
+});
+
+tape( 'the function throws an error if provided an invalid sixth argument (accessors)', function test( t ) {
+ var values;
+ var i;
+
+ values = [
+ -2,
+ -1,
+ 0,
+ 2
+ ];
+
+ for ( i = 0; i < values.length; i++ ) {
+ t.throws( badValue( values[ i ] ), RangeError, 'throws an error when provided ' + values[ i ] );
+ }
+ t.end();
+
+ function badValue( value ) {
+ return function badValue() {
+ gfiedler( 'row-major', 3, toAccessorArray( [ 1.0, 4.0, 12.0 ] ), 1, toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] ), value );
+ };
+ }
+});
+
+tape( 'if provided an `N` less than or equal to `0`, the function returns the output array unchanged', function test( t ) {
+ var expected;
+ var out;
+
+ out = [ 0.0, 0.0, 0.0, 0.0 ];
+
+ expected = [ 0.0, 0.0, 0.0, 0.0 ];
+
+ gfiedler( 'row-major', 0, [], 1, out, 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'if provided an `N` less than or equal to `0`, the function returns the output array unchanged (accessors)', function test( t ) {
+ var expected;
+ var out;
+
+ out = [ 0.0, 0.0, 0.0, 0.0 ];
+
+ expected = [ 0.0, 0.0, 0.0, 0.0 ];
+
+ gfiedler( 'row-major', 0, toAccessorArray( [] ), 1, toAccessorArray( out ), 1 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function returns the output matrix', function test( t ) {
+ var out;
+ var v;
+
+ out = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];
+
+ v = gfiedler( 'row-major', 3, [ 1.0, 4.0, 12.0 ], 1, out, 3 );
+
+ t.strictEqual( v, out, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function returns the output matrix (accessors)', function test( t ) {
+ var out;
+ var v;
+
+ out = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );
+
+ v = gfiedler( 'row-major', 3, toAccessorArray( [ 1.0, 4.0, 12.0 ] ), 1, out, 3 );
+
+ t.strictEqual( v, out, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function generates a Fiedler matrix (row-major)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 4.0, 12.0 ];
+
+ out = [
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0
+ ];
+
+ gfiedler( 'row-major', 3, x, 1, out, 3 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function generates a Fiedler matrix (row-major, accessors)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 4.0, 12.0 ];
+
+ out = [
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0
+ ];
+
+ gfiedler( 'row-major', 3, toAccessorArray( x ), 1, toAccessorArray( out ), 3 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function generates a Fiedler matrix (column-major)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 4.0, 12.0 ];
+
+ out = [
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0
+ ];
+
+ gfiedler( 'column-major', 3, x, 1, out, 3 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function generates a Fiedler matrix (column-major, accessors)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 4.0, 12.0 ];
+
+ out = [
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0
+ ];
+
+ gfiedler( 'column-major', 3, toAccessorArray( x ), 1, toAccessorArray( out ), 3 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports specifying a stride for `x` (row-major)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 0.0, 4.0, 0.0, 12.0 ];
+
+ out = [
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0
+ ];
+
+ gfiedler( 'row-major', 3, x, 2, out, 3 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports specifying a stride for `x` (row-major, accessors)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 0.0, 4.0, 0.0, 12.0 ];
+
+ out = [
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0
+ ];
+
+ gfiedler( 'row-major', 3, toAccessorArray( x ), 2, toAccessorArray( out ), 3 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports specifying a negative stride for `x` (row-major)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 12.0, 4.0, 1.0 ];
+
+ out = [
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0
+ ];
+
+ gfiedler( 'row-major', 3, x, -1, out, 3 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports specifying a negative stride for `x` (row-major, accessors)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 12.0, 4.0, 1.0 ];
+
+ out = [
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0
+ ];
+
+ gfiedler( 'row-major', 3, toAccessorArray( x ), -1, toAccessorArray( out ), 3 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports specifying a stride for `x` (column-major)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 0.0, 4.0, 0.0, 12.0 ];
+
+ out = [
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0
+ ];
+
+ gfiedler( 'column-major', 3, x, 2, out, 3 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports specifying a stride for `x` (column-major, accessors)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 0.0, 4.0, 0.0, 12.0 ];
+
+ out = [
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0
+ ];
+
+ gfiedler( 'column-major', 3, toAccessorArray( x ), 2, toAccessorArray( out ), 3 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports specifying a negative stride for `x` (column-major)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 12.0, 4.0, 1.0 ];
+
+ out = [
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0
+ ];
+
+ gfiedler( 'column-major', 3, x, -1, out, 3 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports specifying a negative stride for `x` (column-major, accessors)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 12.0, 4.0, 1.0 ];
+
+ out = [
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0
+ ];
+
+ gfiedler( 'column-major', 3, toAccessorArray( x ), -1, toAccessorArray( out ), 3 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports a leading dimension for the output matrix (row-major)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 4.0, 12.0 ];
+
+ 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
+ ];
+
+ gfiedler( 'row-major', 3, x, 1, out, 4 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 0.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 0.0,
+ 11.0,
+ 8.0,
+ 0.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports a leading dimension for the output matrix (row-major, accessors)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 4.0, 12.0 ];
+
+ 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
+ ];
+
+ gfiedler( 'row-major', 3, toAccessorArray( x ), 1, toAccessorArray( out ), 4 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 0.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 0.0,
+ 11.0,
+ 8.0,
+ 0.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports a leading dimension for the output matrix (column-major)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 4.0, 12.0 ];
+
+ 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
+ ];
+
+ gfiedler( 'column-major', 3, x, 1, out, 4 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 0.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 0.0,
+ 11.0,
+ 8.0,
+ 0.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports a leading dimension for the output matrix (column-major, accessors)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 4.0, 12.0 ];
+
+ 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
+ ];
+
+ gfiedler( 'column-major', 3, toAccessorArray( x ), 1, toAccessorArray( out ), 4 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 0.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 0.0,
+ 11.0,
+ 8.0,
+ 0.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports view offsets', function test( t ) {
+ var expected;
+ var out0;
+ var out1;
+ var x0;
+ var x1;
+
+ x0 = new Float64Array( [ 999.0, 1.0, 4.0, 12.0 ] );
+ x1 = new Float64Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 );
+
+ out0 = new Float64Array( 10 );
+ out1 = new Float64Array( out0.buffer, out0.BYTES_PER_ELEMENT*1 );
+
+ gfiedler( 'row-major', 3, x1, 1, out1, 3 );
+
+ expected = new Float64Array([
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ]);
+
+ t.deepEqual( out1, expected, 'returns expected value' );
+ t.end();
+});
diff --git a/lib/node_modules/@stdlib/blas/ext/base/gfiedler/test/test.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/test/test.ndarray.js
new file mode 100644
index 000000000000..332f0a0c0e66
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/gfiedler/test/test.ndarray.js
@@ -0,0 +1,1027 @@
+/**
+* @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 toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+var gfiedler = require( './../lib/ndarray.js' );
+
+
+// TESTS //
+
+tape( 'main export is a function', function test( t ) {
+ t.ok( true, __filename );
+ t.strictEqual( typeof gfiedler, 'function', 'main export is a function' );
+ t.end();
+});
+
+tape( 'the function has an arity of 8', function test( t ) {
+ t.strictEqual( gfiedler.length, 8, 'has expected arity' );
+ t.end();
+});
+
+tape( 'if provided an `N` less than or equal to `0`, the function returns the output array unchanged', function test( t ) {
+ var expected;
+ var out;
+
+ out = [ 0.0, 0.0, 0.0, 0.0 ];
+
+ expected = [ 0.0, 0.0, 0.0, 0.0 ];
+
+ gfiedler( 0, [], 1, 0, out, 1, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'if provided an `N` less than or equal to `0`, the function returns the output array unchanged (accessors)', function test( t ) {
+ var expected;
+ var out;
+
+ out = [ 0.0, 0.0, 0.0, 0.0 ];
+
+ expected = [ 0.0, 0.0, 0.0, 0.0 ];
+
+ gfiedler( 0, toAccessorArray( [] ), 1, 0, toAccessorArray( out ), 1, 1, 0 );
+ t.deepEqual( out, expected, 'returns expected value' );
+
+ t.end();
+});
+
+tape( 'the function returns the output matrix', function test( t ) {
+ var out;
+ var v;
+
+ out = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];
+
+ v = gfiedler( 3, [ 1.0, 4.0, 12.0 ], 1, 0, out, 3, 1, 0 );
+
+ t.strictEqual( v, out, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function returns the output matrix (accessors)', function test( t ) {
+ var out;
+ var v;
+
+ out = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );
+
+ v = gfiedler( 3, toAccessorArray( [ 1.0, 4.0, 12.0 ] ), 1, 0, out, 3, 1, 0 );
+
+ t.strictEqual( v, out, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function generates a Fiedler matrix (row-major)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 4.0, 12.0 ];
+
+ out = [
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0
+ ];
+
+ gfiedler( 3, x, 1, 0, out, 3, 1, 0 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function generates a Fiedler matrix (row-major, accessors)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 4.0, 12.0 ];
+
+ out = [
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0
+ ];
+
+ gfiedler( 3, toAccessorArray( x ), 1, 0, toAccessorArray( out ), 3, 1, 0 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function generates a Fiedler matrix (column-major)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 4.0, 12.0 ];
+
+ out = [
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0
+ ];
+
+ gfiedler( 3, x, 1, 0, out, 1, 3, 0 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function generates a Fiedler matrix (column-major, accessors)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 4.0, 12.0 ];
+
+ out = [
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0,
+ 9.0
+ ];
+
+ gfiedler( 3, toAccessorArray( x ), 1, 0, toAccessorArray( out ), 1, 3, 0 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports specifying a stride for `x` (row-major)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 0.0, 4.0, 0.0, 12.0 ];
+
+ out = [
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0
+ ];
+
+ gfiedler( 3, x, 2, 0, out, 3, 1, 0 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports specifying a stride for `x` (row-major, accessors)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 0.0, 4.0, 0.0, 12.0 ];
+
+ out = [
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0
+ ];
+
+ gfiedler( 3, toAccessorArray( x ), 2, 0, toAccessorArray( out ), 3, 1, 0 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports specifying a negative stride for `x` (row-major)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 12.0, 4.0, 1.0 ];
+
+ out = [
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0
+ ];
+
+ gfiedler( 3, x, -1, 2, out, 3, 1, 0 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports specifying a negative stride for `x` (row-major, accessors)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 12.0, 4.0, 1.0 ];
+
+ out = [
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0
+ ];
+
+ gfiedler( 3, toAccessorArray( x ), -1, 2, toAccessorArray( out ), 3, 1, 0 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports specifying a stride for `x` (column-major)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 0.0, 4.0, 0.0, 12.0 ];
+
+ out = [
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0
+ ];
+
+ gfiedler( 3, x, 2, 0, out, 1, 3, 0 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports specifying a stride for `x` (column-major, accessors)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 0.0, 4.0, 0.0, 12.0 ];
+
+ out = [
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0
+ ];
+
+ gfiedler( 3, toAccessorArray( x ), 2, 0, toAccessorArray( out ), 1, 3, 0 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports specifying a negative stride for `x` (column-major)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 12.0, 4.0, 1.0 ];
+
+ out = [
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0
+ ];
+
+ gfiedler( 3, x, -1, 2, out, 1, 3, 0 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports specifying a negative stride for `x` (column-major, accessors)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 12.0, 4.0, 1.0 ];
+
+ out = [
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0
+ ];
+
+ gfiedler( 3, toAccessorArray( x ), -1, 2, toAccessorArray( out ), 1, 3, 0 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports an `x` offset', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 999.0, 1.0, 4.0, 12.0 ];
+
+ out = [
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0
+ ];
+
+ gfiedler( 3, x, 1, 1, out, 3, 1, 0 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports an `x` offset (accessors)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 999.0, 1.0, 4.0, 12.0 ];
+
+ out = [
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0
+ ];
+
+ gfiedler( 3, toAccessorArray( x ), 1, 1, toAccessorArray( out ), 3, 1, 0 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports an output offset', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 4.0, 12.0 ];
+
+ out = [
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0
+ ];
+
+ gfiedler( 3, x, 1, 0, out, 3, 1, 2 );
+
+ expected = [
+ 0.0,
+ 0.0,
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports an output offset (accessors)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 4.0, 12.0 ];
+
+ out = [
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0
+ ];
+
+ gfiedler( 3, toAccessorArray( x ), 1, 0, toAccessorArray( out ), 3, 1, 2 );
+
+ expected = [
+ 0.0,
+ 0.0,
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports output stride with padding (row-major)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 4.0, 12.0 ];
+
+ 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
+ ];
+
+ gfiedler( 3, x, 1, 0, out, 4, 1, 0 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 0.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 0.0,
+ 11.0,
+ 8.0,
+ 0.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports output stride with padding (row-major, accessors)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 4.0, 12.0 ];
+
+ 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
+ ];
+
+ gfiedler( 3, toAccessorArray( x ), 1, 0, toAccessorArray( out ), 4, 1, 0 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 0.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 0.0,
+ 11.0,
+ 8.0,
+ 0.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports output stride with padding (column-major)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 4.0, 12.0 ];
+
+ 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
+ ];
+
+ gfiedler( 3, x, 1, 0, out, 1, 4, 0 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 0.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 0.0,
+ 11.0,
+ 8.0,
+ 0.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports output stride with padding (column-major, accessors)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 4.0, 12.0 ];
+
+ 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
+ ];
+
+ gfiedler( 3, toAccessorArray( x ), 1, 0, toAccessorArray( out ), 1, 4, 0 );
+
+ expected = [
+ 0.0,
+ 3.0,
+ 11.0,
+ 0.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 0.0,
+ 11.0,
+ 8.0,
+ 0.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports specifying negative output strides (row-major)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 4.0, 12.0 ];
+
+ out = [
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0
+ ];
+
+ gfiedler( 3, x, 1, 0, out, -3, -1, 8 );
+
+ expected = [
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports specifying negative output strides (row-major, accessors)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 1.0, 4.0, 12.0 ];
+
+ out = [
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0
+ ];
+
+ gfiedler( 3, toAccessorArray( x ), 1, 0, toAccessorArray( out ), -3, -1, 8 );
+
+ expected = [
+ 0.0,
+ 8.0,
+ 11.0,
+ 8.0,
+ 0.0,
+ 3.0,
+ 11.0,
+ 3.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports complex access patterns', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 999.0, 1.0, 0.0, 4.0, 0.0, 12.0 ];
+
+ 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,
+ 0.0
+ ];
+
+ gfiedler( 3, x, 2, 1, out, 1, 4, 1 );
+
+ expected = [
+ 0.0,
+ 0.0,
+ 3.0,
+ 11.0,
+ 0.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 0.0,
+ 11.0,
+ 8.0,
+ 0.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports complex access patterns (accessors)', function test( t ) {
+ var expected;
+ var out;
+ var x;
+
+ x = [ 999.0, 1.0, 0.0, 4.0, 0.0, 12.0 ];
+
+ 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,
+ 0.0
+ ];
+
+ gfiedler( 3, toAccessorArray( x ), 2, 1, toAccessorArray( out ), 1, 4, 1 );
+
+ expected = [
+ 0.0,
+ 0.0,
+ 3.0,
+ 11.0,
+ 0.0,
+ 3.0,
+ 0.0,
+ 8.0,
+ 0.0,
+ 11.0,
+ 8.0,
+ 0.0,
+ 0.0
+ ];
+
+ t.deepEqual( out, expected, 'returns expected value' );
+ t.end();
+});