Auto-generated commit

Author: stdlib-bot

.github/.keepalive

@@ -4,14 +4,37 @@
 
 <section class="release" id="unreleased">
 
-## Unreleased (2025-05-05)
+## Unreleased (2025-07-09)
+
+<section class="features">
+
+### Features
+
+-   [`5654424`](https://github.com/stdlib-js/stdlib/commit/5654424510f9b6d9273b5ce4c60f365761a53cca) - add support for accessor arrays and refactor `stats/base/nanstdevch` [(#7588)](https://github.com/stdlib-js/stdlib/pull/7588)
+
+</section>
+
+<!-- /.features -->
+
+<section class="issues">
+
+### Closed Issues
+
+This release closes the following issue:
+
+[#5668](https://github.com/stdlib-js/stdlib/issues/5668)
+
+</section>
+
+<!-- /.issues -->
 
 <section class="commits">
 
 ### Commits
 
 <details>
 
+-   [`5654424`](https://github.com/stdlib-js/stdlib/commit/5654424510f9b6d9273b5ce4c60f365761a53cca) - **feat:** add support for accessor arrays and refactor `stats/base/nanstdevch` [(#7588)](https://github.com/stdlib-js/stdlib/pull/7588) _(by Gururaj Gurram)_
 -   [`df4afcc`](https://github.com/stdlib-js/stdlib/commit/df4afcc21abb34b90a9e196f289bb5b3c50708a4) - **refactor:** update paths _(by Aayush Khanna)_
 
 </details>
@@ -24,9 +47,10 @@
 
 ### Contributors
 
-A total of 1 person contributed to this release. Thank you to this contributor:
+A total of 2 people contributed to this release. Thank you to the following contributors:
 
 -   Aayush Khanna
+-   Gururaj Gurram
 
 </section>
 

CHANGELOG.md

@@ -21,10 +21,14 @@ Ali Salesi <[email protected]>
 AlyAbdelmoneim <[email protected]>
 Aman Bhansali <[email protected]>
 AmanBhadkariya <[email protected]>
+Amisha Chhajed <[email protected]>
 Amit Jimiwal <[email protected]>
+Annamalai Prabu <[email protected]>
 Anshu Kumar <[email protected]>
 Anshu Kumar <[email protected]>
 Anudeep Sanapala <[email protected]>
+Arihant Pal <[email protected]>
+Aryan Bhirud <[email protected]>
 Athan Reines <[email protected]>
 Ayaka <[email protected]>
 Bhavishy Agrawal <[email protected]>
@@ -34,10 +38,12 @@ Bryan Elee <[email protected]>
 Chinmay Joshi <[email protected]>
 Christopher Dambamuromo <[email protected]>
 Dan Rose <[email protected]>
+Daniel Hernandez Gomez <[email protected]>
 Daniel Killenberger <[email protected]>
 Daniel Yu <[email protected]>
 Debashis Maharana <[email protected]>
 Deep Trivedi <[email protected]>
+Deepak Singh <[email protected]>
 Desh Deepak Kant <[email protected]>
 Dev Goel <[email protected]>
 Dhanyabad behera <[email protected]>
@@ -53,11 +59,13 @@ Frank Kovacs <[email protected]>
 GK Bishnoi <[email protected]>
 GURU PRASAD SHARMA <[email protected]>
 Gaurav <[email protected]>
+Gautam Kaushik <[email protected]>
 Gautam sharma <[email protected]>
 Girish Garg <[email protected]>
 Golden Kumar <[email protected]>
 Gunj Joshi <[email protected]>
 Gururaj Gurram <[email protected]>
+Harishchandra Reddy <[email protected]>
 Haroon Rasheed <[email protected]>
 Harsh <[email protected]>
 HarshaNP <[email protected]>
@@ -80,6 +88,7 @@ Joris Labie <[email protected]>
 Justin Dennison <[email protected]>
 Justyn Shelby <[email protected]>
 Karan Anand <[email protected]>
+Karan Vasudevamurthy <[email protected]>
 Karan Yadav <[email protected]>
 Karthik Prakash <[email protected]>
 Kaushikgtm <[email protected]>
@@ -89,6 +98,7 @@ Krishnam Agarwal <[email protected]>
 Krishnendu Das <[email protected]>
 Kshitij-Dale <[email protected]>
 Lalit Narayan Yadav <[email protected]>
+Lokesh Ranjan <[email protected]>
 Lovelin Dhoni J B <[email protected]>
 MANI <[email protected]>
 Mahfuza Humayra Mohona <[email protected]>
@@ -117,6 +127,7 @@ Ognjen Jevremović <[email protected]>
 Oneday12323 <[email protected]>
 Ori Miles <[email protected]>
 Philipp Burckhardt <[email protected]>
+Pierre Forstmann <[email protected]>
 Prajjwal Bajpai <[email protected]>
 Prajwal Kulkarni <[email protected]>
 Pranav Goswami <[email protected]>
@@ -146,6 +157,7 @@ Ryan Seal <[email protected]>
 Rylan Yang <[email protected]>
 SAHIL KUMAR <[email protected]>
 SHIVAM YADAV <[email protected]>
+Sachin Raj <[email protected]>
 Sahil Goyal <[email protected]>
 Sai Avinash <[email protected]>
 Sai Srikar Dumpeti <[email protected]>
@@ -166,14 +178,19 @@ Spandan Barve <[email protected]>
 Stephannie Jiménez Gacha <[email protected]>
 Suhaib Ilahi <[email protected]>
 Suraj Kumar <[email protected]>
+Swapnil Hajare <[email protected]>
 Tanishq Ahuja <[email protected]>
 Tirtadwipa Manunggal <[email protected]>
 Tudor Pagu <[email protected]>
 Tufailahmed Bargir <[email protected]>
+Tushar Bhardwaj <[email protected]>
+Uday Kakade <[email protected]>
+Ujjwal Kirti <[email protected]>
 Utkarsh <http://[email protected]>
 Utkarsh Raj <[email protected]>
 UtkershBasnet <[email protected]>
 Vaibhav Patel <[email protected]>
+Vara Rahul Rajana <[email protected]>
 Varad Gupta <[email protected]>
 Vinit Pandit <[email protected]>
 Vivek Maurya <[email protected]>
@@ -182,11 +199,13 @@ Yaswanth Kosuru <[email protected]>
 Yernar Yergaziyev <[email protected]>
 Yugal Kaushik <[email protected]>
 Yuvi Mittal <[email protected]>
+deepak427 <[email protected]>
 devshree-bhati <[email protected]>
 ditsu <[email protected]>
 ekambains <[email protected]>
 fadiothman22 <[email protected]>
 iraandrushko <[email protected]>
+jsai28 <[email protected]>
 lohithganni <[email protected]>
 olenkabilonizhka <[email protected]>
 pranav-1720 <[email protected]>

CONTRIBUTORS

@@ -131,9 +131,9 @@ To view installation and usage instructions specific to each branch build, be su
 var nanstdevch = require( '@stdlib/stats-base-nanstdevch' );
 ```
 
-#### nanstdevch( N, correction, x, stride )
+#### nanstdevch( N, correction, x, strideX )
 
-Computes the [standard deviation][standard-deviation] of a strided array `x` ignoring `NaN` values and using a one-pass trial mean algorithm.
+Computes the [standard deviation][standard-deviation] of a strided array ignoring `NaN` values and using a one-pass trial mean algorithm.
 
 ```javascript
 var x = [ 1.0, -2.0, NaN, 2.0 ];
@@ -147,38 +147,32 @@ The function has the following parameters:
 -   **N**: number of indexed elements.
 -   **correction**: degrees of freedom adjustment. Setting this parameter to a value other than `0` has the effect of adjusting the divisor during the calculation of the [standard deviation][standard-deviation] according to `N-c` where `c` corresponds to the provided degrees of freedom adjustment. When computing the [standard deviation][standard-deviation] of a population, setting this parameter to `0` is the standard choice (i.e., the provided array contains data constituting an entire population). When computing the corrected sample [standard deviation][standard-deviation], setting this parameter to `1` is the standard choice (i.e., the provided array contains data sampled from a larger population; this is commonly referred to as Bessel's correction).
 -   **x**: input [`Array`][mdn-array] or [`typed array`][mdn-typed-array].
--   **stride**: index increment for `x`.
+-   **strideX**: stride length for `x`.
 
 The `N` and `stride` parameters determine which elements in `x` are accessed at runtime. For example, to compute the [standard deviation][standard-deviation] of every other element in `x`,
 
 ```javascript
-var floor = require( '@stdlib/math-base-special-floor' );
-
 var x = [ 1.0, 2.0, 2.0, -7.0, -2.0, 3.0, 4.0, 2.0, NaN ];
-var N = floor( x.length / 2 );
 
-var v = nanstdevch( N, 1, x, 2 );
+var v = nanstdevch( 5, 1, x, 2 );
 // returns 2.5
 ```
 
 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 -->
+<!-- eslint-disable stdlib/capitalized-comments, max-len -->
 
 ```javascript
 var Float64Array = require( '@stdlib/array-float64' );
-var floor = require( '@stdlib/math-base-special-floor' );
 
-var x0 = new Float64Array( [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0, NaN ] );
+var x0 = new Float64Array( [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0, NaN, NaN ] );
 var x1 = new Float64Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); // start at 2nd element
 
-var N = floor( x0.length / 2 );
-
-var v = nanstdevch( N, 1, x1, 2 );
+var v = nanstdevch( 5, 1, x1, 2 );
 // returns 2.5
 ```
 
-#### nanstdevch.ndarray( N, correction, x, stride, offset )
+#### nanstdevch.ndarray( N, correction, x, strideX, offsetX )
 
 Computes the [standard deviation][standard-deviation] of a strided array ignoring `NaN` values and using a one-pass trial mean algorithm and alternative indexing semantics.
 
@@ -191,17 +185,14 @@ var v = nanstdevch.ndarray( x.length, 1, x, 1, 0 );
 
 The function has the following additional parameters:
 
--   **offset**: starting index for `x`.
+-   **offsetX**: starting index for `x`.
 
-While [`typed array`][mdn-typed-array] views mandate a view offset based on the underlying `buffer`, the `offset` parameter supports indexing semantics based on a starting index. For example, to calculate the [standard deviation][standard-deviation] for every other value in `x` starting from the second value
+While [`typed array`][mdn-typed-array] views mandate a view offset based on the underlying buffer, the offset parameter supports indexing semantics based on a starting index. For example, to calculate the [standard deviation][standard-deviation] for every other element in `x` starting from the second element
 
 ```javascript
-var floor = require( '@stdlib/math-base-special-floor' );
+var x = [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0, NaN, NaN ];
 
-var x = [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ];
-var N = floor( x.length / 2 );
-
-var v = nanstdevch.ndarray( N, 1, x, 2, 1 );
+var v = nanstdevch.ndarray( 5, 1, x, 2, 1 );
 // returns 2.5
 ```
 
@@ -216,6 +207,7 @@ var v = nanstdevch.ndarray( N, 1, x, 2, 1 );
 -   If `N <= 0`, both functions return `NaN`.
 -   If `n - c` is less than or equal to `0` (where `c` corresponds to the provided degrees of freedom adjustment and `n` corresponds to the number of non-`NaN` indexed elements), both functions return `NaN`.
 -   The underlying algorithm is a specialized case of Neely's two-pass algorithm. As the standard deviation is invariant with respect to changes in the location parameter, the underlying algorithm uses the first strided array element as a trial mean to shift subsequent data values and thus mitigate catastrophic cancellation. Accordingly, the algorithm's accuracy is best when data is **unordered** (i.e., the data is **not** sorted in either ascending or descending order such that the first value is an "extreme" value).
+-   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]).
 -   Depending on the environment, the typed versions ([`dnanstdevch`][@stdlib/stats/strided/dnanstdevch], [`snanstdevch`][@stdlib/stats/base/snanstdevch], etc.) are likely to be significantly more performant.
 
 </section>
@@ -229,18 +221,19 @@ var v = nanstdevch.ndarray( N, 1, x, 2, 1 );
 <!-- eslint no-undef: "error" -->
 
 ```javascript
-var randu = require( '@stdlib/random-base-randu' );
-var round = require( '@stdlib/math-base-special-round' );
-var Float64Array = require( '@stdlib/array-float64' );
+var uniform = require( '@stdlib/random-base-uniform' );
+var filledarrayBy = require( '@stdlib/array-filled-by' );
+var bernoulli = require( '@stdlib/random-base-bernoulli' );
 var nanstdevch = require( '@stdlib/stats-base-nanstdevch' );
 
-var x;
-var i;
-
-x = new Float64Array( 10 );
-for ( i = 0; i < x.length; i++ ) {
-    x[ i ] = round( (randu()*100.0) - 50.0 );
+function rand() {
+    if ( bernoulli( 0.8 ) < 1 ) {
+        return NaN;
+    }
+    return uniform( -50.0, 50.0 );
 }
+
+var x = filledarrayBy( 10, 'float64', rand );
 console.log( x );
 
 var v = nanstdevch( x.length, 1, x, 1 );
@@ -362,6 +355,8 @@ Copyright &copy; 2016-2025. The Stdlib [Authors][stdlib-authors].
 
 [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/array-base-accessor
+
 [@neely:1966a]: https://doi.org/10.1145/365719.365958
 
 [@ling:1974a]: https://doi.org/10.2307/2286154

README.md

@@ -21,15 +21,30 @@
 // MODULES //
 
 var bench = require( '@stdlib/bench-harness' );
-var randu = require( '@stdlib/random-base-randu' );
+var uniform = require( '@stdlib/random-base-uniform' );
+var bernoulli = require( '@stdlib/random-base-bernoulli' );
+var filledarrayBy = require( '@stdlib/array-filled-by' );
 var isnan = require( '@stdlib/math-base-assert-is-nan' );
 var pow = require( '@stdlib/math-base-special-pow' );
 var pkg = require( './../package.json' ).name;
-var nanstdevch = require( './../lib/nanstdevch.js' );
+var nanstdevch = require( './../lib/main.js' );
 
 
 // FUNCTIONS //
 
+/**
+* Returns a random number.
+*
+* @private
+* @returns {number} random number
+*/
+function rand() {
+	if ( bernoulli( 0.8 ) < 1 ) {
+		return NaN;
+	}
+	return uniform( -10.0, 10.0 );
+}
+
 /**
 * Creates a benchmark function.
 *
@@ -38,17 +53,7 @@ var nanstdevch = require( './../lib/nanstdevch.js' );
 * @returns {Function} benchmark function
 */
 function createBenchmark( len ) {
-	var x;
-	var i;
-
-	x = [];
-	for ( i = 0; i < len; i++ ) {
-		if ( randu() < 0.2 ) {
-			x.push( NaN );
-		} else {
-			x.push( ( randu()*20.0 ) - 10.0 );
-		}
-	}
+	var x = filledarrayBy( len, 'generic', rand );
 	return benchmark;
 
 	function benchmark( b ) {

benchmark/benchmark.js

@@ -21,7 +21,9 @@
 // MODULES //
 
 var bench = require( '@stdlib/bench-harness' );
-var randu = require( '@stdlib/random-base-randu' );
+var uniform = require( '@stdlib/random-base-uniform' );
+var bernoulli = require( '@stdlib/random-base-bernoulli' );
+var filledarrayBy = require( '@stdlib/array-filled-by' );
 var isnan = require( '@stdlib/math-base-assert-is-nan' );
 var pow = require( '@stdlib/math-base-special-pow' );
 var pkg = require( './../package.json' ).name;
@@ -30,6 +32,19 @@ var nanstdevch = require( './../lib/ndarray.js' );
 
 // FUNCTIONS //
 
+/**
+* Returns a random number.
+*
+* @private
+* @returns {number} random number
+*/
+function rand() {
+	if ( bernoulli( 0.8 ) < 1 ) {
+		return NaN;
+	}
+	return uniform( -10.0, 10.0 );
+}
+
 /**
 * Creates a benchmark function.
 *
@@ -38,17 +53,7 @@ var nanstdevch = require( './../lib/ndarray.js' );
 * @returns {Function} benchmark function
 */
 function createBenchmark( len ) {
-	var x;
-	var i;
-
-	x = [];
-	for ( i = 0; i < len; i++ ) {
-		if ( randu() < 0.2 ) {
-			x.push( NaN );
-		} else {
-			x.push( ( randu()*20.0 ) - 10.0 );
-		}
-	}
+	var x = filledarrayBy( len, 'generic', rand );
 	return benchmark;
 
 	function benchmark( b ) {