Auto-generated commit

Author: stdlib-bot

.github/workflows/npm_downloads.yml

@@ -86,8 +86,8 @@ jobs:
 
       # Upload the download data:
       - name: 'Upload data'
-        # Pin action to full length commit SHA corresponding to v3.1.3
-        uses: actions/upload-artifact@a8a3f3ad30e3422c9c7b888a15615d19a852ae32
+        # Pin action to full length commit SHA
+        uses: actions/upload-artifact@5d5d22a31266ced268874388b861e4b58bb5c2f3 # v4.3.1
         with:
           # Define a name for the uploaded artifact (ensuring a unique name for each job):
           name: npm_downloads

.github/workflows/publish.yml

@@ -124,16 +124,10 @@ jobs:
               mv ./package.json.tmp ./package.json
             fi
           done
-          jq -r '.devDependencies | keys[]' ./package.json | while read -r dep; do
-            if [[ "$dep" != "@stdlib"* ]]; then
-              continue
-            fi
-            dep=$(echo "$dep" | xargs)
-            if ! find lib -name "*.js" -exec grep -q "$dep" {} + && ! grep -q -s "$dep" manifest.json && ! grep -q -s "$dep" include.gypi; then
-              jq --indent 2 "del(.devDependencies[\"$dep\"])" ./package.json > ./package.json.tmp
-              mv ./package.json.tmp ./package.json
-            fi
-          done
+
+          # Set `devDependencies` to an empty object:
+          jq --indent 2 '.devDependencies = {}' ./package.json > ./package.json.tmp
+          mv ./package.json.tmp ./package.json
 
           # Remove CLI section:
           find . -type f -name '*.md' -print0 | xargs -0 perl -0777 -i -pe "s/(\* \* \*\n+)?<section class=\"cli\">[\s\S]+?<\!\-\- \/.cli \-\->//"

.github/workflows/test_bundles.yml

@@ -168,8 +168,8 @@ jobs:
 
       # Install Deno:
       - name: 'Install Deno'
-        # Pin action to full length commit SHA corresponding to v1.1.2
-        uses: denoland/setup-deno@61fe2df320078202e33d7d5ad347e7dcfa0e8f31
+        # Pin action to full length commit SHA
+        uses: denoland/setup-deno@041b854f97b325bd60e53e9dc2de9cb9f9ac0cba # v1.1.4
         with:
           deno-version: vx.x.x
 

CONTRIBUTORS

@@ -2,6 +2,7 @@
 #
 # Contributors listed in alphabetical order.
 
+Aditya Sapra <110766802+adityacodes30@users.noreply.github.com>
 Ali Salesi <ali_sal1381@yahoo.com>
 Amit Jimiwal <amitjimiwal45@gmail.com>
 Athan Reines <kgryte@gmail.com>
@@ -13,6 +14,7 @@ Daniel Killenberger <daniel.killenberger@gmail.com>
 Dominik Moritz <domoritz@gmail.com>
 Dorrin Sotoudeh <dorrinsotoudeh123@gmail.com>
 Frank Kovacs <fran70kk@gmail.com>
+GUNJ JOSHI <gunjjoshi8372@gmail.com>
 Harshita Kalani <harshitakalani02@gmail.com>
 James Gelok <jdgelok@gmail.com>
 Jaysukh Makvana <jaysukhmakvana2004@gmail.com>
@@ -21,6 +23,7 @@ Joey Reed <joeyrreed@gmail.com>
 Jordan Gallivan <115050475+Jordan-Gallivan@users.noreply.github.com>
 Joris Labie <joris.labie1@gmail.com>
 Justin Dennison <justin1dennison@gmail.com>
+Karthik Prakash <116057817+skoriop@users.noreply.github.com>
 Marcus Fantham <mfantham@users.noreply.github.com>
 Matt Cochrane <matthew.cochrane.eng@gmail.com>
 Milan Raj <rajsite@users.noreply.github.com>
@@ -36,6 +39,7 @@ Roman Stetsyk <25715951+romanstetsyk@users.noreply.github.com>
 Ryan Seal <splrk@users.noreply.github.com>
 Seyyed Parsa Neshaei <spneshaei@users.noreply.github.com>
 Shraddheya Shendre <shendreshraddheya@gmail.com>
+Spandan Barve <114365550+marsian83@users.noreply.github.com>
 Stephannie Jiménez Gacha <steff456@hotmail.com>
 Yernar Yergaziyev <yernar.yergaziyev@erg.kz>
 orimiles5 <97595296+orimiles5@users.noreply.github.com>

README.md

@@ -1655,6 +1655,60 @@ var count = context.count;
 // returns 3
 ```
 
+<a name="method-reduce"></a>
+
+#### Complex64Array.prototype.reduce( reducerFn\[, initialValue] )
+
+Applies a provided callback function to each element of the array, in order, passing in the return value from the calculation on the preceding element and returning the accumulated result upon completion.
+
+```javascript
+var realf = require( '@stdlib/complex-realf' );
+var imagf = require( '@stdlib/complex-imagf' );
+var caddf = require( '@stdlib/math-base-ops-caddf' );
+
+var arr = new Complex64Array( 3 );
+
+arr.set( [ 1.0, 1.0 ], 0 );
+arr.set( [ 2.0, 2.0 ], 1 );
+arr.set( [ 3.0, 3.0 ], 2 );
+
+var z = arr.reduce( caddf );
+// returns <Complex64>
+
+var re = realf( z );
+// returns 6.0
+
+var im = imagf( z );
+// returns 6.0
+```
+
+The reducer function is provided four arguments:
+
+-   **acc**: accumulated result.
+-   **value**: current array element.
+-   **index**: current array element index.
+-   **arr**: the array on which this method was called.
+
+By default, the function initializes the accumulated result to the first element in the array and passes the second array element as `value` during the first invocation of the provided callback. To begin accumulation from a different starting value and pass in the first array element as `value` during the first invocation of the provided callback, provide an `initialValue` argument.
+ 
+```javascript
+var realf = require( '@stdlib/complex-realf' );
+
+function reducer( acc, v ) {
+    acc += realf( v );
+    return acc;
+}
+
+var arr = new Complex64Array( 3 );
+
+arr.set( [ 1.0, 1.0 ], 0 );
+arr.set( [ 2.0, 2.0 ], 1 );
+arr.set( [ 3.0, 3.0 ], 2 );
+
+var z = arr.reduce( reducer, 0.0 );
+// returns 6.0
+```
+
 <a name="method-reverse"></a>
 
 #### Complex64Array.prototype.reverse()
@@ -2312,8 +2366,8 @@ Copyright &copy; 2016-2024. The Stdlib [Authors][stdlib-authors].
 [npm-image]: http://img.shields.io/npm/v/@stdlib/array-complex64.svg
 [npm-url]: https://npmjs.org/package/@stdlib/array-complex64
 
-[test-image]: https://github.com/stdlib-js/array-complex64/actions/workflows/test.yml/badge.svg?branch=v0.2.0
-[test-url]: https://github.com/stdlib-js/array-complex64/actions/workflows/test.yml?query=branch:v0.2.0
+[test-image]: https://github.com/stdlib-js/array-complex64/actions/workflows/test.yml/badge.svg?branch=main
+[test-url]: https://github.com/stdlib-js/array-complex64/actions/workflows/test.yml?query=branch:main
 
 [coverage-image]: https://img.shields.io/codecov/c/github/stdlib-js/array-complex64/main.svg
 [coverage-url]: https://codecov.io/github/stdlib-js/array-complex64?branch=main

benchmark/benchmark.reduce.js

@@ -0,0 +1,52 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2023 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-harness' );
+var caddf = require( '@stdlib/math-base-ops-caddf' );
+var isComplexLike = require('@stdlib/assert-is-complex-like');
+var pkg = require( './../package.json' ).name;
+var Complex64Array = require( './../lib' );
+
+
+// MAIN //
+
+bench( pkg+':reduce', function benchmark( b ) {
+	var out;
+	var arr;
+	var i;
+
+	arr = new Complex64Array( [ 1, 2, 3, 4, 5, 6 ] );
+
+	b.tic();
+	for ( i = 0; i < b.iterations; i++ ) {
+		out = arr.reduce( caddf );
+		if ( typeof out !== 'object' ) {
+			b.fail( 'should return an object' );
+		}
+	}
+	b.toc();
+	if ( !isComplexLike( out ) ) {
+		b.fail( 'should return a complex number' );
+	}
+	b.pass( 'benchmark finished' );
+	b.end();
+});

benchmark/benchmark.reduce.length.js

@@ -0,0 +1,104 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2023 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-harness' );
+var pow = require( '@stdlib/math-base-special-pow' );
+var caddf = require( '@stdlib/math-base-ops-caddf' );
+var isComplexLike = require('@stdlib/assert-is-complex-like');
+var Complex64 = require( '@stdlib/complex-float32' );
+var pkg = require( './../package.json' ).name;
+var Complex64Array = require( './../lib' );
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - array length
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len ) {
+	var arr;
+	var i;
+
+	arr = [];
+	for ( i = 0; i < len; i++ ) {
+		arr.push( new Complex64( i, i ) );
+	}
+	arr = new Complex64Array( arr );
+
+	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 = arr.reduce( caddf );
+			if ( typeof out !== 'object' ) {
+				b.fail( 'should return an object' );
+			}
+		}
+		b.toc();
+		if ( !isComplexLike( out ) ) {
+			b.fail( 'should return a complex number' );
+		}
+		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( pkg+':reduce:len='+len, f );
+	}
+}
+
+main();