• PASS - FFT output is correct size: Stage 1: B001: FFT::apply() float for n = 65536
  • PASS - FFT output has correct symmetry: Stage 1: B001: FFT::apply() float for n = 65536
  • PASS - FFT result is correct: Stage 1: B001: FFT::apply() float for n = 65536
  • PASS - FFT output is correct size: Stage 2: B001: FFT::apply() float for n = 65536
  • PASS - FFT output has correct symmetry: Stage 2: B001: FFT::apply() float for n = 65536
  • PASS - FFT result is correct: Stage 2: B001: FFT::apply() float for n = 65536
  • PASS - FFT output is correct size: Stage 3: B001: FFT::apply() float for n = 65536
  • PASS - FFT output has correct symmetry: Stage 3: B001: FFT::apply() float for n = 65536
  • PASS - FFT result is correct: Stage 3: B001: FFT::apply() float for n = 65536
  • PASS - FFT output is correct size: Stage 1: A001: FFT::apply() for n = 65536
  • PASS - FFT output has correct symmetry: Stage 1: A001: FFT::apply() for n = 65536
  • PASS - FFT output is correct size: Stage 2: A001: FFT::apply() for n = 65536
  • PASS - FFT output has correct symmetry: Stage 2: A001: FFT::apply() for n = 65536
  • PASS - FFT output is correct size: Stage 3: A001: FFT::apply() for n = 65536
  • PASS - FFT output has correct symmetry: Stage 3: A001: FFT::apply() for n = 65536
  • PASS - FFT result is correct: Stage 3: A001: FFT::apply() for n = 65536
  • PASS - FFT output is correct size: Stage 1: B002: FFT::apply() double float for n = 131072
  • PASS - FFT output has correct symmetry: Stage 1: B002: FFT::apply() double float for n = 131072
  • PASS - FFT output is correct size: Stage 2: B002: FFT::apply() double float for n = 131072
  • PASS - FFT output is correct size: Stage 1: A002: FFT::apply() float for n = 131072
  • PASS - FFT output has correct symmetry: Stage 2: B002: FFT::apply() double float for n = 131072
  • PASS - FFT output has correct symmetry: Stage 1: A002: FFT::apply() float for n = 131072
  • PASS - FFT result is correct: Stage 1: A002: FFT::apply() float for n = 131072
  • PASS - FFT output is correct size: Stage 3: B002: FFT::apply() double float for n = 131072
  • PASS - FFT output has correct symmetry: Stage 3: B002: FFT::apply() double float for n = 131072
  • PASS - FFT result is correct: Stage 3: B002: FFT::apply() double float for n = 131072
  • PASS - FFT result is correctR002: FFT::apply() double for random n
  • PASS - FFT result is correctR002: FFT::apply() double for random n
  • PASS - FFT result is correctR002: FFT::apply() double for random n
  • PASS - FFT result is correctR002: FFT::apply() double for random n
  • PASS - FFT result is correctR002: FFT::apply() double for random n
  • PASS - FFT result is correctR002: FFT::apply() double for random n
  • PASS - FFT result is correctR002: FFT::apply() double for random n
  • PASS - FFT result is correctR002: FFT::apply() double for random n
  • PASS - FFT result is correctR002: FFT::apply() double for random n
  • PASS - FFT result is correctR002: FFT::apply() double for random n
  • PASS - FFT result is correctR002: FFT::apply() double for random n
  • PASS - FFT output is correct size: Stage 2: A002: FFT::apply() float for n = 131072
  • PASS - FFT output has correct symmetry: Stage 2: A002: FFT::apply() float for n = 131072
  • PASS - FFT result is correct: Stage 2: A002: FFT::apply() float for n = 131072
  • PASS - FFT output is correct size: Stage 3: A002: FFT::apply() float for n = 131072
  • PASS - FFT output has correct symmetry: Stage 3: A002: FFT::apply() float for n = 131072
  • PASS - FFT result is correct: Stage 3: A002: FFT::apply() float for n = 131072
  • PASS - FFT result is correctR001: FFT::apply() float for random n
  • PASS - FFT result is correctR001: FFT::apply() float for random n
  • PASS - FFT result is correctR001: FFT::apply() float for random n
  • PASS - FFT result is correctR001: FFT::apply() float for random n
  • PASS - FFT result is correctR001: FFT::apply() float for random n
  • PASS - FFT result is correctR001: FFT::apply() float for random n
  • PASS - FFT result is correctR001: FFT::apply() float for random n
  • PASS - FFT result is correctR001: FFT::apply() float for random n
  • PASS - FFT result is correctR001: FFT::apply() float for random n
  • PASS - FFT result is correctR001: FFT::apply() float for random n
  • PASS - FFT result is correctR001: FFT::apply() float for random n
  • PASS - FFT result is correctR001: FFT::apply() float for random n
  • PASS - FFT result is correctR001: FFT::apply() float for random n
  • PASS - FFT result is correctR001: FFT::apply() float for random n
  • PASS - FFT result is correctR001: FFT::apply() float for random n
  • PASS - Thread 1 joined
  • PASS - Thread 1 result ok
  • PASS - FFT result is correctR002: FFT::apply() double for random n
  • PASS - FFT result is correctR002: FFT::apply() double for random n
  • PASS - FFT result is correctR002: FFT::apply() double for random n
  • PASS - FFT result is correctR002: FFT::apply() double for random n
  • PASS - Thread 2 joined
  • PASS - Thread 2 result ok
  • PASS - FFT output is correct size: Stage 1: C001: FFT::apply() float for n = 1048576
  • PASS - FFT output has correct symmetry: Stage 1: C001: FFT::apply() float for n = 1048576
  • PASS - FFT result is correct: Stage 1: C001: FFT::apply() float for n = 1048576
  • PASS - FFT output is correct size: Stage 2: C001: FFT::apply() float for n = 1048576
  • PASS - FFT output has correct symmetry: Stage 2: C001: FFT::apply() float for n = 1048576
  • PASS - FFT result is correct: Stage 2: C001: FFT::apply() float for n = 1048576
  • PASS - FFT output is correct size: Stage 3: C001: FFT::apply() float for n = 1048576
  • PASS - FFT output has correct symmetry: Stage 3: C001: FFT::apply() float for n = 1048576
  • PASS - FFT result is correct: Stage 3: C001: FFT::apply() float for n = 1048576
  • PASS - Caught invalid_argument
  • PASS - FFT result is correctR003: FFT::apply() std::complex float for random n
  • PASS - FFT result is correctR003: FFT::apply() std::complex float for random n
  • PASS - FFT result is correctR003: FFT::apply() std::complex float for random n
  • PASS - FFT result is correctR003: FFT::apply() std::complex float for random n
  • PASS - FFT result is correctR003: FFT::apply() std::complex float for random n
  • PASS - FFT result is correctR003: FFT::apply() std::complex float for random n
  • PASS - FFT result is correctR003: FFT::apply() std::complex float for random n
  • PASS - FFT result is correctR003: FFT::apply() std::complex float for random n
  • PASS - FFT result is correctR003: FFT::apply() std::complex float for random n
  • PASS - FFT result is correctR003: FFT::apply() std::complex float for random n
  • PASS - FFT result is correctR003: FFT::apply() std::complex float for random n
  • PASS - FFT result is correctR003: FFT::apply() std::complex float for random n
  • PASS - FFT result is correctR003: FFT::apply() std::complex float for random n
  • PASS - FFT result is correctR003: FFT::apply() std::complex float for random n
  • PASS - FFT result is correctR003: FFT::apply() std::complex float for random n
  • PASS - Thread 3 joined
  • PASS - Thread 3 result ok