refactor: replace number with integer

---
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: passed
  - 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
---

Author: gunjjoshi

lib/node_modules/@stdlib/fft/base/fftpack/decompose/docs/repl.txt

@@ -11,33 +11,33 @@
 
     Parameters
     ----------
-    N: number
+    N: integer
         Length of the sequence.
 
-    M: number
+    M: integer
         Number of trial divisors.
 
     initial: Collection<number>
         Array of initial trial divisors.
 
-    si: number
+    si: integer
         Stride length for `initial`.
 
-    oi: number
+    oi: integer
         Starting index for `initial`.
 
     out: Collection<number>
         Output array for storing factorization results.
 
-    so: number
+    so: integer
         Stride length for `out`.
 
-    oo: number
+    oo: integer
         Starting index for `out`.
 
     Returns
     -------
-    numFactors: number
+    numFactors: integer
         Number of factors into which N was decomposed.
 
     Examples

lib/node_modules/@stdlib/fft/base/fftpack/decompose/lib/main.js

@@ -76,7 +76,6 @@ var floor = require( '@stdlib/math/base/special/floor' );
 *     [ sequence_length | number_of_factors | integer_factors | unused_storage ]
 *     ```
 *
-* @private
 * @param {NonNegativeInteger} N - length of the sequence
 * @param {NonNegativeInteger} M - number of trial divisors
 * @param {NonNegativeIntegerArray} initial - strided array of initial trial divisors
@@ -109,7 +108,7 @@ var floor = require( '@stdlib/math/base/special/floor' );
 * var f = factors.slice();
 * // returns [ 8, 2, 2, 4 ]
 */
-function decompose( N, M, initial, si, oi, out, so, oo ) { // eslint-disable-line max-len
+function decompose( N, M, initial, si, oi, out, so, oo ) {
 	var divisor;
 	var ntrials;
 	var nl;
@@ -170,7 +169,7 @@ function decompose( N, M, initial, si, oi, out, so, oo ) { // eslint-disable-lin
 			if ( divisor === 2 && nf !== 1 ) {
 				for ( i = 2; i <= nf; i++ ) {
 					ib = nf - i + 2;
-					out[ oo+((ib+1)*so) ] = out[ oo + (ib*so) ]; // eslint-disable-line max-len
+					out[ oo+((ib+1)*so) ] = out[ oo + (ib*so) ];
 				}
 				out[ oo+(2*so) ] = 2;
 			}