Auto-generated commit

Author: stdlib-bot

.npmignore

@@ -29,8 +29,9 @@ branches.md
 .postinstall.json
 Makefile
 
-# Ignore `binding.gyp` file to avoid compilation of native addon when installing package:
+# Ignore files to avoid compilation of native addon when installing package:
 binding.gyp
+include.gypi
 
 # Directories #
 ###############

CONTRIBUTORS

@@ -3,18 +3,21 @@
 # Contributors listed in alphabetical order.
 
 Aditya Sapra <110766802+adityacodes30@users.noreply.github.com>
+AgPriyanshu18 <113460573+AgPriyanshu18@users.noreply.github.com>
 Ali Salesi <ali_sal1381@yahoo.com>
 Amit Jimiwal <amitjimiwal45@gmail.com>
 Athan Reines <kgryte@gmail.com>
 Brendan Graetz <bguiz@users.noreply.github.com>
 Bruno Fenzl <brunofenzl@gmail.com>
+Chinmay J <86140365+JawHawk@users.noreply.github.com>
 Christopher Dambamuromo <chridam@gmail.com>
 Dan Rose <danoftheroses@gmail.com>
 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>
+Golden <103646877+AuenKr@users.noreply.github.com>
 Harshita Kalani <harshitakalani02@gmail.com>
 James Gelok <jdgelok@gmail.com>
 Jaysukh Makvana <jaysukhmakvana2004@gmail.com>
@@ -24,6 +27,7 @@ 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>
+Khaldon <kahmd1444@gmail.com>
 Marcus Fantham <mfantham@users.noreply.github.com>
 Matt Cochrane <matthew.cochrane.eng@gmail.com>
 Milan Raj <rajsite@users.noreply.github.com>
@@ -34,12 +38,16 @@ Ognjen Jevremović <ognjenjevremovic@users.noreply.github.com>
 Philipp Burckhardt <pburckhardt@outlook.com>
 Prajwal Kulkarni <prajwalkulkarni76@gmail.com>
 Pranav Goswami <goswami.4@iitj.ac.in>
+Praneki <97080887+PraneGIT@users.noreply.github.com>
+Pratik <97464067+Pratik772846@users.noreply.github.com>
 Ricky Reusser <rsreusser@gmail.com>
 Robert Gislason <gztown2216@yahoo.com>
 Roman Stetsyk <25715951+romanstetsyk@users.noreply.github.com>
+Rutam <138517416+performant23@users.noreply.github.com>
 Ryan Seal <splrk@users.noreply.github.com>
 Seyyed Parsa Neshaei <spneshaei@users.noreply.github.com>
 Shraddheya Shendre <shendreshraddheya@gmail.com>
+Shubham <shubh622005@gmail.com>
 Spandan Barve <114365550+marsian83@users.noreply.github.com>
 Stephannie Jiménez Gacha <steff456@hotmail.com>
 Yernar Yergaziyev <yernar.yergaziyev@erg.kz>

README.md

@@ -1707,6 +1707,60 @@ var z = arr.reduce( reducer, 0.0 );
 // returns 6.0
 ```
 
+<a name="method-reduce-right"></a>
+
+#### Complex128Array.prototype.reduceRight( reducerFn\[, initialValue] )
+
+Applies a provided callback function to each element of the array, in reverse order, passing in the return value from the calculation on the following element and returning the accumulated result upon completion.
+
+```javascript
+var real = require( '@stdlib/complex-real' );
+var imag = require( '@stdlib/complex-imag' );
+var cadd = require( '@stdlib/math-base-ops-cadd' );
+
+var arr = new Complex128Array( 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.reduceRight( cadd );
+// returns <Complex128>
+
+var re = real( z );
+// returns 6.0
+
+var im = imag( 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 last element in the array and passes the second-last array element as `value` during the first invocation of the provided callback. To begin accumulation from a different starting value and pass in the last array element as `value` during the first invocation of the provided callback, provide an `initialValue` argument.
+
+```javascript
+var real = require( '@stdlib/complex-real' );
+
+function reducer( acc, v ) {
+    acc += real( v );
+    return acc;
+}
+
+var arr = new Complex128Array( 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.reduceRight( reducer, 0.0 );
+// returns 6.0
+```
+
 <a name="method-reverse"></a>
 
 #### Complex128Array.prototype.reverse()
@@ -2364,8 +2418,8 @@ Copyright &copy; 2016-2024. The Stdlib [Authors][stdlib-authors].
 [npm-image]: http://img.shields.io/npm/v/@stdlib/array-complex128.svg
 [npm-url]: https://npmjs.org/package/@stdlib/array-complex128
 
-[test-image]: https://github.com/stdlib-js/array-complex128/actions/workflows/test.yml/badge.svg?branch=v0.2.1
-[test-url]: https://github.com/stdlib-js/array-complex128/actions/workflows/test.yml?query=branch:v0.2.1
+[test-image]: https://github.com/stdlib-js/array-complex128/actions/workflows/test.yml/badge.svg?branch=main
+[test-url]: https://github.com/stdlib-js/array-complex128/actions/workflows/test.yml?query=branch:main
 
 [coverage-image]: https://img.shields.io/codecov/c/github/stdlib-js/array-complex128/main.svg
 [coverage-url]: https://codecov.io/github/stdlib-js/array-complex128?branch=main

benchmark/benchmark.reduce_right.js

@@ -0,0 +1,52 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2024 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 cadd = require( '@stdlib/math-base-ops-cadd' );
+var isComplexLike = require('@stdlib/assert-is-complex-like' );
+var pkg = require( './../package.json' ).name;
+var Complex128Array = require( './../lib' );
+
+
+// MAIN //
+
+bench( pkg+':reduceRight', function benchmark( b ) {
+	var out;
+	var arr;
+	var i;
+
+	arr = new Complex128Array( [ 1, 2, 3, 4, 5, 6 ] );
+
+	b.tic();
+	for ( i = 0; i < b.iterations; i++ ) {
+		out = arr.reduceRight( cadd );
+		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_right.length.js

@@ -0,0 +1,104 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2024 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 cadd = require( '@stdlib/math-base-ops-cadd' );
+var isComplexLike = require('@stdlib/assert-is-complex-like' );
+var Complex128 = require( '@stdlib/complex-float64' );
+var pkg = require( './../package.json' ).name;
+var Complex128Array = 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 Complex128( i, i ) );
+	}
+	arr = new Complex128Array( 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.reduceRight( cadd );
+			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+':reduceRight:len='+len, f );
+	}
+}
+
+main();