Showing 4 of 4 total issues
Function fft
has 48 lines of code (exceeds 25 allowed). Consider refactoring. Open
Open
export function fft(
inputData: number[], // Array: real part, imaginary, real, imaginary...
n: number, // Length of linear fft: this is a power of 2
log2n: number, // The power of 2 that N is
pixelStride: number, // From one complex number to the next
Function fft
has a Cognitive Complexity of 12 (exceeds 5 allowed). Consider refactoring. Open
Open
export function fft(
inputData: number[], // Array: real part, imaginary, real, imaginary...
n: number, // Length of linear fft: this is a power of 2
log2n: number, // The power of 2 that N is
pixelStride: number, // From one complex number to the next
- Read upRead up
Cognitive Complexity
Cognitive Complexity is a measure of how difficult a unit of code is to intuitively understand. Unlike Cyclomatic Complexity, which determines how difficult your code will be to test, Cognitive Complexity tells you how difficult your code will be to read and comprehend.
A method's cognitive complexity is based on a few simple rules:
- Code is not considered more complex when it uses shorthand that the language provides for collapsing multiple statements into one
- Code is considered more complex for each "break in the linear flow of the code"
- Code is considered more complex when "flow breaking structures are nested"
Further reading
Function realFft
has 5 arguments (exceeds 4 allowed). Consider refactoring. Open
Open
srcData: number[],
n: number, // Length of linear fft: this is a power of 2
log2n: number, // The power of 2 that N is
pixelStride: number, // From one complex number to the next
isInverseTransform = false // Direction of transform (forward or inverse)
Function fft
has 5 arguments (exceeds 4 allowed). Consider refactoring. Open
Open
inputData: number[], // Array: real part, imaginary, real, imaginary...
n: number, // Length of linear fft: this is a power of 2
log2n: number, // The power of 2 that N is
pixelStride: number, // From one complex number to the next
isInverseTransform = false // dir: number, // Direction of transform (forward or inverse)