0

因此，我尝试在大型 C++ STL 向量上执行递归（拆分基数递归蝴蝶的非常简单的代码），并且我正在使用迭代器来调用递归，但由于我不断出错，因此无法正常工作。

#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>

using namespace std;

template <typename T>
class fft_data{
public: 
vector<T> re;
vector<T> im;

};

void inline split_radix_rec(vector<double>::iterator r,vector<double>::iterator i, int sgn,int N) {
if (N == 1) {
    return;
} else if (N == 2) {
    for (int k = 0; k < N/2; k++) {
        int index = 2*k;
        int index1 = index+1;
        double taur =  *(r+index1);
        double taui =  *(i+index1);

        *(r+index1) = *(r+index) - taur; 
        *(i+index1) = *(i+index) - taui; 

        *(r+index) = *(r+index) + taur; 
        *(i+index) = *(i+index) + taui; 
    }
    N=N/2;
} else {
    int m = N/2;
    int p = N/4;

    double PI2 = 6.28318530717958647692528676655900577;
    double theta =  -1.0 * sgn * PI2/N;

    double S =  sin(theta);
    double C =  cos(theta);

    double PI6 =  3.0*6.28318530717958647692528676655900577;
    double theta3 =  -1.0 * sgn * PI6/N;

    double S3 =  sin(theta3);
    double C3 =  cos(theta3);

    double wlr =  1.0;
    double wli =  0.0;

    //T wl2r = (T) 1.0;
    //T wl2i = (T) 0.0;

    double wl3r =  1.0;
    double wl3i =  0.0;

    double tau1r,tau1i,tau2r,tau2i;
    double ur,ui,vr,vi;

    for (int j = 0; j < p; j++) {
        int index1 = j+m;
        int index2 = index1+p;
        int index3 = j+p;

        tau1r = *(r+index1);
        tau1i = *(i+index1);

        tau2r = *(r+index2);
        tau2i = *(i+index2);

        ur = tau1r + tau2r;
        ui = tau1i + tau2i;

        vr = sgn* (tau2r - tau1r);
        vi = sgn* (tau2i - tau1i);

        *(r+index2) = *(r+index3) - vi;
        *(i+index2) = *(i+index3) + vr;

        *(r+index1) = *(r+j) - ur;
        *(i+index1) = *(i+j) - ui;

        *(r+index3) = *(r+index3) + vi;
        *(i+index3) = *(i+index3) - vr;

        *(r+j) = *(r+j) + ur;
        *(i+j) = *(i+j) + ui;

    }

    split_radix_rec(r.begin(),i.begin(),sgn,m);
    split_radix_rec(r.begin()+m,i.begin()+m,sgn,p);
    split_radix_rec(r.begin()+m+p,i.begin()+m+p,sgn,p);
}


}


int main() {
vector<double> u,v;
for (int i = 0; i < 256; i++) {
    u.push_back(i);
    v.push_back(i);
}

int sgn = 1;
int N = 256;
split_radix_rec(u.begin(),v.begin(),sgn,N);
return 0;
}

这是我得到的错误

main.cpp:93:21: error: 'std::vector<double>::iterator' has no member named 'begin'

6 第 93、94、95 行出现相同错误（从 split_radix_rec 函数中调用的三个 split_radix_rec() 函数）。这是更大代码的一部分，因此我希望它适用于 STL 向量。我究竟做错了什么？

4

3 回答 3

3

如错误所述，您正在begin()调用std::vector<double>::iterator.

您应该在 astd::vector<double>上调​​用它，以便它可以返回您 a std::vector<double>::iterator。

于 2013-01-05T21:18:32.843 回答
1

r,i本身就是代码中的迭代器（开始）。

尝试：

split_radix_rec(r,i,sgn,m);
split_radix_rec(r+m,i+m,sgn,p);
split_radix_rec(r+m+p,i+m+p,sgn,p);
于 2013-01-05T21:17:06.370 回答
0

有太多代码无法为您提供简洁的答案，但错误清楚地表明您正在调用begin()向量迭代器而不是向量。这发生在split_radix_rec递归调用中。您可能本来打算这样做：

split_radix_rec(r,i,sgn,m);
split_radix_rec(r+m,i+m,sgn,p);
split_radix_rec(r+m+p,i+m+p,sgn,p);
于 2013-01-05T21:16:51.300 回答