chore: apply review changes

---
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: passed
  - 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: missing_dependencies
  - task: lint_c_examples
    status: missing_dependencies
  - task: lint_c_benchmarks
    status: missing_dependencies
  - 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: aman-095

lib/node_modules/@stdlib/blas/base/ssyr/README.md

@@ -2,7 +2,7 @@
 
 @license Apache-2.0
 
-Copyright (c) 2024 The Stdlib Authors.
+Copyright (c) 2025 The Stdlib Authors.
 
 Licensed under the Apache License, Version 2.0 (the "License");
 you may not use this file except in compliance with the License.
@@ -184,14 +184,15 @@ console.log( A );
 
 ```c
 #include "stdlib/blas/base/ssyr.h"
-#include "stdlib/blas/base/shared.h"
 ```
 
 #### c_ssyr( order, uplo, N, alpha, \*X, strideX, \*A, LDA )
 
 Performs the symmetric rank 1 operation `A = α*x*x^T + A`.
 
 ```c
+#include "stdlib/blas/base/shared.h"
+
 float A[] = { 1.0f, 0.0f, 0.0f, 2.0f, 1.0f, 0.0f, 3.0f, 2.0f, 1.0f };
 const float x[] = { 1.0f, 2.0f, 3.0f };
 
@@ -218,6 +219,8 @@ void c_ssyr( const CBLAS_LAYOUT order, const CBLAS_UPLO uplo, const CBLAS_INT N,
 Performs the symmetric rank 1 operation `A = α*x*x^T + A` using alternative indexing semantics.
 
 ```c
+#include "stdlib/blas/base/shared.h"
+
 float A[] = { 1.0f, 2.0f, 3.0f, 0.0f, 1.0f, 2.0f, 0.0f, 0.0f, 1.0f };
 const float x[] = { 1.0f, 2.0f, 3.0f };
 
@@ -269,7 +272,7 @@ int main( void ) {
     float A[] = { 1.0f, 0.0f, 0.0f, 2.0f, 1.0f, 0.0f, 3.0f, 2.0f, 1.0f };
     const float x[] = { 1.0f, 2.0f, 3.0f };
 
-    // Specify the number of elements:
+    // Specify the number of elements along each dimension of `A`:
     const int N = 3;
 
     // Perform the symmetric rank 1 operation `A = α*x*x^T + A`:

lib/node_modules/@stdlib/blas/base/ssyr/benchmark/c/Makefile

@@ -82,7 +82,7 @@ LIBRARIES ?=
 LIBPATH ?=
 
 # List of C targets:
-c_targets := benchmark.length.out
+c_targets := benchmark.out
 
 
 # RULES #

lib/node_modules/@stdlib/blas/base/ssyr/benchmark/c/benchmark.length.c renamed to lib/node_modules/@stdlib/blas/base/ssyr/benchmark/c/benchmark.c

@@ -94,21 +94,21 @@ static float rand_float( void ) {
 * Runs a benchmark.
 *
 * @param iterations   number of iterations
-* @param len          array length
-* @return elapsed time in seconds
+* @param N            number of elements along each dimension
+* @return             elapsed time in seconds
 */
-static double benchmark1( int iterations, int len ) {
+static double benchmark1( int iterations, int N ) {
 	double elapsed;
-	float A[ len*len ];
-	float x[ len ];
+	float A[ N*N ];
+	float x[ N ];
 	double t;
 	int i;
 
-	stdlib_strided_sfill( len, 0.5f, x, 1 );
-	stdlib_strided_sfill( len*len, 1.0f, A, 1 );
+	stdlib_strided_sfill( N, 0.5f, x, 1 );
+	stdlib_strided_sfill( N*N, 1.0f, A, 1 );
 	t = tic();
 	for ( i = 0; i < iterations; i++ ) {
-		c_ssyr( CblasRowMajor, CblasUpper, len, 1.0, x, 1, A, len );
+		c_ssyr( CblasRowMajor, CblasUpper, N, 1.0, x, 1, A, N );
 		if ( A[ 0 ] != A[ 0 ] ) {
 			printf( "should not return NaN\n" );
 			break;
@@ -125,21 +125,21 @@ static double benchmark1( int iterations, int len ) {
 * Runs a benchmark.
 *
 * @param iterations   number of iterations
-* @param len          array length
-* @return elapsed time in seconds
+* @param N            number of elements along each dimension
+* @return             elapsed time in seconds
 */
-static double benchmark2( int iterations, int len ) {
+static double benchmark2( int iterations, int N ) {
 	double elapsed;
-	float A[ len*len ];
-	float x[ len ];
+	float A[ N*N ];
+	float x[ N ];
 	double t;
 	int i;
 
-	stdlib_strided_sfill( len, 0.5f, x, 1 );
-	stdlib_strided_sfill( len*len, 1.0f, A, 1 );
+	stdlib_strided_sfill( N, 0.5f, x, 1 );
+	stdlib_strided_sfill( N*N, 1.0f, A, 1 );
 	t = tic();
 	for ( i = 0; i < iterations; i++ ) {
-		c_ssyr_ndarray( CblasUpper, len, 1.0, x, 1, 0, A, len, 1, 0 );
+		c_ssyr_ndarray( CblasUpper, N, 1.0, x, 1, 0, A, N, 1, 0 );
 		if ( A[ 0 ] != A[ 0 ] ) {
 			printf( "should not return NaN\n" );
 			break;
@@ -159,29 +159,29 @@ int main( void ) {
 	double elapsed;
 	int count;
 	int iter;
-	int len;
 	int i;
 	int j;
+	int N;
 
 	// Use the current time to seed the random number generator:
 	srand( time( NULL ) );
 
 	print_version();
 	count = 0;
 	for ( i = MIN; i <= MAX; i++ ) {
-		len = stdlib_base_floorf( pow( pow( 10, i ), 1.0/2.0 ) );
+		N = stdlib_base_floorf( pow( pow( 10, i ), 1.0/2.0 ) );
 		iter = ITERATIONS / pow( 10, i-1 );
 		for ( j = 0; j < REPEATS; j++ ) {
 			count += 1;
-			printf( "# c::%s:len=%d\n", NAME, len );
-			elapsed = benchmark1( iter, len );
+			printf( "# c::%s:size=%d\n", NAME, N*N );
+			elapsed = benchmark1( iter, N );
 			print_results( iter, elapsed );
 			printf( "ok %d benchmark finished\n", count );
 		}
 		for ( j = 0; j < REPEATS; j++ ) {
 			count += 1;
-			printf( "# c::%s:ndarray:len=%d\n", NAME, len );
-			elapsed = benchmark2( iter, len );
+			printf( "# c::%s:ndarray:size=%d\n", NAME, N*N );
+			elapsed = benchmark2( iter, N );
 			print_results( iter, elapsed );
 			printf( "ok %d benchmark finished\n", count );
 		}

lib/node_modules/@stdlib/blas/base/ssyr/examples/c/example.c

@@ -25,7 +25,7 @@ int main( void ) {
 	float A[] = { 1.0f, 0.0f, 0.0f, 2.0f, 1.0f, 0.0f, 3.0f, 2.0f, 1.0f };
 	const float x[] = { 1.0f, 2.0f, 3.0f };
 
-	// Specify the number of elements:
+	// Specify the number of elements along each dimension of `A`:
 	const int N = 3;
 
 	// Perform the symmetric rank 1 operation `A = α*x*x^T + A`:

lib/node_modules/@stdlib/blas/base/ssyr/src/ssyr.c

@@ -28,8 +28,8 @@
 * @param uplo     specifies whether the upper or lower triangular part of the symmetric matrix `A` should be referenced
 * @param N        number of elements along each dimension of `A`
 * @param alpha    scalar
-* @param x        input vector
-* @param strideX  `x` stride length
+* @param X        input vector
+* @param strideX  `X` stride length
 * @param A        input matrix
 * @param LDA      stride of the first dimension of `A` (a.k.a., leading dimension of the matrix `A`)
 */
@@ -59,9 +59,9 @@ void API_SUFFIX(c_ssyr)( const CBLAS_LAYOUT order, const CBLAS_UPLO uplo, const
 * @param uplo      specifies whether the upper or lower triangular part of the symmetric matrix `A` should be referenced
 * @param N         number of elements along each dimension of `A`
 * @param alpha     scalar
-* @param x         input vector
-* @param strideX   `x` stride length
-* @param offsetX   starting index of `x`
+* @param X         input vector
+* @param strideX   `X` stride length
+* @param offsetX   starting index of `X`
 * @param A         input matrix
 * @param strideA1  stride of the first dimension of `A`
 * @param strideA2  stride of the second dimension of `A`