diff --git a/lib/node_modules/@stdlib/blas/ext/base/gcartesian-square/lib/accessors.js b/lib/node_modules/@stdlib/blas/ext/base/gcartesian-square/lib/accessors.js
index 005dc262f3a1..aac8d16fb827 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/gcartesian-square/lib/accessors.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/gcartesian-square/lib/accessors.js
@@ -29,7 +29,7 @@ var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major' );
 * Computes the Cartesian square for a strided accessor array.
 *
 * @private
-* @param {NonNegativeInteger} N - number of indexed elements
+* @param {PositiveInteger} N - number of indexed elements
 * @param {Object} x - input array object
 * @param {Collection} x.data - input array data
 * @param {Array<Function>} x.accessors - array element accessors
@@ -41,7 +41,7 @@ var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major' );
 * @param {integer} strideOut1 - stride length for the first dimension of `out`
 * @param {integer} strideOut2 - stride length for the second dimension of `out`
 * @param {NonNegativeInteger} offsetOut - starting index for `out`
-* @returns {Collection} output array
+* @returns {Object} output array object
 *
 * @example
 * var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
@@ -86,7 +86,7 @@ function gcartesianSquare( N, x, strideX, offsetX, out, strideOut1, strideOut2,
 			}
 			ix += strideX;
 		}
-		return obuf;
+		return out;
 	}
 	// Column-major...
 	for ( i = 0; i < N; i++ ) { // Note: these loops inline the equivalent of `gfill` to avoid the overhead of intermediate object creation and accessor dispatch on each call...
@@ -106,7 +106,7 @@ function gcartesianSquare( N, x, strideX, offsetX, out, strideOut1, strideOut2,
 			io += strideOut1;
 		}
 	}
-	return obuf;
+	return out;
 }
 
 
diff --git a/lib/node_modules/@stdlib/blas/ext/base/gcartesian-square/lib/main.js b/lib/node_modules/@stdlib/blas/ext/base/gcartesian-square/lib/main.js
index bdebc226d218..f66ea8b90516 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/gcartesian-square/lib/main.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/gcartesian-square/lib/main.js
@@ -34,7 +34,7 @@ var ndarray = require( './ndarray.js' );
 * Computes the Cartesian square for a strided array.
 *
 * @param {string} order - storage layout
-* @param {NonNegativeInteger} N - number of indexed elements
+* @param {PositiveInteger} N - number of indexed elements
 * @param {Collection} x - input array
 * @param {integer} strideX - stride length for `x`
 * @param {Collection} out - output array
diff --git a/lib/node_modules/@stdlib/blas/ext/base/gcartesian-square/lib/ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/gcartesian-square/lib/ndarray.js
index e1f0f1ed6937..c4969f47ef29 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/gcartesian-square/lib/ndarray.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/gcartesian-square/lib/ndarray.js
@@ -36,7 +36,7 @@ var accessors = require( './accessors.js' );
 *
 * -   Pairs are stored as rows in the output matrix, where the first column contains the first element of each pair and the second column contains the second element.
 *
-* @param {NonNegativeInteger} N - number of indexed elements
+* @param {PositiveInteger} N - number of indexed elements
 * @param {Collection} x - input array
 * @param {integer} strideX - stride length for `x`
 * @param {NonNegativeInteger} offsetX - starting index for `x`
@@ -68,7 +68,8 @@ function gcartesianSquare( N, x, strideX, offsetX, out, strideOut1, strideOut2,
 	xobj = arraylike2object( x );
 	oobj = arraylike2object( out );
 	if ( xobj.accessorProtocol || oobj.accessorProtocol ) {
-		return accessors( N, xobj, strideX, offsetX, oobj, strideOut1, strideOut2, offsetOut ); // eslint-disable-line max-len
+		accessors( N, xobj, strideX, offsetX, oobj, strideOut1, strideOut2, offsetOut ); // eslint-disable-line max-len
+		return out;
 	}
 	ix = offsetX;
 	io = offsetOut;