FEC classes: get rid of fft_full

Thanks to new FFT::Radix2 based on bit-reversal algorithm, only FFT
operation uses data length parameter to decrease complexity. Hence
fft_full is no longer used.

src/fec_base.h

@@ -216,7 +216,6 @@ class FecCode {
     T r;
     std::unique_ptr<gf::Field<T>> gf = nullptr;
     std::unique_ptr<fft::FourierTransform<T>> fft = nullptr;
-    std::unique_ptr<fft::FourierTransform<T>> fft_full = nullptr;
     std::unique_ptr<fft::FourierTransform<T>> fft_2k = nullptr;
     // This vector MUST be initialized by derived Class using multiplicative FFT
     std::unique_ptr<vec::Vector<T>> inv_r_powers = nullptr;
@@ -736,9 +735,6 @@ FecCode<T>::init_context_dec(vec::Vector<T>& fragments_ids, size_t size)
     if (this->fft == nullptr) {
         throw LogicError("FEC base: FFT must be initialized");
     }
-    if (this->fft_full == nullptr) {
-        throw LogicError("FEC base: FFT full must be initialized");
-    }
 
     int k = this->n_data; // number of fragments received
     // vector x=(x_0, x_1, ..., x_k-1)
@@ -814,7 +810,7 @@ void FecCode<T>::decode_apply(
     }
 
     // compute vec2_n = FFT(vec1_n)
-    this->fft_full->fft_inv(vec2_n, vec1_n);
+    this->fft->fft_inv(vec2_n, vec1_n);
 
     // vec_tmp_2k: first k elements from vec2_n
     //             last (len_2k - k) elements are padded
@@ -1103,7 +1099,7 @@ void FecCode<T>::decode_apply(
     }
 
     // compute buf2_n
-    this->fft_full->fft_inv(buf2_n, buf1_n);
+    this->fft->fft_inv(buf2_n, buf1_n);
 
     // buf1_2k: first k buffers point to first k buffers of buf2_n
     //          las k buffers point to a padded zero buffer

src/fec_rs_fnt.h

@@ -99,9 +99,6 @@ class RsFnt : public FecCode<T> {
         this->fft = std::unique_ptr<fft::Radix2<T>>(
             new fft::Radix2<T>(*(this->gf), this->n, m, this->pkt_size));
 
-        this->fft_full = std::unique_ptr<fft::Radix2<T>>(
-            new fft::Radix2<T>(*(this->gf), this->n, this->n, this->pkt_size));
-
         unsigned len_2k = this->gf->get_code_len_high_compo(2 * this->n_data);
         this->fft_2k = std::unique_ptr<fft::Radix2<T>>(
             new fft::Radix2<T>(*(this->gf), len_2k, len_2k, this->pkt_size));

src/fec_rs_gf2n_fft.h

@@ -76,9 +76,6 @@ class RsGf2nFft : public FecCode<T> {
         this->fft = std::unique_ptr<fft::CooleyTukey<T>>(
             new fft::CooleyTukey<T>(*(this->gf), this->n));
 
-        this->fft_full = std::unique_ptr<fft::CooleyTukey<T>>(
-            new fft::CooleyTukey<T>(*(this->gf), this->n));
-
         unsigned len_2k = this->gf->get_code_len_high_compo(2 * this->n_data);
         this->fft_2k = std::unique_ptr<fft::CooleyTukey<T>>(
             new fft::CooleyTukey<T>(*(this->gf), len_2k));

src/fec_rs_gfp_fft.h

@@ -120,13 +120,9 @@ class RsGfpFft : public FecCode<T> {
         if (arith::is_power_of_2<T>(this->n)) {
             this->fft = std::unique_ptr<fft::Radix2<T>>(
                 new fft::Radix2<T>(*(this->gf), this->n));
-            this->fft_full = std::unique_ptr<fft::Radix2<T>>(
-                new fft::Radix2<T>(*(this->gf), this->n));
         } else {
             this->fft = std::unique_ptr<fft::CooleyTukey<T>>(
                 new fft::CooleyTukey<T>(*(this->gf), this->n));
-            this->fft_full = std::unique_ptr<fft::CooleyTukey<T>>(
-                new fft::CooleyTukey<T>(*(this->gf), this->n));
         }
 
         unsigned len_2k = this->gf->get_code_len_high_compo(2 * this->n_data);

src/fec_rs_nf4.h

@@ -95,9 +95,6 @@ class RsNf4 : public FecCode<T> {
         this->fft = std::unique_ptr<fft::Radix2<T>>(
             new fft::Radix2<T>(*ngff4, this->n, m, this->pkt_size));
 
-        this->fft_full = std::unique_ptr<fft::Radix2<T>>(
-            new fft::Radix2<T>(*ngff4, this->n, this->n, this->pkt_size));
-
         unsigned len_2k = this->gf->get_code_len_high_compo(2 * this->n_data);
         this->fft_2k = std::unique_ptr<fft::Radix2<T>>(
             new fft::Radix2<T>(*ngff4, len_2k, len_2k, this->pkt_size));
@@ -197,9 +194,6 @@ class RsNf4 : public FecCode<T> {
         if (this->fft == nullptr) {
             throw LogicError("FEC base: FFT must be initialized");
         }
-        if (this->fft_full == nullptr) {
-            throw LogicError("FEC base: FFT full must be initialized");
-        }
 
         int k = this->n_data; // number of fragments received
         // vector x=(x_0, x_1, ..., x_k-1)