diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/10_blocked_accessors.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/10_blocked_accessors.js
new file mode 100644
index 000000000000..18dd4d46a68f
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/10_blocked_accessors.js
@@ -0,0 +1,394 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-depth, max-len */
+
+'use strict';
+
+// MODULES //
+
+var loopOrder = require( '@stdlib/ndarray/base/unary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/unary-tiling-block-size' );
+var takeIndexed = require( '@stdlib/array/base/take-indexed' );
+var zeros = require( '@stdlib/array/base/zeros' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray via loop blocking.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );
+* var ybuf = toAccessorArray( filled( false, 3 ) );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 3, 3, 3, 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major',
+*     'accessors': accessors( ybuf ).accessors
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* blockedunary10d( base, [ x, y ], views, [ 12, 12, 12, 12, 12, 12, 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ [ [ [ [ [ [ true, false, true ] ] ] ] ] ] ] ] ] ]
+*/
+function blockedunary10d( fcn, arrays, views, strides, opts ) { // eslint-disable-line max-statements, max-lines-per-function
+	var bsize;
+	var ybuf;
+	var set;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var dv4;
+	var dv5;
+	var dv6;
+	var dv7;
+	var dv8;
+	var dv9;
+	var ov1;
+	var ov2;
+	var ov3;
+	var ov4;
+	var ov5;
+	var ov6;
+	var ov7;
+	var ov8;
+	var ov9;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var s5;
+	var s6;
+	var s7;
+	var s8;
+	var s9;
+	var sv;
+	var ov;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+	var i7;
+	var i8;
+	var i9;
+	var j0;
+	var j1;
+	var j2;
+	var j3;
+	var j4;
+	var j5;
+	var j6;
+	var j7;
+	var j8;
+	var j9;
+	var N;
+	var x;
+	var y;
+	var o;
+	var k;
+
+	// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	N = arrays.length;
+	x = arrays[ 0 ];
+	y = arrays[ 1 ];
+
+	// Resolve the loop interchange order:
+	o = loopOrder( y.shape, strides, y.strides );
+	sh = o.sh;
+	sv = [ o.sx, o.sy ];
+	for ( k = 2; k < N; k++ ) {
+		sv.push( takeIndexed( arrays[k].strides, o.idx ) );
+	}
+	// Determine the block size:
+	bsize = blockSize( x.dtype, y.dtype );
+
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	ov = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Cache accessors:
+	set = y.accessors[ 1 ];
+
+	// Cache offset increments for the innermost loop...
+	dv0 = [];
+	for ( k = 0; k < N; k++ ) {
+		dv0.push( sv[k][0] );
+	}
+	// Initialize loop variables...
+	ov1 = zeros( N );
+	ov2 = zeros( N );
+	ov3 = zeros( N );
+	ov4 = zeros( N );
+	ov5 = zeros( N );
+	ov6 = zeros( N );
+	ov7 = zeros( N );
+	ov8 = zeros( N );
+	ov9 = zeros( N );
+	dv1 = zeros( N );
+	dv2 = zeros( N );
+	dv3 = zeros( N );
+	dv4 = zeros( N );
+	dv5 = zeros( N );
+	dv6 = zeros( N );
+	dv7 = zeros( N );
+	dv8 = zeros( N );
+	dv9 = zeros( N );
+	iv = zeros( N );
+
+	// Iterate over blocks...
+	for ( j9 = sh[9]; j9 > 0; ) {
+		if ( j9 < bsize ) {
+			s9 = j9;
+			j9 = 0;
+		} else {
+			s9 = bsize;
+			j9 -= bsize;
+		}
+		for ( k = 0; k < N; k++ ) {
+			ov9[ k ] = ov[k] + ( j9*sv[k][9] );
+		}
+		for ( j8 = sh[8]; j8 > 0; ) {
+			if ( j8 < bsize ) {
+				s8 = j8;
+				j8 = 0;
+			} else {
+				s8 = bsize;
+				j8 -= bsize;
+			}
+			for ( k = 0; k < N; k++ ) {
+				dv9 = sv[k][9] - ( s8*sv[k][8] );
+				ov8[ k ] = ov9[k] + ( j8*sv[k][8] );
+			}
+			for ( j7 = sh[7]; j7 > 0; ) {
+				if ( j7 < bsize ) {
+					s7 = j7;
+					j7 = 0;
+				} else {
+					s7 = bsize;
+					j7 -= bsize;
+				}
+				for ( k = 0; k < N; k++ ) {
+					dv8 = sv[k][8] - ( s7*sv[k][7] );
+					ov7[ k ] = ov8[k] + ( j7*sv[k][7] );
+				}
+				for ( j6 = sh[6]; j6 > 0; ) {
+					if ( j6 < bsize ) {
+						s6 = j6;
+						j6 = 0;
+					} else {
+						s6 = bsize;
+						j6 -= bsize;
+					}
+					for ( k = 0; k < N; k++ ) {
+						dv7 = sv[k][7] - ( s6*sv[k][6] );
+						ov6[ k ] = ov7[k] + ( j6*sv[k][6] );
+					}
+					for ( j5 = sh[5]; j5 > 0; ) {
+						if ( j5 < bsize ) {
+							s5 = j5;
+							j5 = 0;
+						} else {
+							s5 = bsize;
+							j5 -= bsize;
+						}
+						for ( k = 0; k < N; k++ ) {
+							dv6 = sv[k][6] - ( s5*sv[k][5] );
+							ov5[ k ] = ov6[k] + ( j5*sv[k][5] );
+						}
+						for ( j4 = sh[4]; j4 > 0; ) {
+							if ( j4 < bsize ) {
+								s4 = j4;
+								j4 = 0;
+							} else {
+								s4 = bsize;
+								j4 -= bsize;
+							}
+							for ( k = 0; k < N; k++ ) {
+								dv5 = sv[k][5] - ( s4*sv[k][4] );
+								ov4[ k ] = ov5[k] + ( j4*sv[k][4] );
+							}
+							for ( j3 = sh[3]; j3 > 0; ) {
+								if ( j3 < bsize ) {
+									s3 = j3;
+									j3 = 0;
+								} else {
+									s3 = bsize;
+									j3 -= bsize;
+								}
+								for ( k = 0; k < N; k++ ) {
+									dv4[ k ] = sv[k][4] - ( s3*sv[k][3] );
+									ov3[ k ] = ov4[k] + ( j3*sv[k][3] );
+								}
+								for ( j2 = sh[2]; j2 > 0; ) {
+									if ( j2 < bsize ) {
+										s2 = j2;
+										j2 = 0;
+									} else {
+										s2 = bsize;
+										j2 -= bsize;
+									}
+									for ( k = 0; k < N; k++ ) {
+										dv3[ k ] = sv[k][3] - ( s2*sv[k][2] );
+										ov2[ k ] = ov3[k] + ( j2*sv[k][2] );
+									}
+									for ( j1 = sh[1]; j1 > 0; ) {
+										if ( j1 < bsize ) {
+											s1 = j1;
+											j1 = 0;
+										} else {
+											s1 = bsize;
+											j1 -= bsize;
+										}
+										for ( k = 0; k < N; k++ ) {
+											dv2[ k ] = sv[k][2] - ( s1*sv[k][1] );
+											ov1[ k ] = ov2[k] + ( j1*sv[k][1] );
+										}
+										for ( j0 = sh[0]; j0 > 0; ) {
+											if ( j0 < bsize ) {
+												s0 = j0;
+												j0 = 0;
+											} else {
+												s0 = bsize;
+												j0 -= bsize;
+											}
+											// Compute index offsets and loop offset increments for the first ndarray elements in the current block...
+											for ( k = 0; k < N; k++ ) {
+												iv[ k ] = ov1[k] + ( j0*sv[k][0] );
+												dv1[ k ] = sv[k][1] - ( s0*sv[k][0] );
+											}
+											// Iterate over the non-reduced ndarray dimensions...
+											for ( i9 = 0; i9 < s9; i9++ ) {
+												for ( i8 = 0; i8 < s8; i8++ ) {
+													for ( i7 = 0; i7 < s7; i7++ ) {
+														for ( i6 = 0; i6 < s6; i6++ ) {
+															for ( i5 = 0; i5 < s5; i5++ ) {
+																for ( i4 = 0; i4 < s4; i4++ ) {
+																	for ( i3 = 0; i3 < s3; i3++ ) {
+																		for ( i2 = 0; i2 < s2; i2++ ) {
+																			for ( i1 = 0; i1 < s1; i1++ ) {
+																				for ( i0 = 0; i0 < s0; i0++ ) {
+																					setViewOffsets( views, iv );
+																					set( ybuf, iv[ 1 ], fcn( views, opts ) );
+																					incrementOffsets( iv, dv0 );
+																				}
+																				incrementOffsets( iv, dv1 );
+																			}
+																			incrementOffsets( iv, dv2 );
+																		}
+																		incrementOffsets( iv, dv3 );
+																	}
+																	incrementOffsets( iv, dv4 );
+																}
+																incrementOffsets( iv, dv5 );
+															}
+															incrementOffsets( iv, dv6 );
+														}
+														incrementOffsets( iv, dv7 );
+													}
+													incrementOffsets( iv, dv8 );
+												}
+												incrementOffsets( iv, dv9 );
+											}
+										}
+									}
+								}
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = blockedunary10d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/10d.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/10d.js
new file mode 100644
index 000000000000..0fe88a99e5dd
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/10d.js
@@ -0,0 +1,264 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-depth */
+
+'use strict';
+
+// MODULES //
+
+var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major-string' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+* var ybuf = filled( false, 3 );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 3, 3, 3, 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major'
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* unary10d( base, [ x, y ], views, [ 12, 12, 12, 12, 12, 12, 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ [ [ [ [ [ [ true, false, true ] ] ] ] ] ] ] ] ] ]
+*/
+function unary10d( fcn, arrays, views, strides, opts ) { // eslint-disable-line max-statements
+	var ybuf;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var dv4;
+	var dv5;
+	var dv6;
+	var dv7;
+	var dv8;
+	var dv9;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var S5;
+	var S6;
+	var S7;
+	var S8;
+	var S9;
+	var sv;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+	var i7;
+	var i8;
+	var i9;
+	var y;
+	var i;
+
+	// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the output ndarray and associated shape:
+	y = arrays[ 1 ];
+	sh = y.shape;
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	if ( isRowMajor( y.order ) ) {
+		// For row-major ndarrays, the last dimensions have the fastest changing indices...
+		S0 = sh[ 9 ];
+		S1 = sh[ 8 ];
+		S2 = sh[ 7 ];
+		S3 = sh[ 6 ];
+		S4 = sh[ 5 ];
+		S5 = sh[ 4 ];
+		S6 = sh[ 3 ];
+		S7 = sh[ 2 ];
+		S8 = sh[ 1 ];
+		S9 = sh[ 0 ];
+		dv0 = [ strides[9] ];                     // offset increment for innermost loop
+		dv1 = [ strides[8] - ( S0*strides[9] ) ];
+		dv2 = [ strides[7] - ( S1*strides[8] ) ];
+		dv3 = [ strides[6] - ( S2*strides[7] ) ];
+		dv4 = [ strides[5] - ( S3*strides[6] ) ];
+		dv5 = [ strides[4] - ( S4*strides[5] ) ];
+		dv6 = [ strides[3] - ( S5*strides[4] ) ];
+		dv7 = [ strides[2] - ( S6*strides[3] ) ];
+		dv8 = [ strides[1] - ( S7*strides[2] ) ];
+		dv9 = [ strides[0] - ( S8*strides[1] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[9] );
+			dv1.push( sv[8] - ( S0*sv[9] ) );
+			dv2.push( sv[7] - ( S1*sv[8] ) );
+			dv3.push( sv[6] - ( S2*sv[7] ) );
+			dv4.push( sv[5] - ( S3*sv[6] ) );
+			dv5.push( sv[4] - ( S4*sv[5] ) );
+			dv6.push( sv[3] - ( S5*sv[4] ) );
+			dv7.push( sv[2] - ( S6*sv[3] ) );
+			dv8.push( sv[1] - ( S7*sv[2] ) );
+			dv9.push( sv[0] - ( S8*sv[1] ) );
+		}
+	} else { // order === 'column-major'
+		// For column-major ndarrays, the first dimensions have the fastest changing indices...
+		S0 = sh[ 0 ];
+		S1 = sh[ 1 ];
+		S2 = sh[ 2 ];
+		S3 = sh[ 3 ];
+		S4 = sh[ 4 ];
+		S5 = sh[ 5 ];
+		S6 = sh[ 6 ];
+		S7 = sh[ 7 ];
+		S8 = sh[ 8 ];
+		S9 = sh[ 9 ];
+		dv0 = [ strides[0] ];                     // offset increment for innermost loop
+		dv1 = [ strides[1] - ( S0*strides[0] ) ];
+		dv2 = [ strides[2] - ( S1*strides[1] ) ];
+		dv3 = [ strides[3] - ( S2*strides[2] ) ];
+		dv4 = [ strides[4] - ( S3*strides[3] ) ];
+		dv5 = [ strides[5] - ( S4*strides[4] ) ];
+		dv6 = [ strides[6] - ( S5*strides[5] ) ];
+		dv7 = [ strides[7] - ( S6*strides[6] ) ];
+		dv8 = [ strides[8] - ( S7*strides[7] ) ];
+		dv9 = [ strides[9] - ( S8*strides[8] ) ];  // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[0] );
+			dv1.push( sv[1] - ( S0*sv[0] ) );
+			dv2.push( sv[2] - ( S1*sv[1] ) );
+			dv3.push( sv[3] - ( S2*sv[2] ) );
+			dv4.push( sv[4] - ( S3*sv[3] ) );
+			dv5.push( sv[5] - ( S4*sv[4] ) );
+			dv6.push( sv[6] - ( S5*sv[5] ) );
+			dv7.push( sv[7] - ( S6*sv[6] ) );
+			dv8.push( sv[8] - ( S7*sv[7] ) );
+			dv8.push( sv[8] - ( S8*sv[8] ) );
+		}
+	}
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	iv = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Iterate over the non-reduced ndarray dimensions...
+	for ( i9 = 0; i9 < S9; i9++ ) {
+		for ( i8 = 0; i8 < S8; i8++ ) {
+			for ( i7 = 0; i7 < S7; i7++ ) {
+				for ( i6 = 0; i6 < S6; i6++ ) {
+					for ( i5 = 0; i5 < S5; i5++ ) {
+						for ( i4 = 0; i4 < S4; i4++ ) {
+							for ( i3 = 0; i3 < S3; i3++ ) {
+								for ( i2 = 0; i2 < S2; i2++ ) {
+									for ( i1 = 0; i1 < S1; i1++ ) {
+										for ( i0 = 0; i0 < S0; i0++ ) {
+											setViewOffsets( views, iv );
+											ybuf[ iv[1] ] = fcn( views, opts );
+											incrementOffsets( iv, dv0 );
+										}
+										incrementOffsets( iv, dv1 );
+									}
+									incrementOffsets( iv, dv2 );
+								}
+								incrementOffsets( iv, dv3 );
+							}
+							incrementOffsets( iv, dv4 );
+						}
+						incrementOffsets( iv, dv5 );
+					}
+					incrementOffsets( iv, dv6 );
+				}
+				incrementOffsets( iv, dv7 );
+			}
+			incrementOffsets( iv, dv8 );
+		}
+		incrementOffsets( iv, dv9 );
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = unary10d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/10d_accessors.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/10d_accessors.js
new file mode 100644
index 000000000000..fe95c36beade
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/10d_accessors.js
@@ -0,0 +1,272 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-depth, max-len */
+
+'use strict';
+
+// MODULES //
+
+var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major-string' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );
+* var ybuf = toAccessorArray( filled( false, 3 ) );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 3, 3, 3, 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major',
+*     'accessors': accessors( ybuf ).accessors
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* unary10d( base, [ x, y ], views, [ 12, 12, 12, 12, 12, 12, 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ [ [ [ [ [ [ true, false, true ] ] ] ] ] ] ] ] ] ]
+*/
+function unary10d( fcn, arrays, views, strides, opts ) { // eslint-disable-line max-statements
+	var ybuf;
+	var set;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var dv4;
+	var dv5;
+	var dv6;
+	var dv7;
+	var dv8;
+	var dv9;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var S5;
+	var S6;
+	var S7;
+	var S8;
+	var S9;
+	var sv;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+	var i7;
+	var i8;
+	var i9;
+	var y;
+	var i;
+
+	// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the output ndarray and associated shape:
+	y = arrays[ 1 ];
+	sh = y.shape;
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	if ( isRowMajor( y.order ) ) {
+		// For row-major ndarrays, the last dimensions have the fastest changing indices...
+		S0 = sh[ 9 ];
+		S1 = sh[ 8 ];
+		S2 = sh[ 7 ];
+		S3 = sh[ 6 ];
+		S4 = sh[ 5 ];
+		S5 = sh[ 4 ];
+		S6 = sh[ 3 ];
+		S7 = sh[ 2 ];
+		S8 = sh[ 1 ];
+		S9 = sh[ 0 ];
+		dv0 = [ strides[9] ];                     // offset increment for innermost loop
+		dv1 = [ strides[8] - ( S0*strides[9] ) ];
+		dv2 = [ strides[7] - ( S1*strides[8] ) ];
+		dv3 = [ strides[6] - ( S2*strides[7] ) ];
+		dv4 = [ strides[5] - ( S3*strides[6] ) ];
+		dv5 = [ strides[4] - ( S4*strides[5] ) ];
+		dv6 = [ strides[3] - ( S5*strides[4] ) ];
+		dv7 = [ strides[2] - ( S6*strides[3] ) ];
+		dv8 = [ strides[1] - ( S7*strides[2] ) ];
+		dv9 = [ strides[0] - ( S8*strides[1] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[9] );
+			dv1.push( sv[8] - ( S0*sv[9] ) );
+			dv2.push( sv[7] - ( S1*sv[8] ) );
+			dv3.push( sv[6] - ( S2*sv[7] ) );
+			dv4.push( sv[5] - ( S3*sv[6] ) );
+			dv5.push( sv[4] - ( S4*sv[5] ) );
+			dv6.push( sv[3] - ( S5*sv[4] ) );
+			dv7.push( sv[2] - ( S6*sv[3] ) );
+			dv8.push( sv[1] - ( S7*sv[2] ) );
+			dv9.push( sv[0] - ( S8*sv[1] ) );
+		}
+	} else { // order === 'column-major'
+		// For column-major ndarrays, the first dimensions have the fastest changing indices...
+		S0 = sh[ 0 ];
+		S1 = sh[ 1 ];
+		S2 = sh[ 2 ];
+		S3 = sh[ 3 ];
+		S4 = sh[ 4 ];
+		S5 = sh[ 5 ];
+		S6 = sh[ 6 ];
+		S7 = sh[ 7 ];
+		S8 = sh[ 8 ];
+		S9 = sh[ 9 ];
+		dv0 = [ strides[0] ];                     // offset increment for innermost loop
+		dv1 = [ strides[1] - ( S0*strides[0] ) ];
+		dv2 = [ strides[2] - ( S1*strides[1] ) ];
+		dv3 = [ strides[3] - ( S2*strides[2] ) ];
+		dv4 = [ strides[4] - ( S3*strides[3] ) ];
+		dv5 = [ strides[5] - ( S4*strides[4] ) ];
+		dv6 = [ strides[6] - ( S5*strides[5] ) ];
+		dv7 = [ strides[7] - ( S6*strides[6] ) ];
+		dv8 = [ strides[8] - ( S7*strides[7] ) ];
+		dv9 = [ strides[9] - ( S8*strides[8] ) ];  // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[0] );
+			dv1.push( sv[1] - ( S0*sv[0] ) );
+			dv2.push( sv[2] - ( S1*sv[1] ) );
+			dv3.push( sv[3] - ( S2*sv[2] ) );
+			dv4.push( sv[4] - ( S3*sv[3] ) );
+			dv5.push( sv[5] - ( S4*sv[4] ) );
+			dv6.push( sv[6] - ( S5*sv[5] ) );
+			dv7.push( sv[7] - ( S6*sv[6] ) );
+			dv8.push( sv[8] - ( S7*sv[7] ) );
+			dv8.push( sv[8] - ( S8*sv[8] ) );
+		}
+	}
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	iv = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Cache accessors:
+	set = y.accessors[ 1 ];
+
+	// Iterate over the non-reduced ndarray dimensions...
+	for ( i9 = 0; i9 < S9; i9++ ) {
+		for ( i8 = 0; i8 < S8; i8++ ) {
+			for ( i7 = 0; i7 < S7; i7++ ) {
+				for ( i6 = 0; i6 < S6; i6++ ) {
+					for ( i5 = 0; i5 < S5; i5++ ) {
+						for ( i4 = 0; i4 < S4; i4++ ) {
+							for ( i3 = 0; i3 < S3; i3++ ) {
+								for ( i2 = 0; i2 < S2; i2++ ) {
+									for ( i1 = 0; i1 < S1; i1++ ) {
+										for ( i0 = 0; i0 < S0; i0++ ) {
+											setViewOffsets( views, iv );
+											set( ybuf, iv[ 1 ], fcn( views, opts ) );
+											incrementOffsets( iv, dv0 );
+										}
+										incrementOffsets( iv, dv1 );
+									}
+									incrementOffsets( iv, dv2 );
+								}
+								incrementOffsets( iv, dv3 );
+							}
+							incrementOffsets( iv, dv4 );
+						}
+						incrementOffsets( iv, dv5 );
+					}
+					incrementOffsets( iv, dv6 );
+				}
+				incrementOffsets( iv, dv7 );
+			}
+			incrementOffsets( iv, dv8 );
+		}
+		incrementOffsets( iv, dv9 );
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = unary10d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/10d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/10d_blocked.js
new file mode 100644
index 000000000000..dfcddb81036e
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/10d_blocked.js
@@ -0,0 +1,386 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-depth, max-len */
+
+'use strict';
+
+// MODULES //
+
+var loopOrder = require( '@stdlib/ndarray/base/unary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/unary-tiling-block-size' );
+var takeIndexed = require( '@stdlib/array/base/take-indexed' );
+var zeros = require( '@stdlib/array/base/zeros' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray via loop blocking.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+* var ybuf = filled( false, 3 );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 3, 3, 3, 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major'
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* blockedunary10d( base, [ x, y ], views, [ 12, 12, 12, 12, 12, 12, 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ [ [ [ [ [ [ true, false, true ] ] ] ] ] ] ] ] ] ]
+*/
+function blockedunary10d( fcn, arrays, views, strides, opts ) { // eslint-disable-line max-statements, max-lines-per-function
+	var bsize;
+	var ybuf;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var dv4;
+	var dv5;
+	var dv6;
+	var dv7;
+	var dv8;
+	var dv9;
+	var ov1;
+	var ov2;
+	var ov3;
+	var ov4;
+	var ov5;
+	var ov6;
+	var ov7;
+	var ov8;
+	var ov9;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var s5;
+	var s6;
+	var s7;
+	var s8;
+	var s9;
+	var sv;
+	var ov;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+	var i7;
+	var i8;
+	var i9;
+	var j0;
+	var j1;
+	var j2;
+	var j3;
+	var j4;
+	var j5;
+	var j6;
+	var j7;
+	var j8;
+	var j9;
+	var N;
+	var x;
+	var y;
+	var o;
+	var k;
+
+	// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	N = arrays.length;
+	x = arrays[ 0 ];
+	y = arrays[ 1 ];
+
+	// Resolve the loop interchange order:
+	o = loopOrder( y.shape, strides, y.strides );
+	sh = o.sh;
+	sv = [ o.sx, o.sy ];
+	for ( k = 2; k < N; k++ ) {
+		sv.push( takeIndexed( arrays[k].strides, o.idx ) );
+	}
+	// Determine the block size:
+	bsize = blockSize( x.dtype, y.dtype );
+
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	ov = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Cache offset increments for the innermost loop...
+	dv0 = [];
+	for ( k = 0; k < N; k++ ) {
+		dv0.push( sv[k][0] );
+	}
+	// Initialize loop variables...
+	ov1 = zeros( N );
+	ov2 = zeros( N );
+	ov3 = zeros( N );
+	ov4 = zeros( N );
+	ov5 = zeros( N );
+	ov6 = zeros( N );
+	ov7 = zeros( N );
+	ov8 = zeros( N );
+	ov9 = zeros( N );
+	dv1 = zeros( N );
+	dv2 = zeros( N );
+	dv3 = zeros( N );
+	dv4 = zeros( N );
+	dv5 = zeros( N );
+	dv6 = zeros( N );
+	dv7 = zeros( N );
+	dv8 = zeros( N );
+	dv9 = zeros( N );
+	iv = zeros( N );
+
+	// Iterate over blocks...
+	for ( j9 = sh[9]; j9 > 0; ) {
+		if ( j9 < bsize ) {
+			s9 = j9;
+			j9 = 0;
+		} else {
+			s9 = bsize;
+			j9 -= bsize;
+		}
+		for ( k = 0; k < N; k++ ) {
+			ov9[ k ] = ov[k] + ( j9*sv[k][9] );
+		}
+		for ( j8 = sh[8]; j8 > 0; ) {
+			if ( j8 < bsize ) {
+				s8 = j8;
+				j8 = 0;
+			} else {
+				s8 = bsize;
+				j8 -= bsize;
+			}
+			for ( k = 0; k < N; k++ ) {
+				dv9 = sv[k][9] - ( s8*sv[k][8] );
+				ov8[ k ] = ov9[k] + ( j8*sv[k][8] );
+			}
+			for ( j7 = sh[7]; j7 > 0; ) {
+				if ( j7 < bsize ) {
+					s7 = j7;
+					j7 = 0;
+				} else {
+					s7 = bsize;
+					j7 -= bsize;
+				}
+				for ( k = 0; k < N; k++ ) {
+					dv8 = sv[k][8] - ( s7*sv[k][7] );
+					ov7[ k ] = ov8[k] + ( j7*sv[k][7] );
+				}
+				for ( j6 = sh[6]; j6 > 0; ) {
+					if ( j6 < bsize ) {
+						s6 = j6;
+						j6 = 0;
+					} else {
+						s6 = bsize;
+						j6 -= bsize;
+					}
+					for ( k = 0; k < N; k++ ) {
+						dv7 = sv[k][7] - ( s6*sv[k][6] );
+						ov6[ k ] = ov7[k] + ( j6*sv[k][6] );
+					}
+					for ( j5 = sh[5]; j5 > 0; ) {
+						if ( j5 < bsize ) {
+							s5 = j5;
+							j5 = 0;
+						} else {
+							s5 = bsize;
+							j5 -= bsize;
+						}
+						for ( k = 0; k < N; k++ ) {
+							dv6 = sv[k][6] - ( s5*sv[k][5] );
+							ov5[ k ] = ov6[k] + ( j5*sv[k][5] );
+						}
+						for ( j4 = sh[4]; j4 > 0; ) {
+							if ( j4 < bsize ) {
+								s4 = j4;
+								j4 = 0;
+							} else {
+								s4 = bsize;
+								j4 -= bsize;
+							}
+							for ( k = 0; k < N; k++ ) {
+								dv5 = sv[k][5] - ( s4*sv[k][4] );
+								ov4[ k ] = ov5[k] + ( j4*sv[k][4] );
+							}
+							for ( j3 = sh[3]; j3 > 0; ) {
+								if ( j3 < bsize ) {
+									s3 = j3;
+									j3 = 0;
+								} else {
+									s3 = bsize;
+									j3 -= bsize;
+								}
+								for ( k = 0; k < N; k++ ) {
+									dv4[ k ] = sv[k][4] - ( s3*sv[k][3] );
+									ov3[ k ] = ov4[k] + ( j3*sv[k][3] );
+								}
+								for ( j2 = sh[2]; j2 > 0; ) {
+									if ( j2 < bsize ) {
+										s2 = j2;
+										j2 = 0;
+									} else {
+										s2 = bsize;
+										j2 -= bsize;
+									}
+									for ( k = 0; k < N; k++ ) {
+										dv3[ k ] = sv[k][3] - ( s2*sv[k][2] );
+										ov2[ k ] = ov3[k] + ( j2*sv[k][2] );
+									}
+									for ( j1 = sh[1]; j1 > 0; ) {
+										if ( j1 < bsize ) {
+											s1 = j1;
+											j1 = 0;
+										} else {
+											s1 = bsize;
+											j1 -= bsize;
+										}
+										for ( k = 0; k < N; k++ ) {
+											dv2[ k ] = sv[k][2] - ( s1*sv[k][1] );
+											ov1[ k ] = ov2[k] + ( j1*sv[k][1] );
+										}
+										for ( j0 = sh[0]; j0 > 0; ) {
+											if ( j0 < bsize ) {
+												s0 = j0;
+												j0 = 0;
+											} else {
+												s0 = bsize;
+												j0 -= bsize;
+											}
+											// Compute index offsets and loop offset increments for the first ndarray elements in the current block...
+											for ( k = 0; k < N; k++ ) {
+												iv[ k ] = ov1[k] + ( j0*sv[k][0] );
+												dv1[ k ] = sv[k][1] - ( s0*sv[k][0] );
+											}
+											// Iterate over the non-reduced ndarray dimensions...
+											for ( i9 = 0; i9 < s9; i9++ ) {
+												for ( i8 = 0; i8 < s8; i8++ ) {
+													for ( i7 = 0; i7 < s7; i7++ ) {
+														for ( i6 = 0; i6 < s6; i6++ ) {
+															for ( i5 = 0; i5 < s5; i5++ ) {
+																for ( i4 = 0; i4 < s4; i4++ ) {
+																	for ( i3 = 0; i3 < s3; i3++ ) {
+																		for ( i2 = 0; i2 < s2; i2++ ) {
+																			for ( i1 = 0; i1 < s1; i1++ ) {
+																				for ( i0 = 0; i0 < s0; i0++ ) {
+																					setViewOffsets( views, iv );
+																					ybuf[ iv[1] ] = fcn( views, opts );
+																					incrementOffsets( iv, dv0 );
+																				}
+																				incrementOffsets( iv, dv1 );
+																			}
+																			incrementOffsets( iv, dv2 );
+																		}
+																		incrementOffsets( iv, dv3 );
+																	}
+																	incrementOffsets( iv, dv4 );
+																}
+																incrementOffsets( iv, dv5 );
+															}
+															incrementOffsets( iv, dv6 );
+														}
+														incrementOffsets( iv, dv7 );
+													}
+													incrementOffsets( iv, dv8 );
+												}
+												incrementOffsets( iv, dv9 );
+											}
+										}
+									}
+								}
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = blockedunary10d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/3d.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/3d.js
index d2a0a7efe4ec..3f1f6ee0be40 100644
--- a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/3d.js
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/3d.js
@@ -94,12 +94,12 @@ var offsets = require( './offsets.js' );
 * ];
 *
 * // Perform a reduction:
-* unary2d( base, [ x, y ], views, [ 12, 12, 4 ], {} );
+* unary3d( base, [ x, y ], views, [ 12, 12, 4 ], {} );
 *
 * var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
 * // returns [ [ [ true, false, true ] ] ]
 */
-function unary2d( fcn, arrays, views, strides, opts ) {
+function unary3d( fcn, arrays, views, strides, opts ) {
 	var ybuf;
 	var dv0;
 	var dv1;
@@ -175,4 +175,4 @@ function unary2d( fcn, arrays, views, strides, opts ) {
 
 // EXPORTS //
 
-module.exports = unary2d;
+module.exports = unary3d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/3d_accessors.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/3d_accessors.js
new file mode 100644
index 000000000000..5e3f8611236e
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/3d_accessors.js
@@ -0,0 +1,186 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+'use strict';
+
+// MODULES //
+
+var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major-string' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );
+* var ybuf = toAccessorArray( filled( false, 3 ) );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major',
+*     'accessors': accessors( ybuf ).accessors
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* unary3d( base, [ x, y ], views, [ 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ true, false, true ] ] ]
+*/
+function unary3d( fcn, arrays, views, strides, opts ) {
+	var ybuf;
+	var set;
+	var dv0;
+	var dv1;
+	var dv2;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var sv;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var y;
+	var i;
+
+	// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the output ndarray and associated shape:
+	y = arrays[ 1 ];
+	sh = y.shape;
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	if ( isRowMajor( y.order ) ) {
+		// For row-major ndarrays, the last dimensions have the fastest changing indices...
+		S0 = sh[ 2 ];
+		S1 = sh[ 1 ];
+		S2 = sh[ 0 ];
+		dv0 = [ strides[2] ];                     // offset increment for innermost loop
+		dv1 = [ strides[1] - ( S0*strides[2] ) ];
+		dv2 = [ strides[0] - ( S1*strides[1] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[2] );
+			dv1.push( sv[1] - ( S0*sv[2] ) );
+			dv2.push( sv[0] - ( S1*sv[1] ) );
+		}
+	} else {
+		// For column-major ndarrays, the first dimensions have the fastest changing indices...
+		S0 = sh[ 0 ];
+		S1 = sh[ 1 ];
+		S2 = sh[ 2 ];
+		dv0 = [ strides[0] ];                     // offset increment for innermost loop
+		dv1 = [ strides[1] - ( S0*strides[0] ) ];
+		dv2 = [ strides[2] - ( S1*strides[1] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[0] );
+			dv1.push( sv[1] - ( S0*sv[0] ) );
+			dv2.push( sv[2] - ( S1*sv[1] ) );
+		}
+	}
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	iv = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Cache accessors:
+	set = y.accessors[ 1 ];
+
+	// Iterate over the non-reduced ndarray dimensions...
+	for ( i2 = 0; i2 < S2; i2++ ) {
+		for ( i1 = 0; i1 < S1; i1++ ) {
+			for ( i0 = 0; i0 < S0; i0++ ) {
+				setViewOffsets( views, iv );
+				set( ybuf, iv[ 1 ], fcn( views, opts ) );
+				incrementOffsets( iv, dv0 );
+			}
+			incrementOffsets( iv, dv1 );
+		}
+		incrementOffsets( iv, dv2 );
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = unary3d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/3d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/3d_blocked.js
new file mode 100644
index 000000000000..31a5c88e6389
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/3d_blocked.js
@@ -0,0 +1,225 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-depth */
+
+'use strict';
+
+// MODULES //
+
+var loopOrder = require( '@stdlib/ndarray/base/unary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/unary-tiling-block-size' );
+var takeIndexed = require( '@stdlib/array/base/take-indexed' );
+var zeros = require( '@stdlib/array/base/zeros' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray via loop blocking.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+* var ybuf = filled( false, 3 );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major'
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* blockedunary3d( base, [ x, y ], views, [ 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ true, false, true ] ] ]
+*/
+function blockedunary3d( fcn, arrays, views, strides, opts ) {
+	var bsize;
+	var ybuf;
+	var dv0;
+	var dv1;
+	var dv2;
+	var ov1;
+	var ov2;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var sv;
+	var ov;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var j0;
+	var j1;
+	var j2;
+	var N;
+	var x;
+	var y;
+	var o;
+	var k;
+
+	// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	N = arrays.length;
+	x = arrays[ 0 ];
+	y = arrays[ 1 ];
+
+	// Resolve the loop interchange order:
+	o = loopOrder( y.shape, strides, y.strides );
+	sh = o.sh;
+	sv = [ o.sx, o.sy ];
+	for ( k = 2; k < N; k++ ) {
+		sv.push( takeIndexed( arrays[k].strides, o.idx ) );
+	}
+	// Determine the block size:
+	bsize = blockSize( x.dtype, y.dtype );
+
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	ov = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Cache offset increments for the innermost loop...
+	dv0 = [];
+	for ( k = 0; k < N; k++ ) {
+		dv0.push( sv[k][0] );
+	}
+	// Initialize loop variables...
+	ov1 = zeros( N );
+	ov2 = zeros( N );
+	dv1 = zeros( N );
+	dv2 = zeros( N );
+	iv = zeros( N );
+
+	// Iterate over blocks...
+	for ( j2 = sh[2]; j2 > 0; ) {
+		if ( j2 < bsize ) {
+			s2 = j2;
+			j2 = 0;
+		} else {
+			s2 = bsize;
+			j2 -= bsize;
+		}
+		for ( k = 0; k < N; k++ ) {
+			ov2[ k ] = ov[k] + ( j2*sv[k][2] );
+		}
+		for ( j1 = sh[1]; j1 > 0; ) {
+			if ( j1 < bsize ) {
+				s1 = j1;
+				j1 = 0;
+			} else {
+				s1 = bsize;
+				j1 -= bsize;
+			}
+			for ( k = 0; k < N; k++ ) {
+				ov1[ k ] = ov2[k] + ( j1*sv[k][1] );
+				dv2[ k ] = sv[k][2] - ( s1*sv[k][1] );
+			}
+			for ( j0 = sh[0]; j0 > 0; ) {
+				if ( j0 < bsize ) {
+					s0 = j0;
+					j0 = 0;
+				} else {
+					s0 = bsize;
+					j0 -= bsize;
+				}
+				// Compute index offsets and loop offset increments for the first ndarray elements in the current block...
+				for ( k = 0; k < N; k++ ) {
+					iv[ k ] = ov1[k] + ( j0*sv[k][0] );
+					dv1[ k ] = sv[k][1] - ( s0*sv[k][0] );
+				}
+				// Iterate over the non-reduced ndarray dimensions...
+				for ( i2 = 0; i2 < s2; i2++ ) {
+					for ( i1 = 0; i1 < s1; i1++ ) {
+						for ( i0 = 0; i0 < s0; i0++ ) {
+							setViewOffsets( views, iv );
+							ybuf[ iv[1] ] = fcn( views, opts );
+							incrementOffsets( iv, dv0 );
+						}
+						incrementOffsets( iv, dv1 );
+					}
+					incrementOffsets( iv, dv2 );
+				}
+			}
+		}
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = blockedunary3d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/3d_blocked_accessors.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/3d_blocked_accessors.js
new file mode 100644
index 000000000000..ece7a2460c30
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/3d_blocked_accessors.js
@@ -0,0 +1,233 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-depth */
+
+'use strict';
+
+// MODULES //
+
+var loopOrder = require( '@stdlib/ndarray/base/unary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/unary-tiling-block-size' );
+var takeIndexed = require( '@stdlib/array/base/take-indexed' );
+var zeros = require( '@stdlib/array/base/zeros' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray via loop blocking.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );
+* var ybuf = toAccessorArray( filled( false, 3 ) );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major',
+*     'accessors': accessors( ybuf ).accessors
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* blockedunary3d( base, [ x, y ], views, [ 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ true, false, true ] ] ]
+*/
+function blockedunary3d( fcn, arrays, views, strides, opts ) {
+	var bsize;
+	var ybuf;
+	var set;
+	var dv0;
+	var dv1;
+	var dv2;
+	var ov1;
+	var ov2;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var sv;
+	var ov;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var j0;
+	var j1;
+	var j2;
+	var N;
+	var x;
+	var y;
+	var o;
+	var k;
+
+	// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	N = arrays.length;
+	x = arrays[ 0 ];
+	y = arrays[ 1 ];
+
+	// Resolve the loop interchange order:
+	o = loopOrder( y.shape, strides, y.strides );
+	sh = o.sh;
+	sv = [ o.sx, o.sy ];
+	for ( k = 2; k < N; k++ ) {
+		sv.push( takeIndexed( arrays[k].strides, o.idx ) );
+	}
+	// Determine the block size:
+	bsize = blockSize( x.dtype, y.dtype );
+
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	ov = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Cache accessors:
+	set = y.accessors[1];
+
+	// Cache offset increments for the innermost loop...
+	dv0 = [];
+	for ( k = 0; k < N; k++ ) {
+		dv0.push( sv[k][0] );
+	}
+	// Initialize loop variables...
+	ov1 = zeros( N );
+	ov2 = zeros( N );
+	dv1 = zeros( N );
+	dv2 = zeros( N );
+	iv = zeros( N );
+
+	// Iterate over blocks...
+	for ( j2 = sh[2]; j2 > 0; ) {
+		if ( j2 < bsize ) {
+			s2 = j2;
+			j2 = 0;
+		} else {
+			s2 = bsize;
+			j2 -= bsize;
+		}
+		for ( k = 0; k < N; k++ ) {
+			ov2[ k ] = ov[k] + ( j2*sv[k][2] );
+		}
+		for ( j1 = sh[1]; j1 > 0; ) {
+			if ( j1 < bsize ) {
+				s1 = j1;
+				j1 = 0;
+			} else {
+				s1 = bsize;
+				j1 -= bsize;
+			}
+			for ( k = 0; k < N; k++ ) {
+				ov1[ k ] = ov2[k] + ( j1*sv[k][1] );
+				dv2[ k ] = sv[k][2] - ( s1*sv[k][1] );
+			}
+			for ( j0 = sh[0]; j0 > 0; ) {
+				if ( j0 < bsize ) {
+					s0 = j0;
+					j0 = 0;
+				} else {
+					s0 = bsize;
+					j0 -= bsize;
+				}
+				// Compute index offsets and loop offset increments for the first ndarray elements in the current block...
+				for ( k = 0; k < N; k++ ) {
+					iv[ k ] = ov1[k] + ( j0*sv[k][0] );
+					dv1[ k ] = sv[k][1] - ( s0*sv[k][0] );
+				}
+				// Iterate over the non-reduced ndarray dimensions...
+				for ( i2 = 0; i2 < s2; i2++ ) {
+					for ( i1 = 0; i1 < s1; i1++ ) {
+						for ( i0 = 0; i0 < s0; i0++ ) {
+							setViewOffsets( views, iv );
+							set( ybuf, iv[1], fcn( views, opts ) );
+							incrementOffsets( iv, dv0 );
+						}
+						incrementOffsets( iv, dv1 );
+					}
+					incrementOffsets( iv, dv2 );
+				}
+			}
+		}
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = blockedunary3d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/4d.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/4d.js
new file mode 100644
index 000000000000..099a0139f46b
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/4d.js
@@ -0,0 +1,190 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+'use strict';
+
+// MODULES //
+
+var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major-string' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+* var ybuf = filled( false, 3 );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major'
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* unary4d( base, [ x, y ], views, [ 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ true, false, true ] ] ] ]
+*/
+function unary4d( fcn, arrays, views, strides, opts ) {
+	var ybuf;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var sv;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var y;
+	var i;
+
+	// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the output ndarray and associated shape:
+	y = arrays[ 1 ];
+	sh = y.shape;
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	if ( isRowMajor( y.order ) ) {
+		// For row-major ndarrays, the last dimensions have the fastest changing indices...
+		S0 = sh[ 3 ];
+		S1 = sh[ 2 ];
+		S2 = sh[ 1 ];
+		S3 = sh[ 0 ];
+		dv0 = [ strides[3] ];                     // offset increment for innermost loop
+		dv1 = [ strides[2] - ( S0*strides[3] ) ];
+		dv2 = [ strides[1] - ( S1*strides[2] ) ];
+		dv3 = [ strides[0] - ( S2*strides[1] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[3] );
+			dv1.push( sv[2] - ( S0*sv[3] ) );
+			dv2.push( sv[1] - ( S1*sv[2] ) );
+			dv3.push( sv[0] - ( S2*sv[1]) );
+		}
+	} else { // order === 'column-major'
+		// For column-major ndarrays, the first dimensions have the fastest changing indices...
+		S0 = sh[ 0 ];
+		S1 = sh[ 1 ];
+		S2 = sh[ 2 ];
+		S3 = sh[ 3 ];
+		dv0 = [ strides[0] ];                     // offset increment for innermost loop
+		dv1 = [ strides[1] - ( S0*strides[0] ) ];
+		dv2 = [ strides[2] - ( S1*strides[1] ) ];
+		dv3 = [ strides[3] - ( S2*strides[2] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[0] );
+			dv1.push( sv[1] - ( S0*sv[0] ) );
+			dv2.push( sv[2] - ( S1*sv[1] ) );
+			dv3.push( sv[3] - ( S2*sv[2] ) );
+		}
+	}
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	iv = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Iterate over the non-reduced ndarray dimensions...
+	for ( i3 = 0; i3 < S3; i3++ ) {
+		for ( i2 = 0; i2 < S2; i2++ ) {
+			for ( i1 = 0; i1 < S1; i1++ ) {
+				for ( i0 = 0; i0 < S0; i0++ ) {
+					setViewOffsets( views, iv );
+					ybuf[ iv[1] ] = fcn( views, opts );
+					incrementOffsets( iv, dv0 );
+				}
+				incrementOffsets( iv, dv1 );
+			}
+			incrementOffsets( iv, dv2 );
+		}
+		incrementOffsets( iv, dv3 );
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = unary4d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/4d_accessors.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/4d_accessors.js
new file mode 100644
index 000000000000..0a7d899949c4
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/4d_accessors.js
@@ -0,0 +1,198 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+'use strict';
+
+// MODULES //
+
+var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major-string' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );
+* var ybuf = toAccessorArray( filled( false, 3 ) );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major',
+*     'accessors': accessors( ybuf ).accessors
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* unary4d( base, [ x, y ], views, [ 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ true, false, true ] ] ] ]
+*/
+function unary4d( fcn, arrays, views, strides, opts ) {
+	var ybuf;
+	var set;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var sv;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var y;
+	var i;
+
+	// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the output ndarray and associated shape:
+	y = arrays[ 1 ];
+	sh = y.shape;
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	if ( isRowMajor( y.order ) ) {
+		// For row-major ndarrays, the last dimensions have the fastest changing indices...
+		S0 = sh[ 3 ];
+		S1 = sh[ 2 ];
+		S2 = sh[ 1 ];
+		S3 = sh[ 0 ];
+		dv0 = [ strides[3] ];                     // offset increment for innermost loop
+		dv1 = [ strides[2] - ( S0*strides[3] ) ];
+		dv2 = [ strides[1] - ( S1*strides[2] ) ];
+		dv3 = [ strides[0] - ( S2*strides[1] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[3] );
+			dv1.push( sv[2] - ( S0*sv[3] ) );
+			dv2.push( sv[1] - ( S1*sv[2] ) );
+			dv3.push( sv[0] - ( S2*sv[1] ) );
+		}
+	} else { // order === 'column-major'
+		// For column-major ndarrays, the first dimensions have the fastest changing indices...
+		S0 = sh[ 0 ];
+		S1 = sh[ 1 ];
+		S2 = sh[ 2 ];
+		S3 = sh[ 3 ];
+		dv0 = [ strides[0] ];                     // offset increment for innermost loop
+		dv1 = [ strides[1] - ( S0*strides[0] ) ];
+		dv2 = [ strides[2] - ( S1*strides[1] ) ];
+		dv3 = [ strides[3] - ( S2*strides[2]) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[0] );
+			dv1.push( sv[1] - ( S0*sv[0] ) );
+			dv2.push( sv[2] - ( S1*sv[1] ) );
+			dv3.push( sv[3] - ( S2*sv[2] ) );
+		}
+	}
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	iv = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Cache accessors:
+	set = y.accessors[ 1 ];
+
+	// Iterate over the non-reduced ndarray dimensions...
+	for ( i3 = 0; i3 < S3; i3++ ) {
+		for ( i2 = 0; i2 < S2; i2++ ) {
+			for ( i1 = 0; i1 < S1; i1++ ) {
+				for ( i0 = 0; i0 < S0; i0++ ) {
+					setViewOffsets( views, iv );
+					set( ybuf, iv[ 1 ], fcn( views, opts ) );
+					incrementOffsets( iv, dv0 );
+				}
+				incrementOffsets( iv, dv1 );
+			}
+			incrementOffsets( iv, dv2 );
+		}
+		incrementOffsets( iv, dv3 );
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = unary4d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/4d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/4d_blocked.js
new file mode 100644
index 000000000000..bef3bde91ba8
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/4d_blocked.js
@@ -0,0 +1,248 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-depth */
+
+'use strict';
+
+// MODULES //
+
+var loopOrder = require( '@stdlib/ndarray/base/unary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/unary-tiling-block-size' );
+var takeIndexed = require( '@stdlib/array/base/take-indexed' );
+var zeros = require( '@stdlib/array/base/zeros' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray via loop blocking.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+* var ybuf = filled( false, 3 );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major'
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* blockedunary4d( base, [ x, y ], views, [ 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ true, false, true ] ] ] ]
+*/
+function blockedunary4d( fcn, arrays, views, strides, opts ) {
+	var bsize;
+	var ybuf;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var ov1;
+	var ov2;
+	var ov3;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var sv;
+	var ov;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var j0;
+	var j1;
+	var j2;
+	var j3;
+	var N;
+	var x;
+	var y;
+	var o;
+	var k;
+
+	// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	N = arrays.length;
+	x = arrays[ 0 ];
+	y = arrays[ 1 ];
+
+	// Resolve the loop interchange order:
+	o = loopOrder( y.shape, strides, y.strides );
+	sh = o.sh;
+	sv = [ o.sx, o.sy ];
+	for ( k = 2; k < N; k++ ) {
+		sv.push( takeIndexed( arrays[k].strides, o.idx ) );
+	}
+	// Determine the block size:
+	bsize = blockSize( x.dtype, y.dtype );
+
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	ov = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Cache offset increments for the innermost loop...
+	dv0 = [];
+	for ( k = 0; k < N; k++ ) {
+		dv0.push( sv[k][0] );
+	}
+	// Initialize loop variables...
+	ov1 = zeros( N );
+	ov2 = zeros( N );
+	ov3 = zeros( N );
+	dv1 = zeros( N );
+	dv2 = zeros( N );
+	dv3 = zeros( N );
+	iv = zeros( N );
+
+	// Iterate over blocks...
+	for ( j3 = sh[3]; j3 > 0; ) {
+		if ( j3 < bsize ) {
+			s3 = j3;
+			j3 = 0;
+		} else {
+			s3 = bsize;
+			j3 -= bsize;
+		}
+		for ( k = 0; k < N; k++ ) {
+			ov3[ k ] = ov[k] + ( j3*sv[k][3] );
+		}
+		for ( j2 = sh[2]; j2 > 0; ) {
+			if ( j2 < bsize ) {
+				s2 = j2;
+				j2 = 0;
+			} else {
+				s2 = bsize;
+				j2 -= bsize;
+			}
+			for ( k = 0; k < N; k++ ) {
+				ov2[ k ] = ov3[k] + ( j2*sv[k][2] );
+				dv3[ k ] = sv[k][3] - ( s2*sv[k][2] );
+			}
+			for ( j1 = sh[1]; j1 > 0; ) {
+				if ( j1 < bsize ) {
+					s1 = j1;
+					j1 = 0;
+				} else {
+					s1 = bsize;
+					j1 -= bsize;
+				}
+				for ( k = 0; k < N; k++ ) {
+					ov1[ k ] = ov2[k] + ( j1*sv[k][1] );
+					dv2[ k ] = sv[k][2] - ( s1*sv[k][1] );
+				}
+				for ( j0 = sh[0]; j0 > 0; ) {
+					if ( j0 < bsize ) {
+						s0 = j0;
+						j0 = 0;
+					} else {
+						s0 = bsize;
+						j0 -= bsize;
+					}
+					// Compute index offsets and loop offset increments for the first ndarray elements in the current block...
+					for ( k = 0; k < N; k++ ) {
+						iv[ k ] = ov1[k] + ( j0*sv[k][0] );
+						dv1[ k ] = sv[k][1] - ( s0*sv[k][0] );
+					}
+					// Iterate over the non-reduced ndarray dimensions...
+					for ( i3 = 0; i3 < s3; i3++ ) {
+						for ( i2 = 0; i2 < s2; i2++ ) {
+							for ( i1 = 0; i1 < s1; i1++ ) {
+								for ( i0 = 0; i0 < s0; i0++ ) {
+									setViewOffsets( views, iv );
+									ybuf[ iv[1] ] = fcn( views, opts );
+									incrementOffsets( iv, dv0 );
+								}
+								incrementOffsets( iv, dv1 );
+							}
+							incrementOffsets( iv, dv2 );
+						}
+						incrementOffsets( iv, dv3 );
+					}
+				}
+			}
+		}
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = blockedunary4d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/4d_blocked_accessors.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/4d_blocked_accessors.js
new file mode 100644
index 000000000000..d5f33d916dae
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/4d_blocked_accessors.js
@@ -0,0 +1,256 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-depth */
+
+'use strict';
+
+// MODULES //
+
+var loopOrder = require( '@stdlib/ndarray/base/unary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/unary-tiling-block-size' );
+var takeIndexed = require( '@stdlib/array/base/take-indexed' );
+var zeros = require( '@stdlib/array/base/zeros' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray via loop blocking.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );
+* var ybuf = toAccessorArray( filled( false, 3 ) );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major',
+*     'accessors': accessors( ybuf ).accessors
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* blockedunary4d( base, [ x, y ], views, [ 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ true, false, true ] ] ] ]
+*/
+function blockedunary4d( fcn, arrays, views, strides, opts ) {
+	var bsize;
+	var ybuf;
+	var set;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var ov1;
+	var ov2;
+	var ov3;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var sv;
+	var ov;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var j0;
+	var j1;
+	var j2;
+	var j3;
+	var N;
+	var x;
+	var y;
+	var o;
+	var k;
+
+	// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	N = arrays.length;
+	x = arrays[ 0 ];
+	y = arrays[ 1 ];
+
+	// Resolve the loop interchange order:
+	o = loopOrder( y.shape, strides, y.strides );
+	sh = o.sh;
+	sv = [ o.sx, o.sy ];
+	for ( k = 2; k < N; k++ ) {
+		sv.push( takeIndexed( arrays[k].strides, o.idx ) );
+	}
+	// Determine the block size:
+	bsize = blockSize( x.dtype, y.dtype );
+
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	ov = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Cache accessors:
+	set = y.accessors[1];
+
+	// Cache offset increments for the innermost loop...
+	dv0 = [];
+	for ( k = 0; k < N; k++ ) {
+		dv0.push( sv[k][0] );
+	}
+	// Initialize loop variables...
+	ov1 = zeros( N );
+	ov2 = zeros( N );
+	ov3 = zeros( N );
+	dv1 = zeros( N );
+	dv2 = zeros( N );
+	dv3 = zeros( N );
+	iv = zeros( N );
+
+	// Iterate over blocks...
+	for ( j3 = sh[3]; j3 > 0; ) {
+		if ( j3 < bsize ) {
+			s3 = j3;
+			j3 = 0;
+		} else {
+			s3 = bsize;
+			j3 -= bsize;
+		}
+		for ( k = 0; k < N; k++ ) {
+			ov3[ k ] = ov[k] + ( j3*sv[k][3] );
+		}
+		for ( j2 = sh[2]; j2 > 0; ) {
+			if ( j2 < bsize ) {
+				s2 = j2;
+				j2 = 0;
+			} else {
+				s2 = bsize;
+				j2 -= bsize;
+			}
+			for ( k = 0; k < N; k++ ) {
+				ov2[ k ] = ov3[k] + ( j2*sv[k][2] );
+				dv3[ k ] = sv[k][3] - ( s2*sv[k][2] );
+			}
+			for ( j1 = sh[1]; j1 > 0; ) {
+				if ( j1 < bsize ) {
+					s1 = j1;
+					j1 = 0;
+				} else {
+					s1 = bsize;
+					j1 -= bsize;
+				}
+				for ( k = 0; k < N; k++ ) {
+					ov1[ k ] = ov2[k] + ( j1*sv[k][1] );
+					dv2[ k ] = sv[k][2] - ( s1*sv[k][1] );
+				}
+				for ( j0 = sh[0]; j0 > 0; ) {
+					if ( j0 < bsize ) {
+						s0 = j0;
+						j0 = 0;
+					} else {
+						s0 = bsize;
+						j0 -= bsize;
+					}
+					// Compute index offsets and loop offset increments for the first ndarray elements in the current block...
+					for ( k = 0; k < N; k++ ) {
+						iv[ k ] = ov1[k] + ( j0*sv[k][0] );
+						dv1[ k ] = sv[k][1] - ( s0*sv[k][0] );
+					}
+					// Iterate over the non-reduced ndarray dimensions...
+					for ( i3 = 0; i3 < s3; i3++ ) {
+						for ( i2 = 0; i2 < s2; i2++ ) {
+							for ( i1 = 0; i1 < s1; i1++ ) {
+								for ( i0 = 0; i0 < s0; i0++ ) {
+									setViewOffsets( views, iv );
+									set( ybuf, iv[1], fcn( views, opts ) );
+									incrementOffsets( iv, dv0 );
+								}
+								incrementOffsets( iv, dv1 );
+							}
+							incrementOffsets( iv, dv2 );
+						}
+						incrementOffsets( iv, dv3 );
+					}
+				}
+			}
+		}
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = blockedunary4d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/5d.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/5d.js
new file mode 100644
index 000000000000..b7217bcd5bef
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/5d.js
@@ -0,0 +1,202 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+'use strict';
+
+// MODULES //
+
+var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major-string' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+* var ybuf = filled( false, 3 );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major'
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* unary5d( base, [ x, y ], views, [ 12, 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ [ true, false, true ] ] ] ] ]
+*/
+function unary5d( fcn, arrays, views, strides, opts ) {
+	var ybuf;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var dv4;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var sv;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var y;
+	var i;
+
+	// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the output ndarray and associated shape:
+	y = arrays[ 1 ];
+	sh = y.shape;
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	if ( isRowMajor( y.order ) ) {
+		// For row-major ndarrays, the last dimensions have the fastest changing indices...
+		S0 = sh[ 4 ];
+		S1 = sh[ 3 ];
+		S2 = sh[ 2 ];
+		S3 = sh[ 1 ];
+		S4 = sh[ 0 ];
+		dv0 = [ strides[4] ];                     // offset increment for innermost loop
+		dv1 = [ strides[3] - ( S0*strides[4] ) ];
+		dv2 = [ strides[2] - ( S1*strides[3] ) ];
+		dv3 = [ strides[1] - ( S2*strides[2] ) ];
+		dv4 = [ strides[0] - ( S3*strides[1] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[4] );
+			dv1.push( sv[3] - ( S0*sv[4] ) );
+			dv2.push( sv[2] - ( S1*sv[3] ) );
+			dv3.push( sv[1] - ( S2*sv[2] ) );
+			dv4.push( sv[0] - ( S3*sv[1] ) );
+		}
+	} else { // order === 'column-major'
+		// For column-major ndarrays, the first dimensions have the fastest changing indices...
+		S0 = sh[ 0 ];
+		S1 = sh[ 1 ];
+		S2 = sh[ 2 ];
+		S3 = sh[ 3 ];
+		S4 = sh[ 4 ];
+		dv0 = [ strides[0] ];                     // offset increment for innermost loop
+		dv1 = [ strides[1] - ( S0*strides[0] ) ];
+		dv2 = [ strides[2] - ( S1*strides[1] ) ];
+		dv3 = [ strides[3] - ( S2*strides[2] ) ];
+		dv4 = [ strides[4] - ( S3*strides[3] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[0] );
+			dv1.push( sv[1] - ( S0*sv[0] ) );
+			dv2.push( sv[2] - ( S1*sv[1] ) );
+			dv3.push( sv[3] - ( S2*sv[2] ) );
+			dv4.push( sv[4] - ( S3*sv[3] ) );
+		}
+	}
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	iv = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Iterate over the non-reduced ndarray dimensions...
+	for ( i4 = 0; i4 < S4; i4++ ) {
+		for ( i3 = 0; i3 < S3; i3++ ) {
+			for ( i2 = 0; i2 < S2; i2++ ) {
+				for ( i1 = 0; i1 < S1; i1++ ) {
+					for ( i0 = 0; i0 < S0; i0++ ) {
+						setViewOffsets( views, iv );
+						ybuf[ iv[1] ] = fcn( views, opts );
+						incrementOffsets( iv, dv0 );
+					}
+					incrementOffsets( iv, dv1 );
+				}
+				incrementOffsets( iv, dv2 );
+			}
+			incrementOffsets( iv, dv3 );
+		}
+		incrementOffsets( iv, dv4 );
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = unary5d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/5d_accessors.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/5d_accessors.js
new file mode 100644
index 000000000000..910a6a72a7d9
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/5d_accessors.js
@@ -0,0 +1,210 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+'use strict';
+
+// MODULES //
+
+var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major-string' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );
+* var ybuf = toAccessorArray( filled( false, 3 ) );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major',
+*     'accessors': accessors( ybuf ).accessors
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* unary5d( base, [ x, y ], views, [ 12, 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ [ true, false, true ] ] ] ] ]
+*/
+function unary5d( fcn, arrays, views, strides, opts ) {
+	var ybuf;
+	var set;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var dv4;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var sv;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var y;
+	var i;
+
+	// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the output ndarray and associated shape:
+	y = arrays[ 1 ];
+	sh = y.shape;
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	if ( isRowMajor( y.order ) ) {
+		// For row-major ndarrays, the last dimensions have the fastest changing indices...
+		S0 = sh[ 4 ];
+		S1 = sh[ 3 ];
+		S2 = sh[ 2 ];
+		S3 = sh[ 1 ];
+		S4 = sh[ 0 ];
+		dv0 = [ strides[4] ];                     // offset increment for innermost loop
+		dv1 = [ strides[3] - ( S0*strides[4] ) ];
+		dv2 = [ strides[2] - ( S1*strides[3] ) ];
+		dv3 = [ strides[1] - ( S2*strides[2] ) ];
+		dv4 = [ strides[0] - ( S3*strides[1] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[4] );
+			dv1.push( sv[3] - ( S0*sv[4] ) );
+			dv2.push( sv[2] - ( S1*sv[3] ) );
+			dv3.push( sv[1] - ( S2*sv[2] ) );
+			dv4.push( sv[0] - ( S3*sv[1] ) );
+		}
+	} else { // order === 'column-major'
+		// For column-major ndarrays, the first dimensions have the fastest changing indices...
+		S0 = sh[ 0 ];
+		S1 = sh[ 1 ];
+		S2 = sh[ 2 ];
+		S3 = sh[ 3 ];
+		S4 = sh[ 4 ];
+		dv0 = [ strides[0] ];                     // offset increment for innermost loop
+		dv1 = [ strides[1] - ( S0*strides[0] ) ];
+		dv2 = [ strides[2] - ( S1*strides[1] ) ];
+		dv3 = [ strides[3] - ( S2*strides[2] ) ];
+		dv4 = [ strides[4] - ( S3*strides[3] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[0] );
+			dv1.push( sv[1] - ( S0*sv[0] ) );
+			dv2.push( sv[2] - ( S1*sv[1] ) );
+			dv3.push( sv[3] - ( S2*sv[2] ) );
+			dv4.push( sv[4] - ( S3*sv[3] ) );
+		}
+	}
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	iv = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Cache accessors:
+	set = y.accessors[ 1 ];
+
+	// Iterate over the non-reduced ndarray dimensions...
+	for ( i4 = 0; i4 < S4; i4++ ) {
+		for ( i3 = 0; i3 < S3; i3++ ) {
+			for ( i2 = 0; i2 < S2; i2++ ) {
+				for ( i1 = 0; i1 < S1; i1++ ) {
+					for ( i0 = 0; i0 < S0; i0++ ) {
+						setViewOffsets( views, iv );
+						set( ybuf, iv[ 1 ], fcn( views, opts ) );
+						incrementOffsets( iv, dv0 );
+					}
+					incrementOffsets( iv, dv1 );
+				}
+				incrementOffsets( iv, dv2 );
+			}
+			incrementOffsets( iv, dv3 );
+		}
+		incrementOffsets( iv, dv4 );
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = unary5d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/5d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/5d_blocked.js
new file mode 100644
index 000000000000..eb0dbf090253
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/5d_blocked.js
@@ -0,0 +1,271 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-depth */
+
+'use strict';
+
+// MODULES //
+
+var loopOrder = require( '@stdlib/ndarray/base/unary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/unary-tiling-block-size' );
+var takeIndexed = require( '@stdlib/array/base/take-indexed' );
+var zeros = require( '@stdlib/array/base/zeros' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray via loop blocking.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+* var ybuf = filled( false, 3 );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major'
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* blockedunary5d( base, [ x, y ], views, [ 12, 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ [ true, false, true ] ] ] ] ]
+*/
+function blockedunary5d( fcn, arrays, views, strides, opts ) { // eslint-disable-line max-statements
+	var bsize;
+	var ybuf;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var dv4;
+	var ov1;
+	var ov2;
+	var ov3;
+	var ov4;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var sv;
+	var ov;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var j0;
+	var j1;
+	var j2;
+	var j3;
+	var j4;
+	var N;
+	var x;
+	var y;
+	var o;
+	var k;
+
+	// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	N = arrays.length;
+	x = arrays[ 0 ];
+	y = arrays[ 1 ];
+
+	// Resolve the loop interchange order:
+	o = loopOrder( y.shape, strides, y.strides );
+	sh = o.sh;
+	sv = [ o.sx, o.sy ];
+	for ( k = 2; k < N; k++ ) {
+		sv.push( takeIndexed( arrays[k].strides, o.idx ) );
+	}
+	// Determine the block size:
+	bsize = blockSize( x.dtype, y.dtype );
+
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	ov = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Cache offset increments for the innermost loop...
+	dv0 = [];
+	for ( k = 0; k < N; k++ ) {
+		dv0.push( sv[k][0] );
+	}
+	// Initialize loop variables...
+	ov1 = zeros( N );
+	ov2 = zeros( N );
+	ov3 = zeros( N );
+	ov4 = zeros( N );
+	dv1 = zeros( N );
+	dv2 = zeros( N );
+	dv3 = zeros( N );
+	dv4 = zeros( N );
+	iv = zeros( N );
+
+	// Iterate over blocks...
+	for ( j4 = sh[4]; j4 > 0; ) {
+		if ( j4 < bsize ) {
+			s4 = j4;
+			j4 = 0;
+		} else {
+			s4 = bsize;
+			j4 -= bsize;
+		}
+		for ( k = 0; k < N; k++ ) {
+			ov4[ k ] = ov[k] + ( j4*sv[k][4] );
+		}
+		for ( j3 = sh[3]; j3 > 0; ) {
+			if ( j3 < bsize ) {
+				s3 = j3;
+				j3 = 0;
+			} else {
+				s3 = bsize;
+				j3 -= bsize;
+			}
+			for ( k = 0; k < N; k++ ) {
+				dv4[ k ] = sv[k][4] - ( s3*sv[k][3] );
+				ov3[ k ] = ov4[k] + ( j3*sv[k][3] );
+			}
+			for ( j2 = sh[2]; j2 > 0; ) {
+				if ( j2 < bsize ) {
+					s2 = j2;
+					j2 = 0;
+				} else {
+					s2 = bsize;
+					j2 -= bsize;
+				}
+				for ( k = 0; k < N; k++ ) {
+					dv3[ k ] = sv[k][3] - ( s2*sv[k][2] );
+					ov2[ k ] = ov3[k] + ( j2*sv[k][2] );
+				}
+				for ( j1 = sh[1]; j1 > 0; ) {
+					if ( j1 < bsize ) {
+						s1 = j1;
+						j1 = 0;
+					} else {
+						s1 = bsize;
+						j1 -= bsize;
+					}
+					for ( k = 0; k < N; k++ ) {
+						dv2[ k ] = sv[k][2] - ( s1*sv[k][1] );
+						ov1[ k ] = ov2[k] + ( j1*sv[k][1] );
+					}
+					for ( j0 = sh[0]; j0 > 0; ) {
+						if ( j0 < bsize ) {
+							s0 = j0;
+							j0 = 0;
+						} else {
+							s0 = bsize;
+							j0 -= bsize;
+						}
+						// Compute index offsets and loop offset increments for the first ndarray elements in the current block...
+						for ( k = 0; k < N; k++ ) {
+							iv[ k ] = ov1[k] + ( j0*sv[k][0] );
+							dv1[ k ] = sv[k][1] - ( s0*sv[k][0] );
+						}
+						// Iterate over the non-reduced ndarray dimensions...
+						for ( i4 = 0; i4 < s4; i4++ ) {
+							for ( i3 = 0; i3 < s3; i3++ ) {
+								for ( i2 = 0; i2 < s2; i2++ ) {
+									for ( i1 = 0; i1 < s1; i1++ ) {
+										for ( i0 = 0; i0 < s0; i0++ ) {
+											setViewOffsets( views, iv );
+											ybuf[ iv[1] ] = fcn( views, opts );
+											incrementOffsets( iv, dv0 );
+										}
+										incrementOffsets( iv, dv1 );
+									}
+									incrementOffsets( iv, dv2 );
+								}
+								incrementOffsets( iv, dv3 );
+							}
+							incrementOffsets( iv, dv4 );
+						}
+					}
+				}
+			}
+		}
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = blockedunary5d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/5d_blocked_accessors.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/5d_blocked_accessors.js
new file mode 100644
index 000000000000..58f0147473f4
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/5d_blocked_accessors.js
@@ -0,0 +1,279 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-depth, max-len */
+
+'use strict';
+
+// MODULES //
+
+var loopOrder = require( '@stdlib/ndarray/base/unary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/unary-tiling-block-size' );
+var takeIndexed = require( '@stdlib/array/base/take-indexed' );
+var zeros = require( '@stdlib/array/base/zeros' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray via loop blocking.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );
+* var ybuf = toAccessorArray( filled( false, 3 ) );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major',
+*     'accessors': accessors( ybuf ).accessors
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* blockedunary5d( base, [ x, y ], views, [ 12, 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ [ true, false, true ] ] ] ] ]
+*/
+function blockedunary5d( fcn, arrays, views, strides, opts ) { // eslint-disable-line max-statements
+	var bsize;
+	var ybuf;
+	var set;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var dv4;
+	var ov1;
+	var ov2;
+	var ov3;
+	var ov4;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var sv;
+	var ov;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var j0;
+	var j1;
+	var j2;
+	var j3;
+	var j4;
+	var N;
+	var x;
+	var y;
+	var o;
+	var k;
+
+	// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	N = arrays.length;
+	x = arrays[ 0 ];
+	y = arrays[ 1 ];
+
+	// Resolve the loop interchange order:
+	o = loopOrder( y.shape, strides, y.strides );
+	sh = o.sh;
+	sv = [ o.sx, o.sy ];
+	for ( k = 2; k < N; k++ ) {
+		sv.push( takeIndexed( arrays[k].strides, o.idx ) );
+	}
+	// Determine the block size:
+	bsize = blockSize( x.dtype, y.dtype );
+
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	ov = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Cache accessors:
+	set = y.accessors[1];
+
+	// Cache offset increments for the innermost loop...
+	dv0 = [];
+	for ( k = 0; k < N; k++ ) {
+		dv0.push( sv[k][0] );
+	}
+	// Initialize loop variables...
+	ov1 = zeros( N );
+	ov2 = zeros( N );
+	ov3 = zeros( N );
+	ov4 = zeros( N );
+	dv1 = zeros( N );
+	dv2 = zeros( N );
+	dv3 = zeros( N );
+	dv4 = zeros( N );
+	iv = zeros( N );
+
+	// Iterate over blocks...
+	for ( j4 = sh[4]; j4 > 0; ) {
+		if ( j4 < bsize ) {
+			s4 = j4;
+			j4 = 0;
+		} else {
+			s4 = bsize;
+			j4 -= bsize;
+		}
+		for ( k = 0; k < N; k++ ) {
+			ov4[ k ] = ov[k] + ( j4*sv[k][4] );
+		}
+		for ( j3 = sh[3]; j3 > 0; ) {
+			if ( j3 < bsize ) {
+				s3 = j3;
+				j3 = 0;
+			} else {
+				s3 = bsize;
+				j3 -= bsize;
+			}
+			for ( k = 0; k < N; k++ ) {
+				dv4[ k ] = sv[k][4] - ( s3*sv[k][3] );
+				ov3[ k ] = ov4[k] + ( j3*sv[k][3] );
+			}
+			for ( j2 = sh[2]; j2 > 0; ) {
+				if ( j2 < bsize ) {
+					s2 = j2;
+					j2 = 0;
+				} else {
+					s2 = bsize;
+					j2 -= bsize;
+				}
+				for ( k = 0; k < N; k++ ) {
+					dv3[ k ] = sv[k][3] - ( s2*sv[k][2] );
+					ov2[ k ] = ov3[k] + ( j2*sv[k][2] );
+				}
+				for ( j1 = sh[1]; j1 > 0; ) {
+					if ( j1 < bsize ) {
+						s1 = j1;
+						j1 = 0;
+					} else {
+						s1 = bsize;
+						j1 -= bsize;
+					}
+					for ( k = 0; k < N; k++ ) {
+						dv2[ k ] = sv[k][2] - ( s1*sv[k][1] );
+						ov1[ k ] = ov2[k] + ( j1*sv[k][1] );
+					}
+					for ( j0 = sh[0]; j0 > 0; ) {
+						if ( j0 < bsize ) {
+							s0 = j0;
+							j0 = 0;
+						} else {
+							s0 = bsize;
+							j0 -= bsize;
+						}
+						// Compute index offsets and loop offset increments for the first ndarray elements in the current block...
+						for ( k = 0; k < N; k++ ) {
+							iv[ k ] = ov1[k] + ( j0*sv[k][0] );
+							dv1[ k ] = sv[k][1] - ( s0*sv[k][0] );
+						}
+						// Iterate over the non-reduced ndarray dimensions...
+						for ( i4 = 0; i4 < s4; i4++ ) {
+							for ( i3 = 0; i3 < s3; i3++ ) {
+								for ( i2 = 0; i2 < s2; i2++ ) {
+									for ( i1 = 0; i1 < s1; i1++ ) {
+										for ( i0 = 0; i0 < s0; i0++ ) {
+											setViewOffsets( views, iv );
+											set( ybuf, iv[1], fcn( views, opts ) );
+											incrementOffsets( iv, dv0 );
+										}
+										incrementOffsets( iv, dv1 );
+									}
+									incrementOffsets( iv, dv2 );
+								}
+								incrementOffsets( iv, dv3 );
+							}
+							incrementOffsets( iv, dv4 );
+						}
+					}
+				}
+			}
+		}
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = blockedunary5d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/6d.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/6d.js
new file mode 100644
index 000000000000..0cbed055813f
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/6d.js
@@ -0,0 +1,216 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-depth */
+
+'use strict';
+
+// MODULES //
+
+var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major-string' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+* var ybuf = filled( false, 3 );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major'
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* unary6d( base, [ x, y ], views, [ 12, 12, 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ [ [ true, false, true ] ] ] ] ] ]
+*/
+function unary6d( fcn, arrays, views, strides, opts ) {
+	var ybuf;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var dv4;
+	var dv5;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var S5;
+	var sv;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var y;
+	var i;
+
+	// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the output ndarray and associated shape:
+	y = arrays[ 1 ];
+	sh = y.shape;
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	if ( isRowMajor( y.order ) ) {
+		// For row-major ndarrays, the last dimensions have the fastest changing indices...
+		S0 = sh[ 5 ];
+		S1 = sh[ 4 ];
+		S2 = sh[ 3 ];
+		S3 = sh[ 2 ];
+		S4 = sh[ 1 ];
+		S5 = sh[ 0 ];
+		dv0 = [ strides[5] ];                     // offset increment for innermost loop
+		dv1 = [ strides[4] - ( S0*strides[5] ) ];
+		dv2 = [ strides[3] - ( S1*strides[4] ) ];
+		dv3 = [ strides[2] - ( S2*strides[3] ) ];
+		dv4 = [ strides[1] - ( S3*strides[2] ) ];
+		dv5 = [ strides[0] - ( S4*strides[1] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[5] );
+			dv1.push( sv[4] - ( S0*sv[5] ) );
+			dv2.push( sv[3] - ( S1*sv[4] ) );
+			dv3.push( sv[2] - ( S2*sv[3] ) );
+			dv4.push( sv[1] - ( S3*sv[2] ) );
+			dv5.push( sv[0] - ( S4*sv[1] ) );
+		}
+	} else { // order === 'column-major'
+		// For column-major ndarrays, the first dimensions have the fastest changing indices...
+		S0 = sh[ 0 ];
+		S1 = sh[ 1 ];
+		S2 = sh[ 2 ];
+		S3 = sh[ 3 ];
+		S4 = sh[ 4 ];
+		S5 = sh[ 5 ];
+		dv0 = [ strides[0] ];                     // offset increment for innermost loop
+		dv1 = [ strides[1] - ( S0*strides[0] ) ];
+		dv2 = [ strides[2] - ( S1*strides[1] ) ];
+		dv3 = [ strides[3] - ( S2*strides[2] ) ];
+		dv4 = [ strides[4] - ( S3*strides[3] ) ];
+		dv5 = [ strides[5] - ( S4*strides[4] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[0] );
+			dv1.push( sv[1] - ( S0*sv[0] ) );
+			dv2.push( sv[2] - ( S1*sv[1] ) );
+			dv3.push( sv[3] - ( S2*sv[2] ) );
+			dv4.push( sv[4] - ( S3*sv[3] ) );
+			dv5.push( sv[5] - ( S4*sv[4] ) );
+		}
+	}
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	iv = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Iterate over the non-reduced ndarray dimensions...
+	for ( i5 = 0; i5 < S5; i5++ ) {
+		for ( i4 = 0; i4 < S4; i4++ ) {
+			for ( i3 = 0; i3 < S3; i3++ ) {
+				for ( i2 = 0; i2 < S2; i2++ ) {
+					for ( i1 = 0; i1 < S1; i1++ ) {
+						for ( i0 = 0; i0 < S0; i0++ ) {
+							setViewOffsets( views, iv );
+							ybuf[ iv[1] ] = fcn( views, opts );
+							incrementOffsets( iv, dv0 );
+						}
+						incrementOffsets( iv, dv1 );
+					}
+					incrementOffsets( iv, dv2 );
+				}
+				incrementOffsets( iv, dv3 );
+			}
+			incrementOffsets( iv, dv4 );
+		}
+		incrementOffsets( iv, dv5 );
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = unary6d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/6d_accessors.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/6d_accessors.js
new file mode 100644
index 000000000000..a7d6c3de197e
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/6d_accessors.js
@@ -0,0 +1,224 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-depth */
+
+'use strict';
+
+// MODULES //
+
+var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major-string' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );
+* var ybuf = toAccessorArray( filled( false, 3 ) );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major',
+*     'accessors': accessors( ybuf ).accessors
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* unary6d( base, [ x, y ], views, [ 12, 12, 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ [ [ true, false, true ] ] ] ] ] ]
+*/
+function unary6d( fcn, arrays, views, strides, opts ) {
+	var ybuf;
+	var set;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var dv4;
+	var dv5;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var S5;
+	var sv;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var y;
+	var i;
+
+	// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the output ndarray and associated shape:
+	y = arrays[ 1 ];
+	sh = y.shape;
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	if ( isRowMajor( y.order ) ) {
+		// For row-major ndarrays, the last dimensions have the fastest changing indices...
+		S0 = sh[ 5 ];
+		S1 = sh[ 4 ];
+		S2 = sh[ 3 ];
+		S3 = sh[ 2 ];
+		S4 = sh[ 1 ];
+		S5 = sh[ 0 ];
+		dv0 = [ strides[5] ];                     // offset increment for innermost loop
+		dv1 = [ strides[4] - ( S0*strides[5] ) ];
+		dv2 = [ strides[3] - ( S1*strides[4] ) ];
+		dv3 = [ strides[2] - ( S2*strides[3] ) ];
+		dv4 = [ strides[1] - ( S3*strides[2] ) ];
+		dv5 = [ strides[0] - ( S4*strides[1] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[5] );
+			dv1.push( sv[4] - ( S0*sv[5] ) );
+			dv2.push( sv[3] - ( S1*sv[4] ) );
+			dv3.push( sv[2] - ( S2*sv[3] ) );
+			dv4.push( sv[1] - ( S3*sv[2] ) );
+			dv5.push( sv[0] - ( S4*sv[1] ) );
+		}
+	} else { // order === 'column-major'
+		// For column-major ndarrays, the first dimensions have the fastest changing indices...
+		S0 = sh[ 0 ];
+		S1 = sh[ 1 ];
+		S2 = sh[ 2 ];
+		S3 = sh[ 3 ];
+		S4 = sh[ 4 ];
+		S5 = sh[ 5 ];
+		dv0 = [ strides[0] ];                     // offset increment for innermost loop
+		dv1 = [ strides[1] - ( S0*strides[0] ) ];
+		dv2 = [ strides[2] - ( S1*strides[1] ) ];
+		dv3 = [ strides[3] - ( S2*strides[2] ) ];
+		dv4 = [ strides[4] - ( S3*strides[3] ) ];
+		dv5 = [ strides[5] - ( S4*strides[4] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[0] );
+			dv1.push( sv[1] - ( S0*sv[0] ) );
+			dv2.push( sv[2] - ( S1*sv[1] ) );
+			dv3.push( sv[3] - ( S2*sv[2] ) );
+			dv4.push( sv[4] - ( S3*sv[3] ) );
+			dv5.push( sv[5] - ( S4*sv[4] ) );
+		}
+	}
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	iv = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Cache accessors:
+	set = y.accessors[ 1 ];
+
+	// Iterate over the non-reduced ndarray dimensions...
+	for ( i5 = 0; i5 < S5; i5++ ) {
+		for ( i4 = 0; i4 < S4; i4++ ) {
+			for ( i3 = 0; i3 < S3; i3++ ) {
+				for ( i2 = 0; i2 < S2; i2++ ) {
+					for ( i1 = 0; i1 < S1; i1++ ) {
+						for ( i0 = 0; i0 < S0; i0++ ) {
+							setViewOffsets( views, iv );
+							set( ybuf, iv[ 1 ], fcn( views, opts ) );
+							incrementOffsets( iv, dv0 );
+						}
+						incrementOffsets( iv, dv1 );
+					}
+					incrementOffsets( iv, dv2 );
+				}
+				incrementOffsets( iv, dv3 );
+			}
+			incrementOffsets( iv, dv4 );
+		}
+		incrementOffsets( iv, dv5 );
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = unary6d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/6d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/6d_blocked.js
new file mode 100644
index 000000000000..a6837575a6b9
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/6d_blocked.js
@@ -0,0 +1,294 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-depth, max-len */
+
+'use strict';
+
+// MODULES //
+
+var loopOrder = require( '@stdlib/ndarray/base/unary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/unary-tiling-block-size' );
+var takeIndexed = require( '@stdlib/array/base/take-indexed' );
+var zeros = require( '@stdlib/array/base/zeros' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray via loop blocking.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+* var ybuf = filled( false, 3 );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major'
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* blockedunary6d( base, [ x, y ], views, [ 12, 12, 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ [ [ true, false, true ] ] ] ] ] ]
+*/
+function blockedunary6d( fcn, arrays, views, strides, opts ) { // eslint-disable-line max-statements
+	var bsize;
+	var ybuf;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var dv4;
+	var dv5;
+	var ov1;
+	var ov2;
+	var ov3;
+	var ov4;
+	var ov5;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var s5;
+	var sv;
+	var ov;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var j0;
+	var j1;
+	var j2;
+	var j3;
+	var j4;
+	var j5;
+	var N;
+	var x;
+	var y;
+	var o;
+	var k;
+
+	// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	N = arrays.length;
+	x = arrays[ 0 ];
+	y = arrays[ 1 ];
+
+	// Resolve the loop interchange order:
+	o = loopOrder( y.shape, strides, y.strides );
+	sh = o.sh;
+	sv = [ o.sx, o.sy ];
+	for ( k = 2; k < N; k++ ) {
+		sv.push( takeIndexed( arrays[k].strides, o.idx ) );
+	}
+	// Determine the block size:
+	bsize = blockSize( x.dtype, y.dtype );
+
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	ov = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Cache offset increments for the innermost loop...
+	dv0 = [];
+	for ( k = 0; k < N; k++ ) {
+		dv0.push( sv[k][0] );
+	}
+	// Initialize loop variables...
+	ov1 = zeros( N );
+	ov2 = zeros( N );
+	ov3 = zeros( N );
+	ov4 = zeros( N );
+	ov5 = zeros( N );
+	dv1 = zeros( N );
+	dv2 = zeros( N );
+	dv3 = zeros( N );
+	dv4 = zeros( N );
+	dv5 = zeros( N );
+	iv = zeros( N );
+
+	// Iterate over blocks...
+	for ( j5 = sh[5]; j5 > 0; ) {
+		if ( j5 < bsize ) {
+			s5 = j5;
+			j5 = 0;
+		} else {
+			s5 = bsize;
+			j5 -= bsize;
+		}
+		for ( k = 0; k < N; k++ ) {
+			ov5[ k ] = ov[k] + ( j5*sv[k][5] );
+		}
+		for ( j4 = sh[4]; j4 > 0; ) {
+			if ( j4 < bsize ) {
+				s4 = j4;
+				j4 = 0;
+			} else {
+				s4 = bsize;
+				j4 -= bsize;
+			}
+			for ( k = 0; k < N; k++ ) {
+				dv5 = sv[k][5] - ( s4*sv[k][4] );
+				ov4[ k ] = ov5[k] + ( j4*sv[k][4] );
+			}
+			for ( j3 = sh[3]; j3 > 0; ) {
+				if ( j3 < bsize ) {
+					s3 = j3;
+					j3 = 0;
+				} else {
+					s3 = bsize;
+					j3 -= bsize;
+				}
+				for ( k = 0; k < N; k++ ) {
+					dv4[ k ] = sv[k][4] - ( s3*sv[k][3] );
+					ov3[ k ] = ov4[k] + ( j3*sv[k][3] );
+				}
+				for ( j2 = sh[2]; j2 > 0; ) {
+					if ( j2 < bsize ) {
+						s2 = j2;
+						j2 = 0;
+					} else {
+						s2 = bsize;
+						j2 -= bsize;
+					}
+					for ( k = 0; k < N; k++ ) {
+						dv3[ k ] = sv[k][3] - ( s2*sv[k][2] );
+						ov2[ k ] = ov3[k] + ( j2*sv[k][2] );
+					}
+					for ( j1 = sh[1]; j1 > 0; ) {
+						if ( j1 < bsize ) {
+							s1 = j1;
+							j1 = 0;
+						} else {
+							s1 = bsize;
+							j1 -= bsize;
+						}
+						for ( k = 0; k < N; k++ ) {
+							dv2[ k ] = sv[k][2] - ( s1*sv[k][1] );
+							ov1[ k ] = ov2[k] + ( j1*sv[k][1] );
+						}
+						for ( j0 = sh[0]; j0 > 0; ) {
+							if ( j0 < bsize ) {
+								s0 = j0;
+								j0 = 0;
+							} else {
+								s0 = bsize;
+								j0 -= bsize;
+							}
+							// Compute index offsets and loop offset increments for the first ndarray elements in the current block...
+							for ( k = 0; k < N; k++ ) {
+								iv[ k ] = ov1[k] + ( j0*sv[k][0] );
+								dv1[ k ] = sv[k][1] - ( s0*sv[k][0] );
+							}
+							// Iterate over the non-reduced ndarray dimensions...
+							for ( i5 = 0; i5 < s5; i5++ ) {
+								for ( i4 = 0; i4 < s4; i4++ ) {
+									for ( i3 = 0; i3 < s3; i3++ ) {
+										for ( i2 = 0; i2 < s2; i2++ ) {
+											for ( i1 = 0; i1 < s1; i1++ ) {
+												for ( i0 = 0; i0 < s0; i0++ ) {
+													setViewOffsets( views, iv );
+													ybuf[ iv[1] ] = fcn( views, opts );
+													incrementOffsets( iv, dv0 );
+												}
+												incrementOffsets( iv, dv1 );
+											}
+											incrementOffsets( iv, dv2 );
+										}
+										incrementOffsets( iv, dv3 );
+									}
+									incrementOffsets( iv, dv4 );
+								}
+								incrementOffsets( iv, dv5 );
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = blockedunary6d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/6d_blocked_accessors.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/6d_blocked_accessors.js
new file mode 100644
index 000000000000..fd15c802d418
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/6d_blocked_accessors.js
@@ -0,0 +1,302 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-depth, max-len */
+
+'use strict';
+
+// MODULES //
+
+var loopOrder = require( '@stdlib/ndarray/base/unary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/unary-tiling-block-size' );
+var takeIndexed = require( '@stdlib/array/base/take-indexed' );
+var zeros = require( '@stdlib/array/base/zeros' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray via loop blocking.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );
+* var ybuf = toAccessorArray( filled( false, 3 ) );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major',
+*     'accessors': accessors( ybuf ).accessors
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* blockedunary6d( base, [ x, y ], views, [ 12, 12, 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ [ [ true, false, true ] ] ] ] ] ]
+*/
+function blockedunary6d( fcn, arrays, views, strides, opts ) { // eslint-disable-line max-statements
+	var bsize;
+	var ybuf;
+	var set;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var dv4;
+	var dv5;
+	var ov1;
+	var ov2;
+	var ov3;
+	var ov4;
+	var ov5;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var s5;
+	var sv;
+	var ov;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var j0;
+	var j1;
+	var j2;
+	var j3;
+	var j4;
+	var j5;
+	var N;
+	var x;
+	var y;
+	var o;
+	var k;
+
+	// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	N = arrays.length;
+	x = arrays[ 0 ];
+	y = arrays[ 1 ];
+
+	// Resolve the loop interchange order:
+	o = loopOrder( y.shape, strides, y.strides );
+	sh = o.sh;
+	sv = [ o.sx, o.sy ];
+	for ( k = 2; k < N; k++ ) {
+		sv.push( takeIndexed( arrays[k].strides, o.idx ) );
+	}
+	// Determine the block size:
+	bsize = blockSize( x.dtype, y.dtype );
+
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	ov = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Cache accessors:
+	set = y.accessors[1];
+
+	// Cache offset increments for the innermost loop...
+	dv0 = [];
+	for ( k = 0; k < N; k++ ) {
+		dv0.push( sv[k][0] );
+	}
+	// Initialize loop variables...
+	ov1 = zeros( N );
+	ov2 = zeros( N );
+	ov3 = zeros( N );
+	ov4 = zeros( N );
+	ov5 = zeros( N );
+	dv1 = zeros( N );
+	dv2 = zeros( N );
+	dv3 = zeros( N );
+	dv4 = zeros( N );
+	dv5 = zeros( N );
+	iv = zeros( N );
+
+	// Iterate over blocks...
+	for ( j5 = sh[5]; j5 > 0; ) {
+		if ( j5 < bsize ) {
+			s5 = j5;
+			j5 = 0;
+		} else {
+			s5 = bsize;
+			j5 -= bsize;
+		}
+		for ( k = 0; k < N; k++ ) {
+			ov5[ k ] = ov[k] + ( j5*sv[k][5] );
+		}
+		for ( j4 = sh[4]; j4 > 0; ) {
+			if ( j4 < bsize ) {
+				s4 = j4;
+				j4 = 0;
+			} else {
+				s4 = bsize;
+				j4 -= bsize;
+			}
+			for ( k = 0; k < N; k++ ) {
+				dv5 = sv[k][5] - ( s4*sv[k][4] );
+				ov4[ k ] = ov5[k] + ( j4*sv[k][4] );
+			}
+			for ( j3 = sh[3]; j3 > 0; ) {
+				if ( j3 < bsize ) {
+					s3 = j3;
+					j3 = 0;
+				} else {
+					s3 = bsize;
+					j3 -= bsize;
+				}
+				for ( k = 0; k < N; k++ ) {
+					dv4[ k ] = sv[k][4] - ( s3*sv[k][3] );
+					ov3[ k ] = ov4[k] + ( j3*sv[k][3] );
+				}
+				for ( j2 = sh[2]; j2 > 0; ) {
+					if ( j2 < bsize ) {
+						s2 = j2;
+						j2 = 0;
+					} else {
+						s2 = bsize;
+						j2 -= bsize;
+					}
+					for ( k = 0; k < N; k++ ) {
+						dv3[ k ] = sv[k][3] - ( s2*sv[k][2] );
+						ov2[ k ] = ov3[k] + ( j2*sv[k][2] );
+					}
+					for ( j1 = sh[1]; j1 > 0; ) {
+						if ( j1 < bsize ) {
+							s1 = j1;
+							j1 = 0;
+						} else {
+							s1 = bsize;
+							j1 -= bsize;
+						}
+						for ( k = 0; k < N; k++ ) {
+							dv2[ k ] = sv[k][2] - ( s1*sv[k][1] );
+							ov1[ k ] = ov2[k] + ( j1*sv[k][1] );
+						}
+						for ( j0 = sh[0]; j0 > 0; ) {
+							if ( j0 < bsize ) {
+								s0 = j0;
+								j0 = 0;
+							} else {
+								s0 = bsize;
+								j0 -= bsize;
+							}
+							// Compute index offsets and loop offset increments for the first ndarray elements in the current block...
+							for ( k = 0; k < N; k++ ) {
+								iv[ k ] = ov1[k] + ( j0*sv[k][0] );
+								dv1[ k ] = sv[k][1] - ( s0*sv[k][0] );
+							}
+							// Iterate over the non-reduced ndarray dimensions...
+							for ( i5 = 0; i5 < s5; i5++ ) {
+								for ( i4 = 0; i4 < s4; i4++ ) {
+									for ( i3 = 0; i3 < s3; i3++ ) {
+										for ( i2 = 0; i2 < s2; i2++ ) {
+											for ( i1 = 0; i1 < s1; i1++ ) {
+												for ( i0 = 0; i0 < s0; i0++ ) {
+													setViewOffsets( views, iv );
+													set( ybuf, iv[1], fcn( views, opts ) );
+													incrementOffsets( iv, dv0 );
+												}
+												incrementOffsets( iv, dv1 );
+											}
+											incrementOffsets( iv, dv2 );
+										}
+										incrementOffsets( iv, dv3 );
+									}
+									incrementOffsets( iv, dv4 );
+								}
+								incrementOffsets( iv, dv5 );
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = blockedunary6d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/7d.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/7d.js
new file mode 100644
index 000000000000..a419fe934829
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/7d.js
@@ -0,0 +1,228 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-depth */
+
+'use strict';
+
+// MODULES //
+
+var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major-string' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+* var ybuf = filled( false, 3 );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major'
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* unary7d( base, [ x, y ], views, [ 12, 12, 12, 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ [ [ [ true, false, true ] ] ] ] ] ] ]
+*/
+function unary7d( fcn, arrays, views, strides, opts ) {
+	var ybuf;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var dv4;
+	var dv5;
+	var dv6;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var S5;
+	var S6;
+	var sv;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+	var y;
+	var i;
+
+	// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the output ndarray and associated shape:
+	y = arrays[ 1 ];
+	sh = y.shape;
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	if ( isRowMajor( y.order ) ) {
+		// For row-major ndarrays, the last dimensions have the fastest changing indices...
+		S0 = sh[ 6 ];
+		S1 = sh[ 5 ];
+		S2 = sh[ 4 ];
+		S3 = sh[ 3 ];
+		S4 = sh[ 2 ];
+		S5 = sh[ 1 ];
+		S6 = sh[ 0 ];
+		dv0 = [ strides[6] ];                     // offset increment for innermost loop
+		dv1 = [ strides[5] - ( S0*strides[6] ) ];
+		dv2 = [ strides[4] - ( S1*strides[5] ) ];
+		dv3 = [ strides[3] - ( S2*strides[4] ) ];
+		dv4 = [ strides[2] - ( S3*strides[3] ) ];
+		dv5 = [ strides[1] - ( S4*strides[2] ) ];
+		dv6 = [ strides[0] - ( S5*strides[1] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[6] );
+			dv1.push( sv[5] - ( S0*sv[6] ) );
+			dv2.push( sv[4] - ( S1*sv[5] ) );
+			dv3.push( sv[3] - ( S2*sv[4] ) );
+			dv4.push( sv[2] - ( S3*sv[3] ) );
+			dv5.push( sv[1] - ( S4*sv[2] ) );
+			dv6.push( sv[0] - ( S5*sv[1] ) );
+		}
+	} else { // order === 'column-major'
+		// For column-major ndarrays, the first dimensions have the fastest changing indices...
+		S0 = sh[ 0 ];
+		S1 = sh[ 1 ];
+		S2 = sh[ 2 ];
+		S3 = sh[ 3 ];
+		S4 = sh[ 4 ];
+		S5 = sh[ 5 ];
+		S6 = sh[ 6 ];
+		dv0 = [ strides[0] ];                     // offset increment for innermost loop
+		dv1 = [ strides[1] - ( S0*strides[0] ) ];
+		dv2 = [ strides[2] - ( S1*strides[1] ) ];
+		dv3 = [ strides[3] - ( S2*strides[2] ) ];
+		dv4 = [ strides[4] - ( S3*strides[3] ) ];
+		dv5 = [ strides[5] - ( S4*strides[4] ) ];
+		dv6 = [ strides[6] - ( S5*strides[5] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[0] );
+			dv1.push( sv[1] - ( S0*sv[0] ) );
+			dv2.push( sv[2] - ( S1*sv[1] ) );
+			dv3.push( sv[3] - ( S2*sv[2] ) );
+			dv4.push( sv[4] - ( S3*sv[3] ) );
+			dv5.push( sv[5] - ( S4*sv[4] ) );
+			dv6.push( sv[6] - ( S5*sv[5] ) );
+		}
+	}
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	iv = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Iterate over the non-reduced ndarray dimensions...
+	for ( i6 = 0; i6 < S6; i6++ ) {
+		for ( i5 = 0; i5 < S5; i5++ ) {
+			for ( i4 = 0; i4 < S4; i4++ ) {
+				for ( i3 = 0; i3 < S3; i3++ ) {
+					for ( i2 = 0; i2 < S2; i2++ ) {
+						for ( i1 = 0; i1 < S1; i1++ ) {
+							for ( i0 = 0; i0 < S0; i0++ ) {
+								setViewOffsets( views, iv );
+								ybuf[ iv[1] ] = fcn( views, opts );
+								incrementOffsets( iv, dv0 );
+							}
+							incrementOffsets( iv, dv1 );
+						}
+						incrementOffsets( iv, dv2 );
+					}
+					incrementOffsets( iv, dv3 );
+				}
+				incrementOffsets( iv, dv4 );
+			}
+			incrementOffsets( iv, dv5 );
+		}
+		incrementOffsets( iv, dv6 );
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = unary7d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/7d_accessors.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/7d_accessors.js
new file mode 100644
index 000000000000..65748f90110a
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/7d_accessors.js
@@ -0,0 +1,236 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-depth */
+
+'use strict';
+
+// MODULES //
+
+var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major-string' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );
+* var ybuf = toAccessorArray( filled( false, 3 ) );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major',
+*     'accessors': accessors( ybuf ).accessors
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* unary7d( base, [ x, y ], views, [ 12, 12, 12, 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ [ [ [ true, false, true ] ] ] ] ] ] ]
+*/
+function unary7d( fcn, arrays, views, strides, opts ) {
+	var ybuf;
+	var set;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var dv4;
+	var dv5;
+	var dv6;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var S5;
+	var S6;
+	var sv;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+	var y;
+	var i;
+
+	// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the output ndarray and associated shape:
+	y = arrays[ 1 ];
+	sh = y.shape;
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	if ( isRowMajor( y.order ) ) {
+		// For row-major ndarrays, the last dimensions have the fastest changing indices...
+		S0 = sh[ 6 ];
+		S1 = sh[ 5 ];
+		S2 = sh[ 4 ];
+		S3 = sh[ 3 ];
+		S4 = sh[ 2 ];
+		S5 = sh[ 1 ];
+		S6 = sh[ 0 ];
+		dv0 = [ strides[6] ];                     // offset increment for innermost loop
+		dv1 = [ strides[5] - ( S0*strides[6] ) ];
+		dv2 = [ strides[4] - ( S1*strides[5] ) ];
+		dv3 = [ strides[3] - ( S2*strides[4] ) ];
+		dv4 = [ strides[2] - ( S3*strides[3] ) ];
+		dv5 = [ strides[1] - ( S4*strides[2] ) ];
+		dv6 = [ strides[0] - ( S5*strides[1] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[6] );
+			dv1.push( sv[5] - ( S0*sv[6] ) );
+			dv2.push( sv[4] - ( S1*sv[5] ) );
+			dv3.push( sv[3] - ( S2*sv[4] ) );
+			dv4.push( sv[2] - ( S3*sv[3] ) );
+			dv5.push( sv[1] - ( S4*sv[2] ) );
+			dv6.push( sv[0] - ( S5*sv[1] ) );
+		}
+	} else { // order === 'column-major'
+		// For column-major ndarrays, the first dimensions have the fastest changing indices...
+		S0 = sh[ 0 ];
+		S1 = sh[ 1 ];
+		S2 = sh[ 2 ];
+		S3 = sh[ 3 ];
+		S4 = sh[ 4 ];
+		S5 = sh[ 5 ];
+		S6 = sh[ 6 ];
+		dv0 = [ strides[0] ];                     // offset increment for innermost loop
+		dv1 = [ strides[1] - ( S0*strides[0] ) ];
+		dv2 = [ strides[2] - ( S1*strides[1] ) ];
+		dv3 = [ strides[3] - ( S2*strides[2] ) ];
+		dv4 = [ strides[4] - ( S3*strides[3] ) ];
+		dv5 = [ strides[5] - ( S4*strides[4] ) ];
+		dv6 = [ strides[6] - ( S5*strides[5] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[0] );
+			dv1.push( sv[1] - ( S0*sv[0] ) );
+			dv2.push( sv[2] - ( S1*sv[1] ) );
+			dv3.push( sv[3] - ( S2*sv[2] ) );
+			dv4.push( sv[4] - ( S3*sv[3] ) );
+			dv5.push( sv[5] - ( S4*sv[4] ) );
+			dv6.push( sv[6] - ( S5*sv[5] ) );
+		}
+	}
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	iv = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Cache accessors:
+	set = y.accessors[ 1 ];
+
+	// Iterate over the non-reduced ndarray dimensions...
+	for ( i6 = 0; i6 < S6; i6++ ) {
+		for ( i5 = 0; i5 < S5; i5++ ) {
+			for ( i4 = 0; i4 < S4; i4++ ) {
+				for ( i3 = 0; i3 < S3; i3++ ) {
+					for ( i2 = 0; i2 < S2; i2++ ) {
+						for ( i1 = 0; i1 < S1; i1++ ) {
+							for ( i0 = 0; i0 < S0; i0++ ) {
+								setViewOffsets( views, iv );
+								set( ybuf, iv[ 1 ], fcn( views, opts ) );
+								incrementOffsets( iv, dv0 );
+							}
+							incrementOffsets( iv, dv1 );
+						}
+						incrementOffsets( iv, dv2 );
+					}
+					incrementOffsets( iv, dv3 );
+				}
+				incrementOffsets( iv, dv4 );
+			}
+			incrementOffsets( iv, dv5 );
+		}
+		incrementOffsets( iv, dv6 );
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = unary7d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/7d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/7d_blocked.js
new file mode 100644
index 000000000000..ced55fdfe9cd
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/7d_blocked.js
@@ -0,0 +1,317 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-depth, max-len */
+
+'use strict';
+
+// MODULES //
+
+var loopOrder = require( '@stdlib/ndarray/base/unary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/unary-tiling-block-size' );
+var takeIndexed = require( '@stdlib/array/base/take-indexed' );
+var zeros = require( '@stdlib/array/base/zeros' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray via loop blocking.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+* var ybuf = filled( false, 3 );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major'
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* blockedunary7d( base, [ x, y ], views, [ 12, 12, 12, 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ [ [ [ true, false, true ] ] ] ] ] ] ]
+*/
+function blockedunary7d( fcn, arrays, views, strides, opts ) { // eslint-disable-line max-statements
+	var bsize;
+	var ybuf;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var dv4;
+	var dv5;
+	var dv6;
+	var ov1;
+	var ov2;
+	var ov3;
+	var ov4;
+	var ov5;
+	var ov6;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var s5;
+	var s6;
+	var sv;
+	var ov;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+	var j0;
+	var j1;
+	var j2;
+	var j3;
+	var j4;
+	var j5;
+	var j6;
+	var N;
+	var x;
+	var y;
+	var o;
+	var k;
+
+	// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	N = arrays.length;
+	x = arrays[ 0 ];
+	y = arrays[ 1 ];
+
+	// Resolve the loop interchange order:
+	o = loopOrder( y.shape, strides, y.strides );
+	sh = o.sh;
+	sv = [ o.sx, o.sy ];
+	for ( k = 2; k < N; k++ ) {
+		sv.push( takeIndexed( arrays[k].strides, o.idx ) );
+	}
+	// Determine the block size:
+	bsize = blockSize( x.dtype, y.dtype );
+
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	ov = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Cache offset increments for the innermost loop...
+	dv0 = [];
+	for ( k = 0; k < N; k++ ) {
+		dv0.push( sv[k][0] );
+	}
+	// Initialize loop variables...
+	ov1 = zeros( N );
+	ov2 = zeros( N );
+	ov3 = zeros( N );
+	ov4 = zeros( N );
+	ov5 = zeros( N );
+	ov6 = zeros( N );
+	dv1 = zeros( N );
+	dv2 = zeros( N );
+	dv3 = zeros( N );
+	dv4 = zeros( N );
+	dv5 = zeros( N );
+	dv6 = zeros( N );
+	iv = zeros( N );
+
+	// Iterate over blocks...
+	for ( j6 = sh[6]; j6 > 0; ) {
+		if ( j6 < bsize ) {
+			s6 = j6;
+			j6 = 0;
+		} else {
+			s6 = bsize;
+			j6 -= bsize;
+		}
+		for ( k = 0; k < N; k++ ) {
+			ov6[ k ] = ov[k] + ( j6*sv[k][6] );
+		}
+		for ( j5 = sh[5]; j5 > 0; ) {
+			if ( j5 < bsize ) {
+				s5 = j5;
+				j5 = 0;
+			} else {
+				s5 = bsize;
+				j5 -= bsize;
+			}
+			for ( k = 0; k < N; k++ ) {
+				dv6 = sv[k][6] - ( s5*sv[k][5] );
+				ov5[ k ] = ov6[k] + ( j5*sv[k][5] );
+			}
+			for ( j4 = sh[4]; j4 > 0; ) {
+				if ( j4 < bsize ) {
+					s4 = j4;
+					j4 = 0;
+				} else {
+					s4 = bsize;
+					j4 -= bsize;
+				}
+				for ( k = 0; k < N; k++ ) {
+					dv5 = sv[k][5] - ( s4*sv[k][4] );
+					ov4[ k ] = ov5[k] + ( j4*sv[k][4] );
+				}
+				for ( j3 = sh[3]; j3 > 0; ) {
+					if ( j3 < bsize ) {
+						s3 = j3;
+						j3 = 0;
+					} else {
+						s3 = bsize;
+						j3 -= bsize;
+					}
+					for ( k = 0; k < N; k++ ) {
+						dv4[ k ] = sv[k][4] - ( s3*sv[k][3] );
+						ov3[ k ] = ov4[k] + ( j3*sv[k][3] );
+					}
+					for ( j2 = sh[2]; j2 > 0; ) {
+						if ( j2 < bsize ) {
+							s2 = j2;
+							j2 = 0;
+						} else {
+							s2 = bsize;
+							j2 -= bsize;
+						}
+						for ( k = 0; k < N; k++ ) {
+							dv3[ k ] = sv[k][3] - ( s2*sv[k][2] );
+							ov2[ k ] = ov3[k] + ( j2*sv[k][2] );
+						}
+						for ( j1 = sh[1]; j1 > 0; ) {
+							if ( j1 < bsize ) {
+								s1 = j1;
+								j1 = 0;
+							} else {
+								s1 = bsize;
+								j1 -= bsize;
+							}
+							for ( k = 0; k < N; k++ ) {
+								dv2[ k ] = sv[k][2] - ( s1*sv[k][1] );
+								ov1[ k ] = ov2[k] + ( j1*sv[k][1] );
+							}
+							for ( j0 = sh[0]; j0 > 0; ) {
+								if ( j0 < bsize ) {
+									s0 = j0;
+									j0 = 0;
+								} else {
+									s0 = bsize;
+									j0 -= bsize;
+								}
+								// Compute index offsets and loop offset increments for the first ndarray elements in the current block...
+								for ( k = 0; k < N; k++ ) {
+									iv[ k ] = ov1[k] + ( j0*sv[k][0] );
+									dv1[ k ] = sv[k][1] - ( s0*sv[k][0] );
+								}
+								// Iterate over the non-reduced ndarray dimensions...
+								for ( i6 = 0; i6 < s6; i6++ ) {
+									for ( i5 = 0; i5 < s5; i5++ ) {
+										for ( i4 = 0; i4 < s4; i4++ ) {
+											for ( i3 = 0; i3 < s3; i3++ ) {
+												for ( i2 = 0; i2 < s2; i2++ ) {
+													for ( i1 = 0; i1 < s1; i1++ ) {
+														for ( i0 = 0; i0 < s0; i0++ ) {
+															setViewOffsets( views, iv );
+															ybuf[ iv[1] ] = fcn( views, opts );
+															incrementOffsets( iv, dv0 );
+														}
+														incrementOffsets( iv, dv1 );
+													}
+													incrementOffsets( iv, dv2 );
+												}
+												incrementOffsets( iv, dv3 );
+											}
+											incrementOffsets( iv, dv4 );
+										}
+										incrementOffsets( iv, dv5 );
+									}
+									incrementOffsets( iv, dv6 );
+								}
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = blockedunary7d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/7d_blocked_accessors.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/7d_blocked_accessors.js
new file mode 100644
index 000000000000..d4e7329dcf64
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/7d_blocked_accessors.js
@@ -0,0 +1,325 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-depth, max-len */
+
+'use strict';
+
+// MODULES //
+
+var loopOrder = require( '@stdlib/ndarray/base/unary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/unary-tiling-block-size' );
+var takeIndexed = require( '@stdlib/array/base/take-indexed' );
+var zeros = require( '@stdlib/array/base/zeros' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray via loop blocking.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );
+* var ybuf = toAccessorArray( filled( false, 3 ) );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major',
+*     'accessors': accessors( ybuf ).accessors
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* blockedunary7d( base, [ x, y ], views, [ 12, 12, 12, 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ [ [ [ true, false, true ] ] ] ] ] ] ]
+*/
+function blockedunary7d( fcn, arrays, views, strides, opts ) { // eslint-disable-line max-statements
+	var bsize;
+	var ybuf;
+	var set;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var dv4;
+	var dv5;
+	var dv6;
+	var ov1;
+	var ov2;
+	var ov3;
+	var ov4;
+	var ov5;
+	var ov6;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var s5;
+	var s6;
+	var sv;
+	var ov;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+	var j0;
+	var j1;
+	var j2;
+	var j3;
+	var j4;
+	var j5;
+	var j6;
+	var N;
+	var x;
+	var y;
+	var o;
+	var k;
+
+	// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	N = arrays.length;
+	x = arrays[ 0 ];
+	y = arrays[ 1 ];
+
+	// Resolve the loop interchange order:
+	o = loopOrder( y.shape, strides, y.strides );
+	sh = o.sh;
+	sv = [ o.sx, o.sy ];
+	for ( k = 2; k < N; k++ ) {
+		sv.push( takeIndexed( arrays[k].strides, o.idx ) );
+	}
+	// Determine the block size:
+	bsize = blockSize( x.dtype, y.dtype );
+
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	ov = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Cache accessors:
+	set = y.accessors[ 1 ];
+
+	// Cache offset increments for the innermost loop...
+	dv0 = [];
+	for ( k = 0; k < N; k++ ) {
+		dv0.push( sv[k][0] );
+	}
+	// Initialize loop variables...
+	ov1 = zeros( N );
+	ov2 = zeros( N );
+	ov3 = zeros( N );
+	ov4 = zeros( N );
+	ov5 = zeros( N );
+	ov6 = zeros( N );
+	dv1 = zeros( N );
+	dv2 = zeros( N );
+	dv3 = zeros( N );
+	dv4 = zeros( N );
+	dv5 = zeros( N );
+	dv6 = zeros( N );
+	iv = zeros( N );
+
+	// Iterate over blocks...
+	for ( j6 = sh[6]; j6 > 0; ) {
+		if ( j6 < bsize ) {
+			s6 = j6;
+			j6 = 0;
+		} else {
+			s6 = bsize;
+			j6 -= bsize;
+		}
+		for ( k = 0; k < N; k++ ) {
+			ov6[ k ] = ov[k] + ( j6*sv[k][6] );
+		}
+		for ( j5 = sh[5]; j5 > 0; ) {
+			if ( j5 < bsize ) {
+				s5 = j5;
+				j5 = 0;
+			} else {
+				s5 = bsize;
+				j5 -= bsize;
+			}
+			for ( k = 0; k < N; k++ ) {
+				dv6 = sv[k][6] - ( s5*sv[k][5] );
+				ov5[ k ] = ov6[k] + ( j5*sv[k][5] );
+			}
+			for ( j4 = sh[4]; j4 > 0; ) {
+				if ( j4 < bsize ) {
+					s4 = j4;
+					j4 = 0;
+				} else {
+					s4 = bsize;
+					j4 -= bsize;
+				}
+				for ( k = 0; k < N; k++ ) {
+					dv5 = sv[k][5] - ( s4*sv[k][4] );
+					ov4[ k ] = ov5[k] + ( j4*sv[k][4] );
+				}
+				for ( j3 = sh[3]; j3 > 0; ) {
+					if ( j3 < bsize ) {
+						s3 = j3;
+						j3 = 0;
+					} else {
+						s3 = bsize;
+						j3 -= bsize;
+					}
+					for ( k = 0; k < N; k++ ) {
+						dv4[ k ] = sv[k][4] - ( s3*sv[k][3] );
+						ov3[ k ] = ov4[k] + ( j3*sv[k][3] );
+					}
+					for ( j2 = sh[2]; j2 > 0; ) {
+						if ( j2 < bsize ) {
+							s2 = j2;
+							j2 = 0;
+						} else {
+							s2 = bsize;
+							j2 -= bsize;
+						}
+						for ( k = 0; k < N; k++ ) {
+							dv3[ k ] = sv[k][3] - ( s2*sv[k][2] );
+							ov2[ k ] = ov3[k] + ( j2*sv[k][2] );
+						}
+						for ( j1 = sh[1]; j1 > 0; ) {
+							if ( j1 < bsize ) {
+								s1 = j1;
+								j1 = 0;
+							} else {
+								s1 = bsize;
+								j1 -= bsize;
+							}
+							for ( k = 0; k < N; k++ ) {
+								dv2[ k ] = sv[k][2] - ( s1*sv[k][1] );
+								ov1[ k ] = ov2[k] + ( j1*sv[k][1] );
+							}
+							for ( j0 = sh[0]; j0 > 0; ) {
+								if ( j0 < bsize ) {
+									s0 = j0;
+									j0 = 0;
+								} else {
+									s0 = bsize;
+									j0 -= bsize;
+								}
+								// Compute index offsets and loop offset increments for the first ndarray elements in the current block...
+								for ( k = 0; k < N; k++ ) {
+									iv[ k ] = ov1[k] + ( j0*sv[k][0] );
+									dv1[ k ] = sv[k][1] - ( s0*sv[k][0] );
+								}
+								// Iterate over the non-reduced ndarray dimensions...
+								for ( i6 = 0; i6 < s6; i6++ ) {
+									for ( i5 = 0; i5 < s5; i5++ ) {
+										for ( i4 = 0; i4 < s4; i4++ ) {
+											for ( i3 = 0; i3 < s3; i3++ ) {
+												for ( i2 = 0; i2 < s2; i2++ ) {
+													for ( i1 = 0; i1 < s1; i1++ ) {
+														for ( i0 = 0; i0 < s0; i0++ ) {
+															setViewOffsets( views, iv );
+															set( ybuf, iv[ 1 ], fcn( views, opts ) );
+															incrementOffsets( iv, dv0 );
+														}
+														incrementOffsets( iv, dv1 );
+													}
+													incrementOffsets( iv, dv2 );
+												}
+												incrementOffsets( iv, dv3 );
+											}
+											incrementOffsets( iv, dv4 );
+										}
+										incrementOffsets( iv, dv5 );
+									}
+									incrementOffsets( iv, dv6 );
+								}
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = blockedunary7d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/8d.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/8d.js
new file mode 100644
index 000000000000..2fbe333645da
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/8d.js
@@ -0,0 +1,240 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-depth */
+
+'use strict';
+
+// MODULES //
+
+var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major-string' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+* var ybuf = filled( false, 3 );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 1, 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 3, 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major'
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* unary8d( base, [ x, y ], views, [ 12, 12, 12, 12, 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ [ [ [ [ true, false, true ] ] ] ] ] ] ] ]
+*/
+function unary8d( fcn, arrays, views, strides, opts ) { // eslint-disable-line max-statements
+	var ybuf;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var dv4;
+	var dv5;
+	var dv6;
+	var dv7;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var S5;
+	var S6;
+	var S7;
+	var sv;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+	var i7;
+	var y;
+	var i;
+
+	// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the output ndarray and associated shape:
+	y = arrays[ 1 ];
+	sh = y.shape;
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	if ( isRowMajor( y.order ) ) {
+		// For row-major ndarrays, the last dimensions have the fastest changing indices...
+		S0 = sh[ 7 ];
+		S1 = sh[ 6 ];
+		S2 = sh[ 5 ];
+		S3 = sh[ 4 ];
+		S4 = sh[ 3 ];
+		S5 = sh[ 2 ];
+		S6 = sh[ 1 ];
+		S7 = sh[ 0 ];
+		dv0 = [ strides[7] ];                     // offset increment for innermost loop
+		dv1 = [ strides[6] - ( S0*strides[7] ) ];
+		dv2 = [ strides[5] - ( S1*strides[6] ) ];
+		dv3 = [ strides[4] - ( S2*strides[5] ) ];
+		dv4 = [ strides[3] - ( S3*strides[4] ) ];
+		dv5 = [ strides[2] - ( S4*strides[3] ) ];
+		dv6 = [ strides[1] - ( S5*strides[2] ) ];
+		dv7 = [ strides[0] - ( S6*strides[1] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[7] );
+			dv1.push( sv[6] - ( S0*sv[7] ) );
+			dv2.push( sv[5] - ( S1*sv[6] ) );
+			dv3.push( sv[4] - ( S2*sv[5] ) );
+			dv4.push( sv[3] - ( S3*sv[4] ) );
+			dv5.push( sv[2] - ( S4*sv[3] ) );
+			dv6.push( sv[1] - ( S5*sv[2] ) );
+			dv7.push( sv[0] - ( S6*sv[1] ) );
+		}
+	} else { // order === 'column-major'
+		// For column-major ndarrays, the first dimensions have the fastest changing indices...
+		S0 = sh[ 0 ];
+		S1 = sh[ 1 ];
+		S2 = sh[ 2 ];
+		S3 = sh[ 3 ];
+		S4 = sh[ 4 ];
+		S5 = sh[ 5 ];
+		S6 = sh[ 6 ];
+		S7 = sh[ 7 ];
+		dv0 = [ strides[0] ];                     // offset increment for innermost loop
+		dv1 = [ strides[1] - ( S0*strides[0] ) ];
+		dv2 = [ strides[2] - ( S1*strides[1] ) ];
+		dv3 = [ strides[3] - ( S2*strides[2] ) ];
+		dv4 = [ strides[4] - ( S3*strides[3] ) ];
+		dv5 = [ strides[5] - ( S4*strides[4] ) ];
+		dv6 = [ strides[6] - ( S5*strides[5] ) ];
+		dv7 = [ strides[7] - ( S6*strides[6] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[0] );
+			dv1.push( sv[1] - ( S0*sv[0] ) );
+			dv2.push( sv[2] - ( S1*sv[1] ) );
+			dv3.push( sv[3] - ( S2*sv[2] ) );
+			dv4.push( sv[4] - ( S3*sv[3] ) );
+			dv5.push( sv[5] - ( S4*sv[4] ) );
+			dv6.push( sv[6] - ( S5*sv[5] ) );
+			dv7.push( sv[7] - ( S6*sv[6] ) );
+		}
+	}
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	iv = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Iterate over the non-reduced ndarray dimensions...
+	for ( i7 = 0; i7 < S7; i7++ ) {
+		for ( i6 = 0; i6 < S6; i6++ ) {
+			for ( i5 = 0; i5 < S5; i5++ ) {
+				for ( i4 = 0; i4 < S4; i4++ ) {
+					for ( i3 = 0; i3 < S3; i3++ ) {
+						for ( i2 = 0; i2 < S2; i2++ ) {
+							for ( i1 = 0; i1 < S1; i1++ ) {
+								for ( i0 = 0; i0 < S0; i0++ ) {
+									setViewOffsets( views, iv );
+									ybuf[ iv[1] ] = fcn( views, opts );
+									incrementOffsets( iv, dv0 );
+								}
+								incrementOffsets( iv, dv1 );
+							}
+							incrementOffsets( iv, dv2 );
+						}
+						incrementOffsets( iv, dv3 );
+					}
+					incrementOffsets( iv, dv4 );
+				}
+				incrementOffsets( iv, dv5 );
+			}
+			incrementOffsets( iv, dv6 );
+		}
+		incrementOffsets( iv, dv7 );
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = unary8d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/8d_accessors.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/8d_accessors.js
new file mode 100644
index 000000000000..96b258f287e1
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/8d_accessors.js
@@ -0,0 +1,248 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-depth */
+
+'use strict';
+
+// MODULES //
+
+var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major-string' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );
+* var ybuf = toAccessorArray( filled( false, 3 ) );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 1, 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 3, 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major',
+*     'accessors': accessors( ybuf ).accessors
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* unary8d( base, [ x, y ], views, [ 12, 12, 12, 12, 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ [ [ [ [ true, false, true ] ] ] ] ] ] ] ]
+*/
+function unary8d( fcn, arrays, views, strides, opts ) { // eslint-disable-line max-statements
+	var ybuf;
+	var set;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var dv4;
+	var dv5;
+	var dv6;
+	var dv7;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var S5;
+	var S6;
+	var S7;
+	var sv;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+	var i7;
+	var y;
+	var i;
+
+	// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the output ndarray and associated shape:
+	y = arrays[ 1 ];
+	sh = y.shape;
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	if ( isRowMajor( y.order ) ) {
+		// For row-major ndarrays, the last dimensions have the fastest changing indices...
+		S0 = sh[ 7 ];
+		S1 = sh[ 6 ];
+		S2 = sh[ 5 ];
+		S3 = sh[ 4 ];
+		S4 = sh[ 3 ];
+		S5 = sh[ 2 ];
+		S6 = sh[ 1 ];
+		S7 = sh[ 0 ];
+		dv0 = [ strides[7] ];                     // offset increment for innermost loop
+		dv1 = [ strides[6] - ( S0*strides[7] ) ];
+		dv2 = [ strides[5] - ( S1*strides[6] ) ];
+		dv3 = [ strides[4] - ( S2*strides[5] ) ];
+		dv4 = [ strides[3] - ( S3*strides[4] ) ];
+		dv5 = [ strides[2] - ( S4*strides[3] ) ];
+		dv6 = [ strides[1] - ( S5*strides[2] ) ];
+		dv7 = [ strides[0] - ( S6*strides[1] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[7] );
+			dv1.push( sv[6] - ( S0*sv[7] ) );
+			dv2.push( sv[5] - ( S1*sv[6] ) );
+			dv3.push( sv[4] - ( S2*sv[5] ) );
+			dv4.push( sv[3] - ( S3*sv[4] ) );
+			dv5.push( sv[2] - ( S4*sv[3] ) );
+			dv6.push( sv[1] - ( S5*sv[2] ) );
+			dv7.push( sv[0] - ( S6*sv[1] ) );
+		}
+	} else { // order === 'column-major'
+		// For column-major ndarrays, the first dimensions have the fastest changing indices...
+		S0 = sh[ 0 ];
+		S1 = sh[ 1 ];
+		S2 = sh[ 2 ];
+		S3 = sh[ 3 ];
+		S4 = sh[ 4 ];
+		S5 = sh[ 5 ];
+		S6 = sh[ 6 ];
+		S7 = sh[ 7 ];
+		dv0 = [ strides[0] ];                     // offset increment for innermost loop
+		dv1 = [ strides[1] - ( S0*strides[0] ) ];
+		dv2 = [ strides[2] - ( S1*strides[1] ) ];
+		dv3 = [ strides[3] - ( S2*strides[2] ) ];
+		dv4 = [ strides[4] - ( S3*strides[3] ) ];
+		dv5 = [ strides[5] - ( S4*strides[4] ) ];
+		dv6 = [ strides[6] - ( S5*strides[5] ) ];
+		dv7 = [ strides[7] - ( S6*strides[6] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[0] );
+			dv1.push( sv[1] - ( S0*sv[0] ) );
+			dv2.push( sv[2] - ( S1*sv[1] ) );
+			dv3.push( sv[3] - ( S2*sv[2] ) );
+			dv4.push( sv[4] - ( S3*sv[3] ) );
+			dv5.push( sv[5] - ( S4*sv[4] ) );
+			dv6.push( sv[6] - ( S5*sv[5] ) );
+			dv7.push( sv[7] - ( S6*sv[6] ) );
+		}
+	}
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	iv = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Cache accessors:
+	set = y.accessors[ 1 ];
+
+	// Iterate over the non-reduced ndarray dimensions...
+	for ( i7 = 0; i7 < S7; i7++ ) {
+		for ( i6 = 0; i6 < S6; i6++ ) {
+			for ( i5 = 0; i5 < S5; i5++ ) {
+				for ( i4 = 0; i4 < S4; i4++ ) {
+					for ( i3 = 0; i3 < S3; i3++ ) {
+						for ( i2 = 0; i2 < S2; i2++ ) {
+							for ( i1 = 0; i1 < S1; i1++ ) {
+								for ( i0 = 0; i0 < S0; i0++ ) {
+									setViewOffsets( views, iv );
+									set( ybuf, iv[ 1 ], fcn( views, opts ) );
+									incrementOffsets( iv, dv0 );
+								}
+								incrementOffsets( iv, dv1 );
+							}
+							incrementOffsets( iv, dv2 );
+						}
+						incrementOffsets( iv, dv3 );
+					}
+					incrementOffsets( iv, dv4 );
+				}
+				incrementOffsets( iv, dv5 );
+			}
+			incrementOffsets( iv, dv6 );
+		}
+		incrementOffsets( iv, dv7 );
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = unary8d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/8d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/8d_blocked.js
new file mode 100644
index 000000000000..4a5f8d1f49a2
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/8d_blocked.js
@@ -0,0 +1,340 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-depth, max-len */
+
+'use strict';
+
+// MODULES //
+
+var loopOrder = require( '@stdlib/ndarray/base/unary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/unary-tiling-block-size' );
+var takeIndexed = require( '@stdlib/array/base/take-indexed' );
+var zeros = require( '@stdlib/array/base/zeros' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray via loop blocking.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+* var ybuf = filled( false, 3 );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 1, 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 3, 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major'
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* blockedunary8d( base, [ x, y ], views, [ 12, 12, 12, 12, 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ [ [ [ [ true, false, true ] ] ] ] ] ] ] ]
+*/
+function blockedunary8d( fcn, arrays, views, strides, opts ) { // eslint-disable-line max-statements, max-lines-per-function
+	var bsize;
+	var ybuf;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var dv4;
+	var dv5;
+	var dv6;
+	var dv7;
+	var ov1;
+	var ov2;
+	var ov3;
+	var ov4;
+	var ov5;
+	var ov6;
+	var ov7;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var s5;
+	var s6;
+	var s7;
+	var sv;
+	var ov;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+	var i7;
+	var j0;
+	var j1;
+	var j2;
+	var j3;
+	var j4;
+	var j5;
+	var j6;
+	var j7;
+	var N;
+	var x;
+	var y;
+	var o;
+	var k;
+
+	// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	N = arrays.length;
+	x = arrays[ 0 ];
+	y = arrays[ 1 ];
+
+	// Resolve the loop interchange order:
+	o = loopOrder( y.shape, strides, y.strides );
+	sh = o.sh;
+	sv = [ o.sx, o.sy ];
+	for ( k = 2; k < N; k++ ) {
+		sv.push( takeIndexed( arrays[k].strides, o.idx ) );
+	}
+	// Determine the block size:
+	bsize = blockSize( x.dtype, y.dtype );
+
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	ov = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Cache offset increments for the innermost loop...
+	dv0 = [];
+	for ( k = 0; k < N; k++ ) {
+		dv0.push( sv[k][0] );
+	}
+	// Initialize loop variables...
+	ov1 = zeros( N );
+	ov2 = zeros( N );
+	ov3 = zeros( N );
+	ov4 = zeros( N );
+	ov5 = zeros( N );
+	ov6 = zeros( N );
+	ov7 = zeros( N );
+	dv1 = zeros( N );
+	dv2 = zeros( N );
+	dv3 = zeros( N );
+	dv4 = zeros( N );
+	dv5 = zeros( N );
+	dv6 = zeros( N );
+	dv7 = zeros( N );
+	iv = zeros( N );
+
+	// Iterate over blocks...
+	for ( j7 = sh[7]; j7 > 0; ) {
+		if ( j7 < bsize ) {
+			s7 = j7;
+			j7 = 0;
+		} else {
+			s7 = bsize;
+			j7 -= bsize;
+		}
+		for ( k = 0; k < N; k++ ) {
+			ov7[ k ] = ov[k] + ( j7*sv[k][7] );
+		}
+		for ( j6 = sh[6]; j6 > 0; ) {
+			if ( j6 < bsize ) {
+				s6 = j6;
+				j6 = 0;
+			} else {
+				s6 = bsize;
+				j6 -= bsize;
+			}
+			for ( k = 0; k < N; k++ ) {
+				dv7 = sv[k][7] - ( s6*sv[k][6] );
+				ov6[ k ] = ov7[k] + ( j6*sv[k][6] );
+			}
+			for ( j5 = sh[5]; j5 > 0; ) {
+				if ( j5 < bsize ) {
+					s5 = j5;
+					j5 = 0;
+				} else {
+					s5 = bsize;
+					j5 -= bsize;
+				}
+				for ( k = 0; k < N; k++ ) {
+					dv6 = sv[k][6] - ( s5*sv[k][5] );
+					ov5[ k ] = ov6[k] + ( j5*sv[k][5] );
+				}
+				for ( j4 = sh[4]; j4 > 0; ) {
+					if ( j4 < bsize ) {
+						s4 = j4;
+						j4 = 0;
+					} else {
+						s4 = bsize;
+						j4 -= bsize;
+					}
+					for ( k = 0; k < N; k++ ) {
+						dv5 = sv[k][5] - ( s4*sv[k][4] );
+						ov4[ k ] = ov5[k] + ( j4*sv[k][4] );
+					}
+					for ( j3 = sh[3]; j3 > 0; ) {
+						if ( j3 < bsize ) {
+							s3 = j3;
+							j3 = 0;
+						} else {
+							s3 = bsize;
+							j3 -= bsize;
+						}
+						for ( k = 0; k < N; k++ ) {
+							dv4[ k ] = sv[k][4] - ( s3*sv[k][3] );
+							ov3[ k ] = ov4[k] + ( j3*sv[k][3] );
+						}
+						for ( j2 = sh[2]; j2 > 0; ) {
+							if ( j2 < bsize ) {
+								s2 = j2;
+								j2 = 0;
+							} else {
+								s2 = bsize;
+								j2 -= bsize;
+							}
+							for ( k = 0; k < N; k++ ) {
+								dv3[ k ] = sv[k][3] - ( s2*sv[k][2] );
+								ov2[ k ] = ov3[k] + ( j2*sv[k][2] );
+							}
+							for ( j1 = sh[1]; j1 > 0; ) {
+								if ( j1 < bsize ) {
+									s1 = j1;
+									j1 = 0;
+								} else {
+									s1 = bsize;
+									j1 -= bsize;
+								}
+								for ( k = 0; k < N; k++ ) {
+									dv2[ k ] = sv[k][2] - ( s1*sv[k][1] );
+									ov1[ k ] = ov2[k] + ( j1*sv[k][1] );
+								}
+								for ( j0 = sh[0]; j0 > 0; ) {
+									if ( j0 < bsize ) {
+										s0 = j0;
+										j0 = 0;
+									} else {
+										s0 = bsize;
+										j0 -= bsize;
+									}
+									// Compute index offsets and loop offset increments for the first ndarray elements in the current block...
+									for ( k = 0; k < N; k++ ) {
+										iv[ k ] = ov1[k] + ( j0*sv[k][0] );
+										dv1[ k ] = sv[k][1] - ( s0*sv[k][0] );
+									}
+									// Iterate over the non-reduced ndarray dimensions...
+									for ( i7 = 0; i7 < s7; i7++ ) {
+										for ( i6 = 0; i6 < s6; i6++ ) {
+											for ( i5 = 0; i5 < s5; i5++ ) {
+												for ( i4 = 0; i4 < s4; i4++ ) {
+													for ( i3 = 0; i3 < s3; i3++ ) {
+														for ( i2 = 0; i2 < s2; i2++ ) {
+															for ( i1 = 0; i1 < s1; i1++ ) {
+																for ( i0 = 0; i0 < s0; i0++ ) {
+																	setViewOffsets( views, iv );
+																	ybuf[ iv[1] ] = fcn( views, opts );
+																	incrementOffsets( iv, dv0 );
+																}
+																incrementOffsets( iv, dv1 );
+															}
+															incrementOffsets( iv, dv2 );
+														}
+														incrementOffsets( iv, dv3 );
+													}
+													incrementOffsets( iv, dv4 );
+												}
+												incrementOffsets( iv, dv5 );
+											}
+											incrementOffsets( iv, dv6 );
+										}
+										incrementOffsets( iv, dv7 );
+									}
+								}
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = blockedunary8d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/8d_blocked_accessors.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/8d_blocked_accessors.js
new file mode 100644
index 000000000000..ad8577c971b3
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/8d_blocked_accessors.js
@@ -0,0 +1,348 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-depth, max-len */
+
+'use strict';
+
+// MODULES //
+
+var loopOrder = require( '@stdlib/ndarray/base/unary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/unary-tiling-block-size' );
+var takeIndexed = require( '@stdlib/array/base/take-indexed' );
+var zeros = require( '@stdlib/array/base/zeros' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray via loop blocking.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );
+* var ybuf = toAccessorArray( filled( false, 3 ) );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 1, 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 3, 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major',
+*     'accessors': accessors( ybuf ).accessors
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* blockedunary8d( base, [ x, y ], views, [ 12, 12, 12, 12, 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ [ [ [ [ true, false, true ] ] ] ] ] ] ] ]
+*/
+function blockedunary8d( fcn, arrays, views, strides, opts ) { // eslint-disable-line max-statements, max-lines-per-function
+	var bsize;
+	var ybuf;
+	var set;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var dv4;
+	var dv5;
+	var dv6;
+	var dv7;
+	var ov1;
+	var ov2;
+	var ov3;
+	var ov4;
+	var ov5;
+	var ov6;
+	var ov7;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var s5;
+	var s6;
+	var s7;
+	var sv;
+	var ov;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+	var i7;
+	var j0;
+	var j1;
+	var j2;
+	var j3;
+	var j4;
+	var j5;
+	var j6;
+	var j7;
+	var N;
+	var x;
+	var y;
+	var o;
+	var k;
+
+	// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	N = arrays.length;
+	x = arrays[ 0 ];
+	y = arrays[ 1 ];
+
+	// Resolve the loop interchange order:
+	o = loopOrder( y.shape, strides, y.strides );
+	sh = o.sh;
+	sv = [ o.sx, o.sy ];
+	for ( k = 2; k < N; k++ ) {
+		sv.push( takeIndexed( arrays[k].strides, o.idx ) );
+	}
+	// Determine the block size:
+	bsize = blockSize( x.dtype, y.dtype );
+
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	ov = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Cache accessors:
+	set = y.accessors[ 1 ];
+
+	// Cache offset increments for the innermost loop...
+	dv0 = [];
+	for ( k = 0; k < N; k++ ) {
+		dv0.push( sv[k][0] );
+	}
+	// Initialize loop variables...
+	ov1 = zeros( N );
+	ov2 = zeros( N );
+	ov3 = zeros( N );
+	ov4 = zeros( N );
+	ov5 = zeros( N );
+	ov6 = zeros( N );
+	ov7 = zeros( N );
+	dv1 = zeros( N );
+	dv2 = zeros( N );
+	dv3 = zeros( N );
+	dv4 = zeros( N );
+	dv5 = zeros( N );
+	dv6 = zeros( N );
+	dv7 = zeros( N );
+	iv = zeros( N );
+
+	// Iterate over blocks...
+	for ( j7 = sh[7]; j7 > 0; ) {
+		if ( j7 < bsize ) {
+			s7 = j7;
+			j7 = 0;
+		} else {
+			s7 = bsize;
+			j7 -= bsize;
+		}
+		for ( k = 0; k < N; k++ ) {
+			ov7[ k ] = ov[k] + ( j7*sv[k][7] );
+		}
+		for ( j6 = sh[6]; j6 > 0; ) {
+			if ( j6 < bsize ) {
+				s6 = j6;
+				j6 = 0;
+			} else {
+				s6 = bsize;
+				j6 -= bsize;
+			}
+			for ( k = 0; k < N; k++ ) {
+				dv7 = sv[k][7] - ( s6*sv[k][6] );
+				ov6[ k ] = ov7[k] + ( j6*sv[k][6] );
+			}
+			for ( j5 = sh[5]; j5 > 0; ) {
+				if ( j5 < bsize ) {
+					s5 = j5;
+					j5 = 0;
+				} else {
+					s5 = bsize;
+					j5 -= bsize;
+				}
+				for ( k = 0; k < N; k++ ) {
+					dv6 = sv[k][6] - ( s5*sv[k][5] );
+					ov5[ k ] = ov6[k] + ( j5*sv[k][5] );
+				}
+				for ( j4 = sh[4]; j4 > 0; ) {
+					if ( j4 < bsize ) {
+						s4 = j4;
+						j4 = 0;
+					} else {
+						s4 = bsize;
+						j4 -= bsize;
+					}
+					for ( k = 0; k < N; k++ ) {
+						dv5 = sv[k][5] - ( s4*sv[k][4] );
+						ov4[ k ] = ov5[k] + ( j4*sv[k][4] );
+					}
+					for ( j3 = sh[3]; j3 > 0; ) {
+						if ( j3 < bsize ) {
+							s3 = j3;
+							j3 = 0;
+						} else {
+							s3 = bsize;
+							j3 -= bsize;
+						}
+						for ( k = 0; k < N; k++ ) {
+							dv4[ k ] = sv[k][4] - ( s3*sv[k][3] );
+							ov3[ k ] = ov4[k] + ( j3*sv[k][3] );
+						}
+						for ( j2 = sh[2]; j2 > 0; ) {
+							if ( j2 < bsize ) {
+								s2 = j2;
+								j2 = 0;
+							} else {
+								s2 = bsize;
+								j2 -= bsize;
+							}
+							for ( k = 0; k < N; k++ ) {
+								dv3[ k ] = sv[k][3] - ( s2*sv[k][2] );
+								ov2[ k ] = ov3[k] + ( j2*sv[k][2] );
+							}
+							for ( j1 = sh[1]; j1 > 0; ) {
+								if ( j1 < bsize ) {
+									s1 = j1;
+									j1 = 0;
+								} else {
+									s1 = bsize;
+									j1 -= bsize;
+								}
+								for ( k = 0; k < N; k++ ) {
+									dv2[ k ] = sv[k][2] - ( s1*sv[k][1] );
+									ov1[ k ] = ov2[k] + ( j1*sv[k][1] );
+								}
+								for ( j0 = sh[0]; j0 > 0; ) {
+									if ( j0 < bsize ) {
+										s0 = j0;
+										j0 = 0;
+									} else {
+										s0 = bsize;
+										j0 -= bsize;
+									}
+									// Compute index offsets and loop offset increments for the first ndarray elements in the current block...
+									for ( k = 0; k < N; k++ ) {
+										iv[ k ] = ov1[k] + ( j0*sv[k][0] );
+										dv1[ k ] = sv[k][1] - ( s0*sv[k][0] );
+									}
+									// Iterate over the non-reduced ndarray dimensions...
+									for ( i7 = 0; i7 < s7; i7++ ) {
+										for ( i6 = 0; i6 < s6; i6++ ) {
+											for ( i5 = 0; i5 < s5; i5++ ) {
+												for ( i4 = 0; i4 < s4; i4++ ) {
+													for ( i3 = 0; i3 < s3; i3++ ) {
+														for ( i2 = 0; i2 < s2; i2++ ) {
+															for ( i1 = 0; i1 < s1; i1++ ) {
+																for ( i0 = 0; i0 < s0; i0++ ) {
+																	setViewOffsets( views, iv );
+																	set( ybuf, iv[ 1 ], fcn( views, opts ) );
+																	incrementOffsets( iv, dv0 );
+																}
+																incrementOffsets( iv, dv1 );
+															}
+															incrementOffsets( iv, dv2 );
+														}
+														incrementOffsets( iv, dv3 );
+													}
+													incrementOffsets( iv, dv4 );
+												}
+												incrementOffsets( iv, dv5 );
+											}
+											incrementOffsets( iv, dv6 );
+										}
+										incrementOffsets( iv, dv7 );
+									}
+								}
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = blockedunary8d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/9d.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/9d.js
new file mode 100644
index 000000000000..6e14d58e27a4
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/9d.js
@@ -0,0 +1,252 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-depth */
+
+'use strict';
+
+// MODULES //
+
+var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major-string' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+* var ybuf = filled( false, 3 );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 1, 1, 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 3, 3, 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major'
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* unary9d( base, [ x, y ], views, [ 12, 12, 12, 12, 12, 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ [ [ [ [ [ true, false, true ] ] ] ] ] ] ] ] ]
+*/
+function unary9d( fcn, arrays, views, strides, opts ) { // eslint-disable-line max-statements
+	var ybuf;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var dv4;
+	var dv5;
+	var dv6;
+	var dv7;
+	var dv8;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var S5;
+	var S6;
+	var S7;
+	var S8;
+	var sv;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+	var i7;
+	var i8;
+	var y;
+	var i;
+
+	// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the output ndarray and associated shape:
+	y = arrays[ 1 ];
+	sh = y.shape;
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	if ( isRowMajor( y.order ) ) {
+		// For row-major ndarrays, the last dimensions have the fastest changing indices...
+		S0 = sh[ 8 ];
+		S1 = sh[ 7 ];
+		S2 = sh[ 6 ];
+		S3 = sh[ 5 ];
+		S4 = sh[ 4 ];
+		S5 = sh[ 3 ];
+		S6 = sh[ 2 ];
+		S7 = sh[ 1 ];
+		S8 = sh[ 0 ];
+		dv0 = [ strides[8] ];                     // offset increment for innermost loop
+		dv1 = [ strides[7] - ( S0*strides[8] ) ];
+		dv2 = [ strides[6] - ( S1*strides[7] ) ];
+		dv3 = [ strides[5] - ( S2*strides[6] ) ];
+		dv4 = [ strides[4] - ( S3*strides[5] ) ];
+		dv5 = [ strides[3] - ( S4*strides[4] ) ];
+		dv6 = [ strides[2] - ( S5*strides[3] ) ];
+		dv7 = [ strides[1] - ( S6*strides[2] ) ];
+		dv8 = [ strides[0] - ( S7*strides[1] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[8] );
+			dv1.push( sv[7] - ( S0*sv[8] ) );
+			dv2.push( sv[6] - ( S1*sv[7] ) );
+			dv3.push( sv[5] - ( S2*sv[6] ) );
+			dv4.push( sv[4] - ( S3*sv[5] ) );
+			dv5.push( sv[3] - ( S4*sv[4] ) );
+			dv6.push( sv[2] - ( S5*sv[3] ) );
+			dv7.push( sv[1] - ( S6*sv[2] ) );
+			dv8.push( sv[0] - ( S7*sv[1] ) );
+		}
+	} else { // order === 'column-major'
+		// For column-major ndarrays, the first dimensions have the fastest changing indices...
+		S0 = sh[ 0 ];
+		S1 = sh[ 1 ];
+		S2 = sh[ 2 ];
+		S3 = sh[ 3 ];
+		S4 = sh[ 4 ];
+		S5 = sh[ 5 ];
+		S6 = sh[ 6 ];
+		S7 = sh[ 7 ];
+		S8 = sh[ 8 ];
+		dv0 = [ strides[0] ];                     // offset increment for innermost loop
+		dv1 = [ strides[1] - ( S0*strides[0] ) ];
+		dv2 = [ strides[2] - ( S1*strides[1] ) ];
+		dv3 = [ strides[3] - ( S2*strides[2] ) ];
+		dv4 = [ strides[4] - ( S3*strides[3] ) ];
+		dv5 = [ strides[5] - ( S4*strides[4] ) ];
+		dv6 = [ strides[6] - ( S5*strides[5] ) ];
+		dv7 = [ strides[7] - ( S6*strides[6] ) ];
+		dv8 = [ strides[8] - ( S7*strides[7] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[0] );
+			dv1.push( sv[1] - ( S0*sv[0] ) );
+			dv2.push( sv[2] - ( S1*sv[1] ) );
+			dv3.push( sv[3] - ( S2*sv[2] ) );
+			dv4.push( sv[4] - ( S3*sv[3] ) );
+			dv5.push( sv[5] - ( S4*sv[4] ) );
+			dv6.push( sv[6] - ( S5*sv[5] ) );
+			dv7.push( sv[7] - ( S6*sv[6] ) );
+			dv8.push( sv[8] - ( S7*sv[7] ) );
+		}
+	}
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	iv = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Iterate over the non-reduced ndarray dimensions...
+	for ( i8 = 0; i8 < S8; i8++ ) {
+		for ( i7 = 0; i7 < S7; i7++ ) {
+			for ( i6 = 0; i6 < S6; i6++ ) {
+				for ( i5 = 0; i5 < S5; i5++ ) {
+					for ( i4 = 0; i4 < S4; i4++ ) {
+						for ( i3 = 0; i3 < S3; i3++ ) {
+							for ( i2 = 0; i2 < S2; i2++ ) {
+								for ( i1 = 0; i1 < S1; i1++ ) {
+									for ( i0 = 0; i0 < S0; i0++ ) {
+										setViewOffsets( views, iv );
+										ybuf[ iv[1] ] = fcn( views, opts );
+										incrementOffsets( iv, dv0 );
+									}
+									incrementOffsets( iv, dv1 );
+								}
+								incrementOffsets( iv, dv2 );
+							}
+							incrementOffsets( iv, dv3 );
+						}
+						incrementOffsets( iv, dv4 );
+					}
+					incrementOffsets( iv, dv5 );
+				}
+				incrementOffsets( iv, dv6 );
+			}
+			incrementOffsets( iv, dv7 );
+		}
+		incrementOffsets( iv, dv8 );
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = unary9d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/9d_accessors.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/9d_accessors.js
new file mode 100644
index 000000000000..70c1c8aec6b4
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/9d_accessors.js
@@ -0,0 +1,260 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-depth, max-len */
+
+'use strict';
+
+// MODULES //
+
+var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major-string' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );
+* var ybuf = toAccessorArray( filled( false, 3 ) );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 1, 1, 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 3, 3, 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major',
+*     'accessors': accessors( ybuf ).accessors
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* unary9d( base, [ x, y ], views, [ 12, 12, 12, 12, 12, 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ [ [ [ [ [ true, false, true ] ] ] ] ] ] ] ] ]
+*/
+function unary9d( fcn, arrays, views, strides, opts ) { // eslint-disable-line max-statements
+	var ybuf;
+	var set;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var dv4;
+	var dv5;
+	var dv6;
+	var dv7;
+	var dv8;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var S5;
+	var S6;
+	var S7;
+	var S8;
+	var sv;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+	var i7;
+	var i8;
+	var y;
+	var i;
+
+	// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the output ndarray and associated shape:
+	y = arrays[ 1 ];
+	sh = y.shape;
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	if ( isRowMajor( y.order ) ) {
+		// For row-major ndarrays, the last dimensions have the fastest changing indices...
+		S0 = sh[ 8 ];
+		S1 = sh[ 7 ];
+		S2 = sh[ 6 ];
+		S3 = sh[ 5 ];
+		S4 = sh[ 4 ];
+		S5 = sh[ 3 ];
+		S6 = sh[ 2 ];
+		S7 = sh[ 1 ];
+		S8 = sh[ 0 ];
+		dv0 = [ strides[8] ];                     // offset increment for innermost loop
+		dv1 = [ strides[7] - ( S0*strides[8] ) ];
+		dv2 = [ strides[6] - ( S1*strides[7] ) ];
+		dv3 = [ strides[5] - ( S2*strides[6] ) ];
+		dv4 = [ strides[4] - ( S3*strides[5] ) ];
+		dv5 = [ strides[3] - ( S4*strides[4] ) ];
+		dv6 = [ strides[2] - ( S5*strides[3] ) ];
+		dv7 = [ strides[1] - ( S6*strides[2] ) ];
+		dv8 = [ strides[0] - ( S7*strides[1] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[8] );
+			dv1.push( sv[7] - ( S0*sv[8] ) );
+			dv2.push( sv[6] - ( S1*sv[7] ) );
+			dv3.push( sv[5] - ( S2*sv[6] ) );
+			dv4.push( sv[4] - ( S3*sv[5] ) );
+			dv5.push( sv[3] - ( S4*sv[4] ) );
+			dv6.push( sv[2] - ( S5*sv[3] ) );
+			dv7.push( sv[1] - ( S6*sv[2] ) );
+			dv8.push( sv[0] - ( S7*sv[1] ) );
+		}
+	} else { // order === 'column-major'
+		// For column-major ndarrays, the first dimensions have the fastest changing indices...
+		S0 = sh[ 0 ];
+		S1 = sh[ 1 ];
+		S2 = sh[ 2 ];
+		S3 = sh[ 3 ];
+		S4 = sh[ 4 ];
+		S5 = sh[ 5 ];
+		S6 = sh[ 6 ];
+		S7 = sh[ 7 ];
+		S8 = sh[ 8 ];
+		dv0 = [ strides[0] ];                     // offset increment for innermost loop
+		dv1 = [ strides[1] - ( S0*strides[0] ) ];
+		dv2 = [ strides[2] - ( S1*strides[1] ) ];
+		dv3 = [ strides[3] - ( S2*strides[2] ) ];
+		dv4 = [ strides[4] - ( S3*strides[3] ) ];
+		dv5 = [ strides[5] - ( S4*strides[4] ) ];
+		dv6 = [ strides[6] - ( S5*strides[5] ) ];
+		dv7 = [ strides[7] - ( S6*strides[6] ) ];
+		dv8 = [ strides[8] - ( S7*strides[7] ) ]; // offset increment for outermost loop
+		for ( i = 1; i < arrays.length; i++ ) {
+			sv = arrays[ i ].strides;
+			dv0.push( sv[0] );
+			dv1.push( sv[1] - ( S0*sv[0] ) );
+			dv2.push( sv[2] - ( S1*sv[1] ) );
+			dv3.push( sv[3] - ( S2*sv[2] ) );
+			dv4.push( sv[4] - ( S3*sv[3] ) );
+			dv5.push( sv[5] - ( S4*sv[4] ) );
+			dv6.push( sv[6] - ( S5*sv[5] ) );
+			dv7.push( sv[7] - ( S6*sv[6] ) );
+			dv8.push( sv[8] - ( S7*sv[7] ) );
+		}
+	}
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	iv = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Cache accessors:
+	set = y.accessors[ 1 ];
+
+	// Iterate over the non-reduced ndarray dimensions...
+	for ( i8 = 0; i8 < S8; i8++ ) {
+		for ( i7 = 0; i7 < S7; i7++ ) {
+			for ( i6 = 0; i6 < S6; i6++ ) {
+				for ( i5 = 0; i5 < S5; i5++ ) {
+					for ( i4 = 0; i4 < S4; i4++ ) {
+						for ( i3 = 0; i3 < S3; i3++ ) {
+							for ( i2 = 0; i2 < S2; i2++ ) {
+								for ( i1 = 0; i1 < S1; i1++ ) {
+									for ( i0 = 0; i0 < S0; i0++ ) {
+										setViewOffsets( views, iv );
+										set( ybuf, iv[ 1 ], fcn( views, opts ) );
+										incrementOffsets( iv, dv0 );
+									}
+									incrementOffsets( iv, dv1 );
+								}
+								incrementOffsets( iv, dv2 );
+							}
+							incrementOffsets( iv, dv3 );
+						}
+						incrementOffsets( iv, dv4 );
+					}
+					incrementOffsets( iv, dv5 );
+				}
+				incrementOffsets( iv, dv6 );
+			}
+			incrementOffsets( iv, dv7 );
+		}
+		incrementOffsets( iv, dv8 );
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = unary9d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/9d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/9d_blocked.js
new file mode 100644
index 000000000000..2914065c0f98
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/9d_blocked.js
@@ -0,0 +1,363 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-depth, max-len */
+
+'use strict';
+
+// MODULES //
+
+var loopOrder = require( '@stdlib/ndarray/base/unary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/unary-tiling-block-size' );
+var takeIndexed = require( '@stdlib/array/base/take-indexed' );
+var zeros = require( '@stdlib/array/base/zeros' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray via loop blocking.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+* var ybuf = filled( false, 3 );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 1, 1, 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 3, 3, 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major'
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* blockedunary9d( base, [ x, y ], views, [ 12, 12, 12, 12, 12, 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ [ [ [ [ [ true, false, true ] ] ] ] ] ] ] ] ]
+*/
+function blockedunary9d( fcn, arrays, views, strides, opts ) { // eslint-disable-line max-statements, max-lines-per-function
+	var bsize;
+	var ybuf;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var dv4;
+	var dv5;
+	var dv6;
+	var dv7;
+	var dv8;
+	var ov1;
+	var ov2;
+	var ov3;
+	var ov4;
+	var ov5;
+	var ov6;
+	var ov7;
+	var ov8;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var s5;
+	var s6;
+	var s7;
+	var s8;
+	var sv;
+	var ov;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+	var i7;
+	var i8;
+	var j0;
+	var j1;
+	var j2;
+	var j3;
+	var j4;
+	var j5;
+	var j6;
+	var j7;
+	var j8;
+	var N;
+	var x;
+	var y;
+	var o;
+	var k;
+
+	// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	N = arrays.length;
+	x = arrays[ 0 ];
+	y = arrays[ 1 ];
+
+	// Resolve the loop interchange order:
+	o = loopOrder( y.shape, strides, y.strides );
+	sh = o.sh;
+	sv = [ o.sx, o.sy ];
+	for ( k = 2; k < N; k++ ) {
+		sv.push( takeIndexed( arrays[k].strides, o.idx ) );
+	}
+	// Determine the block size:
+	bsize = blockSize( x.dtype, y.dtype );
+
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	ov = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Cache offset increments for the innermost loop...
+	dv0 = [];
+	for ( k = 0; k < N; k++ ) {
+		dv0.push( sv[k][0] );
+	}
+	// Initialize loop variables...
+	ov1 = zeros( N );
+	ov2 = zeros( N );
+	ov3 = zeros( N );
+	ov4 = zeros( N );
+	ov5 = zeros( N );
+	ov6 = zeros( N );
+	ov7 = zeros( N );
+	ov8 = zeros( N );
+	dv1 = zeros( N );
+	dv2 = zeros( N );
+	dv3 = zeros( N );
+	dv4 = zeros( N );
+	dv5 = zeros( N );
+	dv6 = zeros( N );
+	dv7 = zeros( N );
+	dv8 = zeros( N );
+	iv = zeros( N );
+
+	// Iterate over blocks...
+	for ( j8 = sh[8]; j8 > 0; ) {
+		if ( j8 < bsize ) {
+			s8 = j8;
+			j8 = 0;
+		} else {
+			s8 = bsize;
+			j8 -= bsize;
+		}
+		for ( k = 0; k < N; k++ ) {
+			ov8[ k ] = ov[k] + ( j8*sv[k][8] );
+		}
+		for ( j7 = sh[7]; j7 > 0; ) {
+			if ( j7 < bsize ) {
+				s7 = j7;
+				j7 = 0;
+			} else {
+				s7 = bsize;
+				j7 -= bsize;
+			}
+			for ( k = 0; k < N; k++ ) {
+				dv8 = sv[k][8] - ( s7*sv[k][7] );
+				ov7[ k ] = ov8[k] + ( j7*sv[k][7] );
+			}
+			for ( j6 = sh[6]; j6 > 0; ) {
+				if ( j6 < bsize ) {
+					s6 = j6;
+					j6 = 0;
+				} else {
+					s6 = bsize;
+					j6 -= bsize;
+				}
+				for ( k = 0; k < N; k++ ) {
+					dv7 = sv[k][7] - ( s6*sv[k][6] );
+					ov6[ k ] = ov7[k] + ( j6*sv[k][6] );
+				}
+				for ( j5 = sh[5]; j5 > 0; ) {
+					if ( j5 < bsize ) {
+						s5 = j5;
+						j5 = 0;
+					} else {
+						s5 = bsize;
+						j5 -= bsize;
+					}
+					for ( k = 0; k < N; k++ ) {
+						dv6 = sv[k][6] - ( s5*sv[k][5] );
+						ov5[ k ] = ov6[k] + ( j5*sv[k][5] );
+					}
+					for ( j4 = sh[4]; j4 > 0; ) {
+						if ( j4 < bsize ) {
+							s4 = j4;
+							j4 = 0;
+						} else {
+							s4 = bsize;
+							j4 -= bsize;
+						}
+						for ( k = 0; k < N; k++ ) {
+							dv5 = sv[k][5] - ( s4*sv[k][4] );
+							ov4[ k ] = ov5[k] + ( j4*sv[k][4] );
+						}
+						for ( j3 = sh[3]; j3 > 0; ) {
+							if ( j3 < bsize ) {
+								s3 = j3;
+								j3 = 0;
+							} else {
+								s3 = bsize;
+								j3 -= bsize;
+							}
+							for ( k = 0; k < N; k++ ) {
+								dv4[ k ] = sv[k][4] - ( s3*sv[k][3] );
+								ov3[ k ] = ov4[k] + ( j3*sv[k][3] );
+							}
+							for ( j2 = sh[2]; j2 > 0; ) {
+								if ( j2 < bsize ) {
+									s2 = j2;
+									j2 = 0;
+								} else {
+									s2 = bsize;
+									j2 -= bsize;
+								}
+								for ( k = 0; k < N; k++ ) {
+									dv3[ k ] = sv[k][3] - ( s2*sv[k][2] );
+									ov2[ k ] = ov3[k] + ( j2*sv[k][2] );
+								}
+								for ( j1 = sh[1]; j1 > 0; ) {
+									if ( j1 < bsize ) {
+										s1 = j1;
+										j1 = 0;
+									} else {
+										s1 = bsize;
+										j1 -= bsize;
+									}
+									for ( k = 0; k < N; k++ ) {
+										dv2[ k ] = sv[k][2] - ( s1*sv[k][1] );
+										ov1[ k ] = ov2[k] + ( j1*sv[k][1] );
+									}
+									for ( j0 = sh[0]; j0 > 0; ) {
+										if ( j0 < bsize ) {
+											s0 = j0;
+											j0 = 0;
+										} else {
+											s0 = bsize;
+											j0 -= bsize;
+										}
+										// Compute index offsets and loop offset increments for the first ndarray elements in the current block...
+										for ( k = 0; k < N; k++ ) {
+											iv[ k ] = ov1[k] + ( j0*sv[k][0] );
+											dv1[ k ] = sv[k][1] - ( s0*sv[k][0] );
+										}
+										// Iterate over the non-reduced ndarray dimensions...
+										for ( i8 = 0; i8 < s8; i8++ ) {
+											for ( i7 = 0; i7 < s7; i7++ ) {
+												for ( i6 = 0; i6 < s6; i6++ ) {
+													for ( i5 = 0; i5 < s5; i5++ ) {
+														for ( i4 = 0; i4 < s4; i4++ ) {
+															for ( i3 = 0; i3 < s3; i3++ ) {
+																for ( i2 = 0; i2 < s2; i2++ ) {
+																	for ( i1 = 0; i1 < s1; i1++ ) {
+																		for ( i0 = 0; i0 < s0; i0++ ) {
+																			setViewOffsets( views, iv );
+																			ybuf[ iv[1] ] = fcn( views, opts );
+																			incrementOffsets( iv, dv0 );
+																		}
+																		incrementOffsets( iv, dv1 );
+																	}
+																	incrementOffsets( iv, dv2 );
+																}
+																incrementOffsets( iv, dv3 );
+															}
+															incrementOffsets( iv, dv4 );
+														}
+														incrementOffsets( iv, dv5 );
+													}
+													incrementOffsets( iv, dv6 );
+												}
+												incrementOffsets( iv, dv7 );
+											}
+											incrementOffsets( iv, dv8 );
+										}
+									}
+								}
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = blockedunary9d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/9d_blocked_accessors.js b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/9d_blocked_accessors.js
new file mode 100644
index 000000000000..bf3c68b381ed
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/unary-reduce-subarray/lib/9d_blocked_accessors.js
@@ -0,0 +1,371 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+/* eslint-disable max-depth, max-len */
+
+'use strict';
+
+// MODULES //
+
+var loopOrder = require( '@stdlib/ndarray/base/unary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/unary-tiling-block-size' );
+var takeIndexed = require( '@stdlib/array/base/take-indexed' );
+var zeros = require( '@stdlib/array/base/zeros' );
+var incrementOffsets = require( './increment_offsets.js' );
+var setViewOffsets = require( './set_view_offsets.js' );
+var offsets = require( './offsets.js' );
+
+
+// MAIN //
+
+/**
+* Performs a reduction over an input ndarray and assigns results to a provided output ndarray via loop blocking.
+*
+* @private
+* @param {Function} fcn - reduction function
+* @param {Array<Object>} arrays - ndarrays
+* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views
+* @param {IntegerArray} strides - loop dimension strides for the input ndarray
+* @param {Options} opts - function options
+* @returns {void}
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+* var Float64Array = require( '@stdlib/array/float64' );
+* var filled = require( '@stdlib/array/base/filled' );
+* var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+* var base = require( '@stdlib/ndarray/base/every' );
+*
+* // Create data buffers:
+* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );
+* var ybuf = toAccessorArray( filled( false, 3 ) );
+*
+* // Define the array shapes:
+* var xsh = [ 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];
+* var ysh = [ 1, 1, 1, 1, 1, 1, 1, 1, 3 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];
+* var sy = [ 3, 3, 3, 3, 3, 3, 3, 3, 1 ];
+*
+* // Define the index offsets:
+* var ox = 0;
+* var oy = 0;
+*
+* // Create an input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': xsh,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Create an output ndarray-like object:
+* var y = {
+*     'dtype': 'generic',
+*     'data': ybuf,
+*     'shape': ysh,
+*     'strides': sy,
+*     'offset': oy,
+*     'order': 'row-major',
+*     'accessors': accessors( ybuf ).accessors
+* };
+*
+* // Initialize ndarray-like objects representing sub-array views:
+* var views = [
+*     {
+*         'dtype': x.dtype,
+*         'data': x.data,
+*         'shape': [ 2, 2 ],
+*         'strides': [ 2, 1 ],
+*         'offset': x.offset,
+*         'order': x.order
+*     }
+* ];
+*
+* // Perform a reduction:
+* blockedunary9d( base, [ x, y ], views, [ 12, 12, 12, 12, 12, 12, 12, 12, 4 ], {} );
+*
+* var arr = ndarray2array( y.data, y.shape, y.strides, y.offset, y.order );
+* // returns [ [ [ [ [ [ [ [ [ true, false, true ] ] ] ] ] ] ] ] ]
+*/
+function blockedunary9d( fcn, arrays, views, strides, opts ) { // eslint-disable-line max-statements, max-lines-per-function
+	var bsize;
+	var ybuf;
+	var set;
+	var dv0;
+	var dv1;
+	var dv2;
+	var dv3;
+	var dv4;
+	var dv5;
+	var dv6;
+	var dv7;
+	var dv8;
+	var ov1;
+	var ov2;
+	var ov3;
+	var ov4;
+	var ov5;
+	var ov6;
+	var ov7;
+	var ov8;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var s5;
+	var s6;
+	var s7;
+	var s8;
+	var sv;
+	var ov;
+	var iv;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+	var i7;
+	var i8;
+	var j0;
+	var j1;
+	var j2;
+	var j3;
+	var j4;
+	var j5;
+	var j6;
+	var j7;
+	var j8;
+	var N;
+	var x;
+	var y;
+	var o;
+	var k;
+
+	// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	N = arrays.length;
+	x = arrays[ 0 ];
+	y = arrays[ 1 ];
+
+	// Resolve the loop interchange order:
+	o = loopOrder( y.shape, strides, y.strides );
+	sh = o.sh;
+	sv = [ o.sx, o.sy ];
+	for ( k = 2; k < N; k++ ) {
+		sv.push( takeIndexed( arrays[k].strides, o.idx ) );
+	}
+	// Determine the block size:
+	bsize = blockSize( x.dtype, y.dtype );
+
+	// Resolve a list of pointers to the first indexed elements in the respective ndarrays:
+	ov = offsets( arrays );
+
+	// Cache a reference to the output ndarray buffer:
+	ybuf = y.data;
+
+	// Cache accessors:
+	set = y.accessors[ 1 ];
+
+	// Cache offset increments for the innermost loop...
+	dv0 = [];
+	for ( k = 0; k < N; k++ ) {
+		dv0.push( sv[k][0] );
+	}
+	// Initialize loop variables...
+	ov1 = zeros( N );
+	ov2 = zeros( N );
+	ov3 = zeros( N );
+	ov4 = zeros( N );
+	ov5 = zeros( N );
+	ov6 = zeros( N );
+	ov7 = zeros( N );
+	ov8 = zeros( N );
+	dv1 = zeros( N );
+	dv2 = zeros( N );
+	dv3 = zeros( N );
+	dv4 = zeros( N );
+	dv5 = zeros( N );
+	dv6 = zeros( N );
+	dv7 = zeros( N );
+	dv8 = zeros( N );
+	iv = zeros( N );
+
+	// Iterate over blocks...
+	for ( j8 = sh[8]; j8 > 0; ) {
+		if ( j8 < bsize ) {
+			s8 = j8;
+			j8 = 0;
+		} else {
+			s8 = bsize;
+			j8 -= bsize;
+		}
+		for ( k = 0; k < N; k++ ) {
+			ov8[ k ] = ov[k] + ( j8*sv[k][8] );
+		}
+		for ( j7 = sh[7]; j7 > 0; ) {
+			if ( j7 < bsize ) {
+				s7 = j7;
+				j7 = 0;
+			} else {
+				s7 = bsize;
+				j7 -= bsize;
+			}
+			for ( k = 0; k < N; k++ ) {
+				dv8 = sv[k][8] - ( s7*sv[k][7] );
+				ov7[ k ] = ov8[k] + ( j7*sv[k][7] );
+			}
+			for ( j6 = sh[6]; j6 > 0; ) {
+				if ( j6 < bsize ) {
+					s6 = j6;
+					j6 = 0;
+				} else {
+					s6 = bsize;
+					j6 -= bsize;
+				}
+				for ( k = 0; k < N; k++ ) {
+					dv7 = sv[k][7] - ( s6*sv[k][6] );
+					ov6[ k ] = ov7[k] + ( j6*sv[k][6] );
+				}
+				for ( j5 = sh[5]; j5 > 0; ) {
+					if ( j5 < bsize ) {
+						s5 = j5;
+						j5 = 0;
+					} else {
+						s5 = bsize;
+						j5 -= bsize;
+					}
+					for ( k = 0; k < N; k++ ) {
+						dv6 = sv[k][6] - ( s5*sv[k][5] );
+						ov5[ k ] = ov6[k] + ( j5*sv[k][5] );
+					}
+					for ( j4 = sh[4]; j4 > 0; ) {
+						if ( j4 < bsize ) {
+							s4 = j4;
+							j4 = 0;
+						} else {
+							s4 = bsize;
+							j4 -= bsize;
+						}
+						for ( k = 0; k < N; k++ ) {
+							dv5 = sv[k][5] - ( s4*sv[k][4] );
+							ov4[ k ] = ov5[k] + ( j4*sv[k][4] );
+						}
+						for ( j3 = sh[3]; j3 > 0; ) {
+							if ( j3 < bsize ) {
+								s3 = j3;
+								j3 = 0;
+							} else {
+								s3 = bsize;
+								j3 -= bsize;
+							}
+							for ( k = 0; k < N; k++ ) {
+								dv4[ k ] = sv[k][4] - ( s3*sv[k][3] );
+								ov3[ k ] = ov4[k] + ( j3*sv[k][3] );
+							}
+							for ( j2 = sh[2]; j2 > 0; ) {
+								if ( j2 < bsize ) {
+									s2 = j2;
+									j2 = 0;
+								} else {
+									s2 = bsize;
+									j2 -= bsize;
+								}
+								for ( k = 0; k < N; k++ ) {
+									dv3[ k ] = sv[k][3] - ( s2*sv[k][2] );
+									ov2[ k ] = ov3[k] + ( j2*sv[k][2] );
+								}
+								for ( j1 = sh[1]; j1 > 0; ) {
+									if ( j1 < bsize ) {
+										s1 = j1;
+										j1 = 0;
+									} else {
+										s1 = bsize;
+										j1 -= bsize;
+									}
+									for ( k = 0; k < N; k++ ) {
+										dv2[ k ] = sv[k][2] - ( s1*sv[k][1] );
+										ov1[ k ] = ov2[k] + ( j1*sv[k][1] );
+									}
+									for ( j0 = sh[0]; j0 > 0; ) {
+										if ( j0 < bsize ) {
+											s0 = j0;
+											j0 = 0;
+										} else {
+											s0 = bsize;
+											j0 -= bsize;
+										}
+										// Compute index offsets and loop offset increments for the first ndarray elements in the current block...
+										for ( k = 0; k < N; k++ ) {
+											iv[ k ] = ov1[k] + ( j0*sv[k][0] );
+											dv1[ k ] = sv[k][1] - ( s0*sv[k][0] );
+										}
+										// Iterate over the non-reduced ndarray dimensions...
+										for ( i8 = 0; i8 < s8; i8++ ) {
+											for ( i7 = 0; i7 < s7; i7++ ) {
+												for ( i6 = 0; i6 < s6; i6++ ) {
+													for ( i5 = 0; i5 < s5; i5++ ) {
+														for ( i4 = 0; i4 < s4; i4++ ) {
+															for ( i3 = 0; i3 < s3; i3++ ) {
+																for ( i2 = 0; i2 < s2; i2++ ) {
+																	for ( i1 = 0; i1 < s1; i1++ ) {
+																		for ( i0 = 0; i0 < s0; i0++ ) {
+																			setViewOffsets( views, iv );
+																			set( ybuf, iv[ 1 ], fcn( views, opts ) );
+																			incrementOffsets( iv, dv0 );
+																		}
+																		incrementOffsets( iv, dv1 );
+																	}
+																	incrementOffsets( iv, dv2 );
+																}
+																incrementOffsets( iv, dv3 );
+															}
+															incrementOffsets( iv, dv4 );
+														}
+														incrementOffsets( iv, dv5 );
+													}
+													incrementOffsets( iv, dv6 );
+												}
+												incrementOffsets( iv, dv7 );
+											}
+											incrementOffsets( iv, dv8 );
+										}
+									}
+								}
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+}
+
+
+// EXPORTS //
+
+module.exports = blockedunary9d;