chore: clean up in docs

---
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: passed
  - 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: passed
  - 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: na
  - task: lint_c_tests_fixtures
    status: na
  - task: lint_shell
    status: na
  - task: lint_typescript_declarations
    status: passed
  - task: lint_typescript_tests
    status: passed
  - task: lint_license_headers
    status: passed
---

Author: DivitJain26

lib/node_modules/@stdlib/blas/base/ctrsv/benchmark/benchmark.js

@@ -74,12 +74,12 @@ function createBenchmark( N ) {
 		b.tic();
 		for ( i = 0; i < b.iterations; i++ ) {
 			z = ctrsv( 'row-major', 'upper', 'transpose', 'non-unit', N, A, N, x, 1 );
-			if ( isnanf( z[ i % ( z.length ) ] ) ) {
+			if ( isnanf( z[ i%z.length ] ) ) {
 				b.fail( 'should not return NaN' );
 			}
 		}
 		b.toc();
-		if ( isnanf( z[ i % ( z.length ) ] ) ) {
+		if ( isnanf( z[ i%z.length ] ) ) {
 			b.fail( 'should not return NaN' );
 		}
 		b.pass( 'benchmark finished' );

lib/node_modules/@stdlib/blas/base/ctrsv/benchmark/benchmark.ndarray.js

@@ -74,12 +74,12 @@ function createBenchmark( N ) {
 		b.tic();
 		for ( i = 0; i < b.iterations; i++ ) {
 			z = ctrsv( 'upper', 'transpose', 'non-unit', N, A, N, 1, 0, x, 1, 0 );
-			if ( isnanf( z[ i%(z.length) ] ) ) {
+			if ( isnanf( z[ i%z.length ] ) ) {
 				b.fail( 'should not return NaN' );
 			}
 		}
 		b.toc();
-		if ( isnanf( z[ i%(z.length) ] ) ) {
+		if ( isnanf( z[ i%z.length ] ) ) {
 			b.fail( 'should not return NaN' );
 		}
 		b.pass( 'benchmark finished' );

lib/node_modules/@stdlib/blas/base/ctrsv/docs/repl.txt

@@ -1,8 +1,8 @@
 
 {{alias}}( order, uplo, trans, diag, N, A, lda, x, sx )
     Solves one of the systems of equations `A*x = b` or `A^T*x = b` or
-    `A^H*x = b` where `b` and `x` are `N` element complex vectors and `A` is an
-    `N` by `N` unit, or non-unit, upper or lower triangular complex matrix.
+    `A^H*x = b` where `b` and `x` are `N` element vectors and `A` is an `N` by
+    `N` unit, or non-unit, upper or lower triangular matrix.
 
     Indexing is relative to the first index. To introduce an offset, use typed
     array views.
@@ -20,8 +20,7 @@
 
     trans: string
         Specifies whether `A` should be transposed, conjugate-transposed, or not
-        transposed. Accepted values typically include: 'no-transpose',
-        'transpose', 'conjugate-transpose'.
+        transposed.
 
     diag: string
         Specifies whether `A` has a unit diagonal.
@@ -98,11 +97,11 @@
 {{alias}}.ndarray( uplo, trans, diag, N, A, sa1, sa2, oa, x, sx, ox )
     Solves one of the systems of equations `A*x = b` or `A^T*x = b` or
     `A^H*x = b` using alternative indexing semantics and where `b` and `x` are
-    `N` element complex vectors and `A` is an `N` by `N` unit, or non-unit,
-    upper or lower triangular complex matrix.
+    `N` element vectors and `A` is an `N` by `N` unit, or non-unit, upper or
+    lower triangular matrix.
 
-    While typed array views mandate a view offset based on the underlying buffer
-    , the offset parameters support indexing semantics based on starting
+    While typed array views mandate a view offset based on the underlying
+    buffer, the offset parameters support indexing semantics based on starting
     indices.
 
     Parameters
@@ -112,8 +111,7 @@
 
     trans: string
         Specifies whether `A` should be transposed, conjugate-transposed, or not
-        transposed. Accepted values typically include: 'no-transpose',
-        'transpose', 'conjugate-transpose'.
+        transposed.
 
     diag: string
         Specifies whether `A` has a unit diagonal.

lib/node_modules/@stdlib/blas/base/ctrsv/docs/types/index.d.ts

@@ -28,7 +28,7 @@ import { Complex64Array } from '@stdlib/types/array';
 */
 interface Routine {
 	/**
-	* Solves one of the systems of equations `A*x = b` or `A^T*x = b` or `A^H*x = b` where `b` and `x` are `N` element complex vectors and `A` is an `N` by `N` unit, or non-unit, upper or lower triangular complex matrix.
+	* Solves one of the systems of equations `A*x = b` or `A^T*x = b` or `A^H*x = b` where `b` and `x` are `N` element vectors and `A` is an `N` by `N` unit, or non-unit, upper or lower triangular matrix.
 	*
 	* @param order - storage layout
 	* @param uplo - specifies whether `A` is an upper or lower triangular matrix
@@ -53,7 +53,7 @@ interface Routine {
 	( order: Layout, uplo: MatrixTriangle, trans: TransposeOperation, diag: DiagonalType, N: number, A: Complex64Array, LDA: number, x: Complex64Array, strideX: number ): Complex64Array;
 
 	/**
-	* Solves one of the systems of equations `A*x = b` or `A^T*x = b` or `A^H*x = b` using alternative indexing semantics and where `b` and `x` are `N` element complex vectors and `A` is an `N` by `N` unit, or non-unit, upper or lower triangular complex matrix.
+	* Solves one of the systems of equations `A*x = b` or `A^T*x = b` or `A^H*x = b` using alternative indexing semantics and where `b` and `x` are `N` element vectors and `A` is an `N` by `N` unit, or non-unit, upper or lower triangular matrix.
 	*
 	* @param uplo - specifies whether `A` is an upper or lower triangular matrix
 	* @param trans - specifies whether `A` should be transposed, conjugate-transposed, or not transposed
@@ -81,7 +81,7 @@ interface Routine {
 }
 
 /**
-* Solves one of the systems of equations `A*x = b` or `A^T*x = b` or `A^H*x = b` where `b` and `x` are `N` element complex vectors and `A` is an `N` by `N` unit, or non-unit, upper or lower triangular complex matrix.
+* Solves one of the systems of equations `A*x = b` or `A^T*x = b` or `A^H*x = b` where `b` and `x` are `N` element vectors and `A` is an `N` by `N` unit, or non-unit, upper or lower triangular matrix.
 *
 * @param order - storage layout
 * @param uplo - specifies whether `A` is an upper or lower triangular matrix