chore: remove unnecessary diff

Author: aayush0325

lib/node_modules/@stdlib/stats/base/smeanwd/src/main.c

@@ -23,19 +23,6 @@
 /**
 * Computes the arithmetic mean of a single-precision floating-point strided array using Welford's algorithm.
 *
-* @param N        number of indexed elements
-* @param X        input array
-* @param strideX  stride length
-* @return         output value
-*/
-float API_SUFFIX(stdlib_strided_smeanwd)( const CBLAS_INT N, const float *X, const CBLAS_INT strideX ) {
-	const CBLAS_INT ox = stdlib_strided_stride2offset( N, strideX );
-	return API_SUFFIX(stdlib_strided_smeanwd_ndarray)( N, X, strideX, ox );
-}
-
-/**
-* Computes the arithmetic mean of a single-precision floating-point strided array using Welford's algorithm and alternative indexing semantics.
-*
 * ## Method
 *
 * -   This implementation uses Welford's algorithm for efficient computation, which can be derived as follows
@@ -57,6 +44,19 @@ float API_SUFFIX(stdlib_strided_smeanwd)( const CBLAS_INT N, const float *X, con
 * @param N        number of indexed elements
 * @param X        input array
 * @param strideX  stride length
+* @return         output value
+*/
+float API_SUFFIX(stdlib_strided_smeanwd)( const CBLAS_INT N, const float *X, const CBLAS_INT strideX ) {
+	const CBLAS_INT ox = stdlib_strided_stride2offset( N, strideX );
+	return API_SUFFIX(stdlib_strided_smeanwd_ndarray)( N, X, strideX, ox );
+}
+
+/**
+* Computes the arithmetic mean of a single-precision floating-point strided array using Welford's algorithm and alternative indexing semantics.
+*
+* @param N        number of indexed elements
+* @param X        input array
+* @param strideX  stride length
 * @param offsetX  starting index for X
 * @return         output value
 */
@@ -67,18 +67,18 @@ float API_SUFFIX(stdlib_strided_smeanwd_ndarray)( const CBLAS_INT N, const float
 	float mu;
 
 	if ( N <= 0 ) {
-		return 0.0 / 0.0; // NaN
+		return 0.0f / 0.0f; // NaN
 	}
 	if ( N == 1 || strideX == 0 ) {
 		return X[ offsetX ];
 	}
 	ix = offsetX;
-	mu = 0.0;
-	n = 0;
+	mu = 0.0f;
+	n = 0.0;
 	for ( i = 0; i < N; i++ ) {
-		n += 1;
-		mu += ( X[ix]-mu ) / (float)n;
-		ix += strideX;
+		n += 1.0;
+		mu += (float)((double)( X[ix]-mu ) / n);
+		ix += stride;
 	}
 	return mu;
 }