/* nag_ftt_2d_complex (c06fuc) Example Program. * * Copyright 1990 Numerical Algorithms Group. * * Mark 2 revised, 1992. * Mark 8 revised, 2004. */ #include #include #include #include int main(void) { Integer exit_status=0, i, j, m, n; NagError fail; double *trigm=0, *trign=0, *x=0, *y=0; INIT_FAIL(fail); Vprintf("nag_fft_2d_complex (c06fuc) Example Program Results\n"); /* Skip heading in data file */ Vscanf("%*[^\n]"); while (scanf("%ld%ld", &m, &n)!=EOF) { if (m*n>=1) { if ( !( trigm = NAG_ALLOC(2*m, double)) || !( trign = NAG_ALLOC(2*n, double)) || !( x = NAG_ALLOC(m*n, double)) || !( y = NAG_ALLOC(m*n, double)) ) { Vprintf("Allocation failure\n"); exit_status = -1; goto END; } } else { Vprintf("Invalid m or n.\n"); exit_status = 1; return exit_status; } Vprintf("\n\nm = %2ld n = %2ld\n", m, n); /* Read in complex data and print out. */ for (j = 0; j