diff --git a/lib/node_modules/@stdlib/blas/ext/base/docs/types/index.d.ts b/lib/node_modules/@stdlib/blas/ext/base/docs/types/index.d.ts
index 87c842ac2f0c..d6e5f72eba8b 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/docs/types/index.d.ts
+++ b/lib/node_modules/@stdlib/blas/ext/base/docs/types/index.d.ts
@@ -342,7 +342,7 @@ interface Namespace {
 	*
 	* ## Notes
 	*
-	* -   If the function is provided an empty matrix or if the function is unable to find a search vector, the function returns `-1` (i.e., an invalid index).
+	* -   If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index).
 	* -   The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored.
 	*
 	* @param order - storage layout
@@ -385,7 +385,7 @@ interface Namespace {
 	*
 	* ## Notes
 	*
-	* -   If the function is provided an empty matrix or if the function is unable to find a search vector, the function returns `-1` (i.e., an invalid index).
+	* -   If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index).
 	* -   The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored.
 	*
 	* @param order - storage layout
@@ -1191,7 +1191,7 @@ interface Namespace {
 	*
 	* ## Notes
 	*
-	* -   If the function is provided an empty matrix or if the function is unable to find a search vector, the function returns `-1` (i.e., an invalid index).
+	* -   If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index).
 	* -   The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored.
 	*
 	* @param order - storage layout
@@ -1265,7 +1265,7 @@ interface Namespace {
 	*
 	* ## Notes
 	*
-	* -   If the function is provided an empty matrix or if the function is unable to find a search vector, the function returns `-1` (i.e., an invalid index).
+	* -   If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index).
 	* -   The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored.
 	*
 	* @param order - storage layout
@@ -3293,7 +3293,7 @@ interface Namespace {
 	*
 	* ## Notes
 	*
-	* -   If the function is provided an empty matrix or if the function is unable to find a search vector, the function returns `-1` (i.e., an invalid index).
+	* -   If the function is provided an empty matrix or if the function is unable to find a matching column, the function returns `-1` (i.e., an invalid index).
 	*
 	* @param order - storage layout
 	* @param M - number of rows in `A`
@@ -3325,7 +3325,7 @@ interface Namespace {
 	*
 	* ## Notes
 	*
-	* -   If the function is provided an empty matrix or if the function is unable to find a search vector, the function returns `-1` (i.e., an invalid index).
+	* -   If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index).
 	*
 	* @param order - storage layout
 	* @param M - number of rows in `A`
@@ -3435,7 +3435,7 @@ interface Namespace {
 	*
 	* ## Notes
 	*
-	* -   If the function is provided an empty matrix or if the function is unable to find a search vector, the function returns `-1` (i.e., an invalid index).
+	* -   If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index).
 	* -   The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored.
 	*
 	* @param order - storage layout
@@ -4893,7 +4893,7 @@ interface Namespace {
 	*
 	* ## Notes
 	*
-	* -   If the function is provided an empty matrix or if the function is unable to find a search vector, the function returns `-1` (i.e., an invalid index).
+	* -   If the function is provided an empty matrix or if the function is unable to find a matching column, the function returns `-1` (i.e., an invalid index).
 	* -   The `workspace` array is only applicable when an input matrix is stored in row-major order. When the matrix is stored in column-major order, the workspace array is ignored.
 	*
 	* @param order - storage layout
@@ -4936,7 +4936,7 @@ interface Namespace {
 	*
 	* ## Notes
 	*
-	* -   If the function is provided an empty matrix or if the function is unable to find a search vector, the function returns `-1` (i.e., an invalid index).
+	* -   If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index).
 	* -   The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored.
 	*
 	* @param order - storage layout
@@ -5010,7 +5010,7 @@ interface Namespace {
 	*
 	* ## Notes
 	*
-	* -   If the function is provided an empty matrix or if the function is unable to find a search vector, the function returns `-1` (i.e., an invalid index).
+	* -   If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index).
 	* -   The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored.
 	*
 	* @param order - storage layout
@@ -5894,7 +5894,7 @@ interface Namespace {
 	*
 	* ## Notes
 	*
-	* -   If the function is provided an empty matrix or if the function is unable to find a search vector, the function returns `-1` (i.e., an invalid index).
+	* -   If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index).
 	* -   The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored.
 	*
 	* @param order - storage layout
@@ -5937,7 +5937,7 @@ interface Namespace {
 	*
 	* ## Notes
 	*
-	* -   If the function is provided an empty matrix or if the function is unable to find a search vector, the function returns `-1` (i.e., an invalid index).
+	* -   If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index).
 	* -   The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored.
 	*
 	* @param order - storage layout
diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-buffer-length-compatible-shape/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/assert/is-buffer-length-compatible-shape/benchmark/c/benchmark.c
index 8dc87f32f35d..5c2bb40014d3 100644
--- a/lib/node_modules/@stdlib/ndarray/base/assert/is-buffer-length-compatible-shape/benchmark/c/benchmark.c
+++ b/lib/node_modules/@stdlib/ndarray/base/assert/is-buffer-length-compatible-shape/benchmark/c/benchmark.c
@@ -96,7 +96,7 @@ static double benchmark( void ) {
 	double t;
 	int i;
 
-	int64_t ndims = 3;
+	const int64_t ndims = 3;
 	int64_t shape[] = { 10, 10, 10 };
 
 	t = tic();
diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-buffer-length-compatible/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/assert/is-buffer-length-compatible/benchmark/c/benchmark.c
index 023463e534de..ef1bcda2f32e 100644
--- a/lib/node_modules/@stdlib/ndarray/base/assert/is-buffer-length-compatible/benchmark/c/benchmark.c
+++ b/lib/node_modules/@stdlib/ndarray/base/assert/is-buffer-length-compatible/benchmark/c/benchmark.c
@@ -100,7 +100,7 @@ static double benchmark( void ) {
 	int64_t shape[] = { 10, 10, 10 };
 	int64_t strides[] = { 100, 10, -1 };
 	int64_t offset = 0;
-	int64_t ndims = 3;
+	const int64_t ndims = 3;
 
 	t = tic();
 	for ( i = 0; i < ITERATIONS; i++ ) {
diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-column-major-contiguous/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/assert/is-column-major-contiguous/benchmark/c/benchmark.c
index 13ac19882061..22397ccd8a0d 100644
--- a/lib/node_modules/@stdlib/ndarray/base/assert/is-column-major-contiguous/benchmark/c/benchmark.c
+++ b/lib/node_modules/@stdlib/ndarray/base/assert/is-column-major-contiguous/benchmark/c/benchmark.c
@@ -100,7 +100,7 @@ static double benchmark( void ) {
 	int64_t shape[] = { 10, 10, 10 };
 	int64_t strides[] = { 1, 10, 100 };
 	int64_t offset = 0;
-	int64_t ndims = 3;
+	const int64_t ndims = 3;
 
 	t = tic();
 	for ( i = 0; i < ITERATIONS; i++ ) {
diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-column-major/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/assert/is-column-major/benchmark/c/benchmark.c
index 5a2d6fd3379d..31248b0bdea5 100644
--- a/lib/node_modules/@stdlib/ndarray/base/assert/is-column-major/benchmark/c/benchmark.c
+++ b/lib/node_modules/@stdlib/ndarray/base/assert/is-column-major/benchmark/c/benchmark.c
@@ -96,7 +96,7 @@ static double benchmark( void ) {
 	double t;
 	int i;
 
-	int64_t ndims = 3;
+	const int64_t ndims = 3;
 	int64_t strides[] = { 1, 10, 100 };
 
 	t = tic();
diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-contiguous/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/assert/is-contiguous/benchmark/c/benchmark.c
index b1431d03d351..e20bc9cbfd9c 100644
--- a/lib/node_modules/@stdlib/ndarray/base/assert/is-contiguous/benchmark/c/benchmark.c
+++ b/lib/node_modules/@stdlib/ndarray/base/assert/is-contiguous/benchmark/c/benchmark.c
@@ -100,7 +100,7 @@ static double benchmark( void ) {
 	int64_t shape[] = { 10, 10, 10 };
 	int64_t strides[] = { 1, 10, 100 };
 	int64_t offset = 0;
-	int64_t ndims = 3;
+	const int64_t ndims = 3;
 
 	t = tic();
 	for ( i = 0; i < ITERATIONS; i++ ) {
diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-row-major-contiguous/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/assert/is-row-major-contiguous/benchmark/c/benchmark.c
index d647a4611e44..5121a0c08ad6 100644
--- a/lib/node_modules/@stdlib/ndarray/base/assert/is-row-major-contiguous/benchmark/c/benchmark.c
+++ b/lib/node_modules/@stdlib/ndarray/base/assert/is-row-major-contiguous/benchmark/c/benchmark.c
@@ -100,7 +100,7 @@ static double benchmark( void ) {
 	int64_t shape[] = { 10, 10, 10 };
 	int64_t strides[] = { 100, 10, 1 };
 	int64_t offset = 0;
-	int64_t ndims = 3;
+	const int64_t ndims = 3;
 
 	t = tic();
 	for ( i = 0; i < ITERATIONS; i++ ) {
diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-row-major/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/assert/is-row-major/benchmark/c/benchmark.c
index 0c7b631161f3..1c16a63e556f 100644
--- a/lib/node_modules/@stdlib/ndarray/base/assert/is-row-major/benchmark/c/benchmark.c
+++ b/lib/node_modules/@stdlib/ndarray/base/assert/is-row-major/benchmark/c/benchmark.c
@@ -96,7 +96,7 @@ static double benchmark( void ) {
 	double t;
 	int i;
 
-	int64_t ndims = 3;
+	const int64_t ndims = 3;
 	int64_t strides[] = { 100, 10, 1 };
 
 	t = tic();
diff --git a/lib/node_modules/@stdlib/ndarray/ndarraylike2ndarray/lib/main.js b/lib/node_modules/@stdlib/ndarray/ndarraylike2ndarray/lib/main.js
index bfb11307cad3..882623bf9731 100644
--- a/lib/node_modules/@stdlib/ndarray/ndarraylike2ndarray/lib/main.js
+++ b/lib/node_modules/@stdlib/ndarray/ndarraylike2ndarray/lib/main.js
@@ -33,7 +33,7 @@ var defaults = require( '@stdlib/ndarray/defaults' );
 
 // VARIABLES //
 
-var DEFAULT_ORDER = defaults( 'order' );
+var DEFAULT_ORDER = defaults.get( 'order' );
 
 
 // MAIN //