diff --git a/lib/node_modules/@stdlib/blas/ext/base/zcartesian-product/src/main.c b/lib/node_modules/@stdlib/blas/ext/base/zcartesian-product/src/main.c
index cad1cefa494b..1e16f1168273 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/zcartesian-product/src/main.c
+++ b/lib/node_modules/@stdlib/blas/ext/base/zcartesian-product/src/main.c
@@ -23,6 +23,7 @@
 #include "stdlib/blas/base/shared.h"
 #include "stdlib/strided/base/stride2offset.h"
 #include "stdlib/complex/float64/ctor.h"
+#include <stdint.h>
 
 /**
 * Computes the Cartesian product for two double-precision complex floating-point strided arrays.
@@ -80,7 +81,7 @@ void API_SUFFIX(stdlib_strided_zcartesian_product)( const CBLAS_LAYOUT order, co
 * @param offsetOut   starting index for Out
 */
 void API_SUFFIX(stdlib_strided_zcartesian_product_ndarray)( const CBLAS_INT M, const CBLAS_INT N, const stdlib_complex128_t *X, const CBLAS_INT strideX, const CBLAS_INT offsetX, const stdlib_complex128_t *Y, const CBLAS_INT strideY, const CBLAS_INT offsetY, stdlib_complex128_t *Out, const CBLAS_INT strideOut1, const CBLAS_INT strideOut2, const CBLAS_INT offsetOut ) {
-	CBLAS_INT sa[ 2 ];
+	int64_t sa[ 2 ];
 	CBLAS_INT iy;
 	CBLAS_INT ix;
 	CBLAS_INT io;
diff --git a/lib/node_modules/@stdlib/math/base/special/exp2/test/test.native.js b/lib/node_modules/@stdlib/math/base/special/exp2/test/test.native.js
index a0a63d2d614e..0f928d20a0d6 100644
--- a/lib/node_modules/@stdlib/math/base/special/exp2/test/test.native.js
+++ b/lib/node_modules/@stdlib/math/base/special/exp2/test/test.native.js
@@ -66,7 +66,7 @@ tape( 'the function accurately computes `2**x` for negative medium numbers', opt
 
 	for ( i = 0; i < x.length; i++ ) {
 		v = exp2( x[ i ] );
-		t.strictEqual( isAlmostSameValue( v, expected[ i ], 1 ), true, 'return expected value' );
+		t.strictEqual( isAlmostSameValue( v, expected[ i ], 1 ), true, 'returns expected value' );
 	}
 	t.end();
 });
@@ -82,7 +82,7 @@ tape( 'the function accurately computes `2**x` for positive medium numbers', opt
 
 	for ( i = 0; i < x.length; i++ ) {
 		v = exp2( x[ i ] );
-		t.strictEqual( isAlmostSameValue( v, expected[ i ], 1 ), true, 'return expected value' );
+		t.strictEqual( isAlmostSameValue( v, expected[ i ], 1 ), true, 'returns expected value' );
 	}
 	t.end();
 });
@@ -98,7 +98,7 @@ tape( 'the function accurately computes `2**x` for negative small numbers', opts
 
 	for ( i = 0; i < x.length; i++ ) {
 		v = exp2( x[ i ] );
-		t.strictEqual( isAlmostSameValue( v, expected[ i ], 1 ), true, 'return expected value' );
+		t.strictEqual( isAlmostSameValue( v, expected[ i ], 1 ), true, 'returns expected value' );
 	}
 	t.end();
 });
@@ -114,7 +114,7 @@ tape( 'the function accurately computes `2**x` for positive small numbers', opts
 
 	for ( i = 0; i < x.length; i++ ) {
 		v = exp2( x[ i ] );
-		t.strictEqual( isAlmostSameValue( v, expected[ i ], 1 ), true, 'return expected value' );
+		t.strictEqual( isAlmostSameValue( v, expected[ i ], 1 ), true, 'returns expected value' );
 	}
 	t.end();
 });
@@ -130,7 +130,7 @@ tape( 'the function accurately computes `2**x` for very small `x`', opts, functi
 
 	for ( i = 0; i < x.length; i++ ) {
 		v = exp2( x[ i ] );
-		t.strictEqual( isAlmostSameValue( v, expected[ i ], 1 ), true, 'return expected value' );
+		t.strictEqual( isAlmostSameValue( v, expected[ i ], 1 ), true, 'returns expected value' );
 	}
 	t.end();
 });
diff --git a/lib/node_modules/@stdlib/number/uint64/parse/README.md b/lib/node_modules/@stdlib/number/uint64/parse/README.md
index 44e7586b1cf9..620928abf12b 100644
--- a/lib/node_modules/@stdlib/number/uint64/parse/README.md
+++ b/lib/node_modules/@stdlib/number/uint64/parse/README.md
@@ -65,7 +65,7 @@ a = parseUint64( '123abcxyz', 36 );
 
 ## Notes
 
--   The input string must be a valid representation of an 64-bit unsigned integer.
+-   The input string must be a valid representation of a 64-bit unsigned integer.
 -   If the provided string is malformed (e.g., contains invalid characters or is incomplete), the function throws a `SyntaxError`.
 -   If the provided string represents a value greater than `2^64-1` or the radix is not an integer on the interval `[2, 36]`, the function throws a `RangeError`.