refactor: apply suggestions from code review

---
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: passed
  - task: lint_javascript_src
    status: passed
  - task: lint_javascript_cli
    status: na
  - task: lint_javascript_examples
    status: passed
  - task: lint_javascript_tests
    status: passed
  - task: lint_javascript_benchmarks
    status: passed
  - 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: passed
  - task: lint_typescript_tests
    status: passed
  - task: lint_license_headers
    status: passed
---

Author: headlessNode

lib/node_modules/@stdlib/blas/ext/base/dcartesian-power/README.md

@@ -36,7 +36,7 @@ limitations under the License.
 var dcartesianPower = require( '@stdlib/blas/ext/base/dcartesian-power' );
 ```
 
-#### dcartesianPower( N, k, x, strideX, out, LDO )
+#### dcartesianPower( order, N, k, x, strideX, out, LDO )
 
 Computes the Cartesian power for a double-precision floating-point strided array.
 
@@ -46,12 +46,13 @@ var Float64Array = require( '@stdlib/array/float64' );
 var x = new Float64Array( [ 1.0, 2.0 ] );
 var out = new Float64Array( 8 );
 
-dcartesianPower( x.length, 2, x, 1, out, 2 );
+dcartesianPower( 'row-major', x.length, 2, x, 1, out, 2 );
 // out => <Float64Array>[ 1.0, 1.0, 1.0, 2.0, 2.0, 1.0, 2.0, 2.0 ]
 ```
 
 The function has the following parameters:
 
+-   **order**: storage layout.
 -   **N**: number of indexed elements.
 -   **k**: power.
 -   **x**: input [`Float64Array`][@stdlib/array/float64].
@@ -67,7 +68,7 @@ var Float64Array = require( '@stdlib/array/float64' );
 var x = new Float64Array( [ 1.0, 0.0, 2.0, 0.0 ] );
 var out = new Float64Array( 8 );
 
-dcartesianPower( 2, 2, x, 2, out, 2 );
+dcartesianPower( 'row-major', 2, 2, x, 2, out, 2 );
 // out => <Float64Array>[ 1.0, 1.0, 1.0, 2.0, 2.0, 1.0, 2.0, 2.0 ]
 ```
 
@@ -85,7 +86,7 @@ var out0 = new Float64Array( 8 );
 // Create offset views...
 var x1 = new Float64Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); // start at 2nd element
 
-dcartesianPower( 2, 2, x1, 1, out0, 2 );
+dcartesianPower( 'row-major', 2, 2, x1, 1, out0, 2 );
 // out0 => <Float64Array>[ 1.0, 1.0, 1.0, 2.0, 2.0, 1.0, 2.0, 2.0 ]
 ```
 
@@ -136,6 +137,7 @@ dcartesianPower.ndarray( 2, 2, x, 1, 1, out, 2, 1, 0 );
 
 -   If `N <= 0` or `k <= 0`, both functions return `out` unchanged.
 -   The output array must contain at least `N^k * k` elements.
+-   The `LDO` parameter must be greater than or equal to `max(1, k)`.
 
 </section>
 
@@ -156,7 +158,7 @@ console.log( x );
 
 var out = new Float64Array( 24 );
 
-dcartesianPower( x.length, 3, x, 1, out, 3 );
+dcartesianPower( 'row-major', x.length, 3, x, 1, out, 3 );
 console.log( out );
 ```
 
@@ -192,21 +194,24 @@ console.log( out );
 
 <!--lint disable maximum-heading-length-->
 
-#### stdlib_strided_dcartesian_power( N, k, \*X, strideX, \*Out, LDO )
+#### stdlib_strided_dcartesian_power( order, N, k, \*X, strideX, \*Out, LDO )
 
 <!--lint enable maximum-heading-length-->
 
 Computes the Cartesian power for a double-precision floating-point strided array.
 
 ```c
+#include "stdlib/blas/base/shared.h"
+
 const double X[] = { 1.0, 2.0 };
 double Out[] = { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 };
 
-stdlib_strided_dcartesian_power( 2, 2, X, 1, Out, 2 );
+stdlib_strided_dcartesian_power( CblasRowMajor, 2, 2, X, 1, Out, 2 );
 ```
 
 The function accepts the following arguments:
 
+-   **order**: `[in] CBLAS_LAYOUT` storage layout.
 -   **N**: `[in] CBLAS_INT` number of indexed elements.
 -   **k**: `[in] CBLAS_INT` power.
 -   **X**: `[in] double*` input array.
@@ -215,7 +220,7 @@ The function accepts the following arguments:
 -   **LDO**: `[in] CBLAS_INT` stride length for the leading dimension of `Out`.
 
 ```c
-void stdlib_strided_dcartesian_power( const CBLAS_INT N, const CBLAS_INT k, const double *X, const CBLAS_INT strideX, double *Out, const CBLAS_INT LDO );
+void stdlib_strided_dcartesian_power( const CBLAS_LAYOUT order, const CBLAS_INT N, const CBLAS_INT k, const double *X, const CBLAS_INT strideX, double *Out, const CBLAS_INT LDO );
 ```
 
 <!--lint disable maximum-heading-length-->
@@ -269,6 +274,7 @@ void stdlib_strided_dcartesian_power_ndarray( const CBLAS_INT N, const CBLAS_INT
 
 ```c
 #include "stdlib/blas/ext/base/dcartesianpower.h"
+#include "stdlib/blas/base/shared.h"
 #include <stdio.h>
 
 int main( void ) {
@@ -287,7 +293,7 @@ int main( void ) {
     const int LDO = 2;
 
     // Compute the Cartesian power:
-    stdlib_strided_dcartesian_power( N, k, X, strideX, out, LDO );
+    stdlib_strided_dcartesian_power( CblasRowMajor, N, k, X, strideX, out, LDO );
 
     // Print the result:
     for ( int i = 0; i < N*N; i++ ) {

lib/node_modules/@stdlib/blas/ext/base/dcartesian-power/benchmark/benchmark.js

@@ -67,7 +67,7 @@ function createBenchmark( len ) {
 
 		b.tic();
 		for ( i = 0; i < b.iterations; i++ ) {
-			z = dcartesianPower( x.length, K, x, 1, out, K );
+			z = dcartesianPower( 'row-major', x.length, K, x, 1, out, K );
 			if ( isnan( z[ 0 ] ) ) {
 				b.fail( 'should not return NaN' );
 			}

lib/node_modules/@stdlib/blas/ext/base/dcartesian-power/benchmark/benchmark.native.js

@@ -72,7 +72,7 @@ function createBenchmark( len ) {
 
 		b.tic();
 		for ( i = 0; i < b.iterations; i++ ) {
-			z = dcartesianPower( x.length, K, x, 1, out, K );
+			z = dcartesianPower( 'row-major', x.length, K, x, 1, out, K );
 			if ( isnan( z[ 0 ] ) ) {
 				b.fail( 'should not return NaN' );
 			}

lib/node_modules/@stdlib/blas/ext/base/dcartesian-power/benchmark/c/benchmark.length.c

@@ -17,6 +17,7 @@
 */
 
 #include "stdlib/blas/ext/base/dcartesianpower.h"
+#include "stdlib/blas/base/shared.h"
 #include <stdlib.h>
 #include <stdio.h>
 #include <math.h>
@@ -114,7 +115,7 @@ static double benchmark1( int iterations, int len ) {
 	}
 	t = tic();
 	for ( i = 0; i < iterations; i++ ) {
-		stdlib_strided_dcartesian_power( len, K, x, 1, out, K );
+		stdlib_strided_dcartesian_power( CblasRowMajor, len, K, x, 1, out, K );
 		if ( out[ 0 ] != out[ 0 ] ) {
 			printf( "should not return NaN\n" );
 			break;

lib/node_modules/@stdlib/blas/ext/base/dcartesian-power/docs/repl.txt

@@ -1,4 +1,4 @@
-{{alias}}( N, k, x, strideX, out, LDO )
+{{alias}}( order, N, k, x, strideX, out, LDO )
     Computes the Cartesian power for a double-precision floating-point strided
     array.
 
@@ -9,6 +9,9 @@
 
     Parameters
     ----------
+    order: string
+        Storage layout.
+
     N: integer
         Number of indexed elements.
 
@@ -37,13 +40,13 @@
     // Standard Usage:
     > var x = new {{alias:@stdlib/array/float64}}( [ 1.0, 2.0 ] );
     > var out = new {{alias:@stdlib/array/float64}}( 8 );
-    > {{alias}}( x.length, 2, x, 1, out, 2 )
+    > {{alias}}( 'row-major', x.length, 2, x, 1, out, 2 )
     <Float64Array>[ 1.0, 1.0, 1.0, 2.0, 2.0, 1.0, 2.0, 2.0 ]
 
     // Using `N` and stride parameters:
     > x = new {{alias:@stdlib/array/float64}}( [ 1.0, 0.0, 2.0, 0.0 ] );
     > out = new {{alias:@stdlib/array/float64}}( 8 );
-    > {{alias}}( 2, 2, x, 2, out, 2 )
+    > {{alias}}( 'row-major', 2, 2, x, 2, out, 2 )
     <Float64Array>[ 1.0, 1.0, 1.0, 2.0, 2.0, 1.0, 2.0, 2.0 ]
 
 

lib/node_modules/@stdlib/blas/ext/base/dcartesian-power/docs/types/index.d.ts

@@ -18,13 +18,18 @@
 
 // TypeScript Version: 4.1
 
+/// <reference types="@stdlib/types"/>
+
+import { Layout } from '@stdlib/types/blas';
+
 /**
 * Interface describing `dcartesianPower`.
 */
 interface Routine {
 	/**
 	* Computes the Cartesian power for a double-precision floating-point strided array.
 	*
+	* @param order - storage layout
 	* @param N - number of indexed elements
 	* @param k - power
 	* @param x - input array
@@ -39,10 +44,10 @@ interface Routine {
 	* var x = new Float64Array( [ 1.0, 2.0 ] );
 	* var out = new Float64Array( 8 );
 	*
-	* dcartesianPower( x.length, 2, x, 1, out, 2 );
+	* dcartesianPower( 'row-major', x.length, 2, x, 1, out, 2 );
 	* // out => <Float64Array>[ 1.0, 1.0, 1.0, 2.0, 2.0, 1.0, 2.0, 2.0 ]
 	*/
-	( N: number, k: number, x: Float64Array, strideX: number, out: Float64Array, LDO: number ): Float64Array;
+	( order: Layout, N: number, k: number, x: Float64Array, strideX: number, out: Float64Array, LDO: number ): Float64Array;
 
 	/**
 	* Computes the Cartesian power for a double-precision floating-point strided array using alternative indexing semantics.
@@ -73,6 +78,7 @@ interface Routine {
 /**
 * Computes the Cartesian power for a double-precision floating-point strided array.
 *
+* @param order - storage layout
 * @param N - number of indexed elements
 * @param k - power
 * @param x - input array
@@ -87,7 +93,7 @@ interface Routine {
 * var x = new Float64Array( [ 1.0, 2.0 ] );
 * var out = new Float64Array( 8 );
 *
-* dcartesianPower( x.length, 2, x, 1, out, 2 );
+* dcartesianPower( 'row-major', x.length, 2, x, 1, out, 2 );
 * // out => <Float64Array>[ 1.0, 1.0, 1.0, 2.0, 2.0, 1.0, 2.0, 2.0 ]
 *
 * @example