Avoid unnecesary type promotion

kgryte · kgryte · commit bd8b323a6a7b · 2020-04-25T01:19:38.000-07:00
diff --git a/lib/node_modules/@stdlib/blas/ext/base/sdsnansum/src/sdsnansum.c b/lib/node_modules/@stdlib/blas/ext/base/sdsnansum/src/sdsnansum.c
@@ -55,11 +55,11 @@ float stdlib_strided_sdsnansum( const int64_t N, const float *X, const int64_t s
 	double s7;
 
 	if ( N <= 0 ) {
-		return 0.0;
+		return 0.0f;
 	}
 	if ( N == 1 || stride == 0 ) {
 		if ( stdlib_base_is_nanf( X[ 0 ] ) ) {
-			return 0.0;
+			return 0.0f;
 		}
 		return X[ 0 ];
 	}
diff --git a/lib/node_modules/@stdlib/blas/ext/base/sdssum/src/sdssum.c b/lib/node_modules/@stdlib/blas/ext/base/sdssum/src/sdssum.c
@@ -54,7 +54,7 @@ float stdlib_strided_sdssum( const int64_t N, const float *X, const int64_t stri
 	double s7;
 
 	if ( N <= 0 ) {
-		return 0.0;
+		return 0.0f;
 	}
 	if ( N == 1 || stride == 0 ) {
 		return X[ 0 ];
diff --git a/lib/node_modules/@stdlib/blas/ext/base/snansum/src/snansum.c b/lib/node_modules/@stdlib/blas/ext/base/snansum/src/snansum.c
@@ -49,11 +49,11 @@ float stdlib_strided_snansum( const int64_t N, const float *X, const int64_t str
 	float c;
 
 	if ( N <= 0 ) {
-		return 0.0;
+		return 0.0f;
 	}
 	if ( N == 1 || stride == 0 ) {
 		if ( stdlib_base_is_nanf( X[ 0 ] ) ) {
-			return 0.0;
+			return 0.0f;
 		}
 		return X[ 0 ];
 	}
@@ -62,8 +62,8 @@ float stdlib_strided_snansum( const int64_t N, const float *X, const int64_t str
 	} else {
 		ix = 0;
 	}
-	sum = 0.0;
-	c = 0.0;
+	sum = 0.0f;
+	c = 0.0f;
 	for ( i = 0; i < N; i++ ) {
 		v = X[ ix ];
 		if ( !stdlib_base_is_nanf( v ) ) {
diff --git a/lib/node_modules/@stdlib/blas/ext/base/snansumkbn2/src/snansumkbn2.c b/lib/node_modules/@stdlib/blas/ext/base/snansumkbn2/src/snansumkbn2.c
@@ -52,11 +52,11 @@ float stdlib_strided_snansumkbn2( const int64_t N, const float *X, const int64_t
 	float c;
 
 	if ( N <= 0 ) {
-		return 0.0;
+		return 0.0f;
 	}
 	if ( N == 1 || stride == 0 ) {
 		if ( stdlib_base_is_nanf( X[ 0 ] ) ) {
-			return 0.0;
+			return 0.0f;
 		}
 		return X[ 0 ];
 	}
@@ -65,9 +65,9 @@ float stdlib_strided_snansumkbn2( const int64_t N, const float *X, const int64_t
 	} else {
 		ix = 0;
 	}
-	sum = 0.0;
-	ccs = 0.0; // second order correction term for lost lower order bits
-	cs = 0.0; // first order correction term for lost low order bits
+	sum = 0.0f;
+	ccs = 0.0f; // second order correction term for lost lower order bits
+	cs = 0.0f; // first order correction term for lost low order bits
 	for ( i = 0; i < N; i++ ) {
 		v = X[ ix ];
 		if ( !stdlib_base_is_nanf( v ) ) {
diff --git a/lib/node_modules/@stdlib/blas/ext/base/snansumors/src/snansumors.c b/lib/node_modules/@stdlib/blas/ext/base/snansumors/src/snansumors.c
@@ -36,7 +36,7 @@ float stdlib_strided_snansumors( const int64_t N, const float *X, const int64_t
 	int64_t i;
 	float sum;
 
-	sum = 0.0;
+	sum = 0.0f;
 	if ( N <= 0 ) {
 		return sum;
 	}
diff --git a/lib/node_modules/@stdlib/blas/ext/base/snansumpw/src/snansumpw.c b/lib/node_modules/@stdlib/blas/ext/base/snansumpw/src/snansumpw.c
@@ -55,11 +55,11 @@ float stdlib_strided_snansumpw( const int64_t N, const float *X, const int64_t s
 	float s7;
 
 	if ( N <= 0 ) {
-		return 0.0;
+		return 0.0f;
 	}
 	if ( N == 1 || stride == 0 ) {
 		if ( stdlib_base_is_nanf( X[ 0 ] ) ) {
-			return 0.0;
+			return 0.0f;
 		}
 		return X[ 0 ];
 	}
@@ -70,7 +70,7 @@ float stdlib_strided_snansumpw( const int64_t N, const float *X, const int64_t s
 	}
 	if ( N < 8 ) {
 		// Use simple summation...
-		sum = 0.0;
+		sum = 0.0f;
 		for ( i = 0; i < N; i++ ) {
 			if ( !stdlib_base_is_nanf( X[ ix ] ) ) {
 				sum += X[ ix ];
diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssum/src/ssum.c b/lib/node_modules/@stdlib/blas/ext/base/ssum/src/ssum.c
@@ -48,7 +48,7 @@ float stdlib_strided_ssum( const int64_t N, const float *X, const int64_t stride
 	float c;
 
 	if ( N <= 0 ) {
-		return 0.0;
+		return 0.0f;
 	}
 	if ( N == 1 || stride == 0 ) {
 		return X[ 0 ];
@@ -58,8 +58,8 @@ float stdlib_strided_ssum( const int64_t N, const float *X, const int64_t stride
 	} else {
 		ix = 0;
 	}
-	sum = 0.0;
-	c = 0.0;
+	sum = 0.0f;
+	c = 0.0f;
 	for ( i = 0; i < N; i++ ) {
 		v = X[ ix ];
 		t = sum + v;
diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssumkbn2/src/ssumkbn2.c b/lib/node_modules/@stdlib/blas/ext/base/ssumkbn2/src/ssumkbn2.c
@@ -51,7 +51,7 @@ float stdlib_strided_ssumkbn2( const int64_t N, const float *X, const int64_t st
 	float c;
 
 	if ( N <= 0 ) {
-		return 0.0;
+		return 0.0f;
 	}
 	if ( N == 1 || stride == 0 ) {
 		return X[ 0 ];
@@ -61,9 +61,9 @@ float stdlib_strided_ssumkbn2( const int64_t N, const float *X, const int64_t st
 	} else {
 		ix = 0;
 	}
-	sum = 0.0;
-	ccs = 0.0; // second order correction term for lost lower order bits
-	cs = 0.0; // first order correction term for lost low order bits
+	sum = 0.0f;
+	ccs = 0.0f; // second order correction term for lost lower order bits
+	cs = 0.0f; // first order correction term for lost low order bits
 	for ( i = 0; i < N; i++ ) {
 		v = X[ ix ];
 		t = sum + v;
diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssumors/src/ssumors.c b/lib/node_modules/@stdlib/blas/ext/base/ssumors/src/ssumors.c
@@ -36,7 +36,7 @@ float stdlib_strided_ssumors( const int64_t N, const float *X, const int64_t str
 	int64_t i;
 	float sum;
 
-	sum = 0.0;
+	sum = 0.0f;
 	if ( N <= 0 ) {
 		return sum;
 	}
diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssumpw/src/ssumpw.c b/lib/node_modules/@stdlib/blas/ext/base/ssumpw/src/ssumpw.c
@@ -54,7 +54,7 @@ float stdlib_strided_ssumpw( const int64_t N, const float *X, const int64_t stri
 	float s7;
 
 	if ( N <= 0 ) {
-		return 0.0;
+		return 0.0f;
 	}
 	if ( N == 1 || stride == 0 ) {
 		return X[ 0 ];
@@ -66,7 +66,7 @@ float stdlib_strided_ssumpw( const int64_t N, const float *X, const int64_t stri
 	}
 	if ( N < 8 ) {
 		// Use simple summation...
-		sum = 0.0;
+		sum = 0.0f;
 		for ( i = 0; i < N; i++ ) {
 			sum += X[ ix ];
 			ix += stride;

Original file line number	Diff line number	Diff line change
`@@ -55,11 +55,11 @@ float stdlib_strided_sdsnansum( const int64_t N, const float *X, const int64_t s`
`55`	`55`	`double s7;`
`56`	`56`
`57`	`57`	`if ( N <= 0 ) {`
`58`		`- return 0.0;`
	`58`	`+ return 0.0f;`
`59`	`59`	`}`
`60`	`60`	`if ( N == 1 \|\| stride == 0 ) {`
`61`	`61`	`if ( stdlib_base_is_nanf( X[ 0 ] ) ) {`
`62`		`- return 0.0;`
	`62`	`+ return 0.0f;`
`63`	`63`	`}`
`64`	`64`	`return X[ 0 ];`
`65`	`65`	`}`
Original file line number	Diff line number	Diff line change
`@@ -54,7 +54,7 @@ float stdlib_strided_sdssum( const int64_t N, const float *X, const int64_t stri`
`54`	`54`	`double s7;`
`55`	`55`
`56`	`56`	`if ( N <= 0 ) {`
`57`		`- return 0.0;`
	`57`	`+ return 0.0f;`
`58`	`58`	`}`
`59`	`59`	`if ( N == 1 \|\| stride == 0 ) {`
`60`	`60`	`return X[ 0 ];`
Original file line number	Diff line number	Diff line change
`@@ -49,11 +49,11 @@ float stdlib_strided_snansum( const int64_t N, const float *X, const int64_t str`
`49`	`49`	`float c;`
`50`	`50`
`51`	`51`	`if ( N <= 0 ) {`
`52`		`- return 0.0;`
	`52`	`+ return 0.0f;`
`53`	`53`	`}`
`54`	`54`	`if ( N == 1 \|\| stride == 0 ) {`
`55`	`55`	`if ( stdlib_base_is_nanf( X[ 0 ] ) ) {`
`56`		`- return 0.0;`
	`56`	`+ return 0.0f;`
`57`	`57`	`}`
`58`	`58`	`return X[ 0 ];`
`59`	`59`	`}`
`@@ -62,8 +62,8 @@ float stdlib_strided_snansum( const int64_t N, const float *X, const int64_t str`
`62`	`62`	`} else {`
`63`	`63`	`ix = 0;`
`64`	`64`	`}`
`65`		`- sum = 0.0;`
`66`		`- c = 0.0;`
	`65`	`+ sum = 0.0f;`
	`66`	`+ c = 0.0f;`
`67`	`67`	`for ( i = 0; i < N; i++ ) {`
`68`	`68`	`v = X[ ix ];`
`69`	`69`	`if ( !stdlib_base_is_nanf( v ) ) {`
Original file line number	Diff line number	Diff line change
`@@ -36,7 +36,7 @@ float stdlib_strided_snansumors( const int64_t N, const float *X, const int64_t`
`36`	`36`	`int64_t i;`
`37`	`37`	`float sum;`
`38`	`38`
`39`		`- sum = 0.0;`
	`39`	`+ sum = 0.0f;`
`40`	`40`	`if ( N <= 0 ) {`
`41`	`41`	`return sum;`
`42`	`42`	`}`