refactor: use slice method

---
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: na
  - task: lint_javascript_cli
    status: na
  - task: lint_javascript_examples
    status: na
  - task: lint_javascript_tests
    status: passed
  - 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/test/test.js

@@ -23,6 +23,7 @@
 var tape = require( 'tape' );
 var isnan = require( '@stdlib/math/base/assert/is-nan' );
 var primes = require( '@stdlib/datasets/primes-100k' );
+var slice = require( '@stdlib/array/slice' );
 var decompose = require( './../lib' );
 
 
@@ -221,7 +222,7 @@ tape( 'the function correctly factorizes prime numbers', function test( t ) {
 	var i;
 
 	// First 10 prime numbers: [ 2, 3, 5, 7, 11, 13, 17, 19, 23, 29 ]...
-	primesList = primes().slice( 0, 10 );
+	primesList = slice( primes(), 0, 10 );
 
 	for ( i = 0; i < primesList.length; i++ ) {
 		factors = [ 0, 0, 0 ];