Merge branch 'develop' into migrate-math-base-ops-addf

Signed-off-by: Athan <kgryte@gmail.com>

Author: kgryte

.github/workflows/scripts/create_address_commit_comments_issues

@@ -194,7 +194,7 @@ issue_exists_for_commit() {
 	local query
 
 	# Build a search query that looks for the commit short SHA in the issue title:
-	local raw_query="repo:${owner}/${repo} in:title \"commit ${short_sha}\""
+	local raw_query="repo:${owner}/${repo} in:title \"commit \`${short_sha}\`\""
 
 	# URL-encode the query using jq:
 	query=$(echo "$raw_query" | jq -sRr @uri)
@@ -211,8 +211,7 @@ issue_exists_for_commit() {
 	local total_count
 	total_count=$(echo "$response" | jq -r '.total_count')
 
-	if [ "$total_count" -gt 0 ]; then
-		# An issue already exists:
+	if [ "$total_count" = "null" ] || [ "$total_count" -gt 0 ]; then
 		return 0
 	else
 		return 1

.mailmap

@@ -201,6 +201,8 @@ Stephannie Jiménez Gacha <steff456@hotmail.com> <steff456@users.noreply.github.
 Stephannie Jiménez Gacha <steff456@hotmail.com> Stephannie Jimenez
 Stephannie Jiménez Gacha <steff456@hotmail.com> Stephannie Jimenez Gacha
 
+Suhaib Ilahi <suhaib.elahi87@gmail.com> Suhaib
+
 Suraj Kumar <125961509+kumarsuraj212003@users.noreply.github.com> Suraj kuma
 
 # T
@@ -236,3 +238,5 @@ Yaswanth Kosuru <116426380+yaswanthkosuru@users.noreply.github.com> yaswanth
 
 Yernar Yergaziyev <yernar.yergaziyev@erg.kz> <yernar707@users.noreply.github.com>
 Yernar Yergaziyev <yernar.yergaziyev@erg.kz> <54137699+yernar707@users.noreply.github.com>
+
+Yuvi Mittal <128018763+yuvi-mittal@users.noreply.github.com> yuvi-mittal

CONTRIBUTORS

@@ -104,6 +104,7 @@ Sai Srikar Dumpeti <80447788+the-r3aper7@users.noreply.github.com>
 Sarthak Paandey <145528240+SarthakPaandey@users.noreply.github.com>
 Saurabh Singh <saurabhsraghuvanshi@gmail.com>
 Seyyed Parsa Neshaei <spneshaei@users.noreply.github.com>
+Shabareesh Shetty <139731143+ShabiShett07@users.noreply.github.com>
 Shashank Shekhar Singh <shashankshekharsingh1205@gmail.com>
 Shivam Ahir <11shivam00@gmail.com>
 Shraddheya Shendre <shendreshraddheya@gmail.com>
@@ -114,6 +115,7 @@ Snehil Shah <snehilshah.989@gmail.com>
 Soumajit Chatterjee <121816890+soumajit23@users.noreply.github.com>
 Spandan Barve <contact@marsian.dev>
 Stephannie Jiménez Gacha <steff456@hotmail.com>
+Suhaib Ilahi <suhaib.elahi87@gmail.com>
 Suraj Kumar <125961509+kumarsuraj212003@users.noreply.github.com>
 Tirtadwipa Manunggal <tirtadwipa.manunggal@gmail.com>
 Tudor Pagu <104032457+tudor-pagu@users.noreply.github.com>
@@ -128,6 +130,7 @@ Vivek Maurya <vm8118134@gmail.com>
 Xiaochuan Ye <tap91624@gmail.com>
 Yaswanth Kosuru <116426380+yaswanthkosuru@users.noreply.github.com>
 Yernar Yergaziyev <yernar.yergaziyev@erg.kz>
+Yuvi Mittal <128018763+yuvi-mittal@users.noreply.github.com>
 ekambains <bainsinbusiness@gmail.com>
 olenkabilonizhka <62379231+olenkabilonizhka@users.noreply.github.com>
 pranav-1720 <123018993+pranav-1720@users.noreply.github.com>

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

@@ -87,7 +87,7 @@ var o = blas;
 -   <span class="signature">[`zaxpy( N, za, zx, strideX, zy, strideY )`][@stdlib/blas/base/zaxpy]</span><span class="delimiter">: </span><span class="description">scale a double-precision complex floating-point vector by a double-precision complex floating-point constant and add the result to a double-precision complex floating-point vector.</span>
 -   <span class="signature">[`zcopy( N, x, strideX, y, strideY )`][@stdlib/blas/base/zcopy]</span><span class="delimiter">: </span><span class="description">copy values from one complex double-precision floating-point vector to another complex double-precision floating-point vector.</span>
 -   <span class="signature">[`zdrot( N, zx, strideX, zy, strideY, c, s )`][@stdlib/blas/base/zdrot]</span><span class="delimiter">: </span><span class="description">applies a plane rotation.</span>
--   <span class="signature">[`zscal( N, za, zx, strideX )`][@stdlib/blas/base/zscal]</span><span class="delimiter">: </span><span class="description">scales a double-precision complex floating-point vector by a double-precision complex floating-point constant.</span>
+-   <span class="signature">[`zscal( N, alpha, x, strideX )`][@stdlib/blas/base/zscal]</span><span class="delimiter">: </span><span class="description">scales a double-precision complex floating-point vector by a double-precision complex floating-point constant.</span>
 -   <span class="signature">[`zswap( N, x, strideX, y, strideY )`][@stdlib/blas/base/zswap]</span><span class="delimiter">: </span><span class="description">interchange two complex double-precision floating-point vectors.</span>
 
 </div>

lib/node_modules/@stdlib/blas/base/docs/types/index.d.ts

@@ -2126,30 +2126,30 @@ interface Namespace {
 	* Scales a double-precision complex floating-point vector by a double-precision complex floating-point constant.
 	*
 	* @param N - number of indexed elements
-	* @param za - scalar constant
-	* @param zx - input array
-	* @param strideX - `zx` stride length
+	* @param alpha - scalar constant
+	* @param x - input array
+	* @param strideX - `x` stride length
 	* @returns input array
 	*
 	* @example
 	* var Complex128Array = require( '@stdlib/array/complex128' );
 	* var Complex128 = require( '@stdlib/complex/float64/ctor' );
 	*
-	* var zx = new Complex128Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ] );
-	* var za = new Complex128( 2.0, 2.0 );
+	* var x = new Complex128Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ] );
+	* var alpha = new Complex128( 2.0, 2.0 );
 	*
-	* ns.zscal( 3, za, zx, 1 );
-	* // zx => <Complex128Array>[ -2.0, 6.0, -2.0, 14.0, -2.0, 22.0 ]
+	* ns.zscal( 3, alpha, x, 1 );
+	* // x => <Complex128Array>[ -2.0, 6.0, -2.0, 14.0, -2.0, 22.0 ]
 	*
 	* @example
 	* var Complex128Array = require( '@stdlib/array/complex128' );
 	* var Complex128 = require( '@stdlib/complex/float64/ctor' );
 	*
-	* var zx = new Complex128Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ] );
-	* var za = new Complex128( 2.0, 2.0 );
+	* var x = new Complex128Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ] );
+	* var alpha = new Complex128( 2.0, 2.0 );
 	*
-	* ns.zscal.ndarray( 2, za, zx, 1, 1 );
-	* // zx => <Complex128Array>[ -2.0, 6.0, -2.0, 14.0, -2.0, 22.0 ]
+	* ns.zscal.ndarray( 2, alpha, x, 1, 1 );
+	* // x => <Complex128Array>[ -2.0, 6.0, -2.0, 14.0, -2.0, 22.0 ]
 	*/
 	zscal: typeof zscal;
 

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

@@ -145,7 +145,7 @@ console.log( x );
 ## See Also
 
 -   <span class="package-name">[`@stdlib/blas/ext/base/dapx`][@stdlib/blas/ext/base/dapx]</span><span class="delimiter">: </span><span class="description">add a scalar constant to each element in a double-precision floating-point strided array.</span>
--   <span class="package-name">[`@stdlib/blas/ext/base/sapx`][@stdlib/blas/ext/base/sapx]</span><span class="delimiter">: </span><span class="description">add a constant to each element in a single-precision floating-point strided array.</span>
+-   <span class="package-name">[`@stdlib/blas/ext/base/sapx`][@stdlib/blas/ext/base/sapx]</span><span class="delimiter">: </span><span class="description">add a scalar constant to each element in a single-precision floating-point strided array.</span>
 
 </section>
 

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

@@ -231,14 +231,14 @@ stdlib_strided_ssort2ins( 4, 1.0f, x, 1, y, 1 );
 The function accepts the following arguments:
 
 -   **N**: `[in] CBLAS_INT` number of indexed elements.
--   **order**: `[in] float` sort order. If `order < 0.0`, the input strided array `x` is sorted in **decreasing** order. If `order > 0.0`, the input strided array `x` is sorted in **increasing** order. If `order == 0.0`, the input strided arrays are left unchanged.
+-   **order**: `[in] float` sort order. If `order < 0.0`, the input strided array `X` is sorted in **decreasing** order. If `order > 0.0`, the input strided array `X` is sorted in **increasing** order. If `order == 0.0`, the input strided arrays are left unchanged.
 -   **X**: `[inout] float*` first input array.
 -   **strideX**: `[in] CBLAS_INT` stride length for `X`.
 -   **Y**: `[inout] float*` second input array.
 -   **strideY**: `[in] CBLAS_INT` stride length for `Y`.
 
 ```c
-stdlib_strided_ssort2ins( const CBLAS_INT N, const float order, float *X, CBLAS_INT strideX, float *Y, CBLAS_INT strideY );
+stdlib_strided_ssort2ins( const CBLAS_INT N, const float order, float *X, const CBLAS_INT strideX, float *Y, const CBLAS_INT strideY );
 ```
 
 <!--lint disable maximum-heading-length-->
@@ -259,7 +259,7 @@ stdlib_strided_ssort2ins_ndarray( 4, 1.0f, x, 1, 0, y, 1, 0 );
 The function accepts the following arguments:
 
 -   **N**: `[in] CBLAS_INT` number of indexed elements.
--   **order**: `[in] float` sort order. If `order < 0.0`, the input strided array `x` is sorted in **decreasing** order. If `order > 0.0`, the input strided array `x` is sorted in **increasing** order. If `order == 0.0`, the input strided arrays are left unchanged.
+-   **order**: `[in] float` sort order. If `order < 0.0`, the input strided array `X` is sorted in **decreasing** order. If `order > 0.0`, the input strided array `X` is sorted in **increasing** order. If `order == 0.0`, the input strided arrays are left unchanged.
 -   **X**: `[inout] float*` first input array.
 -   **strideX**: `[in] CBLAS_INT` stride length for `X`.
 -   **offsetX**: `[in] CBLAS_INT` starting index for `X`.
@@ -268,7 +268,7 @@ The function accepts the following arguments:
 -   **offsetY**: `[in] CBLAS_INT` starting index for `Y`.
 
 ```c
-stdlib_strided_ssort2ins_ndarray( const CBLAS_INT N, const float order, float *X, CBLAS_INT strideX, CBLAS_INT offsetX, float *Y, CBLAS_INT strideY, CBLAS_INT offsetY );
+stdlib_strided_ssort2ins_ndarray( const CBLAS_INT N, const float order, float *X, const CBLAS_INT strideX, const CBLAS_INT offsetX, float *Y, const CBLAS_INT strideY, const CBLAS_INT offsetY );
 ```
 
 </section>

lib/node_modules/@stdlib/blas/ext/base/ssort2ins/benchmark/c/benchmark.unsorted_random.length.c

@@ -82,7 +82,7 @@ static double tic( void ) {
 *
 * @return random number
 */
-static double rand_float( void ) {
+static float rand_float( void ) {
 	int r = rand();
 	return (float)r / ( (float)RAND_MAX + 1.0f );
 }

lib/node_modules/@stdlib/blas/ext/base/ssort2ins/src/main.c

@@ -41,7 +41,7 @@ void API_SUFFIX(stdlib_strided_ssort2ins)( const CBLAS_INT N, const float order,
 
 
 /**
-* Simultaneously sorts two signle-precision floating-point strided arrays based on the sort order of the first array using insertion sort and alternative indexing semantics.
+* Simultaneously sorts two single-precision floating-point strided arrays based on the sort order of the first array using insertion sort and alternative indexing semantics.
 *
 * @param N        number of indexed elements
 * @param order    sort order
@@ -52,7 +52,7 @@ void API_SUFFIX(stdlib_strided_ssort2ins)( const CBLAS_INT N, const float order,
 * @param strideY  stride length for `Y`
 * @param offsetY  starting index for `Y`
 */
-void API_SUFFIX(stdlib_strided_ssort2ins_ndarray)( const CBLAS_INT N, const float order, float *X, CBLAS_INT strideX, CBLAS_INT offsetX, float *Y, CBLAS_INT strideY, CBLAS_INT offsetY ) {
+void API_SUFFIX(stdlib_strided_ssort2ins_ndarray)( const CBLAS_INT N, const float order, float *X, const CBLAS_INT strideX, const CBLAS_INT offsetX, float *Y, const CBLAS_INT strideY, const CBLAS_INT offsetY ) {
 	CBLAS_INT sx;
 	CBLAS_INT sy;
 	CBLAS_INT ox;
@@ -76,8 +76,8 @@ void API_SUFFIX(stdlib_strided_ssort2ins_ndarray)( const CBLAS_INT N, const floa
 	}
 	// For a positive stride, sorting in decreasing order is equivalent to providing a negative stride and sorting in increasing order, and, for a negative stride, sorting in decreasing order is equivalent to providing a positive stride and sorting in increasing order...
 	if ( order < 0.0f ) {
-		sx = strideX * -1;
-		sy = strideY * -1;
+		sx = -strideX;
+		sy = -strideY;
 		ox = offsetX - ( (N-1) * sx );
 		oy = offsetY - ( (N-1) * sy );
 	} else {

lib/node_modules/@stdlib/complex/float32/base/docs/types/index.d.ts

@@ -85,6 +85,25 @@ interface Namespace {
 	*
 	* var im = imagf( out );
 	* // returns -1.0
+	*
+	* @example
+	* var Float32Array = require( '@stdlib/array/float32' );
+	*
+	* var out = new Float32Array( 2 );
+	* var v = ns.mul.assign( 5.0, 3.0, -2.0, 1.0, out, 1, 0 );
+	* // returns <Float32Array>[ -13.0, -1.0 ]
+	*
+	* var bool = ( out === v );
+	* // returns true
+	*
+	* @example
+	* var Float32Array = require( '@stdlib/array/float32' );
+	*
+	* var z1 = new Float32Array( [ 5.0, 3.0 ] );
+	* var z2 = new Float32Array( [ -2.0, 1.0 ] );
+	*
+	* var out = ns.mul.strided( z1, 1, 0, z2, 1, 0, new Float32Array( 2 ), 1, 0 );
+	* // returns <Float32Array>[ -13.0, -1.0 ]
 	*/
 	mul: typeof mul;
 }

lib/node_modules/@stdlib/math/base/ops/docs/types/index.d.ts

@@ -97,6 +97,25 @@ interface Namespace {
 	*
 	* var im = imagf( out );
 	* // returns -1.0
+	*
+	* @example
+	* var Float32Array = require( '@stdlib/array/float32' );
+	*
+	* var out = new Float32Array( 2 );
+	* var v = ns.cmulf.assign( 5.0, 3.0, -2.0, 1.0, out, 1, 0 );
+	* // returns <Float32Array>[ -13.0, -1.0 ]
+	*
+	* var bool = ( out === v );
+	* // returns true
+	*
+	* @example
+	* var Float32Array = require( '@stdlib/array/float32' );
+	*
+	* var z1 = new Float32Array( [ 5.0, 3.0 ] );
+	* var z2 = new Float32Array( [ -2.0, 1.0 ] );
+	*
+	* var out = ns.cmulf.strided( z1, 1, 0, z2, 1, 0, new Float32Array( 2 ), 1, 0 );
+	* // returns <Float32Array>[ -13.0, -1.0 ]
 	*/
 	cmulf: typeof cmulf;
 

lib/node_modules/@stdlib/math/base/special/abs2/benchmark/benchmark.js

@@ -21,7 +21,7 @@
 // MODULES //
 
 var bench = require( '@stdlib/bench' );
-var randu = require( '@stdlib/random/base/randu' );
+var randu = require( '@stdlib/random/array/uniform' );
 var isnan = require( '@stdlib/math/base/assert/is-nan' );
 var pkg = require( './../package.json' ).name;
 var abs2 = require( './../lib' );
@@ -34,10 +34,11 @@ bench( pkg, function benchmark( b ) {
 	var y;
 	var i;
 
+	x = randu( 100, -500.0, 500.0 );
+
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		x = ( randu()*1000.0 ) - 500.0;
-		y = abs2( x );
+		y = abs2( x[ i % x.length ] );
 		if ( isnan( y ) ) {
 			b.fail( 'should not return NaN' );
 		}
@@ -55,10 +56,11 @@ bench( pkg+'::built-in', function benchmark( b ) {
 	var y;
 	var i;
 
+	x = randu( 100, -500.0, 500.0 );
+
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		x = ( randu()*1000.0 ) - 500.0;
-		y = x * x;
+		y = x[ i % x.length ] * x[ i % x.length ];
 		if ( isnan( y ) ) {
 			b.fail( 'should not return NaN' );
 		}

lib/node_modules/@stdlib/math/base/special/abs2/benchmark/benchmark.native.js

@@ -22,7 +22,7 @@
 
 var resolve = require( 'path' ).resolve;
 var bench = require( '@stdlib/bench' );
-var randu = require( '@stdlib/random/base/randu' );
+var randu = require( '@stdlib/random/array/uniform' );
 var isnan = require( '@stdlib/math/base/assert/is-nan' );
 var tryRequire = require( '@stdlib/utils/try-require' );
 var pkg = require( './../package.json' ).name;
@@ -43,10 +43,11 @@ bench( pkg+'::native', opts, function benchmark( b ) {
 	var y;
 	var i;
 
+	x = randu( 100, -500.0, 500.0 );
+
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		x = ( randu()*1000.0 ) - 500.0;
-		y = abs2( x );
+		y = abs2( x[ i % x.length ] );
 		if ( isnan( y ) ) {
 			b.fail( 'should not return NaN' );
 		}

lib/node_modules/@stdlib/math/base/special/abs2/benchmark/c/benchmark.c

@@ -99,16 +99,19 @@ double abs2( double x ) {
 * @return elapsed time in seconds
 */
 static double benchmark( void ) {
+	double x[ 100 ];
 	double elapsed;
-	double x;
 	double y;
 	double t;
 	int i;
 
+	for ( i = 0; i < 100; i++ ) {
+		x[ i ] = ( 1000.0 * rand_double() ) - 500.0;
+	}
+
 	t = tic();
 	for ( i = 0; i < ITERATIONS; i++ ) {
-		x = ( 1000.0*rand_double() ) - 500.0;
-		y = abs2( x );
+		y = abs2( x[ i % 100 ] );
 		if ( y != y ) {
 			printf( "should not return NaN\n" );
 			break;

lib/node_modules/@stdlib/math/base/special/abs2/benchmark/c/native/benchmark.c

@@ -90,16 +90,19 @@ static double rand_double( void ) {
 * @return elapsed time in seconds
 */
 static double benchmark( void ) {
+	double x[ 100 ];
 	double elapsed;
-	double x;
 	double y;
 	double t;
 	int i;
 
+	for ( i = 0; i < 100; i++ ) {
+		x[ i ] = ( 1000.0 * rand_double() ) - 500.0;
+	}
+
 	t = tic();
 	for ( i = 0; i < ITERATIONS; i++ ) {
-		x = ( 1000.0*rand_double() ) - 500.0;
-		y = stdlib_base_abs2( x );
+		y = stdlib_base_abs2( x[ i % 100 ] );
 		if ( y != y ) {
 			printf( "should not return NaN\n" );
 			break;

lib/node_modules/@stdlib/math/base/special/abs2/test/test.js

@@ -38,26 +38,26 @@ tape( 'main export is a function', function test( t ) {
 });
 
 tape( 'the function computes the squared absolute value of a number', function test( t ) {
-	t.strictEqual( abs2( -2.0 ), 4.0, 'negative number' );
-	t.strictEqual( abs2( 3.0 ), 9.0, 'positive number' );
-	t.strictEqual( abs2( 0.0 ), 0.0, 'zero' );
-	t.strictEqual( abs2( -PI ), PI*PI, 'pi' );
+	t.strictEqual( abs2( -2.0 ), 4.0, 'returns expected value' );
+	t.strictEqual( abs2( 3.0 ), 9.0, 'returns expected value' );
+	t.strictEqual( abs2( 0.0 ), 0.0, 'returns expected value' );
+	t.strictEqual( abs2( -PI ), PI*PI, 'returns expected value' );
 	t.end();
 });
 
 tape( 'the function computes the squared absolute value of negative zero', function test( t ) {
-	t.strictEqual( isPositiveZero( abs2( -0.0 ) ), true, 'returns positive zero' );
+	t.strictEqual( isPositiveZero( abs2( -0.0 ) ), true, 'returns expected value' );
 	t.end();
 });
 
 tape( 'the function computes the squared absolute value of infinity', function test( t ) {
-	t.strictEqual( abs2( PINF ), PINF, 'returns +infinity' );
-	t.strictEqual( abs2( NINF ), PINF, 'returns +infinity' );
+	t.strictEqual( abs2( PINF ), PINF, 'returns expected value' );
+	t.strictEqual( abs2( NINF ), PINF, 'returns expected value' );
 	t.end();
 });
 
 tape( 'if provided `NaN`, the function returns `NaN`', function test( t ) {
 	var v = abs2( NaN );
-	t.strictEqual( isnan( v ), true, 'returns NaN' );
+	t.strictEqual( isnan( v ), true, 'returns expected value' );
 	t.end();
 });