Comparing version 4.0.3 to 4.0.4
{ | ||
"name": "fft.js", | ||
"version": "4.0.3", | ||
"version": "4.0.4", | ||
"description": "Insanely Fast Fourier Transform (radix-4)", | ||
"main": "lib/fft.js", | ||
"types": "lib/fft.d.ts", | ||
"scripts": { | ||
@@ -10,2 +11,3 @@ "format": "eslint --fix lib/*.js test/*.js bench/index.js", | ||
"bench": "cd bench && npm install && node .", | ||
"types": "npx typescript lib/fft.js --declaration --allowJs --emitDeclarationOnly --outDir lib\n", | ||
"build": "webpack --progress --colors -p --output-library FFTJS", | ||
@@ -36,5 +38,5 @@ "test": "mocha --reporter=spec test/*-test.js && npm run lint", | ||
"fft": "^0.2.1", | ||
"mocha": "^3.2.0", | ||
"mocha": "^8.2.1", | ||
"webpack": "^2.2.1" | ||
} | ||
} |
@@ -28,3 +28,3 @@ # FFT.js | ||
`realTransform` fills just the left half of the `out`, so if the full | ||
spectrum is needed (which is symmetric): | ||
spectrum is needed (which is symmetric), do the following: | ||
```js | ||
@@ -106,2 +106,4 @@ f.completeSpectrum(out); | ||
If you are looking to find the nearest power of 2 given the size of your dataset, here is a [good tutorial](https://stackoverflow.com/questions/466204/rounding-up-to-next-power-of-2/466256#466256) | ||
### Input/Output formats and helper methods. | ||
@@ -157,3 +159,3 @@ | ||
Take array of real numbers `input` and perform FFT transformation on it, filling | ||
the left half of the `output` with complex values (See: | ||
the left half of the `output` with the real part of the Fourier Transform's complex output (See: | ||
`fft.completeSpectrum()`). | ||
@@ -160,0 +162,0 @@ |
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
22390
493
206