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

---
type: pre_push_report
description: Results of running various checks prior to pushing changes.
report:
  - task: run_javascript_examples
    status: na
  - task: run_c_examples
    status: na
  - task: run_cpp_examples
    status: na
  - task: run_javascript_readme_examples
    status: na
  - task: run_c_benchmarks
    status: na
  - task: run_cpp_benchmarks
    status: na
  - task: run_fortran_benchmarks
    status: na
  - task: run_javascript_benchmarks
    status: na
  - task: run_julia_benchmarks
    status: na
  - task: run_python_benchmarks
    status: na
  - task: run_r_benchmarks
    status: na
  - task: run_javascript_tests
    status: na
---

Author: headlessNode

lib/node_modules/@stdlib/array/base/linspace2d/docs/types/index.d.ts

@@ -30,20 +30,20 @@ type Array2D<T> = Array<Array<T>>;
 *
 * @param start - first array value
 * @param stop - last array value
-* @param {NonNegativeIntegerArray} shape - array shape
-* @param {boolean} colexicographic - specifies whether the array values should be in colexicographic order
-* @returns {Array} linearly spaced numeric array
+* @param shape - array shape
+* @param colexicographic - specifies whether the array values should be in colexicographic order
+* @returns linearly spaced numeric array
 *
 * @example
 * var linspace2d = require( '@stdlib/array/base/linspace2d' );
 *
 * var x = linspace2d( 0, 100, [ 2, 3 ], false );
 * // returns [ [ 0, 20, 40 ], [ 60, 80, 100 ] ]
-
+*
 * x = linspace2d( 0, 100, [ 2, 3 ], true );
 * // returns [ [ 0, 40, 80 ], [ 20, 60, 100 ] ]
 */
-declare function linspace2d( start: number, end: number, shape: Shape2D, colexicographic: boolean ): Array2D<number>;
+declare function linspace2d( start: number, stop: number, shape: Shape2D, colexicographic: boolean ): Array2D<number>;
 
 
 // EXPORTS //

lib/node_modules/@stdlib/array/base/linspace2d/lib/main.js

@@ -29,8 +29,8 @@ var linspace = require( '@stdlib/array/base/linspace' );
 /**
 * Generates a linearly spaced two-dimensional nested numeric array.
 *
-* @param {number} x1 - first array value
-* @param {number} x2 - last array value
+* @param {number} start - first array value
+* @param {number} stop - last array value
 * @param {NonNegativeIntegerArray} shape - array shape
 * @param {boolean} colexicographic - specifies whether the array values should be in colexicographic order
 * @returns {Array} linearly spaced numeric array
@@ -42,9 +42,10 @@ var linspace = require( '@stdlib/array/base/linspace' );
 * x = linspace2d( 0, 100, [ 2, 3 ], true );
 * // returns [ [ 0, 40, 80 ], [ 20, 60, 100 ] ]
 */
-function linspace2d( x1, x2, shape, colexicographic ) {
+function linspace2d( start, stop, shape, colexicographic ) {
 	var out;
 	var arr;
+	var idx;
 	var s0;
 	var i0;
 	var s1;
@@ -59,19 +60,22 @@ function linspace2d( x1, x2, shape, colexicographic ) {
 		return [];
 	}
 
-	arr = linspace( x1, x2, n );
+	arr = linspace( start, stop, n );
 	out = zeros2d( shape );
+	idx = 0;
 
 	if ( colexicographic ) {
 		for ( i1 = 0; i1 < s1; i1++ ) {
 			for ( i0 = 0; i0 < s0; i0++ ) {
-				out[ i1 ][ i0 ] = arr[ i0 * s1 + i1 ];
+				idx = ( i0 * s1 ) + i1;
+				out[ i1 ][ i0 ] = arr[ idx ];
 			}
 		}
 	} else {
 		for ( i1 = 0; i1 < s1; i1++ ) {
 			for ( i0 = 0; i0 < s0; i0++ ) {
-				out[ i1 ][ i0 ] = arr[ i1 * s0 + i0 ];
+				idx = ( i1 * s0 ) + i0;
+				out[ i1 ][ i0 ] = arr[ idx ];
 			}
 		}
 	}