Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 | 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x | /** * @license Apache-2.0 * * Copyright (c) 2026 The Stdlib Authors. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ 'use strict'; /** * Factorize a sequence length into a product of integers. * * @module @stdlib/fft/base/fftpack/decompose * * @example * var decompose = require( '@stdlib/fft/base/fftpack/decompose' ); * * var N = 630; * var initial = [ 3, 4, 2, 5 ]; // as found in FFTPACK * var factors = [ 0, 0, 0, 0, 0, 0, 0 ]; * * var numFactors = decompose( N, initial, factors, 1, 0 ); * // returns 5 * * var f = factors.slice(); * // returns [ 630, 5, 2, 3, 3, 5, 7 ] * * @example * var decompose = require( '@stdlib/fft/base/fftpack/decompose' ); * * var N = 8; * var initial = [ 3, 4, 2, 5 ]; // as found in FFTPACK * var factors = [ 0, 0, 0, 0 ]; * * var numFactors = decompose( N, initial, factors, 1, 0 ); * // returns 2 * * var f = factors.slice(); * // returns [ 8, 2, 2, 4 ] */ // MODULES // var main = require( './main.js' ); // EXPORTS // module.exports = main; |