style: fix spacing in C benchmark for planck/mode

---
type: pre_commit_static_analysis_report
description: Results of running static analysis checks when committing changes.
report:
  - task: lint_filenames
    status: passed
  - task: lint_editorconfig
    status: passed
  - task: lint_markdown
    status: na
  - task: lint_package_json
    status: na
  - task: lint_repl_help
    status: na
  - task: lint_javascript_src
    status: na
  - task: lint_javascript_cli
    status: na
  - task: lint_javascript_examples
    status: na
  - task: lint_javascript_tests
    status: na
  - task: lint_javascript_benchmarks
    status: na
  - task: lint_python
    status: na
  - task: lint_r
    status: na
  - task: lint_c_src
    status: na
  - task: lint_c_examples
    status: na
  - task: lint_c_benchmarks
    status: passed
  - task: lint_c_tests_fixtures
    status: na
  - task: lint_shell
    status: na
  - task: lint_typescript_declarations
    status: na
  - task: lint_typescript_tests
    status: na
  - task: lint_license_headers
    status: passed
---

Author: Planeshifter

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

@@ -166,7 +166,7 @@ console.log( v );
 ## See Also
 
 -   <span class="package-name">[`@stdlib/blas/ext/base/dapxsumkbn`][@stdlib/blas/ext/base/dapxsumkbn]</span><span class="delimiter">: </span><span class="description">add a constant to each double-precision floating-point strided array element and compute the sum using an improved Kahan–Babuška algorithm.</span>
--   <span class="package-name">[`@stdlib/blas/ext/base/gapxsumkbn`][@stdlib/blas/ext/base/gapxsumkbn]</span><span class="delimiter">: </span><span class="description">add a scalar constant to each strided array element and compute the sum using an improved Kahan–Babuška algorithm.</span>
+-   <span class="package-name">[`@stdlib/blas/ext/base/gapxsumkbn`][@stdlib/blas/ext/base/gapxsumkbn]</span><span class="delimiter">: </span><span class="description">add a constant to each strided array element and compute the sum using an improved Kahan–Babuška algorithm.</span>
 -   <span class="package-name">[`@stdlib/blas/ext/base/sapxsum`][@stdlib/blas/ext/base/sapxsum]</span><span class="delimiter">: </span><span class="description">add a constant to each single-precision floating-point strided array element and compute the sum.</span>
 -   <span class="package-name">[`@stdlib/blas/ext/base/ssumkbn`][@stdlib/blas/ext/base/ssumkbn]</span><span class="delimiter">: </span><span class="description">calculate the sum of single-precision floating-point strided array elements using an improved Kahan–Babuška algorithm.</span>
 

lib/node_modules/@stdlib/constants/float32/pi/README.md

@@ -108,14 +108,6 @@ Macro for the mathematical constant [π][pi].
 
 <section class="related">
 
-* * *
-
-## See Also
-
--   <span class="package-name">[`@stdlib/constants/float32/fourth-pi`][@stdlib/constants/float32/fourth-pi]</span><span class="delimiter">: </span><span class="description">1/4 times π.</span>
--   <span class="package-name">[`@stdlib/constants/float32/half-pi`][@stdlib/constants/float32/half-pi]</span><span class="delimiter">: </span><span class="description">1/2 times π.</span>
--   <span class="package-name">[`@stdlib/constants/float32/two-pi`][@stdlib/constants/float32/two-pi]</span><span class="delimiter">: </span><span class="description">2π.</span>
-
 </section>
 
 <!-- /.related -->

lib/node_modules/@stdlib/stats/base/dists/planck/mode/README.md

@@ -146,7 +146,7 @@ for ( i = 0; i < lambda.length; i++ ) {
 
 #### stdlib_base_dists_planck_mode( lambda )
 
-Evaluates the mode for planck distribution.
+Returns the [mode][mode] of a Planck distribution with shape parameter `lambda`.
 
 ```c
 double out = stdlib_base_dists_planck_mode( 0.1 );
@@ -155,7 +155,7 @@ double out = stdlib_base_dists_planck_mode( 0.1 );
 
 The function accepts the following arguments:
 
--   **lambda**: `[in] double` shape parameter
+-   **lambda**: `[in] double` shape parameter.
 
 ```c
 double stdlib_base_dists_planck_mode( const double lambda );
@@ -195,7 +195,7 @@ int main( void ) {
     for ( i = 0; i < 25; i++ ) {
         lambda = random_uniform( 0.1, 10.0 );
         y = stdlib_base_dists_planck_mode( lambda );
-        printf( "lambda: %lf, E(X;λ): %lf\n", lambda, y );
+        printf( "lambda: %lf, mode(X;λ): %lf\n", lambda, y );
     }
 }
 ```

lib/node_modules/@stdlib/stats/base/dists/planck/mode/benchmark/c/benchmark.c

@@ -13,7 +13,7 @@
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
-* limitations under the License .
+* limitations under the License.
 */
 
 #include "stdlib/stats/base/dists/planck/mode.h"
@@ -30,8 +30,8 @@
 /**
 * Prints the TAP version.
 */
-static void print_version(void) {
-	printf("TAP version 13\n");
+static void print_version( void ) {
+	printf( "TAP version 13\n" );
 }
 
 /**
@@ -40,37 +40,37 @@ static void print_version(void) {
 * @param total     total number of tests
 * @param passing   total number of passing tests
 */
-static void print_summary(int total, int passing) {
-	printf("#\n");
-	printf("1..%d\n", total); // TAP plan
-	printf("# total %d\n", total);
-	printf("# pass  %d\n", passing);
-	printf("#\n");
-	printf("# ok\n");
+static void print_summary( int total, int passing ) {
+	printf( "#\n" );
+	printf( "1..%d\n", total ); // TAP plan
+	printf( "# total %d\n", total );
+	printf( "# pass  %d\n", passing );
+	printf( "#\n" );
+	printf( "# ok\n" );
 }
 
 /**
 * Prints benchmarks results.
 *
 * @param elapsed   elapsed time in seconds
 */
-static void print_results(double elapsed) {
+static void print_results( double elapsed ) {
 	double rate = (double)ITERATIONS / elapsed;
-	printf("  ---\n");
-	printf("  iterations: %d\n", ITERATIONS);
-	printf("  elapsed: %0.9f\n", elapsed);
-	printf("  rate: %0.9f\n", rate);
-	printf("  ...\n");
+	printf( "  ---\n" );
+	printf( "  iterations: %d\n", ITERATIONS );
+	printf( "  elapsed: %0.9f\n", elapsed );
+	printf( "  rate: %0.9f\n", rate );
+	printf( "  ...\n" );
 }
 
 /**
 * Returns a clock time.
 *
 * @return clock time
 */
-static double tic(void) {
+static double tic( void ) {
 	struct timeval now;
-	gettimeofday(&now, NULL);
+	gettimeofday( &now, NULL );
 	return (double)now.tv_sec + (double)now.tv_usec / 1.0e6;
 }
 
@@ -81,60 +81,60 @@ static double tic(void) {
 * @param max    maximum value (exclusive)
 * @return       random number
 */
-static double random_uniform(const double min, const double max) {
-	double v = (double)rand() / ((double)RAND_MAX + 1.0);
-	return min + (v * (max - min));
+static double random_uniform( const double min, const double max ) {
+	double v = (double)rand() / ( (double)RAND_MAX + 1.0 );
+	return min + ( v * ( max - min ) );
 }
 
 /**
 * Runs a benchmark.
 *
 * @return elapsed time in seconds
 */
-static double benchmark(void) {
+static double benchmark( void ) {
 	double elapsed;
 	double lambda[100];
 	double y;
 	double t;
 	int i;
 
-	for (i = 0; i < 100; i++) {
-		lambda[i] = (random_uniform(0.0, 10.0) + 1.0);
+	for ( i = 0; i < 100; i++ ) {
+		lambda[i] = ( random_uniform( 0.0, 10.0 ) + 1.0 );
 	}
 
 	t = tic();
-	for (i = 0; i < ITERATIONS; i++) {
-		y = stdlib_base_dists_planck_mode(lambda[i % 100]);
-		if (y != y) {
-			printf("should not return NaN\n");
+	for ( i = 0; i < ITERATIONS; i++ ) {
+		y = stdlib_base_dists_planck_mode( lambda[i % 100] );
+		if ( y != y ) {
+			printf( "should not return NaN\n" );
 			break;
 		}
 	}
 	elapsed = tic() - t;
-	if (y != y) {
-		printf("should not return NaN\n");
+	if ( y != y ) {
+		printf( "should not return NaN\n" );
 	}
 	return elapsed;
 }
 
 /**
 * Main execution sequence.
 */
-int main(void) {
+int main( void ) {
 	double elapsed;
 	int i;
 
 	// Use the current time to seed the random number generator:
-	srand(time(NULL));
+	srand( time( NULL ) );
 
 	print_version();
-	for (i = 0; i < REPEATS; i++) {
-		printf("# c::%s\n", NAME);
+	for ( i = 0; i < REPEATS; i++ ) {
+		printf( "# c::%s\n", NAME );
 		elapsed = benchmark();
-		print_results(elapsed);
-		printf("ok %d benchmark finished\n", i + 1);
+		print_results( elapsed );
+		printf( "ok %d benchmark finished\n", i + 1 );
 	}
-	print_summary(REPEATS, REPEATS);
+	print_summary( REPEATS, REPEATS );
 
 	return 0;
 }

lib/node_modules/@stdlib/stats/base/dists/planck/mode/examples/c/example.c

@@ -32,6 +32,6 @@ int main( void ) {
 	for ( i = 0; i < 25; i++ ) {
 		lambda = random_uniform( 1.0, 10.0 );
 		y = stdlib_base_dists_planck_mode( lambda );
-		printf( "λ: %lf, F(x;λ): %lf\n", lambda , y );
+		printf( "λ: %lf, mode(X;λ): %lf\n", lambda , y );
 	}
 }

lib/node_modules/@stdlib/stats/base/dists/planck/mode/lib/native.js

@@ -26,7 +26,7 @@ var addon = require( './../src/addon.node' );
 // MAIN //
 
 /**
-* Returns the mode for Planck distribution with shape parameter `lambda`.
+* Returns the mode for a Planck distribution with shape parameter `lambda`.
 *
 * @private
 * @param {number} lambda - shape parameter

lib/node_modules/@stdlib/stats/base/dists/planck/mode/package.json

@@ -28,8 +28,8 @@
   "scripts": {},
   "homepage": "https://github.com/stdlib-js/stdlib",
   "repository": {
-      "type": "git",
-      "url": "git://github.com/stdlib-js/stdlib.git"
+    "type": "git",
+    "url": "git://github.com/stdlib-js/stdlib.git"
   },
   "bugs": {
     "url": "https://github.com/stdlib-js/stdlib/issues"

lib/node_modules/@stdlib/stats/base/dists/planck/mode/src/addon.c

@@ -19,5 +19,4 @@
 #include "stdlib/stats/base/dists/planck/mode.h"
 #include "stdlib/math/base/napi/unary.h"
 
-// cppcheck-suppress shadowFunction
 STDLIB_MATH_BASE_NAPI_MODULE_D_D( stdlib_base_dists_planck_mode )

lib/node_modules/@stdlib/stats/base/dists/planck/mode/src/main.c

@@ -23,7 +23,7 @@
 * Returns the mode of a Planck distribution with shape parameter `lambda`.
 *
 * @param lambda   shape parameter
-* @return         mode or NaN if invalid input
+* @return         mode
 *
 * @example
 * double y = stdlib_base_dists_planck_mode( 0.1 );