Merge branch 'develop' of https://github.com/stdlib-js/stdlib into develop

Author: kgryte

.github/workflows/scripts/run_tests_coverage

@@ -173,15 +173,14 @@ main() {
 		pkg_functions_cov_fraction=${pkg_cov_fractions[2]}
 		pkg_lines_cov_fraction=${pkg_cov_fractions[3]}
 
-		old_cov_report=$(curl -s --fail "https://coverage.stdlib.io/${pkg}/lib/index.html" 2>/dev/null)
-		status=$?
-		if [ $status -ne 0 ]; then
+		old_cov_report=$(curl -s --fail "https://coverage.stdlib.io/${pkg}/lib/index.html" 2>/dev/null || true)
+		if [ -z "$old_cov_report" ]; then
 			old_statements_cov=0
 			old_branches_cov=0
 			old_functions_cov=0
 			old_lines_cov=0
 		else
-			old_cov_values=$(echo "$old_cov_report" | grep "fraction" | grep -oP '\d+/\d+' | awk -F'/' '{print $1/$2}')
+			old_cov_values=($(echo "$old_cov_report" | grep "fraction" | grep -oP '\d+/\d+' | awk -F'/' '{print $1/$2}'))
 			old_statements_cov=${old_cov_values[0]}
 			old_branches_cov=${old_cov_values[1]}
 			old_functions_cov=${old_cov_values[2]}
@@ -193,7 +192,6 @@ main() {
 		cov_change_functions=$(compare_cov "$old_functions_cov" "$pkg_functions_cov")
 		cov_change_lines=$(compare_cov "$old_lines_cov" "$pkg_lines_cov")
 
-		echo $pkg_statements_cov_fraction
 		pkg_cov="| $pkg_statements_cov_fraction (Δ $cov_change_statements) | $pkg_branches_cov_fraction (Δ $cov_change_branches) | $pkg_functions_cov_fraction (Δ $cov_change_functions) | $pkg_lines_cov_fraction (Δ $cov_change_lines) |"
 
 		pkg_url="https://github.com/${github_repo}/tree/${github_ref}/${package}"

lib/node_modules/@stdlib/random/base/box-muller/lib/main.js

@@ -43,7 +43,6 @@ var factory = require( './factory.js' );
 *
 * -   As two uniform random variates are mapped to two standard normal random variates, one of the random variates is cached and returned upon the following invocation.
 *
-*
 * ## Notes
 *
 * -   The minimum and maximum pseudorandom numbers which can be generated are dependent on the number of bits an underlying uniform pseudorandom number generator (PRNG) uses. For instance, if a PRNG uses \\( 32 \\) bits, the smallest non-zero number that can be generated is \\( 2^{-32}). When \\( U_1 \\) equals this value and \\( U_2 \\) equals \\( 0 \\),
@@ -60,7 +59,6 @@ var factory = require( './factory.js' );
 *
 *     <!-- </note> -->
 *
-*
 * ## References
 *
 * -   Box, G. E. P., and Mervin E. Muller. 1958. "A Note on the Generation of Random Normal Deviates." _The Annals of Mathematical Statistics_ 29 (2). The Institute of Mathematical Statistics: 610–11. doi:[10.1214/aoms/1177706645](http://dx.doi.org/10.1214/aoms/1177706645).
@@ -69,7 +67,6 @@ var factory = require( './factory.js' );
 * -   Marsaglia, G., and T. A. Bray. 1964. "A Convenient Method for Generating Normal Variables." _SIAM Review_ 6 (3). Society for Industrial; Applied Mathematics: 260–64. doi:[10.1137/1006063](http://dx.doi.org/10.1137/1006063).
 * -   Thomas, David B., Wayne Luk, Philip H.W. Leong, and John D. Villasenor. 2007. "Gaussian Random Number Generators." _ACM Computing Surveys_ 39 (4). New York, NY, USA: ACM. doi:[10.1145/1287620.1287622](http://dx.doi.org/10.1145/1287620.1287622).
 *
-*
 * @name randn
 * @type {PRNG}
 * @returns {number} pseudorandom number