Commit d736b2f

committed

Style fixes for FFT code.

1 parent ac9920a commit d736b2fCopy full SHA for d736b2f

File tree

2 files changed

-5

lines changed

src/algorithms/math/fourier-transform
- __test__
  - fastFourierTransform.test.js
- fastFourierTransform.js

2 files changed

-5

lines changed

`‎src/algorithms/math/fourier-transform/test/fastFourierTransform.test.js‎`

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -28,7 +28,7 @@ function sequencesApproximatelyEqual(sequence1, sequence2, delta) {`
`28`	`28`	`const delta = 1e-6;`
`29`	`29`
`30`	`30`	`describe('fastFourierTransform', () => {`
`31`		`- it('should calculate the radix-2 discrete fourier transform after zero padding', () => {`
	`31`	`+ it('should calculate the radix-2 discrete fourier transform #1', () => {`
`32`	`32`	`const input = [new ComplexNumber({ re: 0, im: 0 })];`
`33`	`33`	`const expectedOutput = [new ComplexNumber({ re: 0, im: 0 })];`
`34`	`34`	`const output = fastFourierTransform(input);`
`@@ -38,7 +38,7 @@ describe('fastFourierTransform', () => {`
`38`	`38`	`expect(sequencesApproximatelyEqual(input, invertedOutput, delta)).toBe(true);`
`39`	`39`	`});`
`40`	`40`
`41`		`- it('should calculate the radix-2 discrete fourier transform after zero padding', () => {`
	`41`	`+ it('should calculate the radix-2 discrete fourier transform #2', () => {`
`42`	`42`	`const input = [`
`43`	`43`	`new ComplexNumber({ re: 1, im: 2 }),`
`44`	`44`	`new ComplexNumber({ re: 2, im: 3 }),`
`@@ -59,7 +59,7 @@ describe('fastFourierTransform', () => {`
`59`	`59`	`expect(sequencesApproximatelyEqual(input, invertedOut, delta)).toBe(true);`
`60`	`60`	`});`
`61`	`61`
`62`		`- it('should calculate the radix-2 discrete fourier transform after zero padding', () => {`
	`62`	`+ it('should calculate the radix-2 discrete fourier transform #3', () => {`
`63`	`63`	`const input = [`
`64`	`64`	`new ComplexNumber({ re: -83656.9359385182, im: 98724.08038374918 }),`
`65`	`65`	`new ComplexNumber({ re: -47537.415125808424, im: 88441.58381765135 }),`

`‎src/algorithms/math/fourier-transform/fastFourierTransform.js‎`

Lines changed: 4 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -54,8 +54,10 @@ export default function fastFourierTransform(inputData, inverse = false) {`
`54`	`54`	`let phase = new ComplexNumber({ re: 1, im: 0 });`
`55`	`55`
`56`	`56`	`for (let idx = blockStart; idx < blockStart + blockLength / 2; idx += 1) {`
`57`		`- const upd1 = output[idx].add(output[idx + blockLength / 2].multiply(phase));`
`58`		`- const upd2 = output[idx].subtract(output[idx + blockLength / 2].multiply(phase));`
	`57`	`+ const component = output[idx + blockLength / 2].multiply(phase);`
	`58`	`+`
	`59`	`+ const upd1 = output[idx].add(component);`
	`60`	`+ const upd2 = output[idx].subtract(component);`
`59`	`61`
`60`	`62`	`output[idx] = upd1;`
`61`	`63`	`output[idx + blockLength / 2] = upd2;`

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit d736b2f

File tree

2 files changed

2 files changed

`‎src/algorithms/math/fourier-transform/test/fastFourierTransform.test.js‎`

`‎src/algorithms/math/fourier-transform/fastFourierTransform.js‎`

0 commit comments

File tree

2 files changed

2 files changed

‎src/algorithms/math/fourier-transform/__test__/fastFourierTransform.test.js‎

‎src/algorithms/math/fourier-transform/fastFourierTransform.js‎

0 commit comments

`‎src/algorithms/math/fourier-transform/test/fastFourierTransform.test.js‎`

`‎src/algorithms/math/fourier-transform/fastFourierTransform.js‎`