diff --git a/lib/node_modules/@stdlib/ndarray/base/some/README.md b/lib/node_modules/@stdlib/ndarray/base/some/README.md
new file mode 100644
index 000000000000..f61cede8ca76
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/README.md
@@ -0,0 +1,156 @@
+<!--
+
+@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.
+
+-->
+
+# some
+
+> Test whether at least `n` elements in an ndarray are truthy.
+
+<section class="intro">
+
+</section>
+
+<!-- /.intro -->
+
+<section class="usage">
+
+## Usage
+
+```javascript
+var some = require( '@stdlib/ndarray/base/some' );
+```
+
+#### some( arrays )
+
+Tests whether at least `n` elements in an ndarray are truthy.
+
+<!-- eslint-disable max-len -->
+
+```javascript
+var Float64Array = require( '@stdlib/array/float64' );
+var scalar2ndarray = require( '@stdlib/ndarray/from-scalar' );
+
+// Create a data buffer:
+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 ] );
+
+// Define the shape of the input array:
+var shape = [ 3, 1, 2 ];
+
+// Define the array strides:
+var sx = [ 4, 4, 1 ];
+
+// Define the index offset:
+var ox = 0;
+
+// Create the input ndarray-like object:
+var x = {
+    'dtype': 'float64',
+    'data': xbuf,
+    'shape': shape,
+    'strides': sx,
+    'offset': ox,
+    'order': 'row-major'
+};
+
+// Define the success criterion:
+var n = scalar2ndarray( 3, {
+    'dtype': 'generic'
+});
+
+// Test elements:
+var out = some( [ x, n ] );
+// returns true
+```
+
+The function accepts the following arguments:
+
+-   **arrays**: array-like object containing an input ndarray and a zero-dimensional ndarray specifying the minimum number of elements in the input ndarray that must be truthy.
+
+Each provided ndarray should be an `object` with the following properties:
+
+-   **dtype**: data type.
+-   **data**: data buffer.
+-   **shape**: dimensions.
+-   **strides**: stride lengths.
+-   **offset**: index offset.
+-   **order**: specifies whether an ndarray is row-major (C-style) or column major (Fortran-style).
+
+</section>
+
+<!-- /.usage -->
+
+<section class="notes">
+
+## Notes
+
+-   For very high-dimensional ndarrays which are non-contiguous, one should consider copying the underlying data to contiguous memory before performing the operation in order to achieve better performance.
+
+</section>
+
+<!-- /.notes -->
+
+<section class="examples">
+
+## Examples
+
+<!-- eslint no-undef: "error" -->
+
+```javascript
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var scalar2ndarray = require( '@stdlib/ndarray/from-scalar' );
+var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+var some = require( '@stdlib/ndarray/base/some' );
+
+var x = {
+    'dtype': 'generic',
+    'data': discreteUniform( 10, -2, 10, {
+        'dtype': 'generic'
+    }),
+    'shape': [ 5, 2 ],
+    'strides': [ 2, 1 ],
+    'offset': 0,
+    'order': 'row-major'
+};
+console.log( ndarray2array( x.data, x.shape, x.strides, x.offset, x.order ) );
+
+var n = scalar2ndarray( 5, {
+    'dtype': 'generic'
+});
+
+var out = some( [ x, n ] );
+console.log( out );
+```
+
+</section>
+
+<!-- /.examples -->
+
+<!-- Section for related `stdlib` packages. Do not manually edit this section, as it is automatically populated. -->
+
+<section class="related">
+
+</section>
+
+<!-- /.related -->
+
+<section class="links">
+
+</section>
+
+<!-- /.links -->
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.10d_blocked_columnmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.10d_blocked_columnmajor.js
new file mode 100644
index 000000000000..86301d774dc3
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.10d_blocked_columnmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/10d_blocked.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'column-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/10.0 ) );
+			sh = [ len, len, len, len, len, len, len, len, len, len ];
+			len *= pow( len, 9 );
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.10d_blocked_rowmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.10d_blocked_rowmajor.js
new file mode 100644
index 000000000000..9516e166a94f
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.10d_blocked_rowmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/10d_blocked.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'row-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/10.0 ) );
+			sh = [ len, len, len, len, len, len, len, len, len, len ];
+			len *= pow( len, 9 );
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.10d_columnmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.10d_columnmajor.js
new file mode 100644
index 000000000000..bcbc34c237e3
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.10d_columnmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/10d.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'column-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/10.0 ) );
+			sh = [ len, len, len, len, len, len, len, len, len, len ];
+			len *= pow( len, 9 );
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.10d_rowmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.10d_rowmajor.js
new file mode 100644
index 000000000000..aea9ddd9e873
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.10d_rowmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/10d.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'row-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/10.0 ) );
+			sh = [ len, len, len, len, len, len, len, len, len, len ];
+			len *= pow( len, 9 );
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.11d_columnmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.11d_columnmajor.js
new file mode 100644
index 000000000000..bb24210f1692
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.11d_columnmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/nd.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'column-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/11.0 ) );
+			sh = [ len, len, len, len, len, len, len, len, len, len, len ];
+			len *= pow( len, 10 );
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.11d_rowmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.11d_rowmajor.js
new file mode 100644
index 000000000000..a7c62e294290
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.11d_rowmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/nd.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'row-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/11.0 ) );
+			sh = [ len, len, len, len, len, len, len, len, len, len, len ];
+			len *= pow( len, 10 );
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.1d_columnmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.1d_columnmajor.js
new file mode 100644
index 000000000000..c7ebcf6b42fe
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.1d_columnmajor.js
@@ -0,0 +1,128 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var scalar2ndarray = require( '@stdlib/ndarray/from-scalar' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'column-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+	var n;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	n = scalar2ndarray( len, {
+		'dtype': 'generic',
+		'order': order
+	});
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( [ x, n ] );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.1d_rowmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.1d_rowmajor.js
new file mode 100644
index 000000000000..18c1f7530d25
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.1d_rowmajor.js
@@ -0,0 +1,128 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var scalar2ndarray = require( '@stdlib/ndarray/from-scalar' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'row-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+	var n;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	n = scalar2ndarray( len, {
+		'dtype': 'generic',
+		'order': order
+	});
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( [ x, n ] );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.2d_blocked_columnmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.2d_blocked_columnmajor.js
new file mode 100644
index 000000000000..3fbf14e4d3e8
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.2d_blocked_columnmajor.js
@@ -0,0 +1,134 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var sqrt = require( '@stdlib/math/base/special/sqrt' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/2d_blocked.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'column-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( sqrt( len ) );
+			sh = [ len, len ];
+			len *= len;
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.2d_blocked_rowmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.2d_blocked_rowmajor.js
new file mode 100644
index 000000000000..50241de6f4d0
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.2d_blocked_rowmajor.js
@@ -0,0 +1,134 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var sqrt = require( '@stdlib/math/base/special/sqrt' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/2d_blocked.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'row-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( sqrt( len ) );
+			sh = [ len, len ];
+			len *= len;
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.2d_columnmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.2d_columnmajor.js
new file mode 100644
index 000000000000..ce18b2c2dc04
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.2d_columnmajor.js
@@ -0,0 +1,134 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var sqrt = require( '@stdlib/math/base/special/sqrt' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/2d.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'column-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( sqrt( len ) );
+			sh = [ len, len ];
+			len *= len;
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.2d_rowmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.2d_rowmajor.js
new file mode 100644
index 000000000000..53821cfc5779
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.2d_rowmajor.js
@@ -0,0 +1,134 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var sqrt = require( '@stdlib/math/base/special/sqrt' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/2d.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'row-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( sqrt( len ) );
+			sh = [ len, len ];
+			len *= len;
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.2d_rowmajor_accessors.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.2d_rowmajor_accessors.js
new file mode 100644
index 000000000000..3bc93e9fa4d0
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.2d_rowmajor_accessors.js
@@ -0,0 +1,160 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var sqrt = require( '@stdlib/math/base/special/sqrt' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/2d_accessors.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'row-major';
+
+
+// FUNCTIONS //
+
+/**
+* Returns an array data buffer element.
+*
+* @private
+* @param {Collection} buf - data buffer
+* @param {NonNegativeInteger} idx - element index
+* @returns {*} element
+*/
+function get( buf, idx ) {
+	return buf[ idx ];
+}
+
+/**
+* Sets an array data buffer element.
+*
+* @private
+* @param {Collection} buf - data buffer
+* @param {NonNegativeInteger} idx - element index
+* @param {*} value - value to set
+*/
+function set( buf, idx, value ) {
+	buf[ idx ] = value;
+}
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order,
+		'accessorProtocol': true,
+		'accessors': [ get, set ]
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::accessors:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::accessors:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( sqrt( len ) );
+			sh = [ len, len ];
+			len *= len;
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::accessors:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.2d_rowmajor_accessors_complex.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.2d_rowmajor_accessors_complex.js
new file mode 100644
index 000000000000..778ca1d28efa
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.2d_rowmajor_accessors_complex.js
@@ -0,0 +1,162 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var sqrt = require( '@stdlib/math/base/special/sqrt' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var ctors = require( '@stdlib/array/typed-complex-ctors' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/2d_accessors.js' );
+
+
+// VARIABLES //
+
+var types = [ 'complex64' ];
+var order = 'row-major';
+
+
+// FUNCTIONS //
+
+/**
+* Returns an array data buffer element.
+*
+* @private
+* @param {Collection} buf - data buffer
+* @param {NonNegativeInteger} idx - element index
+* @returns {*} element
+*/
+function get( buf, idx ) {
+	return buf.get( idx );
+}
+
+/**
+* Sets an array data buffer element.
+*
+* @private
+* @param {Collection} buf - data buffer
+* @param {NonNegativeInteger} idx - element index
+* @param {*} value - value to set
+*/
+function set( buf, idx, value ) {
+	buf.set( value, idx );
+}
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var xbuf;
+	var x;
+
+	xbuf = discreteUniform( len*2, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': new ( ctors( xtype ) )( xbuf.buffer ),
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order,
+		'accessorProtocol': true,
+		'accessors': [ get, set ]
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len*2 );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 5; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::accessors:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::accessors:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( sqrt( len ) );
+			sh = [ len, len ];
+			len *= len;
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::accessors:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.3d_blocked_columnmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.3d_blocked_columnmajor.js
new file mode 100644
index 000000000000..07d959e7a21d
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.3d_blocked_columnmajor.js
@@ -0,0 +1,134 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var cbrt = require( '@stdlib/math/base/special/cbrt' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/3d_blocked.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'column-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( cbrt( len ) );
+			sh = [ len, len, len ];
+			len *= len * len;
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.3d_blocked_rowmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.3d_blocked_rowmajor.js
new file mode 100644
index 000000000000..09f1fa4c3b1a
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.3d_blocked_rowmajor.js
@@ -0,0 +1,134 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var cbrt = require( '@stdlib/math/base/special/cbrt' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/3d_blocked.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'row-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( cbrt( len ) );
+			sh = [ len, len, len ];
+			len *= len * len;
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.3d_columnmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.3d_columnmajor.js
new file mode 100644
index 000000000000..814f863bdf31
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.3d_columnmajor.js
@@ -0,0 +1,134 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var cbrt = require( '@stdlib/math/base/special/cbrt' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/3d.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'column-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( cbrt( len ) );
+			sh = [ len, len, len ];
+			len *= len * len;
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.3d_rowmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.3d_rowmajor.js
new file mode 100644
index 000000000000..12188fad529f
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.3d_rowmajor.js
@@ -0,0 +1,134 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var cbrt = require( '@stdlib/math/base/special/cbrt' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/3d.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'row-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( cbrt( len ) );
+			sh = [ len, len, len ];
+			len *= len * len;
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.4d_blocked_columnmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.4d_blocked_columnmajor.js
new file mode 100644
index 000000000000..d78b00121684
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.4d_blocked_columnmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/4d_blocked.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'column-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/4.0 ) );
+			sh = [ len, len, len, len ];
+			len *= len * len * len;
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.4d_blocked_rowmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.4d_blocked_rowmajor.js
new file mode 100644
index 000000000000..8923e05f5797
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.4d_blocked_rowmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/4d_blocked.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'row-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/4.0 ) );
+			sh = [ len, len, len, len ];
+			len *= len * len * len;
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.4d_columnmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.4d_columnmajor.js
new file mode 100644
index 000000000000..249b6fb917a6
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.4d_columnmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/4d.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'column-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/4.0 ) );
+			sh = [ len, len, len, len ];
+			len *= len * len * len;
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.4d_rowmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.4d_rowmajor.js
new file mode 100644
index 000000000000..0ee5b4a0828a
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.4d_rowmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/4d.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'row-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/4.0 ) );
+			sh = [ len, len, len, len ];
+			len *= len * len * len;
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.5d_blocked_columnmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.5d_blocked_columnmajor.js
new file mode 100644
index 000000000000..57aa6bef3805
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.5d_blocked_columnmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/5d_blocked.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'column-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/5.0 ) );
+			sh = [ len, len, len, len, len ];
+			len *= pow( len, 4 );
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.5d_blocked_rowmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.5d_blocked_rowmajor.js
new file mode 100644
index 000000000000..e2b613cb8675
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.5d_blocked_rowmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/5d_blocked.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'row-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/5.0 ) );
+			sh = [ len, len, len, len, len ];
+			len *= pow( len, 4 );
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.5d_columnmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.5d_columnmajor.js
new file mode 100644
index 000000000000..1a3871f3457d
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.5d_columnmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/5d.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'column-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/5.0 ) );
+			sh = [ len, len, len, len, len ];
+			len *= pow( len, 4 );
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.5d_rowmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.5d_rowmajor.js
new file mode 100644
index 000000000000..d051101a253f
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.5d_rowmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/5d.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'row-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/5.0 ) );
+			sh = [ len, len, len, len, len ];
+			len *= pow( len, 4 );
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.6d_blocked_columnmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.6d_blocked_columnmajor.js
new file mode 100644
index 000000000000..f744e7aa4374
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.6d_blocked_columnmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/6d_blocked.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'column-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/6.0 ) );
+			sh = [ len, len, len, len, len, len ];
+			len *= pow( len, 5 );
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.6d_blocked_rowmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.6d_blocked_rowmajor.js
new file mode 100644
index 000000000000..490ec85d6ac7
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.6d_blocked_rowmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/6d_blocked.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'row-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/6.0 ) );
+			sh = [ len, len, len, len, len, len ];
+			len *= pow( len, 5 );
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.6d_columnmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.6d_columnmajor.js
new file mode 100644
index 000000000000..8f933bf80fa5
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.6d_columnmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/6d.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'column-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/6.0 ) );
+			sh = [ len, len, len, len, len, len ];
+			len *= pow( len, 5 );
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.6d_rowmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.6d_rowmajor.js
new file mode 100644
index 000000000000..17b7f6c902ef
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.6d_rowmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/6d.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'row-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/6.0 ) );
+			sh = [ len, len, len, len, len, len ];
+			len *= pow( len, 5 );
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.7d_blocked_columnmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.7d_blocked_columnmajor.js
new file mode 100644
index 000000000000..053b64b28afb
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.7d_blocked_columnmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/7d_blocked.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'column-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1, 1, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 1, 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/7.0 ) );
+			sh = [ len, len, len, len, len, len, len ];
+			len *= pow( len, 6 );
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.7d_blocked_rowmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.7d_blocked_rowmajor.js
new file mode 100644
index 000000000000..4c4b8affbe0e
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.7d_blocked_rowmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/7d_blocked.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'row-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1, 1, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 1, 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/7.0 ) );
+			sh = [ len, len, len, len, len, len, len ];
+			len *= pow( len, 6 );
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.7d_columnmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.7d_columnmajor.js
new file mode 100644
index 000000000000..dc003ecae742
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.7d_columnmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/7d.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'column-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1, 1, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 1, 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/7.0 ) );
+			sh = [ len, len, len, len, len, len, len ];
+			len *= pow( len, 6 );
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.7d_rowmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.7d_rowmajor.js
new file mode 100644
index 000000000000..8053b2d5d47e
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.7d_rowmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/7d.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'row-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1, 1, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 1, 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/7.0 ) );
+			sh = [ len, len, len, len, len, len, len ];
+			len *= pow( len, 6 );
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.8d_blocked_columnmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.8d_blocked_columnmajor.js
new file mode 100644
index 000000000000..23c815487e5b
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.8d_blocked_columnmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/8d_blocked.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'row-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 1, 1, 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/8.0 ) );
+			sh = [ len, len, len, len, len, len, len, len ];
+			len *= pow( len, 7 );
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.8d_blocked_rowmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.8d_blocked_rowmajor.js
new file mode 100644
index 000000000000..23c815487e5b
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.8d_blocked_rowmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/8d_blocked.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'row-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 1, 1, 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/8.0 ) );
+			sh = [ len, len, len, len, len, len, len, len ];
+			len *= pow( len, 7 );
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.8d_columnmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.8d_columnmajor.js
new file mode 100644
index 000000000000..1b326a5a09ff
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.8d_columnmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/8d.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'column-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 1, 1, 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/8.0 ) );
+			sh = [ len, len, len, len, len, len, len, len ];
+			len *= pow( len, 7 );
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.8d_rowmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.8d_rowmajor.js
new file mode 100644
index 000000000000..82040b982744
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.8d_rowmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/8d.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'row-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 1, 1, 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/8.0 ) );
+			sh = [ len, len, len, len, len, len, len, len ];
+			len *= pow( len, 7 );
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.9d_blocked_columnmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.9d_blocked_columnmajor.js
new file mode 100644
index 000000000000..389591dfce29
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.9d_blocked_columnmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/9d_blocked.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'column-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 1, 1, 1, 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/9.0 ) );
+			sh = [ len, len, len, len, len, len, len, len, len ];
+			len *= pow( len, 8 );
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.9d_blocked_rowmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.9d_blocked_rowmajor.js
new file mode 100644
index 000000000000..e2c68247f323
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.9d_blocked_rowmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/9d_blocked.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'row-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 1, 1, 1, 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/9.0 ) );
+			sh = [ len, len, len, len, len, len, len, len, len ];
+			len *= pow( len, 8 );
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+'::blocked:ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.9d_columnmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.9d_columnmajor.js
new file mode 100644
index 000000000000..07aab1ec02c6
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.9d_columnmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/9d.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'column-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 1, 1, 1, 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/9.0 ) );
+			sh = [ len, len, len, len, len, len, len, len, len ];
+			len *= pow( len, 8 );
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.9d_rowmajor.js b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.9d_rowmajor.js
new file mode 100644
index 000000000000..de02d84f7a17
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/benchmark/benchmark.9d_rowmajor.js
@@ -0,0 +1,133 @@
+/**
+* @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 bench = require( '@stdlib/bench' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var pkg = require( './../package.json' ).name;
+var some = require( './../lib/9d.js' );
+
+
+// VARIABLES //
+
+var types = [ 'float64' ];
+var order = 'row-major';
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - ndarray length
+* @param {NonNegativeIntegerArray} shape - ndarray shape
+* @param {string} xtype - ndarray data type
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len, shape, xtype ) {
+	var x;
+
+	x = discreteUniform( len, 1, 100 );
+	x = {
+		'dtype': xtype,
+		'data': x,
+		'shape': shape,
+		'strides': shape2strides( shape, order ),
+		'offset': 0,
+		'order': order
+	};
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = some( x, len );
+			if ( typeof out !== 'boolean' ) {
+				b.fail( 'should return a boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( out ) ) {
+			b.fail( 'should return a boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var sh;
+	var t1;
+	var f;
+	var i;
+	var j;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( j = 0; j < types.length; j++ ) {
+		t1 = types[ j ];
+		for ( i = min; i <= max; i++ ) {
+			len = pow( 10, i );
+
+			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1, 1 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			sh = [ 1, 1, 1, 1, 1, 1, 1, 2, len/2 ];
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+
+			len = floor( pow( len, 1.0/9.0 ) );
+			sh = [ len, len, len, len, len, len, len, len, len ];
+			len *= pow( len, 8 );
+			f = createBenchmark( len, sh, t1 );
+			bench( pkg+':ndims='+sh.length+',len='+len+',shape=['+sh.join(',')+'],xorder='+order+',xtype='+t1, f );
+		}
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/docs/repl.txt b/lib/node_modules/@stdlib/ndarray/base/some/docs/repl.txt
new file mode 100644
index 000000000000..891f1dda894e
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/docs/repl.txt
@@ -0,0 +1,58 @@
+
+{{alias}}( arrays )
+    Tests whether at least `n` elements in an ndarray are truthy.
+
+    A provided "ndarray" should be an `object` with the following properties:
+
+    - dtype: data type.
+    - data: data buffer.
+    - shape: dimensions.
+    - strides: stride lengths.
+    - offset: index offset.
+    - order: specifies whether an ndarray is row-major (C-style) or column-major
+    (Fortran-style).
+
+    Parameters
+    ----------
+    arrays: ArrayLikeObject<ndarray>
+        Array-like object containing an input ndarray and a zero-dimensional
+        ndarray specifying the minimum number of elements in the input ndarray
+        that must be truthy.
+
+    Returns
+    -------
+    out: boolean
+        Boolean indicating whether at least `n` elements in an ndarray are
+        truthy.
+
+    Examples
+    --------
+    // Define ndarray data and meta data...
+    > var xbuf = new {{alias:@stdlib/array/float64}}( [ 1.0, 1.0, 0.0, 1.0 ] );
+    > var dt = 'float64';
+    > var sh = [ 2, 2 ];
+    > var sx = [ 2, 1 ];
+    > var ox = 0;
+    > var ord = 'row-major';
+
+    // Using an ndarray...
+    > var x = {{alias:@stdlib/ndarray/ctor}}( dt, xbuf, sh, sx, ox, ord );
+    > var n = {{alias:@stdlib/ndarray/from-scalar}}( 3 );
+    > {{alias}}( [ x, n ] )
+    true
+
+    // Using a minimal ndarray-like object...
+    > xbuf = new {{alias:@stdlib/array/float64}}( [ -1.0, 0.0, 0.0, -1.0 ] );
+    > x = {
+    ...     'dtype': dt,
+    ...     'data': xbuf,
+    ...     'shape': sh,
+    ...     'strides': sx,
+    ...     'offset': ox,
+    ...     'order': ord
+    ... };
+    > {{alias}}( [ x, n ] )
+    false
+
+    See Also
+    --------
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/docs/types/index.d.ts b/lib/node_modules/@stdlib/ndarray/base/some/docs/types/index.d.ts
new file mode 100644
index 000000000000..ffd7e23f1b41
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/docs/types/index.d.ts
@@ -0,0 +1,62 @@
+/*
+* @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.
+*/
+
+// TypeScript Version: 4.1
+
+/// <reference types="@stdlib/types"/>
+
+import { typedndarray } from '@stdlib/types/ndarray';
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @param arrays - array-like object containing an input ndarray and a zero-dimensional ndarray specifying the minimum number of elements in the input ndarray that must be truthy
+* @returns boolean indicating whether `n` elements pass a test
+*
+* @example
+* var scalar2ndarray = require( '@stdlib/ndarray/from-scalar' );
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create data buffers:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+*
+* // Define the shape of the array:
+* var shape = [ 3, 1, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 4, 1 ];
+*
+* // Define the index offset:
+* var ox = 1;
+*
+* // Create the input ndarray:
+* var x = ndarray( 'float64', xbuf, shape, sx, ox, 'row-major' );
+* var n = scalar2ndarray( 3, {
+*     'dtype': 'generic'
+* });
+*
+* // Test elements:
+* var out = some( [ x, n ] );
+* // returns true
+*/
+declare function some<T = unknown>( arrays: [ typedndarray<T>, typedndarray<number>] ): boolean;
+
+
+// EXPORTS //
+
+export = some;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/docs/types/test.ts b/lib/node_modules/@stdlib/ndarray/base/some/docs/types/test.ts
new file mode 100644
index 000000000000..c3141321c31b
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/docs/types/test.ts
@@ -0,0 +1,63 @@
+/*
+* @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.
+*/
+
+import zeros = require( '@stdlib/ndarray/zeros' );
+import scalar2ndarray = require( '@stdlib/ndarray/from-scalar' );
+import some = require( './index' );
+
+
+// TESTS //
+
+// The function returns a boolean...
+{
+	const x = zeros( [ 2, 2 ] );
+	const n = scalar2ndarray( 2, { 'dtype': 'generic' } );
+
+	some( [ x, n ] ); // $ExpectType boolean
+}
+
+// The compiler throws an error if the function is provided a first argument which is not an array-like object containing ndarray-like objects...
+{
+	some( 5 ); // $ExpectError
+	some( true ); // $ExpectError
+	some( false ); // $ExpectError
+	some( null ); // $ExpectError
+	some( undefined ); // $ExpectError
+	some( {} ); // $ExpectError
+	some( [ 1 ] ); // $ExpectError
+	some( ( x: number ): number => x ); // $ExpectError
+
+	some( 5 ); // $ExpectError
+	some( true ); // $ExpectError
+	some( false ); // $ExpectError
+	some( null ); // $ExpectError
+	some( undefined ); // $ExpectError
+	some( {} ); // $ExpectError
+	some( [ 1 ] ); // $ExpectError
+	some( ( x: number ): number => x ); // $ExpectError
+}
+
+// The compiler throws an error if the function is provided an unsupported number of arguments...
+{
+	const x = zeros( [ 2, 2 ] );
+	const n = scalar2ndarray( 2, { 'dtype': 'generic' } );
+
+	some(); // $ExpectError
+	some( [ x ] ); // $ExpectError
+	some( [ x, n ], {}, {} ); // $ExpectError
+}
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/examples/index.js b/lib/node_modules/@stdlib/ndarray/base/some/examples/index.js
new file mode 100644
index 000000000000..43b21af65c26
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/examples/index.js
@@ -0,0 +1,43 @@
+/**
+* @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';
+
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var scalar2ndarray = require( '@stdlib/ndarray/from-scalar' );
+var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
+var some = require( './../lib' );
+
+var x = {
+	'dtype': 'generic',
+	'data': discreteUniform( 10, -2, 10, {
+		'dtype': 'generic'
+	}),
+	'shape': [ 5, 2 ],
+	'strides': [ 2, 1 ],
+	'offset': 0,
+	'order': 'row-major'
+};
+console.log( ndarray2array( x.data, x.shape, x.strides, x.offset, x.order ) );
+
+var n = scalar2ndarray( 5, {
+	'dtype': 'generic'
+});
+
+var out = some( [ x, n ] );
+console.log( out );
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/0d.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/0d.js
new file mode 100644
index 000000000000..4c55c8b9a0f6
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/0d.js
@@ -0,0 +1,78 @@
+/**
+* @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';
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {ndarrayLike} x.ref - reference to the original ndarray-like object
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [];
+*
+* // Define the array strides:
+* var sx = [ 0 ];
+*
+* // Define the index offset:
+* var ox = 1;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'ref': null,
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = some0d( x, 1 );
+* // returns true
+*/
+function some0d( x, n ) {
+	if ( n === 1 && x.data[ x.offset ] ) {
+		return true;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some0d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/0d_accessors.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/0d_accessors.js
new file mode 100644
index 000000000000..a248accc45d9
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/0d_accessors.js
@@ -0,0 +1,81 @@
+/**
+* @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';
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {ndarrayLike} x.ref - reference to the original ndarray-like object
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {Array<Function>} x.accessors - data buffer accessors
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+*
+* // Create a data buffer:
+* var xbuf = toAccessorArray( [ 1.0, 2.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [];
+*
+* // Define the array strides:
+* var sx = [ 0 ];
+*
+* // Define the index offset:
+* var ox = 1;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'ref': null,
+*     'dtype': 'generic',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Test elements:
+* var out = some0d( x, 1 );
+* // returns true
+*/
+function some0d( x, n ) {
+	if ( n === 1 && x.accessors[ 0 ]( x.data, x.offset ) ) {
+		return true;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some0d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/0d_complex.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/0d_complex.js
new file mode 100644
index 000000000000..e08698652feb
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/0d_complex.js
@@ -0,0 +1,76 @@
+/**
+* @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';
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [];
+*
+* // Define the array strides:
+* var sx = [ 0 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'complex128',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = some0d( x, 1 );
+* // returns true
+*/
+function some0d( x, n ) {
+	if ( n === 1 && ( x.data[ x.offset ] || x.data[ x.offset+1 ] ) ) {
+		return true;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some0d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/10d.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/10d.js
new file mode 100644
index 000000000000..9771684727af
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/10d.js
@@ -0,0 +1,212 @@
+/**
+* @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 strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 1, 1, 1, 3, 1, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 4, 1 ];
+*
+* // Define the index offset:
+* var ox = 1;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = some10d( x, 4 );
+* // returns true
+*/
+function some10d( x, n ) { // eslint-disable-line max-statements
+	var count;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var dx6;
+	var dx7;
+	var dx8;
+	var dx9;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var S5;
+	var S6;
+	var S7;
+	var S8;
+	var S9;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+	var i7;
+	var i8;
+	var i9;
+
+	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// 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 ];
+		dx0 = sx[ 9 ];                // offset increment for innermost loop
+		dx1 = sx[ 8 ] - ( S0*sx[9] );
+		dx2 = sx[ 7 ] - ( S1*sx[8] );
+		dx3 = sx[ 6 ] - ( S2*sx[7] );
+		dx4 = sx[ 5 ] - ( S3*sx[6] );
+		dx5 = sx[ 4 ] - ( S4*sx[5] );
+		dx6 = sx[ 3 ] - ( S5*sx[4] );
+		dx7 = sx[ 2 ] - ( S6*sx[3] );
+		dx8 = sx[ 1 ] - ( S7*sx[2] );
+		dx9 = sx[ 0 ] - ( S8*sx[1] ); // offset increment for outermost loop
+	} 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 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] );
+		dx2 = sx[ 2 ] - ( S1*sx[1] );
+		dx3 = sx[ 3 ] - ( S2*sx[2] );
+		dx4 = sx[ 4 ] - ( S3*sx[3] );
+		dx5 = sx[ 5 ] - ( S4*sx[4] );
+		dx6 = sx[ 6 ] - ( S5*sx[5] );
+		dx7 = sx[ 7 ] - ( S6*sx[6] );
+		dx8 = sx[ 8 ] - ( S7*sx[7] );
+		dx9 = sx[ 9 ] - ( S8*sx[8] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the 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++ ) {
+											if ( xbuf[ ix ] ) {
+												count += 1;
+												if ( count === n ) {
+													return true;
+												}
+											}
+											ix += dx0;
+										}
+										ix += dx1;
+									}
+									ix += dx2;
+								}
+								ix += dx3;
+							}
+							ix += dx4;
+						}
+						ix += dx5;
+					}
+					ix += dx6;
+				}
+				ix += dx7;
+			}
+			ix += dx8;
+		}
+		ix += dx9;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some10d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/10d_accessors.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/10d_accessors.js
new file mode 100644
index 000000000000..2256a6666ec2
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/10d_accessors.js
@@ -0,0 +1,219 @@
+/**
+* @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 strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {Array<Function>} x.accessors - data buffer accessors
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+*
+* // Create a data buffer:
+* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 4, 4, 4, 4, 4, 4, 4, 2, 1 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'generic',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Test elements:
+* var out = some10d( x, 4 );
+* // returns true
+*/
+function some10d( x, n ) { // eslint-disable-line max-statements
+	var count;
+	var xbuf;
+	var get;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var dx6;
+	var dx7;
+	var dx8;
+	var dx9;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var S5;
+	var S6;
+	var S7;
+	var S8;
+	var S9;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+	var i7;
+	var i8;
+	var i9;
+
+	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// 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 ];
+		dx0 = sx[ 9 ];                // offset increment for innermost loop
+		dx1 = sx[ 8 ] - ( S0*sx[9] );
+		dx2 = sx[ 7 ] - ( S1*sx[8] );
+		dx3 = sx[ 6 ] - ( S2*sx[7] );
+		dx4 = sx[ 5 ] - ( S3*sx[6] );
+		dx5 = sx[ 4 ] - ( S4*sx[5] );
+		dx6 = sx[ 3 ] - ( S5*sx[4] );
+		dx7 = sx[ 2 ] - ( S6*sx[3] );
+		dx8 = sx[ 1 ] - ( S7*sx[2] );
+		dx9 = sx[ 0 ] - ( S8*sx[1] ); // offset increment for outermost loop
+	} 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 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] );
+		dx2 = sx[ 2 ] - ( S1*sx[1] );
+		dx3 = sx[ 3 ] - ( S2*sx[2] );
+		dx4 = sx[ 4 ] - ( S3*sx[3] );
+		dx5 = sx[ 5 ] - ( S4*sx[4] );
+		dx6 = sx[ 6 ] - ( S5*sx[5] );
+		dx7 = sx[ 7 ] - ( S6*sx[6] );
+		dx8 = sx[ 8 ] - ( S7*sx[7] );
+		dx9 = sx[ 9 ] - ( S8*sx[8] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache accessor:
+	get = x.accessors[ 0 ];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the 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++ ) {
+											if ( get( xbuf, ix ) ) {
+												count += 1;
+												if ( count === n ) {
+													return true;
+												}
+											}
+											ix += dx0;
+										}
+										ix += dx1;
+									}
+									ix += dx2;
+								}
+								ix += dx3;
+							}
+							ix += dx4;
+						}
+						ix += dx5;
+					}
+					ix += dx6;
+				}
+				ix += dx7;
+			}
+			ix += dx8;
+		}
+		ix += dx9;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some10d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/10d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/10d_blocked.js
new file mode 100644
index 000000000000..3ee357cf56fc
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/10d_blocked.js
@@ -0,0 +1,312 @@
+/**
+* @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/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 1, 1, 1, 3, 1, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 4, 1 ];
+*
+* // Define the index offset:
+* var ox = 1;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = blockedsome10d( x, 4 );
+* // returns true
+*/
+function blockedsome10d( x, n ) { // eslint-disable-line max-statements, max-lines-per-function
+	var count;
+	var bsize;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var dx6;
+	var dx7;
+	var dx8;
+	var dx9;
+	var ox1;
+	var ox2;
+	var ox3;
+	var ox4;
+	var ox5;
+	var ox6;
+	var ox7;
+	var ox8;
+	var ox9;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var s5;
+	var s6;
+	var s7;
+	var s8;
+	var s9;
+	var sx;
+	var ox;
+	var ix;
+	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 o;
+
+	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j9 = sh[9]; j9 > 0; ) {
+		if ( j9 < bsize ) {
+			s9 = j9;
+			j9 = 0;
+		} else {
+			s9 = bsize;
+			j9 -= bsize;
+		}
+		ox9 = ox + ( j9*sx[9] );
+		for ( j8 = sh[8]; j8 > 0; ) {
+			if ( j8 < bsize ) {
+				s8 = j8;
+				j8 = 0;
+			} else {
+				s8 = bsize;
+				j8 -= bsize;
+			}
+			dx9 = sx[9] - ( s8*sx[8] );
+			ox8 = ox9 + ( j8*sx[8] );
+			for ( j7 = sh[7]; j7 > 0; ) {
+				if ( j7 < bsize ) {
+					s7 = j7;
+					j7 = 0;
+				} else {
+					s7 = bsize;
+					j7 -= bsize;
+				}
+				dx8 = sx[8] - ( s7*sx[7] );
+				ox7 = ox8 + ( j7*sx[7] );
+				for ( j6 = sh[6]; j6 > 0; ) {
+					if ( j6 < bsize ) {
+						s6 = j6;
+						j6 = 0;
+					} else {
+						s6 = bsize;
+						j6 -= bsize;
+					}
+					dx7 = sx[7] - ( s6*sx[6] );
+					ox6 = ox7 + ( j6*sx[6] );
+					for ( j5 = sh[5]; j5 > 0; ) {
+						if ( j5 < bsize ) {
+							s5 = j5;
+							j5 = 0;
+						} else {
+							s5 = bsize;
+							j5 -= bsize;
+						}
+						dx6 = sx[6] - ( s5*sx[5] );
+						ox5 = ox6 + ( j5*sx[5] );
+						for ( j4 = sh[4]; j4 > 0; ) {
+							if ( j4 < bsize ) {
+								s4 = j4;
+								j4 = 0;
+							} else {
+								s4 = bsize;
+								j4 -= bsize;
+							}
+							dx5 = sx[5] - ( s4*sx[4] );
+							ox4 = ox5 + ( j4*sx[4] );
+							for ( j3 = sh[3]; j3 > 0; ) {
+								if ( j3 < bsize ) {
+									s3 = j3;
+									j3 = 0;
+								} else {
+									s3 = bsize;
+									j3 -= bsize;
+								}
+								dx4 = sx[4] - ( s3*sx[3] );
+								ox3 = ox4 + ( j3*sx[3] );
+								for ( j2 = sh[2]; j2 > 0; ) {
+									if ( j2 < bsize ) {
+										s2 = j2;
+										j2 = 0;
+									} else {
+										s2 = bsize;
+										j2 -= bsize;
+									}
+									dx3 = sx[3] - ( s2*sx[2] );
+									ox2 = ox3 + ( j2*sx[2] );
+									for ( j1 = sh[1]; j1 > 0; ) {
+										if ( j1 < bsize ) {
+											s1 = j1;
+											j1 = 0;
+										} else {
+											s1 = bsize;
+											j1 -= bsize;
+										}
+										dx2 = sx[2] - ( s1*sx[1] );
+										ox1 = ox2 + ( j1*sx[1] );
+										for ( j0 = sh[0]; j0 > 0; ) {
+											if ( j0 < bsize ) {
+												s0 = j0;
+												j0 = 0;
+											} else {
+												s0 = bsize;
+												j0 -= bsize;
+											}
+											// Compute the index offset for the first input ndarray element in the current block:
+											ix = ox1 + ( j0*sx[0] );
+
+											// Compute the loop offset increment:
+											dx1 = sx[1] - ( s0*sx[0] );
+
+											// Iterate over the 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++ ) {
+																					if ( xbuf[ ix ] ) {
+																						count += 1;
+																						if ( count === n ) {
+																							return true;
+																						}
+																					}
+																					ix += dx0;
+																				}
+																				ix += dx1;
+																			}
+																			ix += dx2;
+																		}
+																		ix += dx3;
+																	}
+																	ix += dx4;
+																}
+																ix += dx5;
+															}
+															ix += dx6;
+														}
+														ix += dx7;
+													}
+													ix += dx8;
+												}
+												ix += dx9;
+											}
+										}
+									}
+								}
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome10d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/10d_blocked_accessors.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/10d_blocked_accessors.js
new file mode 100644
index 000000000000..a1e97dc73f83
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/10d_blocked_accessors.js
@@ -0,0 +1,319 @@
+/**
+* @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/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {Array<Function>} x.accessors - data buffer accessors
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+*
+* // Create a data buffer:
+* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 4, 4, 4, 4, 4, 4, 4, 2, 1 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'generic',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Test elements:
+* var out = blockedsome10d( x, 4 );
+* // returns true
+*/
+function blockedsome10d( x, n ) { // eslint-disable-line max-statements, max-lines-per-function
+	var count;
+	var bsize;
+	var xbuf;
+	var get;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var dx6;
+	var dx7;
+	var dx8;
+	var dx9;
+	var ox1;
+	var ox2;
+	var ox3;
+	var ox4;
+	var ox5;
+	var ox6;
+	var ox7;
+	var ox8;
+	var ox9;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var s5;
+	var s6;
+	var s7;
+	var s8;
+	var s9;
+	var sx;
+	var ox;
+	var ix;
+	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 o;
+
+	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Cache accessor:
+	get = x.accessors[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j9 = sh[9]; j9 > 0; ) {
+		if ( j9 < bsize ) {
+			s9 = j9;
+			j9 = 0;
+		} else {
+			s9 = bsize;
+			j9 -= bsize;
+		}
+		ox9 = ox + ( j9*sx[9] );
+		for ( j8 = sh[8]; j8 > 0; ) {
+			if ( j8 < bsize ) {
+				s8 = j8;
+				j8 = 0;
+			} else {
+				s8 = bsize;
+				j8 -= bsize;
+			}
+			dx9 = sx[9] - ( s8*sx[8] );
+			ox8 = ox9 + ( j8*sx[8] );
+			for ( j7 = sh[7]; j7 > 0; ) {
+				if ( j7 < bsize ) {
+					s7 = j7;
+					j7 = 0;
+				} else {
+					s7 = bsize;
+					j7 -= bsize;
+				}
+				dx8 = sx[8] - ( s7*sx[7] );
+				ox7 = ox8 + ( j7*sx[7] );
+				for ( j6 = sh[6]; j6 > 0; ) {
+					if ( j6 < bsize ) {
+						s6 = j6;
+						j6 = 0;
+					} else {
+						s6 = bsize;
+						j6 -= bsize;
+					}
+					dx7 = sx[7] - ( s6*sx[6] );
+					ox6 = ox7 + ( j6*sx[6] );
+					for ( j5 = sh[5]; j5 > 0; ) {
+						if ( j5 < bsize ) {
+							s5 = j5;
+							j5 = 0;
+						} else {
+							s5 = bsize;
+							j5 -= bsize;
+						}
+						dx6 = sx[6] - ( s5*sx[5] );
+						ox5 = ox6 + ( j5*sx[5] );
+						for ( j4 = sh[4]; j4 > 0; ) {
+							if ( j4 < bsize ) {
+								s4 = j4;
+								j4 = 0;
+							} else {
+								s4 = bsize;
+								j4 -= bsize;
+							}
+							dx5 = sx[5] - ( s4*sx[4] );
+							ox4 = ox5 + ( j4*sx[4] );
+							for ( j3 = sh[3]; j3 > 0; ) {
+								if ( j3 < bsize ) {
+									s3 = j3;
+									j3 = 0;
+								} else {
+									s3 = bsize;
+									j3 -= bsize;
+								}
+								dx4 = sx[4] - ( s3*sx[3] );
+								ox3 = ox4 + ( j3*sx[3] );
+								for ( j2 = sh[2]; j2 > 0; ) {
+									if ( j2 < bsize ) {
+										s2 = j2;
+										j2 = 0;
+									} else {
+										s2 = bsize;
+										j2 -= bsize;
+									}
+									dx3 = sx[3] - ( s2*sx[2] );
+									ox2 = ox3 + ( j2*sx[2] );
+									for ( j1 = sh[1]; j1 > 0; ) {
+										if ( j1 < bsize ) {
+											s1 = j1;
+											j1 = 0;
+										} else {
+											s1 = bsize;
+											j1 -= bsize;
+										}
+										dx2 = sx[2] - ( s1*sx[1] );
+										ox1 = ox2 + ( j1*sx[1] );
+										for ( j0 = sh[0]; j0 > 0; ) {
+											if ( j0 < bsize ) {
+												s0 = j0;
+												j0 = 0;
+											} else {
+												s0 = bsize;
+												j0 -= bsize;
+											}
+											// Compute the index offset for the first input ndarray element in the current block:
+											ix = ox1 + ( j0*sx[0] );
+
+											// Compute the loop offset increment:
+											dx1 = sx[1] - ( s0*sx[0] );
+
+											// Iterate over the 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++ ) {
+																					if ( get( xbuf, ix ) ) {
+																						count += 1;
+																						if ( count === n ) {
+																							return true;
+																						}
+																					}
+																					ix += dx0;
+																				}
+																				ix += dx1;
+																			}
+																			ix += dx2;
+																		}
+																		ix += dx3;
+																	}
+																	ix += dx4;
+																}
+																ix += dx5;
+															}
+															ix += dx6;
+														}
+														ix += dx7;
+													}
+													ix += dx8;
+												}
+												ix += dx9;
+											}
+										}
+									}
+								}
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome10d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/10d_blocked_complex.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/10d_blocked_complex.js
new file mode 100644
index 000000000000..e8892655574e
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/10d_blocked_complex.js
@@ -0,0 +1,312 @@
+/**
+* @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/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 8, 8, 8, 8, 8, 8, 8, 8, 4, 2 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'complex128',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = blockedsome10d( x, 4 );
+* // returns true
+*/
+function blockedsome10d( x, n ) { // eslint-disable-line max-statements, max-lines-per-function
+	var count;
+	var bsize;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var dx6;
+	var dx7;
+	var dx8;
+	var dx9;
+	var ox1;
+	var ox2;
+	var ox3;
+	var ox4;
+	var ox5;
+	var ox6;
+	var ox7;
+	var ox8;
+	var ox9;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var s5;
+	var s6;
+	var s7;
+	var s8;
+	var s9;
+	var sx;
+	var ox;
+	var ix;
+	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 o;
+
+	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j9 = sh[9]; j9 > 0; ) {
+		if ( j9 < bsize ) {
+			s9 = j9;
+			j9 = 0;
+		} else {
+			s9 = bsize;
+			j9 -= bsize;
+		}
+		ox9 = ox + ( j9*sx[9] );
+		for ( j8 = sh[8]; j8 > 0; ) {
+			if ( j8 < bsize ) {
+				s8 = j8;
+				j8 = 0;
+			} else {
+				s8 = bsize;
+				j8 -= bsize;
+			}
+			dx9 = sx[9] - ( s8*sx[8] );
+			ox8 = ox9 + ( j8*sx[8] );
+			for ( j7 = sh[7]; j7 > 0; ) {
+				if ( j7 < bsize ) {
+					s7 = j7;
+					j7 = 0;
+				} else {
+					s7 = bsize;
+					j7 -= bsize;
+				}
+				dx8 = sx[8] - ( s7*sx[7] );
+				ox7 = ox8 + ( j7*sx[7] );
+				for ( j6 = sh[6]; j6 > 0; ) {
+					if ( j6 < bsize ) {
+						s6 = j6;
+						j6 = 0;
+					} else {
+						s6 = bsize;
+						j6 -= bsize;
+					}
+					dx7 = sx[7] - ( s6*sx[6] );
+					ox6 = ox7 + ( j6*sx[6] );
+					for ( j5 = sh[5]; j5 > 0; ) {
+						if ( j5 < bsize ) {
+							s5 = j5;
+							j5 = 0;
+						} else {
+							s5 = bsize;
+							j5 -= bsize;
+						}
+						dx6 = sx[6] - ( s5*sx[5] );
+						ox5 = ox6 + ( j5*sx[5] );
+						for ( j4 = sh[4]; j4 > 0; ) {
+							if ( j4 < bsize ) {
+								s4 = j4;
+								j4 = 0;
+							} else {
+								s4 = bsize;
+								j4 -= bsize;
+							}
+							dx5 = sx[5] - ( s4*sx[4] );
+							ox4 = ox5 + ( j4*sx[4] );
+							for ( j3 = sh[3]; j3 > 0; ) {
+								if ( j3 < bsize ) {
+									s3 = j3;
+									j3 = 0;
+								} else {
+									s3 = bsize;
+									j3 -= bsize;
+								}
+								dx4 = sx[4] - ( s3*sx[3] );
+								ox3 = ox4 + ( j3*sx[3] );
+								for ( j2 = sh[2]; j2 > 0; ) {
+									if ( j2 < bsize ) {
+										s2 = j2;
+										j2 = 0;
+									} else {
+										s2 = bsize;
+										j2 -= bsize;
+									}
+									dx3 = sx[3] - ( s2*sx[2] );
+									ox2 = ox3 + ( j2*sx[2] );
+									for ( j1 = sh[1]; j1 > 0; ) {
+										if ( j1 < bsize ) {
+											s1 = j1;
+											j1 = 0;
+										} else {
+											s1 = bsize;
+											j1 -= bsize;
+										}
+										dx2 = sx[2] - ( s1*sx[1] );
+										ox1 = ox2 + ( j1*sx[1] );
+										for ( j0 = sh[0]; j0 > 0; ) {
+											if ( j0 < bsize ) {
+												s0 = j0;
+												j0 = 0;
+											} else {
+												s0 = bsize;
+												j0 -= bsize;
+											}
+											// Compute the index offset for the first input ndarray element in the current block:
+											ix = ox1 + ( j0*sx[0] );
+
+											// Compute the loop offset increment:
+											dx1 = sx[1] - ( s0*sx[0] );
+
+											// Iterate over the 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++ ) {
+																					if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
+																						count += 1;
+																						if ( count === n ) {
+																							return true;
+																						}
+																					}
+																					ix += dx0;
+																				}
+																				ix += dx1;
+																			}
+																			ix += dx2;
+																		}
+																		ix += dx3;
+																	}
+																	ix += dx4;
+																}
+																ix += dx5;
+															}
+															ix += dx6;
+														}
+														ix += dx7;
+													}
+													ix += dx8;
+												}
+												ix += dx9;
+											}
+										}
+									}
+								}
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome10d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/10d_complex.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/10d_complex.js
new file mode 100644
index 000000000000..1cced55bf4f8
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/10d_complex.js
@@ -0,0 +1,212 @@
+/**
+* @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 strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 8, 8, 8, 8, 8, 8, 8, 8, 4, 2 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'complex128',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = some10d( x, 4 );
+* // returns true
+*/
+function some10d( x, n ) { // eslint-disable-line max-statements
+	var count;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var dx6;
+	var dx7;
+	var dx8;
+	var dx9;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var S5;
+	var S6;
+	var S7;
+	var S8;
+	var S9;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+	var i7;
+	var i8;
+	var i9;
+
+	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// 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 ];
+		dx0 = sx[ 9 ];                // offset increment for innermost loop
+		dx1 = sx[ 8 ] - ( S0*sx[9] );
+		dx2 = sx[ 7 ] - ( S1*sx[8] );
+		dx3 = sx[ 6 ] - ( S2*sx[7] );
+		dx4 = sx[ 5 ] - ( S3*sx[6] );
+		dx5 = sx[ 4 ] - ( S4*sx[5] );
+		dx6 = sx[ 3 ] - ( S5*sx[4] );
+		dx7 = sx[ 2 ] - ( S6*sx[3] );
+		dx8 = sx[ 1 ] - ( S7*sx[2] );
+		dx9 = sx[ 0 ] - ( S8*sx[1] ); // offset increment for outermost loop
+	} 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 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] );
+		dx2 = sx[ 2 ] - ( S1*sx[1] );
+		dx3 = sx[ 3 ] - ( S2*sx[2] );
+		dx4 = sx[ 4 ] - ( S3*sx[3] );
+		dx5 = sx[ 5 ] - ( S4*sx[4] );
+		dx6 = sx[ 6 ] - ( S5*sx[5] );
+		dx7 = sx[ 7 ] - ( S6*sx[6] );
+		dx8 = sx[ 8 ] - ( S7*sx[7] );
+		dx9 = sx[ 9 ] - ( S8*sx[8] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the 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++ ) {
+											if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
+												count += 1;
+												if ( count === n ) {
+													return true;
+												}
+											}
+											ix += dx0;
+										}
+										ix += dx1;
+									}
+									ix += dx2;
+								}
+								ix += dx3;
+							}
+							ix += dx4;
+						}
+						ix += dx5;
+					}
+					ix += dx6;
+				}
+				ix += dx7;
+			}
+			ix += dx8;
+		}
+		ix += dx9;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some10d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/1d.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/1d.js
new file mode 100644
index 000000000000..5cf9d7d60f05
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/1d.js
@@ -0,0 +1,107 @@
+/**
+* @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';
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {ndarrayLike} x.ref - reference to the original ndarray-like object
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 4 ];
+*
+* // Define the array strides:
+* var sx = [ 2 ];
+*
+* // Define the index offset:
+* var ox = 1;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'ref': null,
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = some1d( x, 4 );
+* // returns true
+*/
+function some1d( x, n ) {
+	var count;
+	var xbuf;
+	var dx0;
+	var S0;
+	var ix;
+	var i0;
+
+	// Note on variable naming convention: S#, dx#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables: dimensions and loop offset (pointer) increments:
+	S0 = x.shape[ 0 ];
+	dx0 = x.strides[ 0 ];
+
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the ndarray dimensions...
+	for ( i0 = 0; i0 < S0; i0++ ) {
+		if ( xbuf[ ix ] ) {
+			count += 1;
+			if ( count === n ) {
+				return true;
+			}
+		}
+		ix += dx0;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some1d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/1d_accessors.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/1d_accessors.js
new file mode 100644
index 000000000000..620235f29cc8
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/1d_accessors.js
@@ -0,0 +1,114 @@
+/**
+* @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';
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {ndarrayLike} x.ref - reference to the original ndarray-like object
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {Array<Function>} x.accessors - data buffer accessors
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+*
+* // Create a data buffer:
+* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 4 ];
+*
+* // Define the array strides:
+* var sx = [ 2 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'ref': null,
+*     'dtype': 'generic',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Test elements:
+* var out = some1d( x, 4 );
+* // returns true
+*/
+function some1d( x, n ) {
+	var count;
+	var xbuf;
+	var get;
+	var dx0;
+	var S0;
+	var ix;
+	var i0;
+
+	// Note on variable naming convention: S#, dx#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables: dimensions and loop offset (pointer) increments...
+	S0 = x.shape[ 0 ];
+	dx0 = x.strides[ 0 ];
+
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache accessor:
+	get = x.accessors[ 0 ];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the ndarray dimensions...
+	for ( i0 = 0; i0 < S0; i0++ ) {
+		if ( get( xbuf, ix ) ) {
+			count += 1;
+			if ( count === n ) {
+				return true;
+			}
+		}
+		ix += dx0;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some1d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/1d_complex.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/1d_complex.js
new file mode 100644
index 000000000000..e98cb1333f11
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/1d_complex.js
@@ -0,0 +1,105 @@
+/**
+* @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';
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 4 ];
+*
+* // Define the array strides:
+* var sx = [ 2 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'complex128',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = some1d( x, 4 );
+* // returns true
+*/
+function some1d( x, n ) {
+	var count;
+	var xbuf;
+	var dx0;
+	var S0;
+	var ix;
+	var i0;
+
+	// Note on variable naming convention: S#, dx#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables: dimensions and loop offset (pointer) increments:
+	S0 = x.shape[ 0 ];
+	dx0 = x.strides[ 0 ];
+
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the ndarray dimensions...
+	for ( i0 = 0; i0 < S0; i0++ ) {
+		if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
+			count += 1;
+			if ( count === n ) {
+				return true;
+			}
+		}
+		ix += dx0;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some1d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/2d.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/2d.js
new file mode 100644
index 000000000000..7602911aac9d
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/2d.js
@@ -0,0 +1,132 @@
+/**
+* @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 strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {ndarrayLike} x.ref - reference to the original ndarray-like object
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 1 ];
+*
+* // Define the index offset:
+* var ox = 1;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'ref': null,
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = some2d( x, 4 );
+* // returns true
+*/
+function some2d( x, n ) {
+	var count;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var sh;
+	var S0;
+	var S1;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+
+	// Note on variable naming convention: S#, dx#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// For row-major ndarrays, the last dimensions have the fastest changing indices...
+		S0 = sh[ 1 ];
+		S1 = sh[ 0 ];
+		dx0 = sx[ 1 ];                // offset increment for innermost loop
+		dx1 = sx[ 0 ] - ( S0*sx[1] ); // offset increment for outermost loop
+	} else { // order === 'column-major'
+		// For column-major ndarrays, the first dimensions have the fastest changing indices...
+		S0 = sh[ 0 ];
+		S1 = sh[ 1 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the ndarray dimensions...
+	for ( i1 = 0; i1 < S1; i1++ ) {
+		for ( i0 = 0; i0 < S0; i0++ ) {
+			if ( xbuf[ ix ] ) {
+				count += 1;
+				if ( count === n ) {
+					return true;
+				}
+			}
+			ix += dx0;
+		}
+		ix += dx1;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some2d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/2d_accessors.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/2d_accessors.js
new file mode 100644
index 000000000000..88c51cafb625
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/2d_accessors.js
@@ -0,0 +1,139 @@
+/**
+* @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 strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {ndarrayLike} x.ref - reference to the original ndarray-like object
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {Array<Function>} x.accessors - data buffer accessors
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+*
+* // Create a data buffer:
+* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 1 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'ref': null,
+*     'dtype': 'generic',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Test elements:
+* var out = some2d( x, 4 );
+* // returns true
+*/
+function some2d( x, n ) {
+	var count;
+	var xbuf;
+	var get;
+	var dx0;
+	var dx1;
+	var sh;
+	var S0;
+	var S1;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+
+	// Note on variable naming convention: S#, dx#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// For row-major ndarrays, the last dimensions have the fastest changing indices...
+		S0 = sh[ 1 ];
+		S1 = sh[ 0 ];
+		dx0 = sx[ 1 ];                // offset increment for innermost loop
+		dx1 = sx[ 0 ] - ( S0*sx[1] ); // offset increment for outermost loop
+	} else { // order === 'column-major'
+		// For column-major ndarrays, the first dimensions have the fastest changing indices...
+		S0 = sh[ 0 ];
+		S1 = sh[ 1 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache accessor:
+	get = x.accessors[ 0 ];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the ndarray dimensions...
+	for ( i1 = 0; i1 < S1; i1++ ) {
+		for ( i0 = 0; i0 < S0; i0++ ) {
+			if ( get( xbuf, ix ) ) {
+				count += 1;
+				if ( count === n ) {
+					return true;
+				}
+			}
+			ix += dx0;
+		}
+		ix += dx1;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some2d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/2d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/2d_blocked.js
new file mode 100644
index 000000000000..c52be20283b3
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/2d_blocked.js
@@ -0,0 +1,162 @@
+/**
+* @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';
+
+/* eslint-disable max-depth */
+
+// MODULES //
+
+var loopOrder = require( '@stdlib/ndarray/base/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {ndarrayLike} x.ref - reference to the original ndarray-like object
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 1 ];
+*
+* // Define the index offset:
+* var ox = 1;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'ref': null,
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = blockedsome2d( x, 4 );
+* // returns true
+*/
+function blockedsome2d( x, n ) {
+	var bsize;
+	var count;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var ox1;
+	var sh;
+	var s0;
+	var s1;
+	var sx;
+	var ox;
+	var ix;
+	var i0;
+	var i1;
+	var j0;
+	var j1;
+	var o;
+
+	// Note on variable naming convention: s#, dx#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j1 = sh[1]; j1 > 0; ) {
+		if ( j1 < bsize ) {
+			s1 = j1;
+			j1 = 0;
+		} else {
+			s1 = bsize;
+			j1 -= bsize;
+		}
+		ox1 = ox + ( j1*sx[1] );
+		for ( j0 = sh[0]; j0 > 0; ) {
+			if ( j0 < bsize ) {
+				s0 = j0;
+				j0 = 0;
+			} else {
+				s0 = bsize;
+				j0 -= bsize;
+			}
+			// Compute the index offset for the first input ndarray element in the current block:
+			ix = ox1 + ( j0*sx[0] );
+
+			// Compute the loop offset increment:
+			dx1 = sx[1] - ( s0*sx[0] );
+
+			// Iterate over the ndarray dimensions...
+			for ( i1 = 0; i1 < s1; i1++ ) {
+				for ( i0 = 0; i0 < s0; i0++ ) {
+					if ( xbuf[ ix ] ) {
+						count += 1;
+						if ( count === n ) {
+							return true;
+						}
+					}
+					ix += dx0;
+				}
+				ix += dx1;
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome2d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/2d_blocked_accessors.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/2d_blocked_accessors.js
new file mode 100644
index 000000000000..21509d339b4d
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/2d_blocked_accessors.js
@@ -0,0 +1,169 @@
+/**
+* @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';
+
+/* eslint-disable max-depth */
+
+// MODULES //
+
+var loopOrder = require( '@stdlib/ndarray/base/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {ndarrayLike} x.ref - reference to the original ndarray-like object
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {Array<Function>} x.accessors - data buffer accessors
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+*
+* // Create a data buffer:
+* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 1 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'ref': null,
+*     'dtype': 'generic',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Test elements:
+* var out = blockedsome2d( x, 4 );
+* // returns true
+*/
+function blockedsome2d( x, n ) {
+	var bsize;
+	var count;
+	var xbuf;
+	var get;
+	var dx0;
+	var dx1;
+	var ox1;
+	var sh;
+	var s0;
+	var s1;
+	var sx;
+	var ox;
+	var ix;
+	var i0;
+	var i1;
+	var j0;
+	var j1;
+	var o;
+
+	// Note on variable naming convention: s#, dx#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Cache accessor:
+	get = x.accessors[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j1 = sh[1]; j1 > 0; ) {
+		if ( j1 < bsize ) {
+			s1 = j1;
+			j1 = 0;
+		} else {
+			s1 = bsize;
+			j1 -= bsize;
+		}
+		ox1 = ox + ( j1*sx[1] );
+		for ( j0 = sh[0]; j0 > 0; ) {
+			if ( j0 < bsize ) {
+				s0 = j0;
+				j0 = 0;
+			} else {
+				s0 = bsize;
+				j0 -= bsize;
+			}
+			// Compute the index offset for the first input ndarray element in the current block:
+			ix = ox1 + ( j0*sx[0] );
+
+			// Compute the loop offset increment:
+			dx1 = sx[1] - ( s0*sx[0] );
+
+			// Iterate over the ndarray dimensions...
+			for ( i1 = 0; i1 < s1; i1++ ) {
+				for ( i0 = 0; i0 < s0; i0++ ) {
+					if ( get( xbuf, ix ) ) {
+						count += 1;
+						if ( count === n ) {
+							return true;
+						}
+					}
+					ix += dx0;
+				}
+				ix += dx1;
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome2d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/2d_blocked_complex.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/2d_blocked_complex.js
new file mode 100644
index 000000000000..9ebc8b5ab73b
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/2d_blocked_complex.js
@@ -0,0 +1,160 @@
+/**
+* @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/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 2 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'complex128',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = blockedsome2d( x, 4 );
+* // returns true
+*/
+function blockedsome2d( x, n ) {
+	var count;
+	var bsize;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var ox1;
+	var sh;
+	var s0;
+	var s1;
+	var sx;
+	var ox;
+	var ix;
+	var i0;
+	var i1;
+	var j0;
+	var j1;
+	var o;
+
+	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j1 = sh[1]; j1 > 0; ) {
+		if ( j1 < bsize ) {
+			s1 = j1;
+			j1 = 0;
+		} else {
+			s1 = bsize;
+			j1 -= bsize;
+		}
+		ox1 = ox + ( j1*sx[1] );
+		for ( j0 = sh[0]; j0 > 0; ) {
+			if ( j0 < bsize ) {
+				s0 = j0;
+				j0 = 0;
+			} else {
+				s0 = bsize;
+				j0 -= bsize;
+			}
+			// Compute the index offset for the first input ndarray element in the current block:
+			ix = ox1 + ( j0*sx[0] );
+
+			// Compute the loop offset increment:
+			dx1 = sx[1] - ( s0*sx[0] );
+
+			// Iterate over the ndarray dimensions...
+			for ( i1 = 0; i1 < s1; i1++ ) {
+				for ( i0 = 0; i0 < s0; i0++ ) {
+					if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
+						count += 1;
+						if ( count === n ) {
+							return true;
+						}
+					}
+					ix += dx0;
+				}
+				ix += dx1;
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome2d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/2d_complex.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/2d_complex.js
new file mode 100644
index 000000000000..ec3c260396bd
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/2d_complex.js
@@ -0,0 +1,130 @@
+/**
+* @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 strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 2 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'complex128',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = some2d( x, 4 );
+* // returns true
+*/
+function some2d( x, n ) {
+	var count;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var sh;
+	var S0;
+	var S1;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+
+	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// For row-major ndarrays, the last dimensions have the fastest changing indices...
+		S0 = sh[ 1 ];
+		S1 = sh[ 0 ];
+		dx0 = sx[ 1 ];                // offset increment for innermost loop
+		dx1 = sx[ 0 ] - ( S0*sx[1] ); // offset increment for outermost loop
+	} else { // order === 'column-major'
+		// For column-major ndarrays, the first dimensions have the fastest changing indices...
+		S0 = sh[ 0 ];
+		S1 = sh[ 1 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the ndarray dimensions...
+	for ( i1 = 0; i1 < S1; i1++ ) {
+		for ( i0 = 0; i0 < S0; i0++ ) {
+			if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
+				count += 1;
+				if ( count === n ) {
+					return true;
+				}
+			}
+			ix += dx0;
+		}
+		ix += dx1;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some2d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/3d.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/3d.js
new file mode 100644
index 000000000000..9897600d2da3
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/3d.js
@@ -0,0 +1,142 @@
+/**
+* @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 strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {ndarrayLike} x.ref - reference to the original ndarray-like object
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 3, 1, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 4, 1 ];
+*
+* // Define the index offset:
+* var ox = 1;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'ref': null,
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = some3d( x, 4 );
+* // returns true
+*/
+function some3d( x, n ) {
+	var count;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+
+	// Note on variable naming convention: S#, dx#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// For row-major ndarrays, the last dimensions have the fastest changing indices...
+		S0 = sh[ 2 ];
+		S1 = sh[ 1 ];
+		S2 = sh[ 0 ];
+		dx0 = sx[ 2 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[2] );
+		dx2 = sx[ 0 ] - ( S1*sx[1] ); // offset increment for outermost loop
+	} 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 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] );
+		dx2 = sx[ 2 ] - ( S1*sx[1] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the ndarray dimensions...
+	for ( i2 = 0; i2 < S2; i2++ ) {
+		for ( i1 = 0; i1 < S1; i1++ ) {
+			for ( i0 = 0; i0 < S0; i0++ ) {
+				if ( xbuf[ ix ] ) {
+					count += 1;
+					if ( count === n ) {
+						return true;
+					}
+				}
+				ix += dx0;
+			}
+			ix += dx1;
+		}
+		ix += dx2;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some3d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/3d_accessors.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/3d_accessors.js
new file mode 100644
index 000000000000..dac2dfc513d8
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/3d_accessors.js
@@ -0,0 +1,149 @@
+/**
+* @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 strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {ndarrayLike} x.ref - reference to the original ndarray-like object
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {Array<Function>} x.accessors - data buffer accessors
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+*
+* // Create a data buffer:
+* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 2, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 2, 1 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'ref': null,
+*     'dtype': 'generic',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Test elements:
+* var out = some3d( x, 4 );
+* // returns true
+*/
+function some3d( x, n ) {
+	var count;
+	var xbuf;
+	var get;
+	var dx0;
+	var dx1;
+	var dx2;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+
+	// Note on variable naming convention: S#, dx#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// For row-major ndarrays, the last dimensions have the fastest changing indices...
+		S0 = sh[ 2 ];
+		S1 = sh[ 1 ];
+		S2 = sh[ 0 ];
+		dx0 = sx[ 2 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[2] );
+		dx2 = sx[ 0 ] - ( S1*sx[1] ); // offset increment for outermost loop
+	} 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 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] );
+		dx2 = sx[ 2 ] - ( S1*sx[1] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache accessor:
+	get = x.accessors[ 0 ];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the ndarray dimensions...
+	for ( i2 = 0; i2 < S2; i2++ ) {
+		for ( i1 = 0; i1 < S1; i1++ ) {
+			for ( i0 = 0; i0 < S0; i0++ ) {
+				if ( get( xbuf, ix ) ) {
+					count += 1;
+					if ( count === n ) {
+						return true;
+					}
+				}
+				ix += dx0;
+			}
+			ix += dx1;
+		}
+		ix += dx2;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some3d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/3d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/3d_blocked.js
new file mode 100644
index 000000000000..76ed9fd7a18d
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/3d_blocked.js
@@ -0,0 +1,181 @@
+/**
+* @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/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {ndarrayLike} x.ref - reference to the original ndarray-like object
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 3, 1, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 4, 1 ];
+*
+* // Define the index offset:
+* var ox = 1;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'ref': null,
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = blockedsome3d( x, 4 );
+* // returns true
+*/
+function blockedsome3d( x, n ) {
+	var bsize;
+	var count;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var ox1;
+	var ox2;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var sx;
+	var ox;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var j0;
+	var j1;
+	var j2;
+	var o;
+
+	// Note on variable naming convention: s#, dx#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j2 = sh[2]; j2 > 0; ) {
+		if ( j2 < bsize ) {
+			s2 = j2;
+			j2 = 0;
+		} else {
+			s2 = bsize;
+			j2 -= bsize;
+		}
+		ox2 = ox + ( j2*sx[2] );
+		for ( j1 = sh[1]; j1 > 0; ) {
+			if ( j1 < bsize ) {
+				s1 = j1;
+				j1 = 0;
+			} else {
+				s1 = bsize;
+				j1 -= bsize;
+			}
+			dx2 = sx[2] - ( s1*sx[1] );
+			ox1 = ox2 + ( j1*sx[1] );
+			for ( j0 = sh[0]; j0 > 0; ) {
+				if ( j0 < bsize ) {
+					s0 = j0;
+					j0 = 0;
+				} else {
+					s0 = bsize;
+					j0 -= bsize;
+				}
+				// Compute the index offset for the first input ndarray element in the current block:
+				ix = ox1 + ( j0*sx[0] );
+
+				// Compute the loop offset increment:
+				dx1 = sx[1] - ( s0*sx[0] );
+
+				// Iterate over the ndarray dimensions...
+				for ( i2 = 0; i2 < s2; i2++ ) {
+					for ( i1 = 0; i1 < s1; i1++ ) {
+						for ( i0 = 0; i0 < s0; i0++ ) {
+							if ( xbuf[ ix ] ) {
+								count += 1;
+								if ( count === n ) {
+									return true;
+								}
+							}
+							ix += dx0;
+						}
+						ix += dx1;
+					}
+					ix += dx2;
+				}
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome3d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/3d_blocked_accessors.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/3d_blocked_accessors.js
new file mode 100644
index 000000000000..401688668749
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/3d_blocked_accessors.js
@@ -0,0 +1,188 @@
+/**
+* @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/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {ndarrayLike} x.ref - reference to the original ndarray-like object
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {Array<Function>} x.accessors - data buffer accessors
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+*
+* // Create a data buffer:
+* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 2, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 2, 1 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'ref': null,
+*     'dtype': 'generic',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Test elements:
+* var out = blockedsome3d( x, 4 );
+* // returns true
+*/
+function blockedsome3d( x, n ) {
+	var bsize;
+	var count;
+	var xbuf;
+	var get;
+	var dx0;
+	var dx1;
+	var dx2;
+	var ox1;
+	var ox2;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var sx;
+	var ox;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var j0;
+	var j1;
+	var j2;
+	var o;
+
+	// Note on variable naming convention: s#, dx#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Cache accessor:
+	get = x.accessors[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j2 = sh[2]; j2 > 0; ) {
+		if ( j2 < bsize ) {
+			s2 = j2;
+			j2 = 0;
+		} else {
+			s2 = bsize;
+			j2 -= bsize;
+		}
+		ox2 = ox + ( j2*sx[2] );
+		for ( j1 = sh[1]; j1 > 0; ) {
+			if ( j1 < bsize ) {
+				s1 = j1;
+				j1 = 0;
+			} else {
+				s1 = bsize;
+				j1 -= bsize;
+			}
+			dx2 = sx[2] - ( s1*sx[1] );
+			ox1 = ox2 + ( j1*sx[1] );
+			for ( j0 = sh[0]; j0 > 0; ) {
+				if ( j0 < bsize ) {
+					s0 = j0;
+					j0 = 0;
+				} else {
+					s0 = bsize;
+					j0 -= bsize;
+				}
+				// Compute the index offset for the first input ndarray element in the current block:
+				ix = ox1 + ( j0*sx[0] );
+
+				// Compute the loop offset increment:
+				dx1 = sx[1] - ( s0*sx[0] );
+
+				// Iterate over the ndarray dimensions...
+				for ( i2 = 0; i2 < s2; i2++ ) {
+					for ( i1 = 0; i1 < s1; i1++ ) {
+						for ( i0 = 0; i0 < s0; i0++ ) {
+							if ( get( xbuf, ix ) ) {
+								count += 1;
+								if ( count === n ) {
+									return true;
+								}
+							}
+							ix += dx0;
+						}
+						ix += dx1;
+					}
+					ix += dx2;
+				}
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome3d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/3d_blocked_complex.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/3d_blocked_complex.js
new file mode 100644
index 000000000000..f8fb558b5ff3
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/3d_blocked_complex.js
@@ -0,0 +1,179 @@
+/**
+* @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/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements of a reinterpreted complex number ndarray is truthy via loop blocking.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 8, 4, 2 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'complex128',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = blockedsome3d( x, 4 );
+* // returns true
+*/
+function blockedsome3d( x, n ) {
+	var count;
+	var bsize;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var ox1;
+	var ox2;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var sx;
+	var ox;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var j0;
+	var j1;
+	var j2;
+	var o;
+
+	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j2 = sh[2]; j2 > 0; ) {
+		if ( j2 < bsize ) {
+			s2 = j2;
+			j2 = 0;
+		} else {
+			s2 = bsize;
+			j2 -= bsize;
+		}
+		ox2 = ox + ( j2*sx[2] );
+		for ( j1 = sh[1]; j1 > 0; ) {
+			if ( j1 < bsize ) {
+				s1 = j1;
+				j1 = 0;
+			} else {
+				s1 = bsize;
+				j1 -= bsize;
+			}
+			dx2 = sx[2] - ( s1*sx[1] );
+			ox1 = ox2 + ( j1*sx[1] );
+			for ( j0 = sh[0]; j0 > 0; ) {
+				if ( j0 < bsize ) {
+					s0 = j0;
+					j0 = 0;
+				} else {
+					s0 = bsize;
+					j0 -= bsize;
+				}
+				// Compute the index offset for the first input ndarray element in the current block:
+				ix = ox1 + ( j0*sx[0] );
+
+				// Compute the loop offset increment:
+				dx1 = sx[1] - ( s0*sx[0] );
+
+				// Iterate over the ndarray dimensions...
+				for ( i2 = 0; i2 < s2; i2++ ) {
+					for ( i1 = 0; i1 < s1; i1++ ) {
+						for ( i0 = 0; i0 < s0; i0++ ) {
+							if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
+								count += 1;
+								if ( count === n ) {
+									return true;
+								}
+							}
+							ix += dx0;
+						}
+						ix += dx1;
+					}
+					ix += dx2;
+				}
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome3d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/3d_complex.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/3d_complex.js
new file mode 100644
index 000000000000..64faaa4864f4
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/3d_complex.js
@@ -0,0 +1,140 @@
+/**
+* @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 strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 8, 4, 2 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'complex128',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = some3d( x, 4 );
+* // returns true
+*/
+function some3d( x, n ) {
+	var count;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+
+	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// For row-major ndarrays, the last dimensions have the fastest changing indices...
+		S0 = sh[ 2 ];
+		S1 = sh[ 1 ];
+		S2 = sh[ 0 ];
+		dx0 = sx[ 2 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[2] );
+		dx2 = sx[ 0 ] - ( S1*sx[1] ); // offset increment for outermost loop
+	} 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 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] );
+		dx2 = sx[ 2 ] - ( S1*sx[1] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the ndarray dimensions...
+	for ( i2 = 0; i2 < S2; i2++ ) {
+		for ( i1 = 0; i1 < S1; i1++ ) {
+			for ( i0 = 0; i0 < S0; i0++ ) {
+				if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
+					count += 1;
+					if ( count === n ) {
+						return true;
+					}
+				}
+				ix += dx0;
+			}
+			ix += dx1;
+		}
+		ix += dx2;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some3d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/4d.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/4d.js
new file mode 100644
index 000000000000..125dac60d639
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/4d.js
@@ -0,0 +1,152 @@
+/**
+* @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 strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 3, 1, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 4, 4, 1 ];
+*
+* // Define the index offset:
+* var ox = 1;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = some4d( x, 4 );
+* // returns true
+*/
+function some4d( x, n ) {
+	var count;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+
+	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// For row-major ndarrays, the last dimensions have the fastest changing indices...
+		S0 = sh[ 3 ];
+		S1 = sh[ 2 ];
+		S2 = sh[ 1 ];
+		S3 = sh[ 0 ];
+		dx0 = sx[ 3 ];                // offset increment for innermost loop
+		dx1 = sx[ 2 ] - ( S0*sx[3] );
+		dx2 = sx[ 1 ] - ( S1*sx[2] );
+		dx3 = sx[ 0 ] - ( S2*sx[1] ); // offset increment for outermost loop
+	} 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 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] );
+		dx2 = sx[ 2 ] - ( S1*sx[1] );
+		dx3 = sx[ 3 ] - ( S2*sx[2] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the 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++ ) {
+					if ( xbuf[ ix ] ) {
+						count += 1;
+						if ( count === n ) {
+							return true;
+						}
+					}
+					ix += dx0;
+				}
+				ix += dx1;
+			}
+			ix += dx2;
+		}
+		ix += dx3;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some4d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/4d_accessors.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/4d_accessors.js
new file mode 100644
index 000000000000..7832486444a9
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/4d_accessors.js
@@ -0,0 +1,159 @@
+/**
+* @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 strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {Array<Function>} x.accessors - data buffer accessors
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+*
+* // Create a data buffer:
+* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 4, 2, 1 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'generic',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Test elements:
+* var out = some4d( x, 4 );
+* // returns true
+*/
+function some4d( x, n ) {
+	var count;
+	var xbuf;
+	var get;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+
+	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// For row-major ndarrays, the last dimensions have the fastest changing indices...
+		S0 = sh[ 3 ];
+		S1 = sh[ 2 ];
+		S2 = sh[ 1 ];
+		S3 = sh[ 0 ];
+		dx0 = sx[ 3 ];                // offset increment for innermost loop
+		dx1 = sx[ 2 ] - ( S0*sx[3] );
+		dx2 = sx[ 1 ] - ( S1*sx[2] );
+		dx3 = sx[ 0 ] - ( S2*sx[1] ); // offset increment for outermost loop
+	} 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 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] );
+		dx2 = sx[ 2 ] - ( S1*sx[1] );
+		dx3 = sx[ 3 ] - ( S2*sx[2] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache accessor:
+	get = x.accessors[ 0 ];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the 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++ ) {
+					if ( get( xbuf, ix ) ) {
+						count += 1;
+						if ( count === n ) {
+							return true;
+						}
+					}
+					ix += dx0;
+				}
+				ix += dx1;
+			}
+			ix += dx2;
+		}
+		ix += dx3;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some4d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/4d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/4d_blocked.js
new file mode 100644
index 000000000000..f6e3b4732c36
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/4d_blocked.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.
+*/
+
+/* eslint-disable max-depth */
+
+'use strict';
+
+// MODULES //
+
+var loopOrder = require( '@stdlib/ndarray/base/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 3, 1, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 4, 4, 1 ];
+*
+* // Define the index offset:
+* var ox = 1;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = blockedsome4d( x, 4 );
+* // returns true
+*/
+function blockedsome4d( x, n ) {
+	var bsize;
+	var count;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var ox1;
+	var ox2;
+	var ox3;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var sx;
+	var ox;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var j0;
+	var j1;
+	var j2;
+	var j3;
+	var o;
+
+	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j3 = sh[3]; j3 > 0; ) {
+		if ( j3 < bsize ) {
+			s3 = j3;
+			j3 = 0;
+		} else {
+			s3 = bsize;
+			j3 -= bsize;
+		}
+		ox3 = ox + ( j3*sx[3] );
+		for ( j2 = sh[2]; j2 > 0; ) {
+			if ( j2 < bsize ) {
+				s2 = j2;
+				j2 = 0;
+			} else {
+				s2 = bsize;
+				j2 -= bsize;
+			}
+			dx3 = sx[3] - ( s2*sx[2] );
+			ox2 = ox3 + ( j2*sx[2] );
+			for ( j1 = sh[1]; j1 > 0; ) {
+				if ( j1 < bsize ) {
+					s1 = j1;
+					j1 = 0;
+				} else {
+					s1 = bsize;
+					j1 -= bsize;
+				}
+				dx2 = sx[2] - ( s1*sx[1] );
+				ox1 = ox2 + ( j1*sx[1] );
+				for ( j0 = sh[0]; j0 > 0; ) {
+					if ( j0 < bsize ) {
+						s0 = j0;
+						j0 = 0;
+					} else {
+						s0 = bsize;
+						j0 -= bsize;
+					}
+					// Compute the index offset for the first input ndarray element in the current block:
+					ix = ox1 + ( j0*sx[0] );
+
+					// Compute the loop offset increment:
+					dx1 = sx[1] - ( s0*sx[0] );
+
+					// Iterate over the 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++ ) {
+									if ( xbuf[ ix ] ) {
+										count += 1;
+										if ( count === n ) {
+											return true;
+										}
+									}
+									ix += dx0;
+								}
+								ix += dx1;
+							}
+							ix += dx2;
+						}
+						ix += dx3;
+					}
+				}
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome4d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/4d_blocked_accessors.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/4d_blocked_accessors.js
new file mode 100644
index 000000000000..cc6bef1ba93e
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/4d_blocked_accessors.js
@@ -0,0 +1,205 @@
+/**
+* @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/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {Array<Function>} x.accessors - data buffer accessors
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+*
+* // Create a data buffer:
+* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 4, 2, 1 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'generic',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Test elements:
+* var out = blockedsome4d( x, 4 );
+* // returns true
+*/
+function blockedsome4d( x, n ) {
+	var bsize;
+	var count;
+	var xbuf;
+	var get;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var ox1;
+	var ox2;
+	var ox3;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var sx;
+	var ox;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var j0;
+	var j1;
+	var j2;
+	var j3;
+	var o;
+
+	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Cache accessor:
+	get = x.accessors[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j3 = sh[3]; j3 > 0; ) {
+		if ( j3 < bsize ) {
+			s3 = j3;
+			j3 = 0;
+		} else {
+			s3 = bsize;
+			j3 -= bsize;
+		}
+		ox3 = ox + ( j3*sx[3] );
+		for ( j2 = sh[2]; j2 > 0; ) {
+			if ( j2 < bsize ) {
+				s2 = j2;
+				j2 = 0;
+			} else {
+				s2 = bsize;
+				j2 -= bsize;
+			}
+			dx3 = sx[3] - ( s2*sx[2] );
+			ox2 = ox3 + ( j2*sx[2] );
+			for ( j1 = sh[1]; j1 > 0; ) {
+				if ( j1 < bsize ) {
+					s1 = j1;
+					j1 = 0;
+				} else {
+					s1 = bsize;
+					j1 -= bsize;
+				}
+				dx2 = sx[2] - ( s1*sx[1] );
+				ox1 = ox2 + ( j1*sx[1] );
+				for ( j0 = sh[0]; j0 > 0; ) {
+					if ( j0 < bsize ) {
+						s0 = j0;
+						j0 = 0;
+					} else {
+						s0 = bsize;
+						j0 -= bsize;
+					}
+					// Compute the index offset for the first input ndarray element in the current block:
+					ix = ox1 + ( j0*sx[0] );
+
+					// Compute the loop offset increment:
+					dx1 = sx[1] - ( s0*sx[0] );
+
+					// Iterate over the 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++ ) {
+									if ( get( xbuf, ix ) ) {
+										count += 1;
+										if ( count === n ) {
+											return true;
+										}
+									}
+									ix += dx0;
+								}
+								ix += dx1;
+							}
+							ix += dx2;
+						}
+						ix += dx3;
+					}
+				}
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome4d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/4d_blocked_complex.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/4d_blocked_complex.js
new file mode 100644
index 000000000000..4eda38c3fcc8
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/4d_blocked_complex.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.
+*/
+
+/* eslint-disable max-depth */
+
+'use strict';
+
+// MODULES //
+
+var loopOrder = require( '@stdlib/ndarray/base/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 8, 8, 4, 2 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'complex128',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = blockedsome4d( x, 4 );
+* // returns true
+*/
+function blockedsome4d( x, n ) {
+	var bsize;
+	var count;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var ox1;
+	var ox2;
+	var ox3;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var sx;
+	var ox;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var j0;
+	var j1;
+	var j2;
+	var j3;
+	var o;
+
+	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j3 = sh[3]; j3 > 0; ) {
+		if ( j3 < bsize ) {
+			s3 = j3;
+			j3 = 0;
+		} else {
+			s3 = bsize;
+			j3 -= bsize;
+		}
+		ox3 = ox + ( j3*sx[3] );
+		for ( j2 = sh[2]; j2 > 0; ) {
+			if ( j2 < bsize ) {
+				s2 = j2;
+				j2 = 0;
+			} else {
+				s2 = bsize;
+				j2 -= bsize;
+			}
+			dx3 = sx[3] - ( s2*sx[2] );
+			ox2 = ox3 + ( j2*sx[2] );
+			for ( j1 = sh[1]; j1 > 0; ) {
+				if ( j1 < bsize ) {
+					s1 = j1;
+					j1 = 0;
+				} else {
+					s1 = bsize;
+					j1 -= bsize;
+				}
+				dx2 = sx[2] - ( s1*sx[1] );
+				ox1 = ox2 + ( j1*sx[1] );
+				for ( j0 = sh[0]; j0 > 0; ) {
+					if ( j0 < bsize ) {
+						s0 = j0;
+						j0 = 0;
+					} else {
+						s0 = bsize;
+						j0 -= bsize;
+					}
+					// Compute the index offset for the first input ndarray element in the current block:
+					ix = ox1 + ( j0*sx[0] );
+
+					// Compute the loop offset increment:
+					dx1 = sx[1] - ( s0*sx[0] );
+
+					// Iterate over the 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++ ) {
+									if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
+										count += 1;
+										if ( count === n ) {
+											return true;
+										}
+									}
+									ix += dx0;
+								}
+								ix += dx1;
+							}
+							ix += dx2;
+						}
+						ix += dx3;
+					}
+				}
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome4d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/4d_complex.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/4d_complex.js
new file mode 100644
index 000000000000..5feda8a33d35
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/4d_complex.js
@@ -0,0 +1,152 @@
+/**
+* @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 strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 8, 8, 4, 2 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'complex128',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = some4d( x, 4 );
+* // returns true
+*/
+function some4d( x, n ) {
+	var count;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+
+	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// For row-major ndarrays, the last dimensions have the fastest changing indices...
+		S0 = sh[ 3 ];
+		S1 = sh[ 2 ];
+		S2 = sh[ 1 ];
+		S3 = sh[ 0 ];
+		dx0 = sx[ 3 ];                // offset increment for innermost loop
+		dx1 = sx[ 2 ] - ( S0*sx[3] );
+		dx2 = sx[ 1 ] - ( S1*sx[2] );
+		dx3 = sx[ 0 ] - ( S2*sx[1] ); // offset increment for outermost loop
+	} 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 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] );
+		dx2 = sx[ 2 ] - ( S1*sx[1] );
+		dx3 = sx[ 3 ] - ( S2*sx[2] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the 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++ ) {
+					if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
+						count += 1;
+						if ( count === n ) {
+							return true;
+						}
+					}
+					ix += dx0;
+				}
+				ix += dx1;
+			}
+			ix += dx2;
+		}
+		ix += dx3;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some4d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/5d.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/5d.js
new file mode 100644
index 000000000000..cf2d26010c26
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/5d.js
@@ -0,0 +1,162 @@
+/**
+* @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 strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 3, 1, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 4, 4, 1 ];
+*
+* // Define the index offset:
+* var ox = 1;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = some5d( x, 4 );
+* // returns true
+*/
+function some5d( x, n ) {
+	var count;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+
+	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// 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 ];
+		dx0 = sx[ 4 ];                // offset increment for innermost loop
+		dx1 = sx[ 3 ] - ( S0*sx[4] );
+		dx2 = sx[ 2 ] - ( S1*sx[3] );
+		dx3 = sx[ 1 ] - ( S2*sx[2] );
+		dx4 = sx[ 0 ] - ( S3*sx[1] ); // offset increment for outermost loop
+	} 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 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] );
+		dx2 = sx[ 2 ] - ( S1*sx[1] );
+		dx3 = sx[ 3 ] - ( S2*sx[2] );
+		dx4 = sx[ 4 ] - ( S3*sx[3] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the 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++ ) {
+						if ( xbuf[ ix ] ) {
+							count += 1;
+							if ( count === n ) {
+								return true;
+							}
+						}
+						ix += dx0;
+					}
+					ix += dx1;
+				}
+				ix += dx2;
+			}
+			ix += dx3;
+		}
+		ix += dx4;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some5d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/5d_accessors.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/5d_accessors.js
new file mode 100644
index 000000000000..350969b2117d
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/5d_accessors.js
@@ -0,0 +1,169 @@
+/**
+* @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 strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {Array<Function>} x.accessors - data buffer accessors
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+*
+* // Create a data buffer:
+* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 4, 4, 2, 1 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'generic',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Test elements:
+* var out = some5d( x, 4 );
+* // returns true
+*/
+function some5d( x, n ) {
+	var count;
+	var xbuf;
+	var get;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+
+	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// 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 ];
+		dx0 = sx[ 4 ];                // offset increment for innermost loop
+		dx1 = sx[ 3 ] - ( S0*sx[4] );
+		dx2 = sx[ 2 ] - ( S1*sx[3] );
+		dx3 = sx[ 1 ] - ( S2*sx[2] );
+		dx4 = sx[ 0 ] - ( S3*sx[1] ); // offset increment for outermost loop
+	} 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 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] );
+		dx2 = sx[ 2 ] - ( S1*sx[1] );
+		dx3 = sx[ 3 ] - ( S2*sx[2] );
+		dx4 = sx[ 4 ] - ( S3*sx[3] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache accessor:
+	get = x.accessors[ 0 ];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the 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++ ) {
+						if ( get( xbuf, ix ) ) {
+							count += 1;
+							if ( count === n ) {
+								return true;
+							}
+						}
+						ix += dx0;
+					}
+					ix += dx1;
+				}
+				ix += dx2;
+			}
+			ix += dx3;
+		}
+		ix += dx4;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some5d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/5d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/5d_blocked.js
new file mode 100644
index 000000000000..4ed315d78fbb
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/5d_blocked.js
@@ -0,0 +1,217 @@
+/**
+* @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/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 3, 1, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 4, 4, 1 ];
+*
+* // Define the index offset:
+* var ox = 1;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = blockedsome5d( x, 4 );
+* // returns true
+*/
+function blockedsome5d( x, n ) {
+	var bsize;
+	var count;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var ox1;
+	var ox2;
+	var ox3;
+	var ox4;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var sx;
+	var ox;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var j0;
+	var j1;
+	var j2;
+	var j3;
+	var j4;
+	var o;
+
+	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j4 = sh[4]; j4 > 0; ) {
+		if ( j4 < bsize ) {
+			s4 = j4;
+			j4 = 0;
+		} else {
+			s4 = bsize;
+			j4 -= bsize;
+		}
+		ox4 = ox + ( j4*sx[4] );
+		for ( j3 = sh[3]; j3 > 0; ) {
+			if ( j3 < bsize ) {
+				s3 = j3;
+				j3 = 0;
+			} else {
+				s3 = bsize;
+				j3 -= bsize;
+			}
+			dx4 = sx[4] - ( s3*sx[3] );
+			ox3 = ox4 + ( j3*sx[3] );
+			for ( j2 = sh[2]; j2 > 0; ) {
+				if ( j2 < bsize ) {
+					s2 = j2;
+					j2 = 0;
+				} else {
+					s2 = bsize;
+					j2 -= bsize;
+				}
+				dx3 = sx[3] - ( s2*sx[2] );
+				ox2 = ox3 + ( j2*sx[2] );
+				for ( j1 = sh[1]; j1 > 0; ) {
+					if ( j1 < bsize ) {
+						s1 = j1;
+						j1 = 0;
+					} else {
+						s1 = bsize;
+						j1 -= bsize;
+					}
+					dx2 = sx[2] - ( s1*sx[1] );
+					ox1 = ox2 + ( j1*sx[1] );
+					for ( j0 = sh[0]; j0 > 0; ) {
+						if ( j0 < bsize ) {
+							s0 = j0;
+							j0 = 0;
+						} else {
+							s0 = bsize;
+							j0 -= bsize;
+						}
+						// Compute the index offset for the first input ndarray element in the current block:
+						ix = ox1 + ( j0*sx[0] );
+
+						// Compute the loop offset increment:
+						dx1 = sx[1] - ( s0*sx[0] );
+
+						// Iterate over the 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++ ) {
+											if ( xbuf[ ix ] ) {
+												count += 1;
+												if ( count === n ) {
+													return true;
+												}
+											}
+											ix += dx0;
+										}
+										ix += dx1;
+									}
+									ix += dx2;
+								}
+								ix += dx3;
+							}
+							ix += dx4;
+						}
+					}
+				}
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome5d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/5d_blocked_accessors.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/5d_blocked_accessors.js
new file mode 100644
index 000000000000..e9cc2dc36d9a
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/5d_blocked_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 loopOrder = require( '@stdlib/ndarray/base/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {Array<Function>} x.accessors - data buffer accessors
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+*
+* // Create a data buffer:
+* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 4, 4, 2, 1 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'generic',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Test elements:
+* var out = blockedsome5d( x, 4 );
+* // returns true
+*/
+function blockedsome5d( x, n ) {
+	var count;
+	var bsize;
+	var xbuf;
+	var get;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var ox1;
+	var ox2;
+	var ox3;
+	var ox4;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var sx;
+	var ox;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var j0;
+	var j1;
+	var j2;
+	var j3;
+	var j4;
+	var o;
+
+	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Cache accessor:
+	get = x.accessors[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j4 = sh[4]; j4 > 0; ) {
+		if ( j4 < bsize ) {
+			s4 = j4;
+			j4 = 0;
+		} else {
+			s4 = bsize;
+			j4 -= bsize;
+		}
+		ox4 = ox + ( j4*sx[4] );
+		for ( j3 = sh[3]; j3 > 0; ) {
+			if ( j3 < bsize ) {
+				s3 = j3;
+				j3 = 0;
+			} else {
+				s3 = bsize;
+				j3 -= bsize;
+			}
+			dx4 = sx[4] - ( s3*sx[3] );
+			ox3 = ox4 + ( j3*sx[3] );
+			for ( j2 = sh[2]; j2 > 0; ) {
+				if ( j2 < bsize ) {
+					s2 = j2;
+					j2 = 0;
+				} else {
+					s2 = bsize;
+					j2 -= bsize;
+				}
+				dx3 = sx[3] - ( s2*sx[2] );
+				ox2 = ox3 + ( j2*sx[2] );
+				for ( j1 = sh[1]; j1 > 0; ) {
+					if ( j1 < bsize ) {
+						s1 = j1;
+						j1 = 0;
+					} else {
+						s1 = bsize;
+						j1 -= bsize;
+					}
+					dx2 = sx[2] - ( s1*sx[1] );
+					ox1 = ox2 + ( j1*sx[1] );
+					for ( j0 = sh[0]; j0 > 0; ) {
+						if ( j0 < bsize ) {
+							s0 = j0;
+							j0 = 0;
+						} else {
+							s0 = bsize;
+							j0 -= bsize;
+						}
+						// Compute the index offset for the first input ndarray element in the current block:
+						ix = ox1 + ( j0*sx[0] );
+
+						// Compute the loop offset increment:
+						dx1 = sx[1] - ( s0*sx[0] );
+
+						// Iterate over the 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++ ) {
+											if ( get( xbuf, ix ) ) {
+												count += 1;
+												if ( count === n ) {
+													return true;
+												}
+											}
+											ix += dx0;
+										}
+										ix += dx1;
+									}
+									ix += dx2;
+								}
+								ix += dx3;
+							}
+							ix += dx4;
+						}
+					}
+				}
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome5d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/5d_blocked_complex.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/5d_blocked_complex.js
new file mode 100644
index 000000000000..99b93693b2c9
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/5d_blocked_complex.js
@@ -0,0 +1,217 @@
+/**
+* @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/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 8, 8, 8, 4, 2 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'complex128',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = blockedsome5d( x, 4 );
+* // returns true
+*/
+function blockedsome5d( x, n ) {
+	var bsize;
+	var count;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var ox1;
+	var ox2;
+	var ox3;
+	var ox4;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var sx;
+	var ox;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var j0;
+	var j1;
+	var j2;
+	var j3;
+	var j4;
+	var o;
+
+	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j4 = sh[4]; j4 > 0; ) {
+		if ( j4 < bsize ) {
+			s4 = j4;
+			j4 = 0;
+		} else {
+			s4 = bsize;
+			j4 -= bsize;
+		}
+		ox4 = ox + ( j4*sx[4] );
+		for ( j3 = sh[3]; j3 > 0; ) {
+			if ( j3 < bsize ) {
+				s3 = j3;
+				j3 = 0;
+			} else {
+				s3 = bsize;
+				j3 -= bsize;
+			}
+			dx4 = sx[4] - ( s3*sx[3] );
+			ox3 = ox4 + ( j3*sx[3] );
+			for ( j2 = sh[2]; j2 > 0; ) {
+				if ( j2 < bsize ) {
+					s2 = j2;
+					j2 = 0;
+				} else {
+					s2 = bsize;
+					j2 -= bsize;
+				}
+				dx3 = sx[3] - ( s2*sx[2] );
+				ox2 = ox3 + ( j2*sx[2] );
+				for ( j1 = sh[1]; j1 > 0; ) {
+					if ( j1 < bsize ) {
+						s1 = j1;
+						j1 = 0;
+					} else {
+						s1 = bsize;
+						j1 -= bsize;
+					}
+					dx2 = sx[2] - ( s1*sx[1] );
+					ox1 = ox2 + ( j1*sx[1] );
+					for ( j0 = sh[0]; j0 > 0; ) {
+						if ( j0 < bsize ) {
+							s0 = j0;
+							j0 = 0;
+						} else {
+							s0 = bsize;
+							j0 -= bsize;
+						}
+						// Compute the index offset for the first input ndarray element in the current block:
+						ix = ox1 + ( j0*sx[0] );
+
+						// Compute the loop offset increment:
+						dx1 = sx[1] - ( s0*sx[0] );
+
+						// Iterate over the 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++ ) {
+											if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
+												count += 1;
+												if ( count === n ) {
+													return true;
+												}
+											}
+											ix += dx0;
+										}
+										ix += dx1;
+									}
+									ix += dx2;
+								}
+								ix += dx3;
+							}
+							ix += dx4;
+						}
+					}
+				}
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome5d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/5d_complex.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/5d_complex.js
new file mode 100644
index 000000000000..f9cd4e2f0f78
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/5d_complex.js
@@ -0,0 +1,162 @@
+/**
+* @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 strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 8, 8, 8, 4, 2 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'complex128',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = some5d( x, 4 );
+* // returns true
+*/
+function some5d( x, n ) {
+	var count;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+
+	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// 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 ];
+		dx0 = sx[ 4 ];                // offset increment for innermost loop
+		dx1 = sx[ 3 ] - ( S0*sx[4] );
+		dx2 = sx[ 2 ] - ( S1*sx[3] );
+		dx3 = sx[ 1 ] - ( S2*sx[2] );
+		dx4 = sx[ 0 ] - ( S3*sx[1] ); // offset increment for outermost loop
+	} 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 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] );
+		dx2 = sx[ 2 ] - ( S1*sx[1] );
+		dx3 = sx[ 3 ] - ( S2*sx[2] );
+		dx4 = sx[ 4 ] - ( S3*sx[3] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the 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++ ) {
+						if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
+							count += 1;
+							if ( count === n ) {
+								return true;
+							}
+						}
+						ix += dx0;
+					}
+					ix += dx1;
+				}
+				ix += dx2;
+			}
+			ix += dx3;
+		}
+		ix += dx4;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some5d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/6d.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/6d.js
new file mode 100644
index 000000000000..6ceb55330e3a
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/6d.js
@@ -0,0 +1,172 @@
+/**
+* @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 strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 3, 1, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 4, 4, 1 ];
+*
+* // Define the index offset:
+* var ox = 1;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = some6d( x, 4 );
+* // returns true
+*/
+function some6d( x, n ) {
+	var count;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var S5;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+
+	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// 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 ];
+		dx0 = sx[ 5 ];                // offset increment for innermost loop
+		dx1 = sx[ 4 ] - ( S0*sx[5] );
+		dx2 = sx[ 3 ] - ( S1*sx[4] );
+		dx3 = sx[ 2 ] - ( S2*sx[3] );
+		dx4 = sx[ 1 ] - ( S3*sx[2] );
+		dx5 = sx[ 0 ] - ( S4*sx[1] ); // offset increment for outermost loop
+	} 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 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] );
+		dx2 = sx[ 2 ] - ( S1*sx[1] );
+		dx3 = sx[ 3 ] - ( S2*sx[2] );
+		dx4 = sx[ 4 ] - ( S3*sx[3] );
+		dx5 = sx[ 5 ] - ( S4*sx[4] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the 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++ ) {
+							if ( xbuf[ ix ] ) {
+								count += 1;
+								if ( count === n ) {
+									return true;
+								}
+							}
+							ix += dx0;
+						}
+						ix += dx1;
+					}
+					ix += dx2;
+				}
+				ix += dx3;
+			}
+			ix += dx4;
+		}
+		ix += dx5;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some6d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/6d_accessors.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/6d_accessors.js
new file mode 100644
index 000000000000..e593f52ecf2d
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/6d_accessors.js
@@ -0,0 +1,179 @@
+/**
+* @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 strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {Array<Function>} x.accessors - data buffer accessors
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+*
+* // Create a data buffer:
+* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 4, 4, 4, 2, 1 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'generic',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Test elements:
+* var out = some6d( x, 4 );
+* // returns true
+*/
+function some6d( x, n ) {
+	var count;
+	var xbuf;
+	var get;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var S5;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+
+	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// 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 ];
+		dx0 = sx[ 5 ];                // offset increment for innermost loop
+		dx1 = sx[ 4 ] - ( S0*sx[5] );
+		dx2 = sx[ 3 ] - ( S1*sx[4] );
+		dx3 = sx[ 2 ] - ( S2*sx[3] );
+		dx4 = sx[ 1 ] - ( S3*sx[2] );
+		dx5 = sx[ 0 ] - ( S4*sx[1] ); // offset increment for outermost loop
+	} 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 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] );
+		dx2 = sx[ 2 ] - ( S1*sx[1] );
+		dx3 = sx[ 3 ] - ( S2*sx[2] );
+		dx4 = sx[ 4 ] - ( S3*sx[3] );
+		dx5 = sx[ 5 ] - ( S4*sx[4] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache accessor:
+	get = x.accessors[ 0 ];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the 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++ ) {
+							if ( get( xbuf, ix ) ) {
+								count += 1;
+								if ( count === n ) {
+									return true;
+								}
+							}
+							ix += dx0;
+						}
+						ix += dx1;
+					}
+					ix += dx2;
+				}
+				ix += dx3;
+			}
+			ix += dx4;
+		}
+		ix += dx5;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some6d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/6d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/6d_blocked.js
new file mode 100644
index 000000000000..e336ee699c0e
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/6d_blocked.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 loopOrder = require( '@stdlib/ndarray/base/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 3, 1, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 4, 4, 1 ];
+*
+* // Define the index offset:
+* var ox = 1;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = blockedsome6d( x, 4 );
+* // returns true
+*/
+function blockedsome6d( x, n ) { // eslint-disable-line max-statements
+	var count;
+	var bsize;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var ox1;
+	var ox2;
+	var ox3;
+	var ox4;
+	var ox5;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var s5;
+	var sx;
+	var ox;
+	var ix;
+	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 o;
+
+	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j5 = sh[5]; j5 > 0; ) {
+		if ( j5 < bsize ) {
+			s5 = j5;
+			j5 = 0;
+		} else {
+			s5 = bsize;
+			j5 -= bsize;
+		}
+		ox5 = ox + ( j5*sx[5] );
+		for ( j4 = sh[4]; j4 > 0; ) {
+			if ( j4 < bsize ) {
+				s4 = j4;
+				j4 = 0;
+			} else {
+				s4 = bsize;
+				j4 -= bsize;
+			}
+			dx5 = sx[5] - ( s4*sx[4] );
+			ox4 = ox5 + ( j4*sx[4] );
+			for ( j3 = sh[3]; j3 > 0; ) {
+				if ( j3 < bsize ) {
+					s3 = j3;
+					j3 = 0;
+				} else {
+					s3 = bsize;
+					j3 -= bsize;
+				}
+				dx4 = sx[4] - ( s3*sx[3] );
+				ox3 = ox4 + ( j3*sx[3] );
+				for ( j2 = sh[2]; j2 > 0; ) {
+					if ( j2 < bsize ) {
+						s2 = j2;
+						j2 = 0;
+					} else {
+						s2 = bsize;
+						j2 -= bsize;
+					}
+					dx3 = sx[3] - ( s2*sx[2] );
+					ox2 = ox3 + ( j2*sx[2] );
+					for ( j1 = sh[1]; j1 > 0; ) {
+						if ( j1 < bsize ) {
+							s1 = j1;
+							j1 = 0;
+						} else {
+							s1 = bsize;
+							j1 -= bsize;
+						}
+						dx2 = sx[2] - ( s1*sx[1] );
+						ox1 = ox2 + ( j1*sx[1] );
+						for ( j0 = sh[0]; j0 > 0; ) {
+							if ( j0 < bsize ) {
+								s0 = j0;
+								j0 = 0;
+							} else {
+								s0 = bsize;
+								j0 -= bsize;
+							}
+							// Compute the index offset for the first input ndarray element in the current block:
+							ix = ox1 + ( j0*sx[0] );
+
+							// Compute the loop offset increment:
+							dx1 = sx[1] - ( s0*sx[0] );
+
+							// Iterate over the 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++ ) {
+													if ( xbuf[ ix ] ) {
+														count += 1;
+														if ( count === n ) {
+															return true;
+														}
+													}
+													ix += dx0;
+												}
+												ix += dx1;
+											}
+											ix += dx2;
+										}
+										ix += dx3;
+									}
+									ix += dx4;
+								}
+								ix += dx5;
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome6d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/6d_blocked_accessors.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/6d_blocked_accessors.js
new file mode 100644
index 000000000000..8fd8356748fc
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/6d_blocked_accessors.js
@@ -0,0 +1,243 @@
+/**
+* @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/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {Array<Function>} x.accessors - data buffer accessors
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+*
+* // Create a data buffer:
+* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 4, 4, 4, 2, 1 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'generic',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Test elements:
+* var out = blockedsome6d( x, 4 );
+* // returns true
+*/
+function blockedsome6d( x, n ) { // eslint-disable-line max-statements
+	var count;
+	var bsize;
+	var xbuf;
+	var get;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var ox1;
+	var ox2;
+	var ox3;
+	var ox4;
+	var ox5;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var s5;
+	var sx;
+	var ox;
+	var ix;
+	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 o;
+
+	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Cache accessor:
+	get = x.accessors[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j5 = sh[5]; j5 > 0; ) {
+		if ( j5 < bsize ) {
+			s5 = j5;
+			j5 = 0;
+		} else {
+			s5 = bsize;
+			j5 -= bsize;
+		}
+		ox5 = ox + ( j5*sx[5] );
+		for ( j4 = sh[4]; j4 > 0; ) {
+			if ( j4 < bsize ) {
+				s4 = j4;
+				j4 = 0;
+			} else {
+				s4 = bsize;
+				j4 -= bsize;
+			}
+			dx5 = sx[5] - ( s4*sx[4] );
+			ox4 = ox5 + ( j4*sx[4] );
+			for ( j3 = sh[3]; j3 > 0; ) {
+				if ( j3 < bsize ) {
+					s3 = j3;
+					j3 = 0;
+				} else {
+					s3 = bsize;
+					j3 -= bsize;
+				}
+				dx4 = sx[4] - ( s3*sx[3] );
+				ox3 = ox4 + ( j3*sx[3] );
+				for ( j2 = sh[2]; j2 > 0; ) {
+					if ( j2 < bsize ) {
+						s2 = j2;
+						j2 = 0;
+					} else {
+						s2 = bsize;
+						j2 -= bsize;
+					}
+					dx3 = sx[3] - ( s2*sx[2] );
+					ox2 = ox3 + ( j2*sx[2] );
+					for ( j1 = sh[1]; j1 > 0; ) {
+						if ( j1 < bsize ) {
+							s1 = j1;
+							j1 = 0;
+						} else {
+							s1 = bsize;
+							j1 -= bsize;
+						}
+						dx2 = sx[2] - ( s1*sx[1] );
+						ox1 = ox2 + ( j1*sx[1] );
+						for ( j0 = sh[0]; j0 > 0; ) {
+							if ( j0 < bsize ) {
+								s0 = j0;
+								j0 = 0;
+							} else {
+								s0 = bsize;
+								j0 -= bsize;
+							}
+							// Compute the index offset for the first input ndarray element in the current block:
+							ix = ox1 + ( j0*sx[0] );
+
+							// Compute the loop offset increment:
+							dx1 = sx[1] - ( s0*sx[0] );
+
+							// Iterate over the 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++ ) {
+													if ( get( xbuf, ix ) ) {
+														count += 1;
+														if ( count === n ) {
+															return true;
+														}
+													}
+													ix += dx0;
+												}
+												ix += dx1;
+											}
+											ix += dx2;
+										}
+										ix += dx3;
+									}
+									ix += dx4;
+								}
+								ix += dx5;
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome6d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/6d_blocked_complex.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/6d_blocked_complex.js
new file mode 100644
index 000000000000..dd23a45a9c3d
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/6d_blocked_complex.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, max-len */
+
+'use strict';
+
+// MODULES //
+
+var loopOrder = require( '@stdlib/ndarray/base/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 8, 8, 8, 8, 4, 2 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'complex128',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = blockedsome6d( x, 4 );
+* // returns true
+*/
+function blockedsome6d( x, n ) { // eslint-disable-line max-statements
+	var count;
+	var bsize;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var ox1;
+	var ox2;
+	var ox3;
+	var ox4;
+	var ox5;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var s5;
+	var sx;
+	var ox;
+	var ix;
+	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 o;
+
+	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j5 = sh[5]; j5 > 0; ) {
+		if ( j5 < bsize ) {
+			s5 = j5;
+			j5 = 0;
+		} else {
+			s5 = bsize;
+			j5 -= bsize;
+		}
+		ox5 = ox + ( j5*sx[5] );
+		for ( j4 = sh[4]; j4 > 0; ) {
+			if ( j4 < bsize ) {
+				s4 = j4;
+				j4 = 0;
+			} else {
+				s4 = bsize;
+				j4 -= bsize;
+			}
+			dx5 = sx[5] - ( s4*sx[4] );
+			ox4 = ox5 + ( j4*sx[4] );
+			for ( j3 = sh[3]; j3 > 0; ) {
+				if ( j3 < bsize ) {
+					s3 = j3;
+					j3 = 0;
+				} else {
+					s3 = bsize;
+					j3 -= bsize;
+				}
+				dx4 = sx[4] - ( s3*sx[3] );
+				ox3 = ox4 + ( j3*sx[3] );
+				for ( j2 = sh[2]; j2 > 0; ) {
+					if ( j2 < bsize ) {
+						s2 = j2;
+						j2 = 0;
+					} else {
+						s2 = bsize;
+						j2 -= bsize;
+					}
+					dx3 = sx[3] - ( s2*sx[2] );
+					ox2 = ox3 + ( j2*sx[2] );
+					for ( j1 = sh[1]; j1 > 0; ) {
+						if ( j1 < bsize ) {
+							s1 = j1;
+							j1 = 0;
+						} else {
+							s1 = bsize;
+							j1 -= bsize;
+						}
+						dx2 = sx[2] - ( s1*sx[1] );
+						ox1 = ox2 + ( j1*sx[1] );
+						for ( j0 = sh[0]; j0 > 0; ) {
+							if ( j0 < bsize ) {
+								s0 = j0;
+								j0 = 0;
+							} else {
+								s0 = bsize;
+								j0 -= bsize;
+							}
+							// Compute the index offset for the first input ndarray element in the current block:
+							ix = ox1 + ( j0*sx[0] );
+
+							// Compute the loop offset increment:
+							dx1 = sx[1] - ( s0*sx[0] );
+
+							// Iterate over the 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++ ) {
+													if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
+														count += 1;
+														if ( count === n ) {
+															return true;
+														}
+													}
+													ix += dx0;
+												}
+												ix += dx1;
+											}
+											ix += dx2;
+										}
+										ix += dx3;
+									}
+									ix += dx4;
+								}
+								ix += dx5;
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome6d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/6d_complex.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/6d_complex.js
new file mode 100644
index 000000000000..436916dc3097
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/6d_complex.js
@@ -0,0 +1,172 @@
+/**
+* @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 strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 8, 8, 8, 8, 4, 2 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'complex128',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = some6d( x, 4 );
+* // returns true
+*/
+function some6d( x, n ) {
+	var count;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var S5;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+
+	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// 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 ];
+		dx0 = sx[ 5 ];                // offset increment for innermost loop
+		dx1 = sx[ 4 ] - ( S0*sx[5] );
+		dx2 = sx[ 3 ] - ( S1*sx[4] );
+		dx3 = sx[ 2 ] - ( S2*sx[3] );
+		dx4 = sx[ 1 ] - ( S3*sx[2] );
+		dx5 = sx[ 0 ] - ( S4*sx[1] ); // offset increment for outermost loop
+	} 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 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] );
+		dx2 = sx[ 2 ] - ( S1*sx[1] );
+		dx3 = sx[ 3 ] - ( S2*sx[2] );
+		dx4 = sx[ 4 ] - ( S3*sx[3] );
+		dx5 = sx[ 5 ] - ( S4*sx[4] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the 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++ ) {
+							if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
+								count += 1;
+								if ( count === n ) {
+									return true;
+								}
+							}
+							ix += dx0;
+						}
+						ix += dx1;
+					}
+					ix += dx2;
+				}
+				ix += dx3;
+			}
+			ix += dx4;
+		}
+		ix += dx5;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some6d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/7d.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/7d.js
new file mode 100644
index 000000000000..52727f7d8b48
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/7d.js
@@ -0,0 +1,182 @@
+/**
+* @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 strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 3, 1, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 4, 4, 1 ];
+*
+* // Define the index offset:
+* var ox = 1;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = some7d( x, 4 );
+* // returns true
+*/
+function some7d( x, n ) {
+	var count;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var dx6;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var S5;
+	var S6;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+
+	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// 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 ];
+		dx0 = sx[ 6 ];                // offset increment for innermost loop
+		dx1 = sx[ 5 ] - ( S0*sx[6] );
+		dx2 = sx[ 4 ] - ( S1*sx[5] );
+		dx3 = sx[ 3 ] - ( S2*sx[4] );
+		dx4 = sx[ 2 ] - ( S3*sx[3] );
+		dx5 = sx[ 1 ] - ( S4*sx[2] );
+		dx6 = sx[ 0 ] - ( S5*sx[1] ); // offset increment for outermost loop
+	} 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 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] );
+		dx2 = sx[ 2 ] - ( S1*sx[1] );
+		dx3 = sx[ 3 ] - ( S2*sx[2] );
+		dx4 = sx[ 4 ] - ( S3*sx[3] );
+		dx5 = sx[ 5 ] - ( S4*sx[4] );
+		dx6 = sx[ 6 ] - ( S5*sx[5] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the 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++ ) {
+								if ( xbuf[ ix ] ) {
+									count += 1;
+									if ( count === n ) {
+										return true;
+									}
+								}
+								ix += dx0;
+							}
+							ix += dx1;
+						}
+						ix += dx2;
+					}
+					ix += dx3;
+				}
+				ix += dx4;
+			}
+			ix += dx5;
+		}
+		ix += dx6;
+	}
+	return true;
+}
+
+
+// EXPORTS //
+
+module.exports = some7d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/7d_accessors.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/7d_accessors.js
new file mode 100644
index 000000000000..55f30c695bb7
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/7d_accessors.js
@@ -0,0 +1,189 @@
+/**
+* @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 strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {Array<Function>} x.accessors - data buffer accessors
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+*
+* // Create a data buffer:
+* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 4, 4, 4, 4, 2, 1 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'generic',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Test elements:
+* var out = some7d( x, 4 );
+* // returns true
+*/
+function some7d( x, n ) {
+	var count;
+	var xbuf;
+	var get;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var dx6;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var S5;
+	var S6;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+
+	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// 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 ];
+		dx0 = sx[ 6 ];                // offset increment for innermost loop
+		dx1 = sx[ 5 ] - ( S0*sx[6] );
+		dx2 = sx[ 4 ] - ( S1*sx[5] );
+		dx3 = sx[ 3 ] - ( S2*sx[4] );
+		dx4 = sx[ 2 ] - ( S3*sx[3] );
+		dx5 = sx[ 1 ] - ( S4*sx[2] );
+		dx6 = sx[ 0 ] - ( S5*sx[1] ); // offset increment for outermost loop
+	} 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 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] );
+		dx2 = sx[ 2 ] - ( S1*sx[1] );
+		dx3 = sx[ 3 ] - ( S2*sx[2] );
+		dx4 = sx[ 4 ] - ( S3*sx[3] );
+		dx5 = sx[ 5 ] - ( S4*sx[4] );
+		dx6 = sx[ 6 ] - ( S5*sx[5] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache accessor:
+	get = x.accessors[ 0 ];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the 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++ ) {
+								if ( get( xbuf, ix ) ) {
+									count += 1;
+									if ( count === n ) {
+										return true;
+									}
+								}
+								ix += dx0;
+							}
+							ix += dx1;
+						}
+						ix += dx2;
+					}
+					ix += dx3;
+				}
+				ix += dx4;
+			}
+			ix += dx5;
+		}
+		ix += dx6;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some7d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/7d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/7d_blocked.js
new file mode 100644
index 000000000000..49ef63f34dee
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/7d_blocked.js
@@ -0,0 +1,255 @@
+/**
+* @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/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 3, 1, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 4, 4, 1 ];
+*
+* // Define the index offset:
+* var ox = 1;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = blockedsome7d( x, 4 );
+* // returns true
+*/
+function blockedsome7d( x, n ) { // eslint-disable-line max-statements
+	var count;
+	var bsize;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var dx6;
+	var ox1;
+	var ox2;
+	var ox3;
+	var ox4;
+	var ox5;
+	var ox6;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var s5;
+	var s6;
+	var sx;
+	var ox;
+	var ix;
+	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 o;
+
+	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j6 = sh[6]; j6 > 0; ) {
+		if ( j6 < bsize ) {
+			s6 = j6;
+			j6 = 0;
+		} else {
+			s6 = bsize;
+			j6 -= bsize;
+		}
+		ox6 = ox + ( j6*sx[6] );
+		for ( j5 = sh[5]; j5 > 0; ) {
+			if ( j5 < bsize ) {
+				s5 = j5;
+				j5 = 0;
+			} else {
+				s5 = bsize;
+				j5 -= bsize;
+			}
+			dx6 = sx[6] - ( s5*sx[5] );
+			ox5 = ox6 + ( j5*sx[5] );
+			for ( j4 = sh[4]; j4 > 0; ) {
+				if ( j4 < bsize ) {
+					s4 = j4;
+					j4 = 0;
+				} else {
+					s4 = bsize;
+					j4 -= bsize;
+				}
+				dx5 = sx[5] - ( s4*sx[4] );
+				ox4 = ox5 + ( j4*sx[4] );
+				for ( j3 = sh[3]; j3 > 0; ) {
+					if ( j3 < bsize ) {
+						s3 = j3;
+						j3 = 0;
+					} else {
+						s3 = bsize;
+						j3 -= bsize;
+					}
+					dx4 = sx[4] - ( s3*sx[3] );
+					ox3 = ox4 + ( j3*sx[3] );
+					for ( j2 = sh[2]; j2 > 0; ) {
+						if ( j2 < bsize ) {
+							s2 = j2;
+							j2 = 0;
+						} else {
+							s2 = bsize;
+							j2 -= bsize;
+						}
+						dx3 = sx[3] - ( s2*sx[2] );
+						ox2 = ox3 + ( j2*sx[2] );
+						for ( j1 = sh[1]; j1 > 0; ) {
+							if ( j1 < bsize ) {
+								s1 = j1;
+								j1 = 0;
+							} else {
+								s1 = bsize;
+								j1 -= bsize;
+							}
+							dx2 = sx[2] - ( s1*sx[1] );
+							ox1 = ox2 + ( j1*sx[1] );
+							for ( j0 = sh[0]; j0 > 0; ) {
+								if ( j0 < bsize ) {
+									s0 = j0;
+									j0 = 0;
+								} else {
+									s0 = bsize;
+									j0 -= bsize;
+								}
+								// Compute the index offset for the first input ndarray element in the current block:
+								ix = ox1 + ( j0*sx[0] );
+
+								// Compute the loop offset increment:
+								dx1 = sx[1] - ( s0*sx[0] );
+
+								// Iterate over the 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++ ) {
+															if ( xbuf[ ix ] ) {
+																count += 1;
+																if ( count === n ) {
+																	return true;
+																}
+															}
+															ix += dx0;
+														}
+														ix += dx1;
+													}
+													ix += dx2;
+												}
+												ix += dx3;
+											}
+											ix += dx4;
+										}
+										ix += dx5;
+									}
+									ix += dx6;
+								}
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome7d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/7d_blocked_accessors.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/7d_blocked_accessors.js
new file mode 100644
index 000000000000..21fdaf43751f
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/7d_blocked_accessors.js
@@ -0,0 +1,262 @@
+/**
+* @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/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {Array<Function>} x.accessors - data buffer accessors
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+*
+* // Create a data buffer:
+* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 4, 4, 4, 4, 2, 1 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'generic',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Test elements:
+* var out = blockedsome7d( x, 4 );
+* // returns true
+*/
+function blockedsome7d( x, n ) { // eslint-disable-line max-statements
+	var count;
+	var bsize;
+	var xbuf;
+	var get;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var dx6;
+	var ox1;
+	var ox2;
+	var ox3;
+	var ox4;
+	var ox5;
+	var ox6;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var s5;
+	var s6;
+	var sx;
+	var ox;
+	var ix;
+	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 o;
+
+	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Cache accessor:
+	get = x.accessors[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j6 = sh[6]; j6 > 0; ) {
+		if ( j6 < bsize ) {
+			s6 = j6;
+			j6 = 0;
+		} else {
+			s6 = bsize;
+			j6 -= bsize;
+		}
+		ox6 = ox + ( j6*sx[6] );
+		for ( j5 = sh[5]; j5 > 0; ) {
+			if ( j5 < bsize ) {
+				s5 = j5;
+				j5 = 0;
+			} else {
+				s5 = bsize;
+				j5 -= bsize;
+			}
+			dx6 = sx[6] - ( s5*sx[5] );
+			ox5 = ox6 + ( j5*sx[5] );
+			for ( j4 = sh[4]; j4 > 0; ) {
+				if ( j4 < bsize ) {
+					s4 = j4;
+					j4 = 0;
+				} else {
+					s4 = bsize;
+					j4 -= bsize;
+				}
+				dx5 = sx[5] - ( s4*sx[4] );
+				ox4 = ox5 + ( j4*sx[4] );
+				for ( j3 = sh[3]; j3 > 0; ) {
+					if ( j3 < bsize ) {
+						s3 = j3;
+						j3 = 0;
+					} else {
+						s3 = bsize;
+						j3 -= bsize;
+					}
+					dx4 = sx[4] - ( s3*sx[3] );
+					ox3 = ox4 + ( j3*sx[3] );
+					for ( j2 = sh[2]; j2 > 0; ) {
+						if ( j2 < bsize ) {
+							s2 = j2;
+							j2 = 0;
+						} else {
+							s2 = bsize;
+							j2 -= bsize;
+						}
+						dx3 = sx[3] - ( s2*sx[2] );
+						ox2 = ox3 + ( j2*sx[2] );
+						for ( j1 = sh[1]; j1 > 0; ) {
+							if ( j1 < bsize ) {
+								s1 = j1;
+								j1 = 0;
+							} else {
+								s1 = bsize;
+								j1 -= bsize;
+							}
+							dx2 = sx[2] - ( s1*sx[1] );
+							ox1 = ox2 + ( j1*sx[1] );
+							for ( j0 = sh[0]; j0 > 0; ) {
+								if ( j0 < bsize ) {
+									s0 = j0;
+									j0 = 0;
+								} else {
+									s0 = bsize;
+									j0 -= bsize;
+								}
+								// Compute the index offset for the first input ndarray element in the current block:
+								ix = ox1 + ( j0*sx[0] );
+
+								// Compute the loop offset increment:
+								dx1 = sx[1] - ( s0*sx[0] );
+
+								// Iterate over the 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++ ) {
+															if ( get( xbuf, ix ) ) {
+																count += 1;
+																if ( count === n ) {
+																	return true;
+																}
+															}
+															ix += dx0;
+														}
+														ix += dx1;
+													}
+													ix += dx2;
+												}
+												ix += dx3;
+											}
+											ix += dx4;
+										}
+										ix += dx5;
+									}
+									ix += dx6;
+								}
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome7d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/7d_blocked_complex.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/7d_blocked_complex.js
new file mode 100644
index 000000000000..ef83748c3d09
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/7d_blocked_complex.js
@@ -0,0 +1,255 @@
+/**
+* @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/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 8, 8, 8, 8, 8, 4, 2 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'complex128',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = blockedsome7d( x, 4 );
+* // returns true
+*/
+function blockedsome7d( x, n ) { // eslint-disable-line max-statements
+	var count;
+	var bsize;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var dx6;
+	var ox1;
+	var ox2;
+	var ox3;
+	var ox4;
+	var ox5;
+	var ox6;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var s5;
+	var s6;
+	var sx;
+	var ox;
+	var ix;
+	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 o;
+
+	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j6 = sh[6]; j6 > 0; ) {
+		if ( j6 < bsize ) {
+			s6 = j6;
+			j6 = 0;
+		} else {
+			s6 = bsize;
+			j6 -= bsize;
+		}
+		ox6 = ox + ( j6*sx[6] );
+		for ( j5 = sh[5]; j5 > 0; ) {
+			if ( j5 < bsize ) {
+				s5 = j5;
+				j5 = 0;
+			} else {
+				s5 = bsize;
+				j5 -= bsize;
+			}
+			dx6 = sx[6] - ( s5*sx[5] );
+			ox5 = ox6 + ( j5*sx[5] );
+			for ( j4 = sh[4]; j4 > 0; ) {
+				if ( j4 < bsize ) {
+					s4 = j4;
+					j4 = 0;
+				} else {
+					s4 = bsize;
+					j4 -= bsize;
+				}
+				dx5 = sx[5] - ( s4*sx[4] );
+				ox4 = ox5 + ( j4*sx[4] );
+				for ( j3 = sh[3]; j3 > 0; ) {
+					if ( j3 < bsize ) {
+						s3 = j3;
+						j3 = 0;
+					} else {
+						s3 = bsize;
+						j3 -= bsize;
+					}
+					dx4 = sx[4] - ( s3*sx[3] );
+					ox3 = ox4 + ( j3*sx[3] );
+					for ( j2 = sh[2]; j2 > 0; ) {
+						if ( j2 < bsize ) {
+							s2 = j2;
+							j2 = 0;
+						} else {
+							s2 = bsize;
+							j2 -= bsize;
+						}
+						dx3 = sx[3] - ( s2*sx[2] );
+						ox2 = ox3 + ( j2*sx[2] );
+						for ( j1 = sh[1]; j1 > 0; ) {
+							if ( j1 < bsize ) {
+								s1 = j1;
+								j1 = 0;
+							} else {
+								s1 = bsize;
+								j1 -= bsize;
+							}
+							dx2 = sx[2] - ( s1*sx[1] );
+							ox1 = ox2 + ( j1*sx[1] );
+							for ( j0 = sh[0]; j0 > 0; ) {
+								if ( j0 < bsize ) {
+									s0 = j0;
+									j0 = 0;
+								} else {
+									s0 = bsize;
+									j0 -= bsize;
+								}
+								// Compute the index offset for the first input ndarray element in the current block:
+								ix = ox1 + ( j0*sx[0] );
+
+								// Compute the loop offset increment:
+								dx1 = sx[1] - ( s0*sx[0] );
+
+								// Iterate over the 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++ ) {
+															if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
+																count += 1;
+																if ( count === n ) {
+																	return true;
+																}
+															}
+															ix += dx0;
+														}
+														ix += dx1;
+													}
+													ix += dx2;
+												}
+												ix += dx3;
+											}
+											ix += dx4;
+										}
+										ix += dx5;
+									}
+									ix += dx6;
+								}
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome7d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/7d_complex.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/7d_complex.js
new file mode 100644
index 000000000000..f752c0df3d46
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/7d_complex.js
@@ -0,0 +1,182 @@
+/**
+* @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 strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 8, 8, 8, 8, 8, 4, 2 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'complex128',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = some7d( x, 4 );
+* // returns true
+*/
+function some7d( x, n ) {
+	var count;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var dx6;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var S5;
+	var S6;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+
+	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// 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 ];
+		dx0 = sx[ 6 ];                // offset increment for innermost loop
+		dx1 = sx[ 5 ] - ( S0*sx[6] );
+		dx2 = sx[ 4 ] - ( S1*sx[5] );
+		dx3 = sx[ 3 ] - ( S2*sx[4] );
+		dx4 = sx[ 2 ] - ( S3*sx[3] );
+		dx5 = sx[ 1 ] - ( S4*sx[2] );
+		dx6 = sx[ 0 ] - ( S5*sx[1] ); // offset increment for outermost loop
+	} 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 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] );
+		dx2 = sx[ 2 ] - ( S1*sx[1] );
+		dx3 = sx[ 3 ] - ( S2*sx[2] );
+		dx4 = sx[ 4 ] - ( S3*sx[3] );
+		dx5 = sx[ 5 ] - ( S4*sx[4] );
+		dx6 = sx[ 6 ] - ( S5*sx[5] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the 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++ ) {
+								if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
+									count += 1;
+									if ( count === n ) {
+										return true;
+									}
+								}
+								ix += dx0;
+							}
+							ix += dx1;
+						}
+						ix += dx2;
+					}
+					ix += dx3;
+				}
+				ix += dx4;
+			}
+			ix += dx5;
+		}
+		ix += dx6;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some7d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/8d.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/8d.js
new file mode 100644
index 000000000000..712d9a956063
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/8d.js
@@ -0,0 +1,192 @@
+/**
+* @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 strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 1, 3, 1, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 12, 4, 4, 1 ];
+*
+* // Define the index offset:
+* var ox = 1;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = some8d( x, 4 );
+* // returns true
+*/
+function some8d( x, n ) {
+	var count;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var dx6;
+	var dx7;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var S5;
+	var S6;
+	var S7;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+	var i7;
+
+	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// 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 ];
+		dx0 = sx[ 7 ];                // offset increment for innermost loop
+		dx1 = sx[ 6 ] - ( S0*sx[7] );
+		dx2 = sx[ 5 ] - ( S1*sx[6] );
+		dx3 = sx[ 4 ] - ( S2*sx[5] );
+		dx4 = sx[ 3 ] - ( S3*sx[4] );
+		dx5 = sx[ 2 ] - ( S4*sx[3] );
+		dx6 = sx[ 1 ] - ( S5*sx[2] );
+		dx7 = sx[ 0 ] - ( S6*sx[1] ); // offset increment for outermost loop
+	} 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 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] );
+		dx2 = sx[ 2 ] - ( S1*sx[1] );
+		dx3 = sx[ 3 ] - ( S2*sx[2] );
+		dx4 = sx[ 4 ] - ( S3*sx[3] );
+		dx5 = sx[ 5 ] - ( S4*sx[4] );
+		dx6 = sx[ 6 ] - ( S5*sx[5] );
+		dx7 = sx[ 7 ] - ( S6*sx[6] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the 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++ ) {
+									if ( xbuf[ ix ] ) {
+										count += 1;
+										if ( count === n ) {
+											return true;
+										}
+									}
+									ix += dx0;
+								}
+								ix += dx1;
+							}
+							ix += dx2;
+						}
+						ix += dx3;
+					}
+					ix += dx4;
+				}
+				ix += dx5;
+			}
+			ix += dx6;
+		}
+		ix += dx7;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some8d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/8d_accessors.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/8d_accessors.js
new file mode 100644
index 000000000000..3af06ba2ff22
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/8d_accessors.js
@@ -0,0 +1,199 @@
+/**
+* @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 strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {Array<Function>} x.accessors - data buffer accessors
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+*
+* // Create a data buffer:
+* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 4, 4, 4, 4, 4, 2, 1 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'generic',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Test elements:
+* var out = some8d( x, 4 );
+* // returns true
+*/
+function some8d( x, n ) {
+	var count;
+	var xbuf;
+	var get;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var dx6;
+	var dx7;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var S5;
+	var S6;
+	var S7;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+	var i7;
+
+	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// 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 ];
+		dx0 = sx[ 7 ];                // offset increment for innermost loop
+		dx1 = sx[ 6 ] - ( S0*sx[7] );
+		dx2 = sx[ 5 ] - ( S1*sx[6] );
+		dx3 = sx[ 4 ] - ( S2*sx[5] );
+		dx4 = sx[ 3 ] - ( S3*sx[4] );
+		dx5 = sx[ 2 ] - ( S4*sx[3] );
+		dx6 = sx[ 1 ] - ( S5*sx[2] );
+		dx7 = sx[ 0 ] - ( S6*sx[1] ); // offset increment for outermost loop
+	} 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 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] );
+		dx2 = sx[ 2 ] - ( S1*sx[1] );
+		dx3 = sx[ 3 ] - ( S2*sx[2] );
+		dx4 = sx[ 4 ] - ( S3*sx[3] );
+		dx5 = sx[ 5 ] - ( S4*sx[4] );
+		dx6 = sx[ 6 ] - ( S5*sx[5] );
+		dx7 = sx[ 7 ] - ( S6*sx[6] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache accessor:
+	get = x.accessors[ 0 ];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the 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++ ) {
+									if ( get( xbuf, ix ) ) {
+										count += 1;
+										if ( count === n ) {
+											return true;
+										}
+									}
+									ix += dx0;
+								}
+								ix += dx1;
+							}
+							ix += dx2;
+						}
+						ix += dx3;
+					}
+					ix += dx4;
+				}
+				ix += dx5;
+			}
+			ix += dx6;
+		}
+		ix += dx7;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some8d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/8d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/8d_blocked.js
new file mode 100644
index 000000000000..066a1c08a22a
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/8d_blocked.js
@@ -0,0 +1,274 @@
+/**
+* @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/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 1, 3, 1, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 12, 4, 4, 1 ];
+*
+* // Define the index offset:
+* var ox = 1;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = blockedsome8d( x, 4 );
+* // returns true
+*/
+function blockedsome8d( x, n ) { // eslint-disable-line max-statements
+	var count;
+	var bsize;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var dx6;
+	var dx7;
+	var ox1;
+	var ox2;
+	var ox3;
+	var ox4;
+	var ox5;
+	var ox6;
+	var ox7;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var s5;
+	var s6;
+	var s7;
+	var sx;
+	var ox;
+	var ix;
+	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 o;
+
+	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j7 = sh[7]; j7 > 0; ) {
+		if ( j7 < bsize ) {
+			s7 = j7;
+			j7 = 0;
+		} else {
+			s7 = bsize;
+			j7 -= bsize;
+		}
+		ox7 = ox + ( j7*sx[7] );
+		for ( j6 = sh[6]; j6 > 0; ) {
+			if ( j6 < bsize ) {
+				s6 = j6;
+				j6 = 0;
+			} else {
+				s6 = bsize;
+				j6 -= bsize;
+			}
+			dx7 = sx[7] - ( s6*sx[6] );
+			ox6 = ox7 + ( j6*sx[6] );
+			for ( j5 = sh[5]; j5 > 0; ) {
+				if ( j5 < bsize ) {
+					s5 = j5;
+					j5 = 0;
+				} else {
+					s5 = bsize;
+					j5 -= bsize;
+				}
+				dx6 = sx[6] - ( s5*sx[5] );
+				ox5 = ox6 + ( j5*sx[5] );
+				for ( j4 = sh[4]; j4 > 0; ) {
+					if ( j4 < bsize ) {
+						s4 = j4;
+						j4 = 0;
+					} else {
+						s4 = bsize;
+						j4 -= bsize;
+					}
+					dx5 = sx[5] - ( s4*sx[4] );
+					ox4 = ox5 + ( j4*sx[4] );
+					for ( j3 = sh[3]; j3 > 0; ) {
+						if ( j3 < bsize ) {
+							s3 = j3;
+							j3 = 0;
+						} else {
+							s3 = bsize;
+							j3 -= bsize;
+						}
+						dx4 = sx[4] - ( s3*sx[3] );
+						ox3 = ox4 + ( j3*sx[3] );
+						for ( j2 = sh[2]; j2 > 0; ) {
+							if ( j2 < bsize ) {
+								s2 = j2;
+								j2 = 0;
+							} else {
+								s2 = bsize;
+								j2 -= bsize;
+							}
+							dx3 = sx[3] - ( s2*sx[2] );
+							ox2 = ox3 + ( j2*sx[2] );
+							for ( j1 = sh[1]; j1 > 0; ) {
+								if ( j1 < bsize ) {
+									s1 = j1;
+									j1 = 0;
+								} else {
+									s1 = bsize;
+									j1 -= bsize;
+								}
+								dx2 = sx[2] - ( s1*sx[1] );
+								ox1 = ox2 + ( j1*sx[1] );
+								for ( j0 = sh[0]; j0 > 0; ) {
+									if ( j0 < bsize ) {
+										s0 = j0;
+										j0 = 0;
+									} else {
+										s0 = bsize;
+										j0 -= bsize;
+									}
+									// Compute the index offset for the first input ndarray element in the current block:
+									ix = ox1 + ( j0*sx[0] );
+
+									// Compute the loop offset increment:
+									dx1 = sx[1] - ( s0*sx[0] );
+
+									// Iterate over the 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++ ) {
+																	if ( xbuf[ ix ] ) {
+																		count += 1;
+																		if ( count === n ) {
+																			return true;
+																		}
+																	}
+																	ix += dx0;
+																}
+																ix += dx1;
+															}
+															ix += dx2;
+														}
+														ix += dx3;
+													}
+													ix += dx4;
+												}
+												ix += dx5;
+											}
+											ix += dx6;
+										}
+										ix += dx7;
+									}
+								}
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome8d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/8d_blocked_accessors.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/8d_blocked_accessors.js
new file mode 100644
index 000000000000..21a0ea6c9c4d
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/8d_blocked_accessors.js
@@ -0,0 +1,281 @@
+/**
+* @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/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {Array<Function>} x.accessors - data buffer accessors
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+*
+* // Create a data buffer:
+* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 4, 4, 4, 4, 4, 2, 1 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'generic',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Test elements:
+* var out = blockedsome8d( x, 4 );
+* // returns true
+*/
+function blockedsome8d( x, n ) { // eslint-disable-line max-statements
+	var count;
+	var bsize;
+	var xbuf;
+	var get;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var dx6;
+	var dx7;
+	var ox1;
+	var ox2;
+	var ox3;
+	var ox4;
+	var ox5;
+	var ox6;
+	var ox7;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var s5;
+	var s6;
+	var s7;
+	var sx;
+	var ox;
+	var ix;
+	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 o;
+
+	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Cache accessor:
+	get = x.accessors[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j7 = sh[7]; j7 > 0; ) {
+		if ( j7 < bsize ) {
+			s7 = j7;
+			j7 = 0;
+		} else {
+			s7 = bsize;
+			j7 -= bsize;
+		}
+		ox7 = ox + ( j7*sx[7] );
+		for ( j6 = sh[6]; j6 > 0; ) {
+			if ( j6 < bsize ) {
+				s6 = j6;
+				j6 = 0;
+			} else {
+				s6 = bsize;
+				j6 -= bsize;
+			}
+			dx7 = sx[7] - ( s6*sx[6] );
+			ox6 = ox7 + ( j6*sx[6] );
+			for ( j5 = sh[5]; j5 > 0; ) {
+				if ( j5 < bsize ) {
+					s5 = j5;
+					j5 = 0;
+				} else {
+					s5 = bsize;
+					j5 -= bsize;
+				}
+				dx6 = sx[6] - ( s5*sx[5] );
+				ox5 = ox6 + ( j5*sx[5] );
+				for ( j4 = sh[4]; j4 > 0; ) {
+					if ( j4 < bsize ) {
+						s4 = j4;
+						j4 = 0;
+					} else {
+						s4 = bsize;
+						j4 -= bsize;
+					}
+					dx5 = sx[5] - ( s4*sx[4] );
+					ox4 = ox5 + ( j4*sx[4] );
+					for ( j3 = sh[3]; j3 > 0; ) {
+						if ( j3 < bsize ) {
+							s3 = j3;
+							j3 = 0;
+						} else {
+							s3 = bsize;
+							j3 -= bsize;
+						}
+						dx4 = sx[4] - ( s3*sx[3] );
+						ox3 = ox4 + ( j3*sx[3] );
+						for ( j2 = sh[2]; j2 > 0; ) {
+							if ( j2 < bsize ) {
+								s2 = j2;
+								j2 = 0;
+							} else {
+								s2 = bsize;
+								j2 -= bsize;
+							}
+							dx3 = sx[3] - ( s2*sx[2] );
+							ox2 = ox3 + ( j2*sx[2] );
+							for ( j1 = sh[1]; j1 > 0; ) {
+								if ( j1 < bsize ) {
+									s1 = j1;
+									j1 = 0;
+								} else {
+									s1 = bsize;
+									j1 -= bsize;
+								}
+								dx2 = sx[2] - ( s1*sx[1] );
+								ox1 = ox2 + ( j1*sx[1] );
+								for ( j0 = sh[0]; j0 > 0; ) {
+									if ( j0 < bsize ) {
+										s0 = j0;
+										j0 = 0;
+									} else {
+										s0 = bsize;
+										j0 -= bsize;
+									}
+									// Compute the index offset for the first input ndarray element in the current block:
+									ix = ox1 + ( j0*sx[0] );
+
+									// Compute the loop offset increment:
+									dx1 = sx[1] - ( s0*sx[0] );
+
+									// Iterate over the 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++ ) {
+																	if ( get( xbuf, ix ) ) {
+																		count += 1;
+																		if ( count === n ) {
+																			return true;
+																		}
+																	}
+																	ix += dx0;
+																}
+																ix += dx1;
+															}
+															ix += dx2;
+														}
+														ix += dx3;
+													}
+													ix += dx4;
+												}
+												ix += dx5;
+											}
+											ix += dx6;
+										}
+										ix += dx7;
+									}
+								}
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome8d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/8d_blocked_complex.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/8d_blocked_complex.js
new file mode 100644
index 000000000000..98844795d423
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/8d_blocked_complex.js
@@ -0,0 +1,274 @@
+/**
+* @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/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 8, 8, 8, 8, 8, 8, 4, 2 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'complex128',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = blockedsome8d( x, 4 );
+* // returns true
+*/
+function blockedsome8d( x, n ) { // eslint-disable-line max-statements
+	var count;
+	var bsize;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var dx6;
+	var dx7;
+	var ox1;
+	var ox2;
+	var ox3;
+	var ox4;
+	var ox5;
+	var ox6;
+	var ox7;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var s5;
+	var s6;
+	var s7;
+	var sx;
+	var ox;
+	var ix;
+	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 o;
+
+	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j7 = sh[7]; j7 > 0; ) {
+		if ( j7 < bsize ) {
+			s7 = j7;
+			j7 = 0;
+		} else {
+			s7 = bsize;
+			j7 -= bsize;
+		}
+		ox7 = ox + ( j7*sx[7] );
+		for ( j6 = sh[6]; j6 > 0; ) {
+			if ( j6 < bsize ) {
+				s6 = j6;
+				j6 = 0;
+			} else {
+				s6 = bsize;
+				j6 -= bsize;
+			}
+			dx7 = sx[7] - ( s6*sx[6] );
+			ox6 = ox7 + ( j6*sx[6] );
+			for ( j5 = sh[5]; j5 > 0; ) {
+				if ( j5 < bsize ) {
+					s5 = j5;
+					j5 = 0;
+				} else {
+					s5 = bsize;
+					j5 -= bsize;
+				}
+				dx6 = sx[6] - ( s5*sx[5] );
+				ox5 = ox6 + ( j5*sx[5] );
+				for ( j4 = sh[4]; j4 > 0; ) {
+					if ( j4 < bsize ) {
+						s4 = j4;
+						j4 = 0;
+					} else {
+						s4 = bsize;
+						j4 -= bsize;
+					}
+					dx5 = sx[5] - ( s4*sx[4] );
+					ox4 = ox5 + ( j4*sx[4] );
+					for ( j3 = sh[3]; j3 > 0; ) {
+						if ( j3 < bsize ) {
+							s3 = j3;
+							j3 = 0;
+						} else {
+							s3 = bsize;
+							j3 -= bsize;
+						}
+						dx4 = sx[4] - ( s3*sx[3] );
+						ox3 = ox4 + ( j3*sx[3] );
+						for ( j2 = sh[2]; j2 > 0; ) {
+							if ( j2 < bsize ) {
+								s2 = j2;
+								j2 = 0;
+							} else {
+								s2 = bsize;
+								j2 -= bsize;
+							}
+							dx3 = sx[3] - ( s2*sx[2] );
+							ox2 = ox3 + ( j2*sx[2] );
+							for ( j1 = sh[1]; j1 > 0; ) {
+								if ( j1 < bsize ) {
+									s1 = j1;
+									j1 = 0;
+								} else {
+									s1 = bsize;
+									j1 -= bsize;
+								}
+								dx2 = sx[2] - ( s1*sx[1] );
+								ox1 = ox2 + ( j1*sx[1] );
+								for ( j0 = sh[0]; j0 > 0; ) {
+									if ( j0 < bsize ) {
+										s0 = j0;
+										j0 = 0;
+									} else {
+										s0 = bsize;
+										j0 -= bsize;
+									}
+									// Compute the index offset for the first input ndarray element in the current block:
+									ix = ox1 + ( j0*sx[0] );
+
+									// Compute the loop offset increment:
+									dx1 = sx[1] - ( s0*sx[0] );
+
+									// Iterate over the 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++ ) {
+																	if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
+																		count += 1;
+																		if ( count === n ) {
+																			return true;
+																		}
+																	}
+																	ix += dx0;
+																}
+																ix += dx1;
+															}
+															ix += dx2;
+														}
+														ix += dx3;
+													}
+													ix += dx4;
+												}
+												ix += dx5;
+											}
+											ix += dx6;
+										}
+										ix += dx7;
+									}
+								}
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome8d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/8d_complex.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/8d_complex.js
new file mode 100644
index 000000000000..72b92c78e503
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/8d_complex.js
@@ -0,0 +1,192 @@
+/**
+* @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 strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 8, 8, 8, 8, 8, 8, 4, 2 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'complex128',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = some8d( x, 4 );
+* // returns true
+*/
+function some8d( x, n ) {
+	var count;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var dx6;
+	var dx7;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var S5;
+	var S6;
+	var S7;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+	var i7;
+
+	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// 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 ];
+		dx0 = sx[ 7 ];                // offset increment for innermost loop
+		dx1 = sx[ 6 ] - ( S0*sx[7] );
+		dx2 = sx[ 5 ] - ( S1*sx[6] );
+		dx3 = sx[ 4 ] - ( S2*sx[5] );
+		dx4 = sx[ 3 ] - ( S3*sx[4] );
+		dx5 = sx[ 2 ] - ( S4*sx[3] );
+		dx6 = sx[ 1 ] - ( S5*sx[2] );
+		dx7 = sx[ 0 ] - ( S6*sx[1] ); // offset increment for outermost loop
+	} 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 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] );
+		dx2 = sx[ 2 ] - ( S1*sx[1] );
+		dx3 = sx[ 3 ] - ( S2*sx[2] );
+		dx4 = sx[ 4 ] - ( S3*sx[3] );
+		dx5 = sx[ 5 ] - ( S4*sx[4] );
+		dx6 = sx[ 6 ] - ( S5*sx[5] );
+		dx7 = sx[ 7 ] - ( S6*sx[6] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the 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++ ) {
+									if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
+										count += 1;
+										if ( count === n ) {
+											return true;
+										}
+									}
+									ix += dx0;
+								}
+								ix += dx1;
+							}
+							ix += dx2;
+						}
+						ix += dx3;
+					}
+					ix += dx4;
+				}
+				ix += dx5;
+			}
+			ix += dx6;
+		}
+		ix += dx7;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some8d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/9d.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/9d.js
new file mode 100644
index 000000000000..572db3b91f7e
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/9d.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.
+*/
+
+/* eslint-disable max-depth */
+
+'use strict';
+
+// MODULES //
+
+var strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 1, 1, 3, 1, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 12, 12, 4, 4, 1 ];
+*
+* // Define the index offset:
+* var ox = 1;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = some9d( x, 4 );
+* // returns true
+*/
+function some9d( x, n ) {
+	var count;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var dx6;
+	var dx7;
+	var dx8;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var S5;
+	var S6;
+	var S7;
+	var S8;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+	var i7;
+	var i8;
+
+	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// 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 ];
+		dx0 = sx[ 8 ];                // offset increment for innermost loop
+		dx1 = sx[ 7 ] - ( S0*sx[8] );
+		dx2 = sx[ 6 ] - ( S1*sx[7] );
+		dx3 = sx[ 5 ] - ( S2*sx[6] );
+		dx4 = sx[ 4 ] - ( S3*sx[5] );
+		dx5 = sx[ 3 ] - ( S4*sx[4] );
+		dx6 = sx[ 2 ] - ( S5*sx[3] );
+		dx7 = sx[ 1 ] - ( S6*sx[2] );
+		dx8 = sx[ 0 ] - ( S7*sx[1] ); // offset increment for outermost loop
+	} 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 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] );
+		dx2 = sx[ 2 ] - ( S1*sx[1] );
+		dx3 = sx[ 3 ] - ( S2*sx[2] );
+		dx4 = sx[ 4 ] - ( S3*sx[3] );
+		dx5 = sx[ 5 ] - ( S4*sx[4] );
+		dx6 = sx[ 6 ] - ( S5*sx[5] );
+		dx7 = sx[ 7 ] - ( S6*sx[6] );
+		dx8 = sx[ 8 ] - ( S7*sx[7] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the 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++ ) {
+										if ( xbuf[ ix ] ) {
+											count += 1;
+											if ( count === n ) {
+												return true;
+											}
+										}
+										ix += dx0;
+									}
+									ix += dx1;
+								}
+								ix += dx2;
+							}
+							ix += dx3;
+						}
+						ix += dx4;
+					}
+					ix += dx5;
+				}
+				ix += dx6;
+			}
+			ix += dx7;
+		}
+		ix += dx8;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some9d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/9d_accessors.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/9d_accessors.js
new file mode 100644
index 000000000000..086e7d496b69
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/9d_accessors.js
@@ -0,0 +1,209 @@
+/**
+* @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 strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {Array<Function>} x.accessors - data buffer accessors
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+*
+* // Create a data buffer:
+* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 1, 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 4, 4, 4, 4, 4, 4, 2, 1 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'generic',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Test elements:
+* var out = some9d( x, 4 );
+* // returns true
+*/
+function some9d( x, n ) {
+	var count;
+	var xbuf;
+	var get;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var dx6;
+	var dx7;
+	var dx8;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var S5;
+	var S6;
+	var S7;
+	var S8;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+	var i7;
+	var i8;
+
+	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// 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 ];
+		dx0 = sx[ 8 ];                // offset increment for innermost loop
+		dx1 = sx[ 7 ] - ( S0*sx[8] );
+		dx2 = sx[ 6 ] - ( S1*sx[7] );
+		dx3 = sx[ 5 ] - ( S2*sx[6] );
+		dx4 = sx[ 4 ] - ( S3*sx[5] );
+		dx5 = sx[ 3 ] - ( S4*sx[4] );
+		dx6 = sx[ 2 ] - ( S5*sx[3] );
+		dx7 = sx[ 1 ] - ( S6*sx[2] );
+		dx8 = sx[ 0 ] - ( S7*sx[1] ); // offset increment for outermost loop
+	} 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 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] );
+		dx2 = sx[ 2 ] - ( S1*sx[1] );
+		dx3 = sx[ 3 ] - ( S2*sx[2] );
+		dx4 = sx[ 4 ] - ( S3*sx[3] );
+		dx5 = sx[ 5 ] - ( S4*sx[4] );
+		dx6 = sx[ 6 ] - ( S5*sx[5] );
+		dx7 = sx[ 7 ] - ( S6*sx[6] );
+		dx8 = sx[ 8 ] - ( S7*sx[7] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache accessor:
+	get = x.accessors[ 0 ];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the 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++ ) {
+										if ( get( xbuf, ix ) ) {
+											count += 1;
+											if ( count === n ) {
+												return true;
+											}
+										}
+										ix += dx0;
+									}
+									ix += dx1;
+								}
+								ix += dx2;
+							}
+							ix += dx3;
+						}
+						ix += dx4;
+					}
+					ix += dx5;
+				}
+				ix += dx6;
+			}
+			ix += dx7;
+		}
+		ix += dx8;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some9d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/9d_blocked.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/9d_blocked.js
new file mode 100644
index 000000000000..1ea8a83dbdbc
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/9d_blocked.js
@@ -0,0 +1,293 @@
+/**
+* @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/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 1, 1, 3, 1, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 12, 12, 12, 12, 12, 12, 4, 4, 1 ];
+*
+* // Define the index offset:
+* var ox = 1;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = blockedsome9d( x, 4 );
+* // returns true
+*/
+function blockedsome9d( x, n ) { // eslint-disable-line max-statements
+	var count;
+	var bsize;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var dx6;
+	var dx7;
+	var dx8;
+	var ox1;
+	var ox2;
+	var ox3;
+	var ox4;
+	var ox5;
+	var ox6;
+	var ox7;
+	var ox8;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var s5;
+	var s6;
+	var s7;
+	var s8;
+	var sx;
+	var ox;
+	var ix;
+	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 o;
+
+	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j8 = sh[8]; j8 > 0; ) {
+		if ( j8 < bsize ) {
+			s8 = j8;
+			j8 = 0;
+		} else {
+			s8 = bsize;
+			j8 -= bsize;
+		}
+		ox8 = ox + ( j8*sx[8] );
+		for ( j7 = sh[7]; j7 > 0; ) {
+			if ( j7 < bsize ) {
+				s7 = j7;
+				j7 = 0;
+			} else {
+				s7 = bsize;
+				j7 -= bsize;
+			}
+			dx8 = sx[8] - ( s7*sx[7] );
+			ox7 = ox8 + ( j7*sx[7] );
+			for ( j6 = sh[6]; j6 > 0; ) {
+				if ( j6 < bsize ) {
+					s6 = j6;
+					j6 = 0;
+				} else {
+					s6 = bsize;
+					j6 -= bsize;
+				}
+				dx7 = sx[7] - ( s6*sx[6] );
+				ox6 = ox7 + ( j6*sx[6] );
+				for ( j5 = sh[5]; j5 > 0; ) {
+					if ( j5 < bsize ) {
+						s5 = j5;
+						j5 = 0;
+					} else {
+						s5 = bsize;
+						j5 -= bsize;
+					}
+					dx6 = sx[6] - ( s5*sx[5] );
+					ox5 = ox6 + ( j5*sx[5] );
+					for ( j4 = sh[4]; j4 > 0; ) {
+						if ( j4 < bsize ) {
+							s4 = j4;
+							j4 = 0;
+						} else {
+							s4 = bsize;
+							j4 -= bsize;
+						}
+						dx5 = sx[5] - ( s4*sx[4] );
+						ox4 = ox5 + ( j4*sx[4] );
+						for ( j3 = sh[3]; j3 > 0; ) {
+							if ( j3 < bsize ) {
+								s3 = j3;
+								j3 = 0;
+							} else {
+								s3 = bsize;
+								j3 -= bsize;
+							}
+							dx4 = sx[4] - ( s3*sx[3] );
+							ox3 = ox4 + ( j3*sx[3] );
+							for ( j2 = sh[2]; j2 > 0; ) {
+								if ( j2 < bsize ) {
+									s2 = j2;
+									j2 = 0;
+								} else {
+									s2 = bsize;
+									j2 -= bsize;
+								}
+								dx3 = sx[3] - ( s2*sx[2] );
+								ox2 = ox3 + ( j2*sx[2] );
+								for ( j1 = sh[1]; j1 > 0; ) {
+									if ( j1 < bsize ) {
+										s1 = j1;
+										j1 = 0;
+									} else {
+										s1 = bsize;
+										j1 -= bsize;
+									}
+									dx2 = sx[2] - ( s1*sx[1] );
+									ox1 = ox2 + ( j1*sx[1] );
+									for ( j0 = sh[0]; j0 > 0; ) {
+										if ( j0 < bsize ) {
+											s0 = j0;
+											j0 = 0;
+										} else {
+											s0 = bsize;
+											j0 -= bsize;
+										}
+										// Compute the index offset for the first input ndarray element in the current block:
+										ix = ox1 + ( j0*sx[0] );
+
+										// Compute the loop offset increment:
+										dx1 = sx[1] - ( s0*sx[0] );
+
+										// Iterate over the 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++ ) {
+																			if ( xbuf[ ix ] ) {
+																				count += 1;
+																				if ( count === n ) {
+																					return true;
+																				}
+																			}
+																			ix += dx0;
+																		}
+																		ix += dx1;
+																	}
+																	ix += dx2;
+																}
+																ix += dx3;
+															}
+															ix += dx4;
+														}
+														ix += dx5;
+													}
+													ix += dx6;
+												}
+												ix += dx7;
+											}
+											ix += dx8;
+										}
+									}
+								}
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome9d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/9d_blocked_accessors.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/9d_blocked_accessors.js
new file mode 100644
index 000000000000..5fbdac67d017
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/9d_blocked_accessors.js
@@ -0,0 +1,300 @@
+/**
+* @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/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {Array<Function>} x.accessors - data buffer accessors
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+*
+* // Create a data buffer:
+* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 1, 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 4, 4, 4, 4, 4, 4, 2, 1 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'generic',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Test elements:
+* var out = blockedsome9d( x, 4 );
+* // returns true
+*/
+function blockedsome9d( x, n ) { // eslint-disable-line max-statements
+	var count;
+	var bsize;
+	var xbuf;
+	var get;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var dx6;
+	var dx7;
+	var dx8;
+	var ox1;
+	var ox2;
+	var ox3;
+	var ox4;
+	var ox5;
+	var ox6;
+	var ox7;
+	var ox8;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var s5;
+	var s6;
+	var s7;
+	var s8;
+	var sx;
+	var ox;
+	var ix;
+	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 o;
+
+	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Cache accessor:
+	get = x.accessors[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j8 = sh[8]; j8 > 0; ) {
+		if ( j8 < bsize ) {
+			s8 = j8;
+			j8 = 0;
+		} else {
+			s8 = bsize;
+			j8 -= bsize;
+		}
+		ox8 = ox + ( j8*sx[8] );
+		for ( j7 = sh[7]; j7 > 0; ) {
+			if ( j7 < bsize ) {
+				s7 = j7;
+				j7 = 0;
+			} else {
+				s7 = bsize;
+				j7 -= bsize;
+			}
+			dx8 = sx[8] - ( s7*sx[7] );
+			ox7 = ox8 + ( j7*sx[7] );
+			for ( j6 = sh[6]; j6 > 0; ) {
+				if ( j6 < bsize ) {
+					s6 = j6;
+					j6 = 0;
+				} else {
+					s6 = bsize;
+					j6 -= bsize;
+				}
+				dx7 = sx[7] - ( s6*sx[6] );
+				ox6 = ox7 + ( j6*sx[6] );
+				for ( j5 = sh[5]; j5 > 0; ) {
+					if ( j5 < bsize ) {
+						s5 = j5;
+						j5 = 0;
+					} else {
+						s5 = bsize;
+						j5 -= bsize;
+					}
+					dx6 = sx[6] - ( s5*sx[5] );
+					ox5 = ox6 + ( j5*sx[5] );
+					for ( j4 = sh[4]; j4 > 0; ) {
+						if ( j4 < bsize ) {
+							s4 = j4;
+							j4 = 0;
+						} else {
+							s4 = bsize;
+							j4 -= bsize;
+						}
+						dx5 = sx[5] - ( s4*sx[4] );
+						ox4 = ox5 + ( j4*sx[4] );
+						for ( j3 = sh[3]; j3 > 0; ) {
+							if ( j3 < bsize ) {
+								s3 = j3;
+								j3 = 0;
+							} else {
+								s3 = bsize;
+								j3 -= bsize;
+							}
+							dx4 = sx[4] - ( s3*sx[3] );
+							ox3 = ox4 + ( j3*sx[3] );
+							for ( j2 = sh[2]; j2 > 0; ) {
+								if ( j2 < bsize ) {
+									s2 = j2;
+									j2 = 0;
+								} else {
+									s2 = bsize;
+									j2 -= bsize;
+								}
+								dx3 = sx[3] - ( s2*sx[2] );
+								ox2 = ox3 + ( j2*sx[2] );
+								for ( j1 = sh[1]; j1 > 0; ) {
+									if ( j1 < bsize ) {
+										s1 = j1;
+										j1 = 0;
+									} else {
+										s1 = bsize;
+										j1 -= bsize;
+									}
+									dx2 = sx[2] - ( s1*sx[1] );
+									ox1 = ox2 + ( j1*sx[1] );
+									for ( j0 = sh[0]; j0 > 0; ) {
+										if ( j0 < bsize ) {
+											s0 = j0;
+											j0 = 0;
+										} else {
+											s0 = bsize;
+											j0 -= bsize;
+										}
+										// Compute the index offset for the first input ndarray element in the current block:
+										ix = ox1 + ( j0*sx[0] );
+
+										// Compute the loop offset increment:
+										dx1 = sx[1] - ( s0*sx[0] );
+
+										// Iterate over the 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++ ) {
+																			if ( get( xbuf, ix ) ) {
+																				count += 1;
+																				if ( count === n ) {
+																					return true;
+																				}
+																			}
+																			ix += dx0;
+																		}
+																		ix += dx1;
+																	}
+																	ix += dx2;
+																}
+																ix += dx3;
+															}
+															ix += dx4;
+														}
+														ix += dx5;
+													}
+													ix += dx6;
+												}
+												ix += dx7;
+											}
+											ix += dx8;
+										}
+									}
+								}
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome9d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/9d_blocked_complex.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/9d_blocked_complex.js
new file mode 100644
index 000000000000..51fd64aee1b9
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/9d_blocked_complex.js
@@ -0,0 +1,293 @@
+/**
+* @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/nullary-loop-interchange-order' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 1, 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 8, 8, 8, 8, 8, 8, 8, 4, 2 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'complex128',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = blockedsome9d( x, 4 );
+* // returns true
+*/
+function blockedsome9d( x, n ) { // eslint-disable-line max-statements
+	var count;
+	var bsize;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var dx6;
+	var dx7;
+	var dx8;
+	var ox1;
+	var ox2;
+	var ox3;
+	var ox4;
+	var ox5;
+	var ox6;
+	var ox7;
+	var ox8;
+	var sh;
+	var s0;
+	var s1;
+	var s2;
+	var s3;
+	var s4;
+	var s5;
+	var s6;
+	var s7;
+	var s8;
+	var sx;
+	var ox;
+	var ix;
+	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 o;
+
+	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Resolve the loop interchange order:
+	o = loopOrder( x.shape, x.strides );
+	sh = o.sh;
+	sx = o.sx;
+
+	// Determine the block size:
+	bsize = blockSize( x.dtype );
+
+	// Set a pointer to the first indexed element:
+	ox = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Cache the offset increment for the innermost loop:
+	dx0 = sx[0];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over blocks...
+	for ( j8 = sh[8]; j8 > 0; ) {
+		if ( j8 < bsize ) {
+			s8 = j8;
+			j8 = 0;
+		} else {
+			s8 = bsize;
+			j8 -= bsize;
+		}
+		ox8 = ox + ( j8*sx[8] );
+		for ( j7 = sh[7]; j7 > 0; ) {
+			if ( j7 < bsize ) {
+				s7 = j7;
+				j7 = 0;
+			} else {
+				s7 = bsize;
+				j7 -= bsize;
+			}
+			dx8 = sx[8] - ( s7*sx[7] );
+			ox7 = ox8 + ( j7*sx[7] );
+			for ( j6 = sh[6]; j6 > 0; ) {
+				if ( j6 < bsize ) {
+					s6 = j6;
+					j6 = 0;
+				} else {
+					s6 = bsize;
+					j6 -= bsize;
+				}
+				dx7 = sx[7] - ( s6*sx[6] );
+				ox6 = ox7 + ( j6*sx[6] );
+				for ( j5 = sh[5]; j5 > 0; ) {
+					if ( j5 < bsize ) {
+						s5 = j5;
+						j5 = 0;
+					} else {
+						s5 = bsize;
+						j5 -= bsize;
+					}
+					dx6 = sx[6] - ( s5*sx[5] );
+					ox5 = ox6 + ( j5*sx[5] );
+					for ( j4 = sh[4]; j4 > 0; ) {
+						if ( j4 < bsize ) {
+							s4 = j4;
+							j4 = 0;
+						} else {
+							s4 = bsize;
+							j4 -= bsize;
+						}
+						dx5 = sx[5] - ( s4*sx[4] );
+						ox4 = ox5 + ( j4*sx[4] );
+						for ( j3 = sh[3]; j3 > 0; ) {
+							if ( j3 < bsize ) {
+								s3 = j3;
+								j3 = 0;
+							} else {
+								s3 = bsize;
+								j3 -= bsize;
+							}
+							dx4 = sx[4] - ( s3*sx[3] );
+							ox3 = ox4 + ( j3*sx[3] );
+							for ( j2 = sh[2]; j2 > 0; ) {
+								if ( j2 < bsize ) {
+									s2 = j2;
+									j2 = 0;
+								} else {
+									s2 = bsize;
+									j2 -= bsize;
+								}
+								dx3 = sx[3] - ( s2*sx[2] );
+								ox2 = ox3 + ( j2*sx[2] );
+								for ( j1 = sh[1]; j1 > 0; ) {
+									if ( j1 < bsize ) {
+										s1 = j1;
+										j1 = 0;
+									} else {
+										s1 = bsize;
+										j1 -= bsize;
+									}
+									dx2 = sx[2] - ( s1*sx[1] );
+									ox1 = ox2 + ( j1*sx[1] );
+									for ( j0 = sh[0]; j0 > 0; ) {
+										if ( j0 < bsize ) {
+											s0 = j0;
+											j0 = 0;
+										} else {
+											s0 = bsize;
+											j0 -= bsize;
+										}
+										// Compute the index offset for the first input ndarray element in the current block:
+										ix = ox1 + ( j0*sx[0] );
+
+										// Compute the loop offset increment:
+										dx1 = sx[1] - ( s0*sx[0] );
+
+										// Iterate over the 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++ ) {
+																			if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
+																				count += 1;
+																				if ( count === n ) {
+																					return true;
+																				}
+																			}
+																			ix += dx0;
+																		}
+																		ix += dx1;
+																	}
+																	ix += dx2;
+																}
+																ix += dx3;
+															}
+															ix += dx4;
+														}
+														ix += dx5;
+													}
+													ix += dx6;
+												}
+												ix += dx7;
+											}
+											ix += dx8;
+										}
+									}
+								}
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = blockedsome9d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/9d_complex.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/9d_complex.js
new file mode 100644
index 000000000000..9ea1ddee4d54
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/9d_complex.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.
+*/
+
+/* eslint-disable max-depth */
+
+'use strict';
+
+// MODULES //
+
+var strides2order = require( '@stdlib/ndarray/base/strides2order' );
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 1, 1, 1, 1, 1, 1, 1, 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 8, 8, 8, 8, 8, 8, 8, 4, 2 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'complex128',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = some9d( x, 4 );
+* // returns true
+*/
+function some9d( x, n ) {
+	var count;
+	var xbuf;
+	var dx0;
+	var dx1;
+	var dx2;
+	var dx3;
+	var dx4;
+	var dx5;
+	var dx6;
+	var dx7;
+	var dx8;
+	var sh;
+	var S0;
+	var S1;
+	var S2;
+	var S3;
+	var S4;
+	var S5;
+	var S6;
+	var S7;
+	var S8;
+	var sx;
+	var ix;
+	var i0;
+	var i1;
+	var i2;
+	var i3;
+	var i4;
+	var i5;
+	var i6;
+	var i7;
+	var i8;
+
+	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
+
+	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
+	sh = x.shape;
+	sx = x.strides;
+	if ( strides2order( sx ) === 1 ) {
+		// 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 ];
+		dx0 = sx[ 8 ];                // offset increment for innermost loop
+		dx1 = sx[ 7 ] - ( S0*sx[8] );
+		dx2 = sx[ 6 ] - ( S1*sx[7] );
+		dx3 = sx[ 5 ] - ( S2*sx[6] );
+		dx4 = sx[ 4 ] - ( S3*sx[5] );
+		dx5 = sx[ 3 ] - ( S4*sx[4] );
+		dx6 = sx[ 2 ] - ( S5*sx[3] );
+		dx7 = sx[ 1 ] - ( S6*sx[2] );
+		dx8 = sx[ 0 ] - ( S7*sx[1] ); // offset increment for outermost loop
+	} 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 ];
+		dx0 = sx[ 0 ];                // offset increment for innermost loop
+		dx1 = sx[ 1 ] - ( S0*sx[0] );
+		dx2 = sx[ 2 ] - ( S1*sx[1] );
+		dx3 = sx[ 3 ] - ( S2*sx[2] );
+		dx4 = sx[ 4 ] - ( S3*sx[3] );
+		dx5 = sx[ 5 ] - ( S4*sx[4] );
+		dx6 = sx[ 6 ] - ( S5*sx[5] );
+		dx7 = sx[ 7 ] - ( S6*sx[6] );
+		dx8 = sx[ 8 ] - ( S7*sx[7] ); // offset increment for outermost loop
+	}
+	// Set a pointer to the first indexed element:
+	ix = x.offset;
+
+	// Cache a reference to the input ndarray buffer:
+	xbuf = x.data;
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over the 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++ ) {
+										if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
+											count += 1;
+											if ( count === n ) {
+												return true;
+											}
+										}
+										ix += dx0;
+									}
+									ix += dx1;
+								}
+								ix += dx2;
+							}
+							ix += dx3;
+						}
+						ix += dx4;
+					}
+					ix += dx5;
+				}
+				ix += dx6;
+			}
+			ix += dx7;
+		}
+		ix += dx8;
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = some9d;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/index.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/index.js
new file mode 100644
index 000000000000..4db986770daf
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/index.js
@@ -0,0 +1,70 @@
+/**
+* @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';
+
+/**
+* Test whether at least `n` elements in an ndarray are truthy.
+*
+* @module @stdlib/ndarray/base/some
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+* var scalar2ndarray = require( '@stdlib/ndarray/from-scalar' );
+* var some = require( '@stdlib/ndarray/base/some' );
+*
+* // Create a data buffer:
+* 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 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 3, 1, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 4, 1 ];
+*
+* // Define the index offset:
+* var ox = 1;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Define the success criterion:
+* var n = scalar2ndarray( 3, {
+*     'dtype': 'generic'
+* });
+*
+* // Test elements:
+* var out = some( [ x, n ] );
+* // returns true
+*/
+
+// MODULES //
+
+var main = require( './main.js' );
+
+
+// EXPORTS //
+
+module.exports = main;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/main.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/main.js
new file mode 100644
index 000000000000..5c7273c70c6b
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/main.js
@@ -0,0 +1,306 @@
+/**
+* @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 isComplexArray = require( '@stdlib/array/base/assert/is-complex-typed-array' );
+var isBooleanArray = require( '@stdlib/array/base/assert/is-booleanarray' );
+var iterationOrder = require( '@stdlib/ndarray/base/iteration-order' );
+var minmaxViewBufferIndex = require( '@stdlib/ndarray/base/minmax-view-buffer-index' );
+var ndarray2object = require( '@stdlib/ndarray/base/ndarraylike2object' );
+var reinterpretComplex = require( '@stdlib/strided/base/reinterpret-complex' );
+var reinterpretBoolean = require( '@stdlib/strided/base/reinterpret-boolean' );
+var gscal = require( '@stdlib/blas/base/gscal' );
+var blockedaccessorsome2d = require( './2d_blocked_accessors.js' );
+var blockedaccessorsome3d = require( './3d_blocked_accessors.js' );
+var blockedcomplexsome2d = require( './2d_blocked_complex.js' );
+var blockedcomplexsome3d = require( './3d_blocked_complex.js' );
+var blockedsome2d = require( './2d_blocked.js' );
+var blockedsome3d = require( './3d_blocked.js' );
+var accessorsome0d = require( './0d_accessors.js' );
+var accessorsome1d = require( './1d_accessors.js' );
+var accessorsome2d = require( './2d_accessors.js' );
+var accessorsome3d = require( './3d_accessors.js' );
+var accessorsomend = require( './nd_accessors.js' );
+var complexsome0d = require( './0d_complex.js' );
+var complexsome1d = require( './1d_complex.js' );
+var complexsome2d = require( './2d_complex.js' );
+var complexsome3d = require( './3d_complex.js' );
+var complexsomend = require( './nd_complex.js' );
+var some0d = require( './0d.js' );
+var some1d = require( './1d.js' );
+var some2d = require( './2d.js' );
+var some3d = require( './3d.js' );
+var somend = require( './nd.js' );
+
+
+// VARIABLES //
+
+var SOME = [
+	some0d,
+	some1d,
+	some2d,
+	some3d
+];
+var ACCESSOR_SOME = [
+	accessorsome0d,
+	accessorsome1d,
+	accessorsome2d,
+	accessorsome3d
+];
+var COMPLEX_SOME = [
+	complexsome0d,
+	complexsome1d,
+	complexsome2d,
+	complexsome3d
+];
+var BLOCKED_SOME = [
+	blockedsome2d, // 0
+	blockedsome3d
+];
+var BLOCKED_ACCESSOR_SOME = [
+	blockedaccessorsome2d, // 0
+	blockedaccessorsome3d
+];
+var BLOCKED_COMPLEX_SOME = [
+	blockedcomplexsome2d, // 0
+	blockedcomplexsome3d
+];
+var MAX_DIMS = SOME.length - 1;
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* ## Notes
+*
+* -   A provided ndarray should be an `object` with the following properties:
+*
+*     -   **dtype**: data type.
+*     -   **data**: data buffer.
+*     -   **shape**: dimensions.
+*     -   **strides**: stride lengths.
+*     -   **offset**: index offset.
+*     -   **order**: specifies whether an ndarray is row-major (C-style) or column major (Fortran-style).
+*
+* @param {ArrayLikeObject<Object>} arrays - array-like object containing an input ndarray and a zero-dimensional ndarray specifying the minimum number of elements in the input ndarray that must satisfy the predicate function
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var scalar2ndarray = require( '@stdlib/ndarray/from-scalar' );
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* 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 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 3, 1, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 4, 1 ];
+*
+* // Define the index offset:
+* var ox = 1;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Define the success criterion:
+* var n = scalar2ndarray( 3, {
+*     'dtype': 'generic'
+* });
+*
+* // Test elements:
+* var out = some( [ x, n ] );
+* // returns true
+*/
+function some( arrays ) {
+	var isCmplx;
+	var ndims;
+	var xmmv;
+	var shx;
+	var iox;
+	var len;
+	var sx;
+	var ox;
+	var ns;
+	var N;
+	var x;
+	var n;
+	var d;
+	var i;
+
+	// Unpack the ndarray and standardize ndarray meta data:
+	x = ndarray2object( arrays[ 0 ] );
+	n = ndarray2object( arrays[ 1 ] );
+
+	shx = x.shape;
+	ndims = shx.length;
+
+	// Resolve the success criterion:
+	N = n.accessors[ 0 ]( n.data, n.offset );
+	if ( N < 1 ) {
+		return true;
+	}
+	// Check for known array types which can be reinterpreted for better iteration performance...
+	if ( isBooleanArray( x.data ) ) {
+		x.data = reinterpretBoolean( x.data, 0 );
+		x.accessorProtocol = false;
+	} else if ( isComplexArray( x.data ) ) {
+		x.data = reinterpretComplex( x.data, 0 );
+		x.accessorProtocol = false;
+		x.strides = gscal( ndims, 2, x.strides, 1 );
+		x.offset *= 2;
+		isCmplx = true;
+	}
+	// Determine whether we can avoid iteration altogether...
+	if ( ndims === 0 ) {
+		if ( x.accessorProtocol ) {
+			return ACCESSOR_SOME[ ndims ]( x, N );
+		}
+		if ( isCmplx ) {
+			return COMPLEX_SOME[ ndims ]( x, N );
+		}
+		return SOME[ ndims ]( x, N );
+	}
+	// Compute the number of elements and the number of singleton dimensions...
+	len = 1; // number of elements
+	ns = 0;  // number of singleton dimensions
+	for ( i = 0; i < ndims; i++ ) {
+		d = shx[ i ];
+
+		// Note that, if one of the dimensions is `0`, the length will be `0`...
+		len *= d;
+
+		// Check whether the current dimension is a singleton dimension...
+		if ( d === 1 ) {
+			ns += 1;
+		}
+	}
+	// Check whether we were provided an empty ndarray...
+	if ( len === 0 ) {
+		return false;
+	}
+	// Determine whether the ndarray is one-dimensional and thus readily translates to a one-dimensional strided array...
+	if ( ndims === 1 ) {
+		if ( x.accessorProtocol ) {
+			return ACCESSOR_SOME[ ndims ]( x, N );
+		}
+		if ( isCmplx ) {
+			return COMPLEX_SOME[ ndims ]( x, N );
+		}
+		return SOME[ ndims ]( x, N );
+	}
+	sx = x.strides;
+
+	// Determine whether the ndarray has only **one** non-singleton dimension (e.g., ndims=4, shape=[10,1,1,1]) so that we can treat an ndarray as being equivalent to a one-dimensional strided array...
+	if ( ns === ndims-1 ) {
+		// Get the index of the non-singleton dimension...
+		for ( i = 0; i < ndims; i++ ) {
+			if ( shx[ i ] !== 1 ) {
+				break;
+			}
+		}
+		x.shape = [ shx[i] ];
+		x.strides = [ sx[i] ];
+		if ( x.accessorProtocol ) {
+			return ACCESSOR_SOME[ 1 ]( x, N );
+		}
+		if ( isCmplx ) {
+			return COMPLEX_SOME[ 1 ]( x, N );
+		}
+		return SOME[ 1 ]( x, N );
+	}
+	iox = iterationOrder( sx ); // +/-1
+
+	// Determine whether we can avoid blocked iteration...
+	if ( iox !== 0 ) {
+		// Determine the minimum and maximum linear indices which are accessible by the array view:
+		xmmv = minmaxViewBufferIndex( shx, sx, x.offset );
+
+		// Determine whether we can ignore shape (and strides) and treat the ndarray as a linear one-dimensional strided array...
+		if ( len === ( xmmv[1]-xmmv[0]+1 ) || ( isCmplx && len*2 === ( xmmv[1]-xmmv[0]+1 ) ) ) { // eslint-disable-line max-len
+			// Note: the above is equivalent to @stdlib/ndarray/base/assert/is-contiguous, but in-lined so we can retain computed values...
+			if ( iox === 1 ) {
+				ox = xmmv[ 0 ];
+			} else {
+				ox = xmmv[ 1 ];
+			}
+			x.shape = [ len ];
+			x.strides = [ ( isCmplx ) ? iox*2 : iox ];
+			x.offset = ox;
+			if ( x.accessorProtocol ) {
+				return ACCESSOR_SOME[ 1 ]( x, N );
+			}
+			if ( isCmplx ) {
+				return COMPLEX_SOME[ 1 ]( x, N );
+			}
+			return SOME[ 1 ]( x, N );
+		}
+		// The ndarray is non-contiguous, so we cannot directly use one-dimensional array functionality...
+
+		// Determine whether we can use simple nested loops...
+		if ( ndims <= MAX_DIMS ) {
+			// So long as iteration always moves in the same direction (i.e., no mixed sign strides), we can leverage cache-optimal (i.e., normal) nested loops without resorting to blocked iteration...
+			if ( x.accessorProtocol ) {
+				return ACCESSOR_SOME[ ndims ]( x, N );
+			}
+			if ( isCmplx ) {
+				return COMPLEX_SOME[ ndims ]( x, N );
+			}
+			return SOME[ ndims ]( x, N );
+		}
+		// Fall-through to blocked iteration...
+	}
+	// At this point, we're either dealing with a non-contiguous n-dimensional array or a high dimensional n-dimensional array, so our only hope is that we can still perform blocked iteration...
+
+	// Determine whether we can perform blocked iteration...
+	if ( ndims <= MAX_DIMS ) {
+		if ( x.accessorProtocol ) {
+			return BLOCKED_ACCESSOR_SOME[ ndims-2 ]( x, N );
+		}
+		if ( isCmplx ) {
+			return BLOCKED_COMPLEX_SOME[ ndims-2 ]( x, N );
+		}
+		return BLOCKED_SOME[ ndims-2 ]( x, N );
+	}
+	// Fall-through to linear view iteration without regard for how data is stored in memory (i.e., take the slow path)...
+	if ( x.accessorProtocol ) {
+		return accessorsomend( x, N );
+	}
+	if ( isCmplx ) {
+		return complexsomend( x, N );
+	}
+	return somend( x, N );
+}
+
+
+// EXPORTS //
+
+module.exports = some;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/nd.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/nd.js
new file mode 100644
index 000000000000..d57886275ccc
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/nd.js
@@ -0,0 +1,126 @@
+/**
+* @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 numel = require( '@stdlib/ndarray/base/numel' );
+var vind2bind = require( '@stdlib/ndarray/base/vind2bind' );
+
+
+// VARIABLES //
+
+var MODE = 'throw';
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {ndarrayLike} x.ref - reference to the original ndarray-like object
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 1 ];
+*
+* // Define the index offset:
+* var ox = 1;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'ref': null,
+*     'dtype': 'float64',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = somend( x, 2 );
+* // returns true
+*/
+function somend( x, n ) {
+	var count;
+	var xbuf;
+	var ordx;
+	var len;
+	var sh;
+	var sx;
+	var ox;
+	var ix;
+	var i;
+
+	sh = x.shape;
+
+	// Compute the total number of elements over which to iterate:
+	len = numel( sh );
+
+	// Cache a reference to the input ndarray data buffer:
+	xbuf = x.data;
+
+	// Cache a reference to the stride array:
+	sx = x.strides;
+
+	// Cache the index of the first indexed element:
+	ox = x.offset;
+
+	// Cache the array order:
+	ordx = x.order;
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over each element based on the linear **view** index, regardless as to how the data is stored in memory...
+	for ( i = 0; i < len; i++ ) {
+		ix = vind2bind( sh, sx, ox, ordx, i, MODE );
+		if ( xbuf[ ix ] ) {
+			count += 1;
+			if ( count === n ) {
+				return true;
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = somend;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/nd_accessors.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/nd_accessors.js
new file mode 100644
index 000000000000..5b23bb93f910
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/nd_accessors.js
@@ -0,0 +1,133 @@
+/**
+* @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 numel = require( '@stdlib/ndarray/base/numel' );
+var vind2bind = require( '@stdlib/ndarray/base/vind2bind' );
+
+
+// VARIABLES //
+
+var MODE = 'throw';
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements in an ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {ndarrayLike} x.ref - reference to the original ndarray-like object
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {Array<Function>} x.accessors - data buffer accessors
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var accessors = require( '@stdlib/array/base/accessors' );
+*
+* // Create a data buffer:
+* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 1 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'ref': null,
+*     'dtype': 'generic',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': accessors( xbuf ).accessors
+* };
+*
+* // Test elements:
+* var out = somend( x, 2 );
+* // returns true
+*/
+function somend( x, n ) {
+	var count;
+	var xbuf;
+	var ordx;
+	var len;
+	var get;
+	var sh;
+	var sx;
+	var ox;
+	var ix;
+	var i;
+
+	sh = x.shape;
+
+	// Compute the total number of elements over which to iterate:
+	len = numel( sh );
+
+	// Cache a reference to the input ndarray data buffer:
+	xbuf = x.data;
+
+	// Cache a reference to the stride array:
+	sx = x.strides;
+
+	// Cache the index of the first indexed element:
+	ox = x.offset;
+
+	// Cache the array order:
+	ordx = x.order;
+
+	// Cache accessor:
+	get = x.accessors[ 0 ];
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over each element based on the linear **view** index, regardless as to how the data is stored in memory...
+	for ( i = 0; i < len; i++ ) {
+		ix = vind2bind( sh, sx, ox, ordx, i, MODE );
+		if ( get( xbuf, ix ) ) {
+			count += 1;
+			if ( count === n ) {
+				return true;
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = somend;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/lib/nd_complex.js b/lib/node_modules/@stdlib/ndarray/base/some/lib/nd_complex.js
new file mode 100644
index 000000000000..9d3a3d695990
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/lib/nd_complex.js
@@ -0,0 +1,124 @@
+/**
+* @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 numel = require( '@stdlib/ndarray/base/numel' );
+var vind2bind = require( '@stdlib/ndarray/base/vind2bind' );
+
+
+// VARIABLES //
+
+var MODE = 'throw';
+
+
+// MAIN //
+
+/**
+* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.
+*
+* @private
+* @param {Object} x - object containing ndarray meta data
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {PositiveInteger} n - number of elements
+* @returns {boolean} boolean indicating whether at least `n` elements are truthy
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* // Create a data buffer:
+* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 4, 2 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'dtype': 'complex128',
+*     'data': xbuf,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major'
+* };
+*
+* // Test elements:
+* var out = somend( x, 4 );
+* // returns true
+*/
+function somend( x, n ) {
+	var count;
+	var xbuf;
+	var ordx;
+	var len;
+	var sh;
+	var sx;
+	var ox;
+	var ix;
+	var i;
+
+	sh = x.shape;
+
+	// Compute the total number of elements over which to iterate:
+	len = numel( sh );
+
+	// Cache a reference to the output ndarray data buffer:
+	xbuf = x.data;
+
+	// Cache a reference to the stride array:
+	sx = x.strides;
+
+	// Cache the index of the first indexed element:
+	ox = x.offset;
+
+	// Cache the array order:
+	ordx = x.order;
+
+	// Initialize a counter:
+	count = 0;
+
+	// Iterate over each element based on the linear **view** index, regardless as to how the data is stored in memory...
+	for ( i = 0; i < len; i++ ) {
+		ix = vind2bind( sh, sx, ox, ordx, i, MODE );
+		if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
+			count += 1;
+			if ( count === n ) {
+				return true;
+			}
+		}
+	}
+	return false;
+}
+
+
+// EXPORTS //
+
+module.exports = somend;
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/package.json b/lib/node_modules/@stdlib/ndarray/base/some/package.json
new file mode 100644
index 000000000000..499295b3b962
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/package.json
@@ -0,0 +1,65 @@
+{
+  "name": "@stdlib/ndarray/base/some",
+  "version": "0.0.0",
+  "description": "Test whether at least `n` elements in an ndarray are truthy.",
+  "license": "Apache-2.0",
+  "author": {
+    "name": "The Stdlib Authors",
+    "url": "https://github.com/stdlib-js/stdlib/graphs/contributors"
+  },
+  "contributors": [
+    {
+      "name": "The Stdlib Authors",
+      "url": "https://github.com/stdlib-js/stdlib/graphs/contributors"
+    }
+  ],
+  "main": "./lib",
+  "directories": {
+    "benchmark": "./benchmark",
+    "doc": "./docs",
+    "example": "./examples",
+    "lib": "./lib",
+    "test": "./test"
+  },
+  "types": "./docs/types",
+  "scripts": {},
+  "homepage": "https://github.com/stdlib-js/stdlib",
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/stdlib-js/stdlib.git"
+  },
+  "bugs": {
+    "url": "https://github.com/stdlib-js/stdlib/issues"
+  },
+  "dependencies": {},
+  "devDependencies": {},
+  "engines": {
+    "node": ">=0.10.0",
+    "npm": ">2.7.0"
+  },
+  "os": [
+    "aix",
+    "darwin",
+    "freebsd",
+    "linux",
+    "macos",
+    "openbsd",
+    "sunos",
+    "win32",
+    "windows"
+  ],
+  "keywords": [
+    "stdlib",
+    "base",
+    "strided",
+    "array",
+    "ndarray",
+    "some",
+    "count",
+    "search",
+    "find",
+    "utility",
+    "utils"
+  ],
+  "__stdlib__": {}
+}
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/test/test.0d.js b/lib/node_modules/@stdlib/ndarray/base/some/test/test.0d.js
new file mode 100644
index 000000000000..225d847b2256
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/test/test.0d.js
@@ -0,0 +1,83 @@
+/**
+* @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 tape = require( 'tape' );
+var Complex128 = require( '@stdlib/complex/float64/ctor' );
+var scalar2ndarray = require( '@stdlib/ndarray/from-scalar' );
+var some = require( './../lib' );
+
+
+// TESTS //
+
+tape( 'main export is a function', function test( t ) {
+	t.ok( true, __filename );
+	t.strictEqual( typeof some, 'function', 'main export is a function');
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 0-dimensional ndarray are truthy', function test( t ) {
+	var actual;
+	var x;
+	var n;
+
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	x = scalar2ndarray( 0.0, {
+		'dtype': 'float64'
+	});
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = scalar2ndarray( 1.0, {
+		'dtype': 'float64'
+	});
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 0-dimensional ndarray are truthy (accessors)', function test( t ) {
+	var actual;
+	var x;
+	var n;
+
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	x = scalar2ndarray( new Complex128( 0.0, 0.0 ), {
+		'dtype': 'complex128'
+	});
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = scalar2ndarray( new Complex128( 1.0, 1.0 ), {
+		'dtype': 'complex128'
+	});
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/test/test.10d.js b/lib/node_modules/@stdlib/ndarray/base/some/test/test.10d.js
new file mode 100644
index 000000000000..4d75abfe281a
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/test/test.10d.js
@@ -0,0 +1,3302 @@
+/**
+* @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 tape = require( 'tape' );
+var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+var zeros = require( '@stdlib/array/zeros' );
+var ones = require( '@stdlib/array/ones' );
+var scalar2ndarray = require( '@stdlib/ndarray/from-scalar' );
+var numel = require( '@stdlib/ndarray/base/numel' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var strides2offset = require( '@stdlib/ndarray/base/strides2offset' );
+var ndarray = require( '@stdlib/ndarray/ctor' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+var some = require( './../lib' );
+
+
+// TESTS //
+
+tape( 'main export is a function', function test( t ) {
+	t.ok( true, __filename );
+	t.strictEqual( typeof some, 'function', 'main export is a function');
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, singleton dimensions)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 4, 1, 1, 1, 1, 1, 1, 1, 1, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, singleton dimensions, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 4, 1, 1, 1, 1, 1, 1, 1, 1, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, contiguous)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, contiguous, negative strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ -8, -8, -8, -8, -8, -8, -4, -2, -2, -1 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, 16, 16, 16, 16, 16, 8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, 16, 16, 16, 16, 16, -8, -4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 2, 1, 1, 2, 1, 2, 1, 1, 2 ];
+	st = [ 32, 16, 16, -16, 8, 8, -4, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 2, 1, 2, 1, 2, 1, 1, 2 ];
+	st = [ bsize*64, 32, 16, -16, 8, 8, -4, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 2, bsize*2, 2, 1, 1, 2, 1, 1, 2 ];
+	st = [ bsize*64, bsize*32, 16, -8, 8, 8, -4, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, bsize*2, 2, 1, 2, 1, 1, 2 ];
+	st = [ bsize*64, bsize*64, bsize*32, -16, 8, 8, -4, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, 2, bsize*2, 2, 1, 1, 1, 2 ];
+	st = [ bsize*32, bsize*32, bsize*32, -bsize*16, 8, 4, -4, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, 1, 2, bsize*2, 2, 1, 1, 2 ];
+	st = [ bsize*32, bsize*32, bsize*32, -bsize*32, bsize*16, 8, -4, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2, 1, 2 ];
+	st = [
+		bsize*64,
+		bsize*64,
+		bsize*32,
+		-bsize*32,
+		bsize*32,
+		bsize*16,
+		-8,
+		4,
+		4,
+		2
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 1, 2, bsize*2, 2, 2 ];
+	st = [
+		bsize*64,
+		bsize*64,
+		bsize*32,
+		-bsize*32,
+		bsize*32,
+		bsize*32,
+		-bsize*16,
+		8,
+		4,
+		2
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, 1, 1, 2, bsize*2, 2 ];
+	st = [
+		bsize*64,
+		bsize*64,
+		bsize*32,
+		-bsize*32,
+		bsize*16,
+		bsize*16,
+		-bsize*16,
+		bsize*8,
+		4,
+		2
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 2, bsize*2 ];
+	st = [
+		bsize*32,
+		bsize*32,
+		bsize*16,
+		-bsize*16,
+		bsize*8,
+		bsize*8,
+		-bsize*8,
+		bsize*8,
+		bsize*4,
+		2
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, contiguous, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, contiguous, negative strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ -8, -8, -8, -8, -8, -8, -4, -2, -2, -1 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, 16, 16, 16, 16, 16, 8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, 16, 16, 16, -16, 16, -8, -4, -2, 1 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 2, 1, 1, 2, 1, 2, 1, 1, 2 ];
+	st = [ 32, 16, 16, -16, 8, 8, -4, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 2, 1, 2, 1, 2, 1, 1, 2 ];
+	st = [ bsize*64, 32, 16, -16, 8, 8, -4, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 2, bsize*2, 2, 1, 1, 2, 1, 1, 2 ];
+	st = [ bsize*64, bsize*32, 16, -8, 8, 8, -4, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, bsize*2, 2, 1, 2, 1, 1, 2 ];
+	st = [ bsize*64, bsize*64, bsize*32, -16, 8, 8, -4, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, 2, bsize*2, 2, 1, 1, 1, 2 ];
+	st = [ bsize*32, bsize*32, bsize*32, -bsize*16, 8, 4, -4, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, 1, 2, bsize*2, 2, 1, 1, 2 ];
+	st = [ bsize*32, bsize*32, bsize*32, -bsize*32, bsize*16, 8, -4, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2, 1, 2 ];
+	st = [
+		bsize*64,
+		bsize*64,
+		bsize*32,
+		-bsize*32,
+		bsize*32,
+		bsize*16,
+		-8,
+		4,
+		4,
+		2
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 1, 2, bsize*2, 2, 2 ];
+	st = [
+		bsize*64,
+		bsize*64,
+		bsize*32,
+		-bsize*32,
+		bsize*32,
+		bsize*32,
+		-bsize*16,
+		8,
+		4,
+		2
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, 1, 1, 2, bsize*2, 2 ];
+	st = [
+		bsize*64,
+		bsize*64,
+		bsize*32,
+		-bsize*32,
+		bsize*16,
+		bsize*16,
+		-bsize*16,
+		bsize*8,
+		4,
+		2
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 2, bsize*2 ];
+	st = [
+		bsize*32,
+		bsize*32,
+		bsize*16,
+		-bsize*16,
+		bsize*8,
+		bsize*8,
+		-bsize*8,
+		bsize*8,
+		bsize*4,
+		2
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, contiguous, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, contiguous, negative strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ -8, -8, -8, -8, -8, -8, -4, -2, -2, -1 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, 16, 16, 16, 16, 16, 8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, 16, 16, 16, -16, 16, -8, -4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 2, 1, 1, 2, 1, 2, 1, 1, 2 ];
+	st = [ 32, 16, 16, -16, 8, 8, -4, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 2, 1, 2, 1, 2, 1, 1, 2 ];
+	st = [ bsize*64, 32, 16, -16, 8, 8, -4, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 2, bsize*2, 2, 1, 1, 2, 1, 1, 2 ];
+	st = [ bsize*64, bsize*32, 16, -8, 8, 8, -4, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, bsize*2, 2, 1, 2, 1, 1, 2 ];
+	st = [ bsize*64, bsize*64, bsize*32, -16, 8, 8, -4, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, 2, bsize*2, 2, 1, 1, 1, 2 ];
+	st = [ bsize*32, bsize*32, bsize*32, -bsize*16, 8, 4, -4, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, 1, 2, bsize*2, 2, 1, 1, 2 ];
+	st = [ bsize*32, bsize*32, bsize*32, -bsize*32, bsize*16, 8, -4, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2, 1, 2 ];
+	st = [
+		bsize*64,
+		bsize*64,
+		bsize*32,
+		-bsize*32,
+		bsize*32,
+		bsize*16,
+		-8,
+		4,
+		4,
+		2
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 1, 2, bsize*2, 2, 2 ];
+	st = [
+		bsize*64,
+		bsize*64,
+		bsize*32,
+		-bsize*32,
+		bsize*32,
+		bsize*32,
+		-bsize*16,
+		8,
+		4,
+		2
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, 1, 1, 2, bsize*2, 2 ];
+	st = [
+		bsize*64,
+		bsize*64,
+		bsize*32,
+		-bsize*32,
+		bsize*16,
+		bsize*16,
+		-bsize*16,
+		bsize*8,
+		4,
+		2
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 2, bsize*2 ];
+	st = [
+		bsize*32,
+		bsize*32,
+		bsize*16,
+		-bsize*16,
+		bsize*8,
+		bsize*8,
+		-bsize*8,
+		bsize*8,
+		bsize*4,
+		2
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, singleton dimensions)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 4 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, singleton dimensions, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 4 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, contiguous)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, contiguous, negative strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ -1, -1, -1, -1, -1, -1, -1, -2, -4, -4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, 2, 2, 2, 2, 2, 4, 8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, 2, 2, 2, 2, -2, -4, 8, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 2, 1, 1, 2, 1, 2, 1, 1, 2 ];
+	st = [
+		2,
+		bsize*4,
+		bsize*8,
+		-bsize*8,
+		bsize*8,
+		bsize*16,
+		bsize*16,
+		-bsize*32,
+		bsize*32,
+		bsize*32
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 2, 1, 2, 1, 2, 1, 1, 2 ];
+	st = [
+		2,
+		4,
+		bsize*8,
+		bsize*16,
+		bsize*16,
+		bsize*32,
+		bsize*32,
+		bsize*64,
+		bsize*64,
+		bsize*64
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 2, bsize*2, 2, 1, 1, 2, 1, 1, 2 ];
+	st = [
+		2,
+		4,
+		8,
+		bsize*16,
+		bsize*32,
+		bsize*32,
+		bsize*32,
+		bsize*64,
+		bsize*64,
+		bsize*64
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, bsize*2, 2, 1, 2, 1, 1, 2 ];
+	st = [
+		2,
+		4,
+		4,
+		8,
+		bsize*16,
+		bsize*32,
+		bsize*32,
+		bsize*64,
+		bsize*64,
+		bsize*64
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, 2, bsize*2, 2, 1, 1, 1, 2 ];
+	st = [ 2, 4, 4, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, 1, 2, bsize*2, 2, 1, 1, 2 ];
+	st = [ 2, 4, 4, 4, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2, 1, 2 ];
+	st = [ 2, 4, 4, 8, 8, 8, 16, bsize*32, bsize*64, bsize*64 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, 1, 2, bsize*2, 2, 1 ];
+	st = [ 2, 4, 4, 8, 8, 16, 16, 32, bsize*64, bsize*128 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, 1, 1, 2, bsize*2, 2 ];
+	st = [ 2, 4, 4, 8, 8, 16, 16, 16, 32, bsize*64 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 2, bsize*2 ];
+	st = [ 2, 4, 4, 8, 8, 16, -16, 16, 16, 32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, contiguous, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, contiguous, negative strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2, 1 ];
+	st = [ -1, -1, -1, -1, -1, -1, -2, -4, -4, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, 2, 2, 2, 2, 2, 4, 8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, -2, 2, -2, 2, 2, -4, -8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 2, 1, 1, 2, 1, 2, 1, 1, 2 ];
+	st = [
+		2,
+		bsize*4,
+		bsize*8,
+		-bsize*8,
+		bsize*8,
+		bsize*16,
+		bsize*16,
+		-bsize*32,
+		bsize*32,
+		bsize*32
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 2, 1, 2, 1, 2, 1, 1, 2 ];
+	st = [
+		2,
+		4,
+		bsize*8,
+		bsize*16,
+		bsize*16,
+		bsize*32,
+		bsize*32,
+		bsize*64,
+		bsize*64,
+		bsize*64
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 2, bsize*2, 2, 1, 1, 2, 1, 1, 2 ];
+	st = [
+		2,
+		4,
+		8,
+		bsize*16,
+		bsize*32,
+		bsize*32,
+		bsize*32,
+		bsize*64,
+		bsize*64,
+		bsize*64
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, bsize*2, 2, 1, 2, 1, 1, 2 ];
+	st = [
+		2,
+		4,
+		4,
+		8,
+		bsize*16,
+		bsize*32,
+		bsize*32,
+		bsize*64,
+		bsize*64,
+		bsize*64
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, 2, bsize*2, 2, 1, 1, 1, 2 ];
+	st = [ 2, 4, 4, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, 1, 2, bsize*2, 2, 1, 1, 2 ];
+	st = [ 2, 4, 4, 4, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2, 1, 2 ];
+	st = [ 2, 4, 4, 8, 8, 8, 16, bsize*32, bsize*64, bsize*64 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, 1, 2, bsize*2, 2, 1 ];
+	st = [ 2, 4, 4, 8, 8, 16, 16, 32, bsize*64, bsize*128 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, 1, 1, 2, bsize*2, 2 ];
+	st = [ 2, 4, 4, 8, 8, 16, 16, 16, 32, bsize*64 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 2, bsize*2 ];
+	st = [ 2, 4, 4, 8, 8, 16, -16, 16, 16, 32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, contiguous, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, contiguous, negative strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2, 1 ];
+	st = [ -1, -1, -1, -1, -1, -1, -2, -4, -4, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, 2, 2, 2, 2, 2, 4, 8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, -2, 2, -2, 2, 2, -4, -8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 2, 1, 1, 2, 1, 2, 1, 1, 2 ];
+	st = [
+		2,
+		bsize*4,
+		bsize*8,
+		-bsize*8,
+		bsize*8,
+		bsize*16,
+		bsize*16,
+		-bsize*32,
+		bsize*32,
+		bsize*32
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 2, 1, 2, 1, 2, 1, 1, 2 ];
+	st = [
+		2,
+		4,
+		bsize*8,
+		bsize*16,
+		bsize*16,
+		bsize*32,
+		bsize*32,
+		bsize*64,
+		bsize*64,
+		bsize*64
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 2, bsize*2, 2, 1, 1, 2, 1, 1, 2 ];
+	st = [
+		2,
+		4,
+		8,
+		bsize*16,
+		bsize*32,
+		bsize*32,
+		bsize*32,
+		bsize*64,
+		bsize*64,
+		bsize*64
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, bsize*2, 2, 1, 2, 1, 1, 2 ];
+	st = [
+		2,
+		4,
+		4,
+		8,
+		bsize*16,
+		bsize*32,
+		bsize*32,
+		bsize*64,
+		bsize*64,
+		bsize*64
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, 2, bsize*2, 2, 1, 1, 1, 2 ];
+	st = [ 2, 4, 4, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, 1, 2, bsize*2, 2, 1, 1, 2 ];
+	st = [ 2, 4, 4, 4, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2, 1, 2 ];
+	st = [ 2, 4, 4, 8, 8, 8, 16, bsize*32, bsize*64, bsize*64 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, 1, 2, bsize*2, 2, 1 ];
+	st = [ 2, 4, 4, 8, 8, 16, 16, 32, bsize*64, bsize*128 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, 1, 1, 2, bsize*2, 2 ];
+	st = [ 2, 4, 4, 8, 8, 16, 16, 16, 32, bsize*64 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 2, bsize*2 ];
+	st = [ 2, 4, 4, 8, 8, 16, -16, 16, 16, 32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/test/test.1d.js b/lib/node_modules/@stdlib/ndarray/base/some/test/test.1d.js
new file mode 100644
index 000000000000..dd0719040a55
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/test/test.1d.js
@@ -0,0 +1,83 @@
+/**
+* @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 tape = require( 'tape' );
+var ones = require( '@stdlib/array/ones' );
+var zeros = require( '@stdlib/array/zeros' );
+var Complex128Array = require( '@stdlib/array/complex128' );
+var scalar2ndarray = require( '@stdlib/ndarray/from-scalar' );
+var ndarray = require( '@stdlib/ndarray/ctor' );
+var some = require( './../lib' );
+
+
+// TESTS //
+
+tape( 'main export is a function', function test( t ) {
+	t.ok( true, __filename );
+	t.strictEqual( typeof some, 'function', 'main export is a function');
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 1-dimensional ndarray are truthy', function test( t ) {
+	var actual;
+	var x;
+	var n;
+
+	x = ndarray( 'float64', zeros( 8, 'float64' ), [ 4 ], [ 2 ], 1, 'row-major' );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( 'float64', ones( 8, 'float64' ), [ 4 ], [ 2 ], 1, 'row-major' );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 1-dimensional ndarray are truthy (accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var x;
+	var n;
+
+	xbuf = zeros( 6*2, 'float64' );
+	x = ndarray( 'complex128', new Complex128Array( xbuf ), [ 4 ], [ 1 ], 1, 'row-major' );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( 6*2, 'float64' );
+	x = ndarray( 'complex128', new Complex128Array( xbuf ), [ 4 ], [ 1 ], 1, 'row-major' );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/test/test.2d.js b/lib/node_modules/@stdlib/ndarray/base/some/test/test.2d.js
new file mode 100644
index 000000000000..c687e9f84fcd
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/test/test.2d.js
@@ -0,0 +1,1004 @@
+/**
+* @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 tape = require( 'tape' );
+var zeros = require( '@stdlib/array/zeros' );
+var ones = require( '@stdlib/array/ones' );
+var scalar2ndarray = require( '@stdlib/ndarray/from-scalar' );
+var Complex128Array = require( '@stdlib/array/complex128' );
+var numel = require( '@stdlib/ndarray/base/numel' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var strides2offset = require( '@stdlib/ndarray/base/strides2offset' );
+var ndarray = require( '@stdlib/ndarray/ctor' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+var some = require( './../lib' );
+
+
+// TESTS //
+
+tape( 'main export is a function', function test( t ) {
+	t.ok( true, __filename );
+	t.strictEqual( typeof some, 'function', 'main export is a function');
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, singleton dimensions)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 4, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, singleton dimensions, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 4, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, contiguous)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 2, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, contiguous, negative strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 2, 2 ];
+	st = [ -2, -1 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 2, 2 ];
+	st = [ 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 2, 2 ];
+	st = [ 4, -2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 2 ];
+	st = [ -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2 ];
+	st = [ bsize*4, -2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, contiguous, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 2, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, contiguous, negative strides, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 2, 2 ];
+	st = [ -2, -1 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 2, 2 ];
+	st = [ 4, 2 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( 8*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( 8*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 2, 2 ];
+	st = [ 4, -2 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( 8*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( 8*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 2 ];
+	st = [ -4, 2 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2 ];
+	st = [ bsize*4, -2 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, singleton dimensions)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 4 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, singleton dimensions, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 1, 4 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, contiguous)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, contiguous, negative strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 2 ];
+	st = [ -1, -2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 2 ];
+	st = [ 2, 4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 2 ];
+	st = [ -2, 4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 2 ];
+	st = [ 2, -bsize*4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2 ];
+	st = [ -2, 4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, contiguous, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 2, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, contiguous, negative strides, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 2, 2 ];
+	st = [ -1, -2 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 2, 2 ];
+	st = [ 2, 4 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( 8*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( 8*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 2, 2 ];
+	st = [ -2, 4 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( 8*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( 8*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 2 ];
+	st = [ -2, bsize*2 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2 ];
+	st = [ 2, -4 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/test/test.3d.js b/lib/node_modules/@stdlib/ndarray/base/some/test/test.3d.js
new file mode 100644
index 000000000000..afaf5da34d85
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/test/test.3d.js
@@ -0,0 +1,1150 @@
+/**
+* @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 tape = require( 'tape' );
+var zeros = require( '@stdlib/array/zeros' );
+var ones = require( '@stdlib/array/ones' );
+var scalar2ndarray = require( '@stdlib/ndarray/from-scalar' );
+var Complex128Array = require( '@stdlib/array/complex128' );
+var numel = require( '@stdlib/ndarray/base/numel' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var strides2offset = require( '@stdlib/ndarray/base/strides2offset' );
+var ndarray = require( '@stdlib/ndarray/ctor' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+var some = require( './../lib' );
+
+
+// TESTS //
+
+tape( 'main export is a function', function test( t ) {
+	t.ok( true, __filename );
+	t.strictEqual( typeof some, 'function', 'main export is a function');
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, singleton dimensions)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 4, 1, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, singleton dimensions, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 4, 1, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, contiguous)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, contiguous, negative strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 2, 1, 2 ];
+	st = [ -2, -2, -1 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 2, 1, 2 ];
+	st = [ 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 2, 1, 2 ];
+	st = [ 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2 ];
+	st = [ -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 1 ];
+	st = [ bsize*4, -2, -2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2 ];
+	st = [ bsize*4, -bsize*4, -2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, contiguous, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, contiguous, negative strides, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 2, 1, 2 ];
+	st = [ -2, -2, -1 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 2, 1, 2 ];
+	st = [ 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( 8*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( 8*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 2, 1, 2 ];
+	st = [ -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( 8*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( 8*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2 ];
+	st = [ -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 1 ];
+	st = [ bsize*4, -2, 2 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2 ];
+	st = [ bsize*4, -bsize*4, 2 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, singleton dimensions)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 4 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, singleton dimensions, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 1, 1, 4 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, contiguous)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, contiguous, negative strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 1, 2 ];
+	st = [ -1, -2, -2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 1, 2 ];
+	st = [ 2, 4, 4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 1, 2 ];
+	st = [ -2, 4, 4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2 ];
+	st = [ 2, -bsize*4, bsize*4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 1 ];
+	st = [ -2, 4, bsize*8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2 ];
+	st = [ -2, 4, 4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, contiguous, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, contiguous, negative strides, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 2, 1, 2 ];
+	st = [ -1, -2, -2 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 2, 1, 2 ];
+	st = [ 2, 4, 4 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( 8*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( 8*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 2, 1, 2 ];
+	st = [ -2, 4, 4 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( 8*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( 8*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2 ];
+	st = [ -2, bsize*4, bsize*4 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 1 ];
+	st = [ 2, -4, bsize*8 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2 ];
+	st = [ 2, -4, 4 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/test/test.4d.js b/lib/node_modules/@stdlib/ndarray/base/some/test/test.4d.js
new file mode 100644
index 000000000000..0b071cbca20c
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/test/test.4d.js
@@ -0,0 +1,1778 @@
+/**
+* @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 tape = require( 'tape' );
+var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+var zeros = require( '@stdlib/array/zeros' );
+var ones = require( '@stdlib/array/ones' );
+var scalar2ndarray = require( '@stdlib/ndarray/from-scalar' );
+var numel = require( '@stdlib/ndarray/base/numel' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var strides2offset = require( '@stdlib/ndarray/base/strides2offset' );
+var ndarray = require( '@stdlib/ndarray/ctor' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+var some = require( './../lib' );
+
+
+// TESTS //
+
+tape( 'main export is a function', function test( t ) {
+	t.ok( true, __filename );
+	t.strictEqual( typeof some, 'function', 'main export is a function');
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, singleton dimensions)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 4, 1, 1, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, singleton dimensions, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 4, 1, 1, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, contiguous)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 2, 1, 2, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, contiguous, negative strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 2, 1, 2, 1 ];
+	st = [ -2, -2, -1, -1 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 2, 1, 2, 1 ];
+	st = [ 4, 4, 2, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 2, 1, 2, 1 ];
+	st = [ 4, -4, -2, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2, 1 ];
+	st = [ -4, -4, 2, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 1, bsize*2, 2, 1 ];
+	st = [ -bsize*8, -4, 2, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 1, 2, bsize*2, 1 ];
+	st = [ bsize*8, bsize*4, -2, -2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 1, 2, 1, bsize*2 ];
+	st = [ bsize*8, bsize*4, -bsize*4, -2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, contiguous, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 2, 1, 2, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, contiguous, negative strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 2, 2, 1, 2 ];
+	st = [ -4, -2, -2, -1 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 2, 1, 2, 1 ];
+	st = [ 4, 4, 2, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 2, 1, 2, 1 ];
+	st = [ 4, -4, -2, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2, 1 ];
+	st = [ -4, -4, 2, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 1, bsize*2, 2, 1 ];
+	st = [ -bsize*8, -4, 2, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 1, 2, bsize*2, 1 ];
+	st = [ -bsize*4, -bsize*4, -2, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, bsize*2 ];
+	st = [ -bsize*4, -bsize*4, bsize*4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, contiguous, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 2, 1, 2, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, contiguous, negative strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 2, 2, 1, 2 ];
+	st = [ -4, -2, -2, -1 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 2, 1, 2, 1 ];
+	st = [ 4, 4, 2, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( 8, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( 8, dt ) ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 2, 1, 2, 1 ];
+	st = [ 4, -4, -2, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( 8, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( 8, dt ) ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2, 1 ];
+	st = [ -4, -4, 2, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 1, bsize*2, 2, 1 ];
+	st = [ -bsize*8, -4, 2, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2, 1 ];
+	st = [ bsize*4, bsize*4, -2, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, bsize*2 ];
+	st = [ bsize*4, bsize*4, bsize*4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, singleton dimensions)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 4 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, singleton dimensions, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 4 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, contiguous)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, contiguous, negative strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 2, 1, 2 ];
+	st = [ -1, -2, -4, -4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1 ];
+	st = [ 2, 4, 4, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1 ];
+	st = [ 2, -4, -4, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 1, 2, 1, bsize*2 ];
+	st = [ 2, 2, -4, -4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 1, 2, bsize*2, 1 ];
+	st = [ 2, -2, -4, -bsize*4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 1, bsize*2, 1, 2 ];
+	st = [ 2, 2, -bsize*4, -bsize*4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 1, 2 ];
+	st = [ 2, -bsize*4, bsize*4, -bsize*4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, contiguous, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, contiguous, negative strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 2, 2, 1, 2 ];
+	st = [ -1, -2, -4, -4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1 ];
+	st = [ 2, 4, 4, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1 ];
+	st = [ 2, 4, -4, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2, 1 ];
+	st = [ 2, -bsize*4, -bsize*4, -bsize*8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 1, 1 ];
+	st = [ 1, 2, -bsize*4, -bsize*4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2, 1 ];
+	st = [ 2, 4, -4, -bsize*4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, bsize*4 ];
+	st = [ 2, 4, -4, -4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, contiguous, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, contiguous, negative strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 2, 1, 2 ];
+	st = [ -1, -2, -4, -4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1 ];
+	st = [ 2, 4, 4, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( 8, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( 8, dt ) ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1 ];
+	st = [ 2, -4, -4, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( 8, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( 8, dt ) ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 1, 2, 1, bsize*2 ];
+	st = [ 2, 2, -4, -4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 1, 2, bsize*2, 1 ];
+	st = [ 2, 2, -4, -bsize*4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 1, bsize*2, 1, 2 ];
+	st = [ 2, 2, -bsize*4, -bsize*4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 1, 2 ];
+	st = [ 2, -bsize*4, bsize*4, -bsize*4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/test/test.5d.js b/lib/node_modules/@stdlib/ndarray/base/some/test/test.5d.js
new file mode 100644
index 000000000000..ddbeffcddd7b
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/test/test.5d.js
@@ -0,0 +1,1988 @@
+/**
+* @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 tape = require( 'tape' );
+var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+var zeros = require( '@stdlib/array/zeros' );
+var ones = require( '@stdlib/array/ones' );
+var scalar2ndarray = require( '@stdlib/ndarray/from-scalar' );
+var numel = require( '@stdlib/ndarray/base/numel' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var strides2offset = require( '@stdlib/ndarray/base/strides2offset' );
+var ndarray = require( '@stdlib/ndarray/ctor' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+var some = require( './../lib' );
+
+
+// TESTS //
+
+tape( 'main export is a function', function test( t ) {
+	t.ok( true, __filename );
+	t.strictEqual( typeof some, 'function', 'main export is a function');
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, singleton dimensions)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 4, 1, 1, 1, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, singleton dimensions, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 4, 1, 1, 1, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, contiguous)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 2, 1, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, contiguous, negative strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 2, 2, 1, 2, 2 ];
+	st = [ -8, -4, -4, -2, -1 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 2, 1, 2, 1, 2 ];
+	st = [ 8, 8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 2, 1, 2, 1, 2 ];
+	st = [ 8, 8, -4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2, 1, 2 ];
+	st = [ 8, -8, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 1, 1, 2 ];
+	st = [ bsize*8, -4, 4, -4, -2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2, 1, 2 ];
+	st = [ bsize*8, bsize*8, -4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, bsize*2, 1 ];
+	st = [ bsize*8, bsize*8, -bsize*4, -2, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, bsize*2 ];
+	st = [ bsize*8, -bsize*8, -bsize*4, -bsize*4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, contiguous, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 2, 1, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, contiguous, negative strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 2, 1, 2, 1, 2 ];
+	st = [ -4, -4, -2, -2, -1 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 2, 1, 2, 1, 2 ];
+	st = [ 8, 8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 2, 1, 2, 1, 2 ];
+	st = [ 8, 8, -4, -4, -2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2, 1, 2 ];
+	st = [ 8, -8, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 1, 1, 2 ];
+	st = [ -bsize*8, -4, 4, -4, -2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2, 1, 2 ];
+	st = [ bsize*8, bsize*8, -4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, bsize*2, 2 ];
+	st = [ bsize*8, -bsize*8, -bsize*8, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, bsize*2 ];
+	st = [ bsize*8, -bsize*8, -bsize*4, -bsize*4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, contiguous, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 2, 1, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, contiguous, negative strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 2, 1, 2, 1, 2 ];
+	st = [ -4, -4, -2, -2, -1 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 2, 1, 2, 1, 2 ];
+	st = [ 8, 8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 2, 1, 2, 1, 2 ];
+	st = [ 8, 8, -4, -4, -2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2, 1, 2 ];
+	st = [ 8, -8, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 1, 1, 2 ];
+	st = [ -bsize*8, -4, 4, -4, -2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2, 1, 2 ];
+	st = [ bsize*8, bsize*8, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, bsize*2, 2 ];
+	st = [ bsize*8, -bsize*8, -bsize*8, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, bsize*2 ];
+	st = [ bsize*8, -bsize*8, -bsize*4, -bsize*4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, singleton dimensions)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 4 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, singleton dimensions, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 4 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, contiguous)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, contiguous, negative strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 2, 1, 2, 2 ];
+	st = [ -1, -2, -4, -4, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1, 2 ];
+	st = [ 2, 4, 4, 8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1, 2 ];
+	st = [ 2, -4, -4, -8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2, 1, 2 ];
+	st = [ -2, bsize*4, -bsize*4, bsize*8, bsize*8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 1, 1, 2 ];
+	st = [ -2, 4, -bsize*8, bsize*8, bsize*8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2, 1, 2 ];
+	st = [ -2, 4, -4, bsize*8, bsize*8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, bsize*2, 2 ];
+	st = [ -2, 4, -4, 4, bsize*8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, bsize*2 ];
+	st = [ -2, 4, -4, 8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, contiguous, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, contiguous, negative strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1, 2 ];
+	st = [ -1, -2, -2, -4, -4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1, 2 ];
+	st = [ 2, 4, 4, 8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1, 2 ];
+	st = [ 2, 4, -4, -8, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2, 1, 2 ];
+	st = [ -2, bsize*4, -bsize*4, bsize*8, bsize*8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 2, 1, 1 ];
+	st = [ -2, 4, -bsize*8, bsize*16, bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2, 1, 2 ];
+	st = [ -2, 4, -4, bsize*8, bsize*8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, bsize*2, 2 ];
+	st = [ -2, -4, -4, 4, bsize*8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, bsize*2 ];
+	st = [ 2, 4, -4, 8, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, contiguous, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, contiguous, negative strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1, 2 ];
+	st = [ -1, -2, -2, -4, -4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1, 2 ];
+	st = [ 2, 4, 4, 8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1, 2 ];
+	st = [ 2, -4, -4, -8, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2, 1, 2 ];
+	st = [ -2, bsize*4, -bsize*4, bsize*8, bsize*8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 2, 1, 1 ];
+	st = [ -2, 4, -bsize*8, bsize*16, bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2, 1, 2 ];
+	st = [ -2, 4, -4, bsize*8, bsize*8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, bsize*2, 2 ];
+	st = [ -2, -4, -4, 4, bsize*8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, bsize*2 ];
+	st = [ 2, 4, -4, 8, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/test/test.6d.js b/lib/node_modules/@stdlib/ndarray/base/some/test/test.6d.js
new file mode 100644
index 000000000000..bf7dfdafa42f
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/test/test.6d.js
@@ -0,0 +1,2198 @@
+/**
+* @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 tape = require( 'tape' );
+var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+var zeros = require( '@stdlib/array/zeros' );
+var ones = require( '@stdlib/array/ones' );
+var scalar2ndarray = require( '@stdlib/ndarray/from-scalar' );
+var numel = require( '@stdlib/ndarray/base/numel' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var strides2offset = require( '@stdlib/ndarray/base/strides2offset' );
+var ndarray = require( '@stdlib/ndarray/ctor' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+var some = require( './../lib' );
+
+
+// TESTS //
+
+tape( 'main export is a function', function test( t ) {
+	t.ok( true, __filename );
+	t.strictEqual( typeof some, 'function', 'main export is a function');
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, singleton dimensions)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 4, 1, 1, 1, 1, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, singleton dimensions, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 4, 1, 1, 1, 1, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, contiguous)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 2, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, contiguous, negative strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 2, 2, 1, 2 ];
+	st = [ -8, -8, -4, -2, -2, -1 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, 16, 8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, -16, 8, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2, 1, 1, 2 ];
+	st = [ 8, -8, -4, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 1, 1, 1, 2 ];
+	st = [ bsize*8, -4, -4, 4, 4, -2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2, 1, 1, 2 ];
+	st = [ bsize*8, bsize*8, -4, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, bsize*2, 1, 2 ];
+	st = [ bsize*8, bsize*8, -bsize*8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, 1, bsize*2, 2 ];
+	st = [ bsize*8, -bsize*8, -bsize*8, -bsize*8, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, bsize*2 ];
+	st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, bsize*4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, contiguous, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 1, 1, 2, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, contiguous, negative strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 1, 1, 2, 2, 1, 2 ];
+	st = [ -8, -8, -4, -2, -2, -1 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, 16, 8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, -16, 8, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2, 1, 1, 2 ];
+	st = [ 8, -8, -4, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 1, 1, 1, 2 ];
+	st = [ -bsize*8, -4, -4, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2, 1, 1, 2 ];
+	st = [ bsize*8, bsize*8, -4, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, bsize*2, 1, 2 ];
+	st = [ bsize*8, -bsize*8, -bsize*8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, 1, bsize*2, 2 ];
+	st = [ bsize*8, -bsize*8, -bsize*8, -bsize*8, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, bsize*2 ];
+	st = [ bsize*8, -bsize*8, -bsize*4, -bsize*4, bsize*4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, contiguous, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 2, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, contiguous, negative strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 2, 2, 1, 2 ];
+	st = [ -8, -8, -4, -2, -2, -1 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, 16, 8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, 16, 8, -4, -4, -2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2, 1, 1, 2 ];
+	st = [ 8, -8, -4, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 1, 1, 1, 2 ];
+	st = [ -bsize*8, -4, -4, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2, 1, 1, 2 ];
+	st = [ bsize*8, bsize*8, -4, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, bsize*2, 1, 2 ];
+	st = [ bsize*8, -bsize*8, -bsize*8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, 1, bsize*2, 2 ];
+	st = [ bsize*8, -bsize*8, -bsize*8, -bsize*8, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, bsize*2 ];
+	st = [ bsize*8, -bsize*8, -bsize*4, -bsize*4, bsize*4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, singleton dimensions)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 4 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, singleton dimensions, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 4 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, contiguous)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 2, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, contiguous, negative strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 2, 2, 1, 2 ];
+	st = [ -1, -1, -1, -2, -4, -4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, 2, 4, 8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, -2, 2, -4, 8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 1, 2, 1, 2 ];
+	st = [ 2, bsize*4, bsize*4, -bsize*4, bsize*8, -bsize*8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 1, 1, 1, 2 ];
+	st = [ 2, 4, bsize*8, -bsize*8, bsize*8, -bsize*8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2, 1, 1, 2 ];
+	st = [ 2, 4, 4, -bsize*8, bsize*8, -bsize*8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, bsize*2, 1, 2 ];
+	st = [ 2, 4, 4, -4, bsize*8, -bsize*8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, 2, bsize*2, 1 ];
+	st = [ 2, 4, 4, -4, 8, -bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, bsize*2 ];
+	st = [ 2, 4, 4, -8, 8, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, contiguous, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 1, 1, 2, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, contiguous, negative strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 1, 1, 2, 2, 1, 2 ];
+	st = [ -1, -1, -1, -2, -4, -4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, 2, 4, 8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, 2, -4, -8, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2, 1, 1, 2 ];
+	st = [ 2, bsize*4, bsize*4, -bsize*8, bsize*8, -bsize*8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 1, 1, 1, 2 ];
+	st = [ 2, 4, bsize*8, -bsize*8, bsize*8, -bsize*8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2, 1, 1, 2 ];
+	st = [ 2, 4, 4, -bsize*8, bsize*8, -bsize*8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, bsize*2, 1, 2 ];
+	st = [ 2, 4, 4, -4, bsize*8, -bsize*8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, 2, bsize*2, 1 ];
+	st = [ 2, 4, 4, -4, 8, -bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, bsize*2 ];
+	st = [ 2, 4, 4, -8, 8, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, contiguous, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 2, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, contiguous, negative strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 2, 2, 1, 2 ];
+	st = [ -1, -1, -1, -2, -4, -4 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, 2, 4, 8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, 2, -4, -8, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2, 1, 1, 2 ];
+	st = [ 2, bsize*4, bsize*4, -bsize*8, bsize*8, -bsize*8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 1, 1, 1, 2 ];
+	st = [ 2, 4, bsize*8, -bsize*8, bsize*8, -bsize*8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2, 1, 1, 2 ];
+	st = [ 2, 4, 4, -bsize*8, bsize*8, -bsize*8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, bsize*2, 1, 2 ];
+	st = [ 2, 4, 4, -4, bsize*8, -bsize*8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, 2, bsize*2, 1 ];
+	st = [ 2, 4, 4, -4, 8, -bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, bsize*2 ];
+	st = [ 2, 4, 4, -8, 8, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/test/test.7d.js b/lib/node_modules/@stdlib/ndarray/base/some/test/test.7d.js
new file mode 100644
index 000000000000..e10cbf487b76
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/test/test.7d.js
@@ -0,0 +1,2408 @@
+/**
+* @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 tape = require( 'tape' );
+var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+var zeros = require( '@stdlib/array/zeros' );
+var ones = require( '@stdlib/array/ones' );
+var scalar2ndarray = require( '@stdlib/ndarray/from-scalar' );
+var numel = require( '@stdlib/ndarray/base/numel' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var strides2offset = require( '@stdlib/ndarray/base/strides2offset' );
+var ndarray = require( '@stdlib/ndarray/ctor' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+var some = require( './../lib' );
+
+
+// TESTS //
+
+tape( 'main export is a function', function test( t ) {
+	t.ok( true, __filename );
+	t.strictEqual( typeof some, 'function', 'main export is a function');
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, singleton dimensions)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 4, 1, 1, 1, 1, 1, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, singleton dimensions, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 4, 1, 1, 1, 1, 1, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, contiguous)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, contiguous, negative strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ -8, -8, -8, -4, -2, -2, -1 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, same sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, 16, 16, 8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, mixed sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, 16, -16, 8, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2, 1, 2, 1, 2 ];
+	st = [ 16, -16, 8, 8, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 1, 2, 1, 1, 2 ];
+	st = [ bsize*16, -8, 8, 4, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2, 1, 2, 1, 2 ];
+	st = [ bsize*16, -bsize*16, 8, 8, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, bsize*2, 1, 1, 2 ];
+	st = [ bsize*16, -bsize*16, bsize*8, 4, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, bsize*2, 1, 2 ];
+	st = [ bsize*16, -bsize*16, bsize*8, bsize*8, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, bsize*2, 2 ];
+	st = [ bsize*16, -bsize*16, -bsize*8, bsize*8, bsize*8, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, 1, bsize*2 ];
+	st = [ bsize*16, -bsize*16, -bsize*8, bsize*8, bsize*4, bsize*4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, contiguous, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, contiguous, negative strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 2, 1, 2, 1, 2, 1, 2 ];
+	st = [ -8, -8, -4, -4, -2, -2, -1 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, same sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, 16, 16, 8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ -16, 16, -16, -8, -4, 2, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2, 1, 2, 1, 2 ];
+	st = [ 16, -16, 8, 8, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 1, 1, 2, 1, 2 ];
+	st = [ bsize*16, -8, 8, 8, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2, 1, 2, 1, 2 ];
+	st = [ bsize*16, bsize*16, 8, 8, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, bsize*2, 1, 1, 2 ];
+	st = [ bsize*16, -bsize*16, -bsize*8, 4, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, bsize*2, 1, 2 ];
+	st = [ bsize*16, -bsize*16, bsize*8, bsize*8, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, 2, 1, bsize*2, 2 ];
+	st = [ bsize*16, -bsize*16, -bsize*16, -bsize*8, bsize*8, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, 1, bsize*2 ];
+	st = [ bsize*16, -bsize*16, bsize*8, bsize*8, bsize*4, bsize*4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, contiguous, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, contiguous, negative strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 2, 1, 2, 1, 2, 1, 2 ];
+	st = [ -8, -8, -4, -4, -2, -2, -1 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, same sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, 16, 16, 8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ -16, 16, -16, 8, -4, -2, -2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2, 1, 2, 1, 2 ];
+	st = [ 16, -16, 8, 8, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 1, 1, 2, 1, 2 ];
+	st = [ -bsize*16, -8, 8, 8, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2, 1, 2, 1, 2 ];
+	st = [ bsize*16, -bsize*16, -8, 8, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, bsize*2, 1, 1, 2 ];
+	st = [ bsize*16, -bsize*16, bsize*8, 4, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, bsize*2, 1, 2 ];
+	st = [ bsize*16, -bsize*16, -bsize*8, -bsize*8, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, 2, 1, bsize*2, 2 ];
+	st = [ bsize*16, -bsize*16, bsize*16, bsize*8, -bsize*8, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, 1, bsize*2 ];
+	st = [ bsize*16, -bsize*16, bsize*8, bsize*8, -bsize*4, bsize*4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, singleton dimensions)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 4 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, singleton dimensions, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 4 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, contiguous)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, contiguous, negative strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1, 2, 1, 2 ];
+	st = [ -1, -2, -2, -4, -4, -8, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, same sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, 2, 2, 4, 8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, mixed sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, -2, 2, -4, 8, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2, 1, 2, 1, 2 ];
+	st = [ 2, -bsize*4, bsize*4, bsize*8, bsize*8, bsize*16, bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 1, 2, 1, 2, 1 ];
+	st = [ 2, -4, bsize*8, -bsize*8, bsize*16, -bsize*16, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2, 1, 2, 1, 2 ];
+	st = [ 2, -4, -4, bsize*8, bsize*8, bsize*16, bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, bsize*2, 2, 1, 2 ];
+	st = [ 2, -4, -4, 4, bsize*8, bsize*16, bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, bsize*2, 1, 2 ];
+	st = [ 2, -4, -4, 8, 8, bsize*16, bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, bsize*2, 2 ];
+	st = [ 2, -4, -4, 8, 8, 8, bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, 1, bsize*2 ];
+	st = [ 2, -4, -4, 8, 8, 16, 16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, contiguous, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, contiguous, negative strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1, 2, 1, 2 ];
+	st = [ -1, -2, -2, -4, -4, -8, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, same sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, 2, 2, 4, 8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, 2, -2, -4, -8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2, 1, 2, 1, 2 ];
+	st = [ 2, bsize*4, bsize*4, -bsize*8, bsize*8, -bsize*16, bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 1, 1, 2, 1, 2 ];
+	st = [ 2, 4, -bsize*8, bsize*8, bsize*8, bsize*16, bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2, 1, 2, 1, 2 ];
+	st = [ 2, -4, 4, -bsize*8, bsize*8, -bsize*16, bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, bsize*2, 1, 2, 2 ];
+	st = [ 2, -4, -4, 4, bsize*8, bsize*8, bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, bsize*2, 1, 2 ];
+	st = [ 2, -4, -4, 8, 8, bsize*16, bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, bsize*2, 2 ];
+	st = [ 2, -4, -4, 8, 8, 8, bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, 1, bsize*2 ];
+	st = [ 2, -4, -4, 8, 8, 16, 16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, contiguous, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, contiguous, negative strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1, 2, 1, 2 ];
+	st = [ -1, -2, -2, -4, -4, -8, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, same sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, 2, 2, 4, 8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, 2, 2, -4, -8, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2, 1, 2, 1, 2 ];
+	st = [ 2, -bsize*4, -bsize*4, bsize*8, bsize*8, bsize*16, bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 1, 1, 2, 1, 2 ];
+	st = [ 2, -4, -bsize*8, bsize*8, bsize*8, bsize*16, bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2, 1, 2, 1, 2 ];
+	st = [ 2, -4, -4, bsize*8, bsize*8, bsize*16, bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, bsize*2, 1, 2, 2 ];
+	st = [ 2, -4, -4, 4, bsize*8, bsize*8, bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, bsize*2, 1, 2 ];
+	st = [ 2, -4, -4, 8, 8, bsize*16, bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, bsize*2, 2 ];
+	st = [ 2, -4, -4, 8, 8, 8, bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, 1, bsize*2 ];
+	st = [ 2, -4, -4, 8, 8, 16, 16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/test/test.8d.js b/lib/node_modules/@stdlib/ndarray/base/some/test/test.8d.js
new file mode 100644
index 000000000000..b9a301dcbea5
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/test/test.8d.js
@@ -0,0 +1,2645 @@
+/**
+* @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 tape = require( 'tape' );
+var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+var zeros = require( '@stdlib/array/zeros' );
+var ones = require( '@stdlib/array/ones' );
+var scalar2ndarray = require( '@stdlib/ndarray/from-scalar' );
+var numel = require( '@stdlib/ndarray/base/numel' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var strides2offset = require( '@stdlib/ndarray/base/strides2offset' );
+var ndarray = require( '@stdlib/ndarray/ctor' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+var some = require( './../lib' );
+
+
+// TESTS //
+
+tape( 'main export is a function', function test( t ) {
+	t.ok( true, __filename );
+	t.strictEqual( typeof some, 'function', 'main export is a function');
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, singleton dimensions)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 4, 1, 1, 1, 1, 1, 1, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, singleton dimensions, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 4, 1, 1, 1, 1, 1, 1, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, contiguous)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, contiguous, negative strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ -8, -8, -8, -8, -4, -2, -2, -1 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, 16, 16, 16, 8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, 16, 16, -16, 8, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 2, 2, 1, 1, 2, 1, 2 ];
+	st = [ 32, -16, 8, -8, -8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 2, 1, 1, 2, 1, 2 ];
+	st = [ -bsize*32, -16, 8, -8, -8, 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2, 2, 1, 2, 1, 2 ];
+	st = [ -bsize*32, -bsize*32, 16, -8, -8, 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, bsize*2, 2, 2, 1, 2 ];
+	st = [ -bsize*32, -bsize*32, bsize*32, -16, -8, 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, bsize*2, 2, 1, 2 ];
+	st = [ -bsize*32, -bsize*32, bsize*16, -bsize*16, -8, 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, bsize*2, 2, 2 ];
+	st = [ -bsize*32, -bsize*32, -bsize*16, -bsize*16, -bsize*16, 8, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 1, bsize*2, 2 ];
+	st = [ -bsize*16, -bsize*16, -bsize*8, bsize*8, bsize*8, bsize*8, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 2, 1, bsize*2 ];
+	st = [
+		-bsize*16,
+		-bsize*16,
+		-bsize*8,
+		bsize*8,
+		bsize*8,
+		bsize*4,
+		bsize*4,
+		2
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, contiguous, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, contiguous, negative strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ -8, -8, -8, -8, -4, -2, -2, -1 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, 16, 16, 16, 8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, -16, 16, -16, -8, -4, 2, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 2, 2, 1, 1, 2, 1, 2 ];
+	st = [ 32, 16, 8, -8, -8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 2, 1, 1, 2, 1, 2 ];
+	st = [ -bsize*32, -16, 8, -8, -8, 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2, 2, 1, 2, 1, 2 ];
+	st = [ bsize*32, bsize*32, 16, 8, -8, 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, bsize*2, 2, 2, 1, 2 ];
+	st = [ bsize*32, -bsize*32, -bsize*32, -16, -8, 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, bsize*2, 2, 1, 2 ];
+	st = [ bsize*32, -bsize*32, bsize*16, -bsize*16, -8, 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, bsize*2, 2, 2 ];
+	st = [ bsize*32, -bsize*32, -bsize*16, -bsize*16, bsize*16, 8, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 1, bsize*2, 2 ];
+	st = [ -bsize*16, -bsize*16, bsize*8, -bsize*8, -bsize*8, bsize*8, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 2, 1, bsize*2 ];
+	st = [
+		-bsize*16,
+		-bsize*16,
+		bsize*8,
+		-bsize*8,
+		-bsize*8,
+		bsize*4,
+		bsize*4,
+		2
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, contiguous, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, contiguous, negative strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ -8, -8, -8, -8, -4, -2, -2, -1 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, 16, 16, 16, 8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, -16, 16, -16, 8, -4, -2, -2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 2, 2, 1, 1, 2, 1, 2 ];
+	st = [ 32, 16, 8, -8, -8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 2, 1, 1, 2, 1, 2 ];
+	st = [ -bsize*32, -16, 8, -8, -8, 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, bsize*2, 2, 1, 2, 1, 2 ];
+	st = [ -bsize*32, -bsize*32, 16, -8, -8, 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, bsize*2, 2, 2, 1, 2 ];
+	st = [ -bsize*32, bsize*32, -bsize*32, -16, -8, 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, bsize*2, 2, 1, 2 ];
+	st = [ -bsize*32, -bsize*32, -bsize*16, -bsize*16, -8, 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, bsize*2, 2, 2 ];
+	st = [ -bsize*32, -bsize*32, bsize*16, bsize*16, -bsize*16, 8, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 1, bsize*2, 2 ];
+	st = [ -bsize*16, -bsize*16, bsize*8, bsize*8, -bsize*8, bsize*8, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 2, 1, bsize*2 ];
+	st = [
+		-bsize*16,
+		-bsize*16,
+		bsize*8,
+		bsize*8,
+		-bsize*8,
+		bsize*4,
+		-bsize*4,
+		2
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, singleton dimensions)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 1, 4 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, singleton dimensions, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 1, 4 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, contiguous)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, contiguous, negative strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 2, 2, 1, 2, 1 ];
+	st = [ -1, -1, -1, -1, -2, -4, -4, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, 2, 2, 2, 4, 8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, 2, -2, 2, -4, 8, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2, 1, 1, 2, 1, 2 ];
+	st = [ 2, -bsize*4, bsize*4, bsize*8, bsize*8, bsize*8, bsize*16, bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 1, 1, 1, 2, 1, 2 ];
+	st = [ 2, -4, bsize*8, -bsize*8, bsize*8, bsize*8, -bsize*16, bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 2, bsize*2, 1, 1, 2, 1, 2 ];
+	st = [ 2, 4, 8, bsize*16, bsize*16, bsize*16, bsize*32, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, bsize*2, 1, 2, 1, 2 ];
+	st = [ 2, 4, 4, 8, bsize*16, bsize*16, bsize*32, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 2, bsize*2, 1, 1, 2 ];
+	st = [ 2, 4, 4, 8, 16, bsize*32, bsize*32, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, bsize*2, 1, 2 ];
+	st = [ 2, -4, -4, 8, 8, 16, bsize*32, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2 ];
+	st = [ 2, 4, 4, 8, 8, 8, 16, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 2, 2, bsize*2 ];
+	st = [ 2, 4, 4, 8, 8, 8, 16, 32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, contiguous, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 2, 2, 1, 2, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, contiguous, negative strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 2, 2, 1, 2, 1 ];
+	st = [ -1, -1, -1, -1, -2, -4, -4, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, 2, 2, 2, 4, 8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ -2, 2, -2, 2, 2, -4, -8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2, 1, 1, 2, 1, 2 ];
+	st = [ 2, bsize*4, bsize*4, -bsize*8, bsize*8, bsize*8, bsize*16, bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 1, 1, 1, 2, 1, 2 ];
+	st = [ 2, -4, -bsize*8, bsize*8, bsize*8, bsize*8, bsize*16, bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 2, bsize*2, 1, 1, 2, 1, 2 ];
+	st = [ 2, 4, 8, -bsize*16, bsize*16, -bsize*16, bsize*32, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, bsize*2, 1, 2, 1, 2 ];
+	st = [ 2, 4, 4, 8, bsize*16, bsize*16, bsize*32, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 2, bsize*2, 1, 1, 2 ];
+	st = [ 2, 4, 4, 8, 16, bsize*32, bsize*32, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, bsize*2, 1, 2 ];
+	st = [ 2, 4, 4, 8, 8, 16, bsize*32, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2 ];
+	st = [ 2, 4, 4, 8, 8, 8, 16, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 2, 2, bsize*2 ];
+	st = [ 2, 4, 4, 8, 8, 8, 16, 32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, contiguous, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, contiguous, negative strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 2, 2, 1, 2, 1 ];
+	st = [ -1, -1, -1, -1, -2, -4, -4, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, 2, 2, 2, 4, 8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, 2, 2, 2, -4, -8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 1, 2, 1, 1, 2, 1, 2 ];
+	st = [ 2, -bsize*4, -bsize*4, bsize*8, bsize*8, bsize*8, bsize*16, bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 1, 1, 1, 2, 1, 2 ];
+	st = [ 2, -4, bsize*8, bsize*8, bsize*8, bsize*8, bsize*16, bsize*16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 2, bsize*2, 1, 1, 2, 1, 2 ];
+	st = [ 2, -4, -8, bsize*16, bsize*16, bsize*16, bsize*32, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, bsize*2, 1, 2, 1, 2 ];
+	st = [ 2, -4, -4, 8, bsize*16, bsize*16, bsize*32, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 2, bsize*2, 1, 1, 2 ];
+	st = [ 2, -4, -4, 8, 16, bsize*32, bsize*32, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, bsize*2, 1, 2 ];
+	st = [ 2, -4, -4, 8, 8, 16, bsize*32, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2 ];
+	st = [ 2, -4, -4, 8, 8, 8, 16, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 2, 2, bsize*2 ];
+	st = [ 2, 4, 4, 8, 8, 8, 16, 32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/test/test.9d.js b/lib/node_modules/@stdlib/ndarray/base/some/test/test.9d.js
new file mode 100644
index 000000000000..c6a3115b3c86
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/test/test.9d.js
@@ -0,0 +1,2978 @@
+/**
+* @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 tape = require( 'tape' );
+var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+var zeros = require( '@stdlib/array/zeros' );
+var ones = require( '@stdlib/array/ones' );
+var scalar2ndarray = require( '@stdlib/ndarray/from-scalar' );
+var numel = require( '@stdlib/ndarray/base/numel' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var strides2offset = require( '@stdlib/ndarray/base/strides2offset' );
+var ndarray = require( '@stdlib/ndarray/ctor' );
+var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
+var some = require( './../lib' );
+
+
+// TESTS //
+
+tape( 'main export is a function', function test( t ) {
+	t.ok( true, __filename );
+	t.strictEqual( typeof some, 'function', 'main export is a function');
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, singleton dimensions)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 4, 1, 1, 1, 1, 1, 1, 1, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, singleton dimensions, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 4, 1, 1, 1, 1, 1, 1, 1, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, contiguous)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, contiguous, negative strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ -8, -8, -8, -8, -8, -4, -2, -2, -1 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, 16, 16, 16, 16, 8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, 16, 16, 16, -16, 8, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 2, 2, 1, 1, 2, 1, 1, 2 ];
+	st = [ 32, -16, 8, -8, -8, 4, 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 2, 1, 1, 2, 1, 1, 2 ];
+	st = [ -bsize*32, -16, 8, -8, -8, 4, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 1, 2, bsize*2, 2, 1, 2, 1, 1, 2 ];
+	st = [ -bsize*64, -bsize*32, 16, -8, -8, 4, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, bsize*2, 2, 2, 1, 1, 2 ];
+	st = [ bsize*64, -bsize*64, -bsize*32, 16, 8, -4, 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 2, bsize*2, 2, 1, 1, 2 ];
+	st = [ -bsize*64, -bsize*64, bsize*32, -bsize*16, -8, 4, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, bsize*2, 2, 1, 2 ];
+	st = [ -bsize*64, -bsize*64, -bsize*32, -bsize*32, -bsize*16, 8, -4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2, 2 ];
+	st = [
+		-bsize*64,
+		-bsize*64,
+		-bsize*32,
+		bsize*32,
+		bsize*32,
+		bsize*16,
+		8,
+		-4,
+		2
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 1, 2, bsize*2, 2 ];
+	st = [
+		-bsize*32,
+		-bsize*32,
+		-bsize*16,
+		bsize*16,
+		bsize*16,
+		-bsize*16,
+		bsize*8,
+		4,
+		2
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, 1, 1, 2, bsize*2 ];
+	st = [
+		-bsize*32,
+		-bsize*32,
+		-bsize*16,
+		bsize*16,
+		bsize*8,
+		-bsize*8,
+		bsize*8,
+		bsize*4,
+		2
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, contiguous, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, contiguous, negative strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ -8, -8, -8, -8, -8, -4, -2, -2, -1 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, 16, 16, 16, 16, 8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, 16, 16, -16, 16, -8, -4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 2, 2, 1, 1, 2, 1, 1, 2 ];
+	st = [ 32, -16, -8, 8, 8, -4, 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 2, 1, 1, 2, 1, 1, 2 ];
+	st = [ bsize*32, -16, -8, 8, 8, -4, 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 2, bsize*2, 2, 1, 2, 1, 1, 2 ];
+	st = [ bsize*64, -bsize*32, -16, 8, 8, -4, 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, bsize*2, 2, 2, 1, 1, 2 ];
+	st = [ bsize*64, -bsize*64, -bsize*32, 16, 8, -4, 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 2, bsize*2, 2, 1, 1, 2 ];
+	st = [ bsize*64, -bsize*64, -bsize*32, bsize*16, 8, -4, 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, bsize*2, 2, 1, 2 ];
+	st = [ bsize*64, -bsize*64, -bsize*32, bsize*32, bsize*16, -8, 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2, 2 ];
+	st = [
+		bsize*64,
+		-bsize*64,
+		-bsize*32,
+		bsize*32,
+		bsize*32,
+		-bsize*16,
+		8,
+		-4,
+		2
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 1, 2, bsize*2, 2 ];
+	st = [
+		-bsize*32,
+		-bsize*32,
+		-bsize*16,
+		bsize*16,
+		bsize*16,
+		-bsize*16,
+		bsize*8,
+		4,
+		2
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, 1, 1, 2, bsize*2 ];
+	st = [
+		-bsize*32,
+		-bsize*32,
+		-bsize*16,
+		bsize*16,
+		bsize*8,
+		-bsize*8,
+		bsize*8,
+		bsize*4,
+		2
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, contiguous, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, contiguous, negative strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ -8, -8, -8, -8, -8, -4, -2, -2, -1 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, 16, 16, 16, 16, 8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 16, 16, 16, -16, 16, -8, -4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 2, 2, 1, 1, 2, 1, 1, 2 ];
+	st = [ 32, -16, -8, 8, 8, -4, 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 2, 1, 1, 2, 1, 1, 2 ];
+	st = [ bsize*32, -16, -8, 8, 8, -4, 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 2, bsize*2, 2, 1, 2, 1, 1, 2 ];
+	st = [ bsize*64, -bsize*32, -16, 8, 8, -4, 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, bsize*2, 2, 2, 1, 1, 2 ];
+	st = [ bsize*64, -bsize*64, -bsize*32, 16, 8, -4, 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 2, bsize*2, 2, 1, 1, 2 ];
+	st = [ bsize*64, -bsize*64, -bsize*32, bsize*16, 8, -4, 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, bsize*2, 2, 1, 2 ];
+	st = [ bsize*64, -bsize*64, -bsize*32, bsize*32, bsize*16, -8, 4, -4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2, 2 ];
+	st = [
+		bsize*64,
+		-bsize*64,
+		-bsize*32,
+		bsize*32,
+		bsize*32,
+		-bsize*16,
+		8,
+		-4,
+		2
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 1, 2, bsize*2, 2 ];
+	st = [
+		-bsize*32,
+		-bsize*32,
+		-bsize*16,
+		bsize*16,
+		bsize*16,
+		-bsize*16,
+		bsize*8,
+		4,
+		2
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, 1, 1, 2, bsize*2 ];
+	st = [
+		-bsize*32,
+		-bsize*32,
+		-bsize*16,
+		bsize*16,
+		bsize*8,
+		-bsize*8,
+		bsize*8,
+		bsize*4,
+		2
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, singleton dimensions)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 4 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, singleton dimensions, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 4 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, contiguous)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, contiguous, negative strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 2, 1, 2, 1, 1, 1, 1, 1 ];
+	st = [ -1, -2, -4, -4, -8, -8, -8, -8, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, 2, 2, 2, 2, 4, 8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, 2, 2, 2, -2, -4, 8, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 2, 2, 1, 1, 2, 1, 1, 2 ];
+	st = [
+		2,
+		bsize*4,
+		bsize*8,
+		bsize*16,
+		bsize*16,
+		bsize*16,
+		bsize*32,
+		bsize*32,
+		bsize*32
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 2, 1, 1, 1, 1, 1, 2 ];
+	st = [
+		2,
+		4,
+		bsize*8,
+		bsize*16,
+		bsize*16,
+		bsize*16,
+		bsize*16,
+		bsize*16,
+		bsize*16
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 2, bsize*2, 2, 1, 1, 1, 1, 2 ];
+	st = [ 2, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32, bsize*32, bsize*32 ]; // eslint-disable-line max-len
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, bsize*2, 2, 1, 1, 1, 2 ];
+	st = [ 2, 4, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, 2, bsize*2, 2, 1, 1, 2 ];
+	st = [ 2, 4, 4, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, bsize*2, 2, 1, 2 ];
+	st = [ 2, 4, 4, 8, 8, 16, bsize*32, bsize*64, bsize*64 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2, 2 ];
+	st = [ 2, 4, 4, 8, 8, 8, 16, bsize*32, bsize*64 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 1, 2, bsize*2, 2 ];
+	st = [ 2, 4, 4, 8, 8, 8, 8, 16, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 1, 2, 2, bsize*2 ];
+	st = [ 2, 4, 4, 8, 8, 8, 8, 16, 32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, contiguous, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 2, 2, 1, 2, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, contiguous, negative strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 2, 2, 1, 2, 1, 1, 1, 1, 1 ];
+	st = [ -1, -2, -4, -4, -8, -8, -8, -8, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, 2, 2, 2, 2, 4, 8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, -2, 2, -2, 2, 1, -4, -8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 2, 2, 1, 1, 2, 1, 1, 2 ];
+	st = [
+		2,
+		bsize*4,
+		bsize*8,
+		bsize*16,
+		bsize*16,
+		bsize*16,
+		bsize*32,
+		bsize*32,
+		bsize*32
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 2, 1, 1, 1, 1, 1, 2 ];
+	st = [
+		2,
+		4,
+		bsize*8,
+		bsize*16,
+		bsize*16,
+		bsize*16,
+		bsize*16,
+		bsize*16,
+		bsize*16
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 2, bsize*2, 2, 1, 1, 1, 1, 2 ];
+	st = [ 2, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32, bsize*32, bsize*32 ]; // eslint-disable-line max-len
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, bsize*2, 2, 1, 1, 1, 2 ];
+	st = [ 2, 4, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, 2, bsize*2, 2, 1, 1, 2 ];
+	st = [ 2, 4, 4, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, bsize*2, 2, 1, 2 ];
+	st = [ 2, 4, 4, 8, 8, 16, bsize*32, bsize*64, bsize*64 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2, 2 ];
+	st = [ 2, 4, 4, 8, 8, 8, 16, bsize*32, bsize*64 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 1, 2, bsize*2, 2 ];
+	st = [ 2, 4, 4, 8, 8, 8, 8, 16, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 1, 2, 2, bsize*2 ];
+	st = [ 2, 4, 4, 8, 8, 8, 8, 16, 32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, contiguous, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, contiguous, negative strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 2, 1, 2, 1, 1, 1, 1, 1 ];
+	st = [ -1, -2, -4, -4, -8, -8, -8, -8, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, 2, 2, 2, 2, 4, 8, 8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
+	st = [ 2, 2, 2, 2, 2, -2, -4, 8, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ bsize*2, 2, 2, 1, 1, 2, 1, 1, 2 ];
+	st = [
+		2,
+		bsize*4,
+		bsize*8,
+		bsize*16,
+		bsize*16,
+		bsize*16,
+		bsize*32,
+		bsize*32,
+		bsize*32
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, bsize*2, 2, 1, 1, 1, 1, 1, 2 ];
+	st = [
+		2,
+		4,
+		bsize*8,
+		bsize*16,
+		bsize*16,
+		bsize*16,
+		bsize*16,
+		bsize*16,
+		bsize*16
+	];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 2, bsize*2, 2, 1, 1, 1, 1, 2 ];
+	st = [ 2, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32, bsize*32, bsize*32 ]; // eslint-disable-line max-len
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, bsize*2, 2, 1, 1, 1, 2 ];
+	st = [ 2, 4, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 1, 2, bsize*2, 2, 1, 1, 2 ];
+	st = [ 2, 4, 4, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 2, bsize*2, 2, 1, 2 ];
+	st = [ 2, 4, 4, 8, 8, 16, bsize*32, bsize*64, bsize*64 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2, 2 ];
+	st = [ 2, 4, 4, 8, 8, 8, 16, bsize*32, bsize*64 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 1, 2, bsize*2, 2 ];
+	st = [ 2, 4, 4, 8, 8, 8, 8, 16, bsize*32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
+	var actual;
+	var bsize;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+
+	bsize = blockSize( dt );
+	sh = [ 2, 1, 2, 1, 1, 1, 2, 2, bsize*2 ];
+	st = [ 2, 4, 4, 8, 8, 8, 8, 16, 32 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/test/test.js b/lib/node_modules/@stdlib/ndarray/base/some/test/test.js
new file mode 100644
index 000000000000..88e1c61eaa67
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/test/test.js
@@ -0,0 +1,69 @@
+/**
+* @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 tape = require( 'tape' );
+var ones = require( '@stdlib/array/ones' );
+var zeros = require( '@stdlib/array/zeros' );
+var scalar2ndarray = require( '@stdlib/ndarray/from-scalar' );
+var ndarray = require( '@stdlib/ndarray/ctor' );
+var some = require( './../lib' );
+
+
+// TESTS //
+
+tape( 'main export is a function', function test( t ) {
+	t.ok( true, __filename );
+	t.strictEqual( typeof some, 'function', 'main export is a function' );
+	t.end();
+});
+
+tape( 'the function returns `false` if provided an empty input ndarray', function test( t ) {
+	var actual;
+	var x;
+	var n;
+
+	x = ndarray( 'float64', ones( 8, 'float64' ), [ 0 ], [ 1 ], 0, 'row-major' );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function returns `true` if a provided `n` parameter is less than zero', function test( t ) {
+	var actual;
+	var x;
+	var n;
+
+	x = ndarray( 'float64', zeros( 2, 'float64' ), [ 2 ], [ 1 ], 0, 'row-major' );
+	n = scalar2ndarray( -1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
diff --git a/lib/node_modules/@stdlib/ndarray/base/some/test/test.nd.js b/lib/node_modules/@stdlib/ndarray/base/some/test/test.nd.js
new file mode 100644
index 000000000000..8c8cf14a1c36
--- /dev/null
+++ b/lib/node_modules/@stdlib/ndarray/base/some/test/test.nd.js
@@ -0,0 +1,711 @@
+/**
+* @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 tape = require( 'tape' );
+var zeros = require( '@stdlib/array/zeros' );
+var ones = require( '@stdlib/array/ones' );
+var scalar2ndarray = require( '@stdlib/ndarray/from-scalar' );
+var Complex128Array = require( '@stdlib/array/complex128' );
+var numel = require( '@stdlib/ndarray/base/numel' );
+var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
+var strides2offset = require( '@stdlib/ndarray/base/strides2offset' );
+var ndarray = require( '@stdlib/ndarray/ctor' );
+var some = require( './../lib' );
+
+
+// TESTS //
+
+tape( 'main export is a function', function test( t ) {
+	t.ok( true, __filename );
+	t.strictEqual( typeof some, 'function', 'main export is a function');
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (row-major, singleton dimensions)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (row-major, singleton dimensions, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (row-major, contiguous)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (row-major, contiguous, negative strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2 ];
+	st = [ -8, -8, -8, -8, -8, -8, -4, -4, -2, -2, -1 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2 ];
+	st = [ 16, 16, 16, 16, 16, 16, 8, 8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2 ];
+	st = [ 16, 16, 16, 16, 16, 16, 8, -8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (row-major, contiguous, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (row-major, contiguous, negative strides, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2 ];
+	st = [ -8, -8, -8, -8, -8, -8, -4, -4, -2, -2, -1 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2 ];
+	st = [ 16, 16, 16, 16, 16, 16, 8, 8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'row-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2 ];
+	st = [ 16, 16, 16, 16, 16, 16, -8, 8, 4, 4, 2 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (column-major, singleton dimensions)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (column-major, singleton dimensions, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (column-major, contiguous)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (column-major, contiguous, negative strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1 ];
+	st = [ -1, -2, -2, -4, -4, -8, -8, -8, -8, -8, -8 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1 ];
+	st = [ 2, 4, 4, 8, 8, 16, 16, 16, 16, 16, 16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides)', function test( t ) {
+	var actual;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'float64';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1 ];
+	st = [ -2, 4, 4, 8, 8, 16, 16, 16, 16, 16, 16 ];
+	o = strides2offset( sh, st );
+
+	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (column-major, contiguous, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1 ];
+	st = shape2strides( sh, ord );
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (column-major, contiguous, negative strides, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1 ];
+	st = [ -1, -2, -2, -4, -4, -8, -8, -8, -8, -8, -8 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*2, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1 ];
+	st = [ 2, 4, 4, 8, 8, 16, 16, 16, 16, 16, 16 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});
+
+tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
+	var actual;
+	var xbuf;
+	var ord;
+	var sh;
+	var st;
+	var dt;
+	var o;
+	var x;
+	var n;
+
+	dt = 'complex128';
+	ord = 'column-major';
+	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1 ];
+	st = [ -2, 4, 4, 8, 8, 16, 16, 16, 16, 16, 16 ];
+	o = strides2offset( sh, st );
+
+	xbuf = zeros( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+	n = scalar2ndarray( 1, {
+		'dtype': 'generic'
+	});
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, false, 'returns expected value' );
+
+	xbuf = ones( numel( sh )*4, 'float64' );
+	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
+
+	actual = some( [ x, n ] );
+	t.strictEqual( actual, true, 'returns expected value' );
+
+	t.end();
+});