feat: add blas/ext/base/gcunone

lib/node_modules/@stdlib/blas/ext/base/gcunone/README.md

@@ -0,0 +1,179 @@
+<!--
+
+@license Apache-2.0
+
+Copyright (c) 2026 The Stdlib Authors.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+   http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
+
+-->
+
+# gcunone
+
+> Cumulatively test whether every element in a strided array is falsy.
+
+<section class="intro">
+
+</section>
+
+<!-- /.intro -->
+
+<section class="usage">
+
+## Usage
+
+```javascript
+var gcunone = require( '@stdlib/blas/ext/base/gcunone' );
+```
+
+#### gcunone( N, x, strideX, out, strideOut )
+
+Cumulatively tests whether every element in a strided array is falsy.
+
+```javascript
+var x = [ 0, 0, 1, 1 ];
+var out = [ false, false, false, false ];
+
+gcunone( x.length, x, 1, out, 1 );
+// out => [ true, true, false, false ]
+```
+
+The function has the following parameters:
+
+-   **N**: number of indexed elements.
+-   **x**: input [`Array`][mdn-array] or [`typed array`][mdn-typed-array].
+-   **strideX**: stride length for `x`.
+-   **out**: output [`Array`][mdn-array] or [`typed array`][mdn-typed-array].
+-   **strideOut**: stride length for `out`.
+
+The `N` and stride parameters determine which elements in the strided arrays are accessed at runtime. For example, to cumulatively test every other element:
+
+```javascript
+var x = [ 0, 0, 0, 0, 1, 0, 1, 0 ];
+var out = [ false, false, false, false ];
+
+gcunone( 4, x, 2, out, 1 );
+// out => [ true, true, false, false ]
+```
+
+Note that indexing is relative to the first index. To introduce an offset, use [`typed array`][mdn-typed-array] views.
+
+<!-- eslint-disable stdlib/capitalized-comments -->
+
+```javascript
+var Uint8Array = require( '@stdlib/array/uint8' );
+
+// Initial arrays...
+var x0 = new Uint8Array( [ 0, 0, 0, 1, 1, 1 ] );
+var o0 = new Uint8Array( x0.length );
+
+// Create offset views...
+var x1 = new Uint8Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); // start at 2nd element
+var o1 = new Uint8Array( o0.buffer, o0.BYTES_PER_ELEMENT*3 ); // start at 4th element
+
+gcunone( 3, x1, 2, o1, 1 );
+// o0 => <Uint8Array>[ 0, 0, 0, 1, 0, 0 ]
+```
+
+#### gcunone.ndarray( N, x, strideX, offsetX, out, strideOut, offsetOut )
+
+Cumulatively tests whether every element in a strided array is falsy using alternative indexing semantics.
+
+```javascript
+var x = [ 0, 0, 1, 1 ];
+var out = [ false, false, false, false ];
+
+gcunone.ndarray( x.length, x, 1, 0, out, 1, 0 );
+// out => [ true, true, false, false ]
+```
+
+The function has the following additional parameters:
+
+-   **offsetX**: starting index for `x`.
+-   **offsetOut**: starting index for `out`.
+
+While [`typed array`][mdn-typed-array] views mandate a view offset based on the underlying buffer, offset parameters support indexing semantics based on starting indices. For example, to cumulatively test every other element starting from the third element:
+
+```javascript
+var x = [ 0, 0, 0, 0, 1, 0, 1, 0 ];
+var out = [ false, false, false ];
+
+gcunone.ndarray( 3, x, 2, 2, out, 1, 0 );
+// out => [ true, false, false ]
+```
+
+</section>
+
+<!-- /.usage -->
+
+<section class="notes">
+
+## Notes
+
+-   If `N <= 0`, both functions return `out` unchanged.
+-   Both functions support array-like objects having getter and setter accessors for array element access (e.g., [`@stdlib/array/base/accessor`][@stdlib/array/base/accessor]).
+
+</section>
+
+<!-- /.notes -->
+
+<section class="examples">
+
+## Examples
+
+<!-- eslint no-undef: "error" -->
+
+```javascript
+var bernoulli = require( '@stdlib/random/array/bernoulli' );
+var filled = require( '@stdlib/array/base/filled' );
+var gcunone = require( '@stdlib/blas/ext/base/gcunone' );
+
+var x = bernoulli( 10, 0.5, {
+    'dtype': 'generic'
+});
+console.log( x );
+
+var out = filled( false, x.length );
+gcunone( x.length, x, 1, out, 1 );
+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 for all links. Make sure to keep an empty line after the `section` element and another before the `/section` close. -->
+
+<section class="links">
+
+[mdn-array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array
+
+[mdn-typed-array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray
+
+[@stdlib/array/base/accessor]: https://github.com/stdlib-js/stdlib/tree/develop/lib/node_modules/%40stdlib/array/base/accessor
+
+<!-- <related-links> -->
+
+<!-- </related-links> -->
+
+</section>
+
+<!-- /.links -->

lib/node_modules/@stdlib/blas/ext/base/gcunone/benchmark/benchmark.js

@@ -0,0 +1,105 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2026 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+'use strict';
+
+// MODULES //
+
+var bench = require( '@stdlib/bench' );
+var bernoulli = require( '@stdlib/random/array/bernoulli' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var filled = require( '@stdlib/array/base/filled' );
+var pow = require( '@stdlib/math/base/special/pow' );
+var format = require( '@stdlib/string/format' );
+var pkg = require( './../package.json' ).name;
+var gcunone = require( './../lib/main.js' );
+
+
+// VARIABLES //
+
+var options = {
+	'dtype': 'generic'
+};
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - array length
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len ) {
+	var out = filled( false, len );
+	var x = bernoulli( len, 0.5, options );
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var v;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			v = gcunone( len, x, 1, out, 1 );
+			if ( typeof v[ i%len ] !== 'boolean' ) {
+				b.fail( 'should return boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( v[ i%len ] ) ) {
+			b.fail( 'should return boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var f;
+	var i;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( i = min; i <= max; i++ ) {
+		len = pow( 10, i );
+		f = createBenchmark( len );
+		bench( format( '%s:len=%d', pkg, len ), f );
+	}
+}
+
+main();

lib/node_modules/@stdlib/blas/ext/base/gcunone/benchmark/benchmark.ndarray.js

@@ -0,0 +1,105 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2026 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+'use strict';
+
+// MODULES //
+
+var bench = require( '@stdlib/bench' );
+var bernoulli = require( '@stdlib/random/array/bernoulli' );
+var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
+var filled = require( '@stdlib/array/base/filled' );
+var pow = require( '@stdlib/math/base/special/pow' );
+var format = require( '@stdlib/string/format' );
+var pkg = require( './../package.json' ).name;
+var gcunone = require( './../lib/ndarray.js' );
+
+
+// VARIABLES //
+
+var options = {
+	'dtype': 'generic'
+};
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - array length
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len ) {
+	var out = filled( false, len );
+	var x = bernoulli( len, 0.5, options );
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var v;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			v = gcunone( len, x, 1, 0, out, 1, 0 );
+			if ( typeof v[ i%len ] !== 'boolean' ) {
+				b.fail( 'should return boolean' );
+			}
+		}
+		b.toc();
+		if ( !isBoolean( v[ i%len ] ) ) {
+			b.fail( 'should return boolean' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var f;
+	var i;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( i = min; i <= max; i++ ) {
+		len = pow( 10, i );
+		f = createBenchmark( len );
+		bench( format( '%s:ndarray:len=%d', pkg, len ), f );
+	}
+}
+
+main();