// This is core/vnl/algo/vnl_fft_1d.h
#ifndef vnl_fft_1d_h_
#define vnl_fft_1d_h_
//:
// \file
// \brief In-place 1D fast Fourier transform
// \author fsm
//
// \verbatim
//  Modifications
//   19 June 2003 - Peter Vanroose - added cmplx* and vector<cmplx> interfaces
// \endverbatim

#include <vector>
#ifdef _MSC_VER
#  include <vcl_msvc_warnings.h>
#endif
#include <vnl/vnl_vector.h>
#include <vnl/algo/vnl_fft_base.h>

//: In-place 1D fast Fourier transform

template <class T>
struct vnl_fft_1d : public vnl_fft_base<1, T>
{
  typedef vnl_fft_base<1, T> base;

  //: constructor takes length of signal.
  vnl_fft_1d(int N) { base::factors_[0].resize(N); }

  //: return length of signal.
  unsigned int
  size() const
  {
    return base::factors_[0].number();
  }

  //: dir = +1/-1 according to direction of transform.
  void
  transform(std::vector<std::complex<T>> & signal, int dir)
  {
    base::transform(&signal[0], dir);
  }

  //: dir = +1/-1 according to direction of transform.
  void
  transform(std::complex<T> * signal, int dir)
  {
    base::transform(signal, dir);
  }

  //: dir = +1/-1 according to direction of transform.
  void
  transform(vnl_vector<std::complex<T>> & signal, int dir)
  {
    base::transform(signal.data_block(), dir);
  }

  //: forward FFT
  void
  fwd_transform(std::vector<std::complex<T>> & signal)
  {
    transform(signal, +1);
  }

  //: forward FFT
  void
  fwd_transform(std::complex<T> * signal)
  {
    transform(signal, +1);
  }

  //: forward FFT
  void
  fwd_transform(vnl_vector<std::complex<T>> & signal)
  {
    transform(signal, +1);
  }

  //: backward (inverse) FFT
  void
  bwd_transform(std::vector<std::complex<T>> & signal)
  {
    transform(signal, -1);
  }

  //: backward (inverse) FFT
  void
  bwd_transform(std::complex<T> * signal)
  {
    transform(signal, -1);
  }

  //: backward (inverse) FFT
  void
  bwd_transform(vnl_vector<std::complex<T>> & signal)
  {
    transform(signal, -1);
  }
};

#endif // vnl_fft_1d_h_
