1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333
|
!%f90 -*- f90 -*-
! Author: Pearu Peterson, August 2002
python module _fftpack
interface
subroutine zfft(x,n,direction,howmany,normalize)
! y = fft(x[,n,direction,normalize,overwrite_x])
intent(c) zfft
complex*16 intent(c,in,out,copy,out=y) :: x(*)
integer optional,depend(x),intent(c,in) :: n=size(x)
check(n>0) n
integer depend(x,n),intent(c,hide) :: howmany = size(x)/n
check(n*howmany==size(x)) howmany
integer optional,intent(c,in) :: direction = 1
integer optional,intent(c,in),depend(direction) &
:: normalize = (direction<0)
end subroutine zfft
subroutine drfft(x,n,direction,howmany,normalize)
! y = drfft(x[,n,direction,normalize,overwrite_x])
intent(c) drfft
real*8 intent(c,in,out,copy,out=y) :: x(*)
integer optional,depend(x),intent(c,in) :: n=size(x)
check(n>0&&n<=size(x)) n
integer depend(x,n),intent(c,hide) :: howmany = size(x)/n
check(n*howmany==size(x)) howmany
integer optional,intent(c,in) :: direction = 1
integer optional,intent(c,in),depend(direction) &
:: normalize = (direction<0)
end subroutine drfft
subroutine zrfft(x,n,direction,howmany,normalize)
! y = zrfft(x[,n,direction,normalize,overwrite_x])
intent(c) zrfft
complex*16 intent(c,in,out,overwrite,out=y) :: x(*)
integer optional,depend(x),intent(c,in) :: n=size(x)
check(n>0&&n<=size(x)) n
integer depend(x,n),intent(c,hide) :: howmany = size(x)/n
check(n*howmany==size(x)) howmany
integer optional,intent(c,in) :: direction = 1
integer optional,intent(c,in),depend(direction) &
:: normalize = (direction<0)
end subroutine zrfft
subroutine zfftnd(x,r,s,direction,howmany,normalize,j)
! y = zfftnd(x[,s,direction,normalize,overwrite_x])
intent(c) zfftnd
complex*16 intent(c,in,out,copy,out=y) :: x(*)
integer intent(c,hide),depend(x) :: r=old_rank(x)
integer intent(c,hide) :: j=0
integer optional,depend(r),dimension(r),intent(c,in) &
:: s=old_shape(x,j++)
check(r>=len(s)) s
integer intent(c,hide) :: howmany = 1
integer optional,intent(c,in) :: direction = 1
integer optional,intent(c,in),depend(direction) :: &
normalize = (direction<0)
callprotoargument complex_double*,int,int*,int,int,int
callstatement {&
int i,sz=1,xsz=size(x); &
for (i=0;i<r;++i) sz *= s[i]; &
howmany = xsz/sz; &
if (sz*howmany==xsz) &
(*f2py_func)(x,r,s,direction,howmany,normalize); &
else {&
f2py_success = 0; &
PyErr_SetString(_fftpack_error, &
"inconsistency in x.shape and s argument"); &
} &
}
end subroutine zfftnd
subroutine destroy_zfft_cache()
intent(c) destroy_zfft_cache
end subroutine destroy_zfft_cache
subroutine destroy_zfftnd_cache()
intent(c) destroy_zfftnd_cache
end subroutine destroy_zfftnd_cache
subroutine destroy_drfft_cache()
intent(c) destroy_drfft_cache
end subroutine destroy_drfft_cache
/* Single precision version */
subroutine cfft(x,n,direction,howmany,normalize)
! y = fft(x[,n,direction,normalize,overwrite_x])
intent(c) cfft
complex*8 intent(c,in,out,copy,out=y) :: x(*)
integer optional,depend(x),intent(c,in) :: n=size(x)
check(n>0) n
integer depend(x,n),intent(c,hide) :: howmany = size(x)/n
check(n*howmany==size(x)) howmany
integer optional,intent(c,in) :: direction = 1
integer optional,intent(c,in),depend(direction) &
:: normalize = (direction<0)
end subroutine cfft
subroutine rfft(x,n,direction,howmany,normalize)
! y = rfft(x[,n,direction,normalize,overwrite_x])
intent(c) rfft
real*4 intent(c,in,out,copy,out=y) :: x(*)
integer optional,depend(x),intent(c,in) :: n=size(x)
check(n>0&&n<=size(x)) n
integer depend(x,n),intent(c,hide) :: howmany = size(x)/n
check(n*howmany==size(x)) howmany
integer optional,intent(c,in) :: direction = 1
integer optional,intent(c,in),depend(direction) &
:: normalize = (direction<0)
end subroutine rfft
subroutine crfft(x,n,direction,howmany,normalize)
! y = crfft(x[,n,direction,normalize,overwrite_x])
intent(c) crfft
complex*8 intent(c,in,out,overwrite,out=y) :: x(*)
integer optional,depend(x),intent(c,in) :: n=size(x)
check(n>0&&n<=size(x)) n
integer depend(x,n),intent(c,hide) :: howmany = size(x)/n
check(n*howmany==size(x)) howmany
integer optional,intent(c,in) :: direction = 1
integer optional,intent(c,in),depend(direction) &
:: normalize = (direction<0)
end subroutine crfft
subroutine cfftnd(x,r,s,direction,howmany,normalize,j)
! y = cfftnd(x[,s,direction,normalize,overwrite_x])
intent(c) cfftnd
complex*8 intent(c,in,out,copy,out=y) :: x(*)
integer intent(c,hide),depend(x) :: r=old_rank(x)
integer intent(c,hide) :: j=0
integer optional,depend(r),dimension(r),intent(c,in) &
:: s=old_shape(x,j++)
check(r>=len(s)) s
integer intent(c,hide) :: howmany = 1
integer optional,intent(c,in) :: direction = 1
integer optional,intent(c,in),depend(direction) :: &
normalize = (direction<0)
callprotoargument complex_float*,int,int*,int,int,int
callstatement {&
int i,sz=1,xsz=size(x); &
for (i=0;i<r;++i) sz *= s[i]; &
howmany = xsz/sz; &
if (sz*howmany==xsz) &
(*f2py_func)(x,r,s,direction,howmany,normalize); &
else {&
f2py_success = 0; &
PyErr_SetString(_fftpack_error, &
"inconsistency in x.shape and s argument"); &
} &
}
end subroutine cfftnd
subroutine destroy_cfft_cache()
intent(c) destroy_cfft_cache
end subroutine destroy_cfft_cache
subroutine destroy_cfftnd_cache()
intent(c) destroy_cfftnd_cache
end subroutine destroy_cfftnd_cache
subroutine destroy_rfft_cache()
intent(c) destroy_rfft_cache
end subroutine destroy_rfft_cache
subroutine ddct1(x,n,howmany,normalize)
! y = ddct1(x[,n,normalize,overwrite_x])
intent(c) ddct1
real*8 intent(c,in,out,copy,out=y) :: x(*)
integer optional,depend(x),intent(c,in) :: n=size(x)
check(n>0&&n<=size(x)) n
integer depend(x,n),intent(c,hide) :: howmany = size(x)/n
check(n*howmany==size(x)) howmany
integer optional,intent(c,in) :: normalize = 0
end subroutine ddct1
subroutine ddct2(x,n,howmany,normalize)
! y = ddct2(x[,n,normalize,overwrite_x])
intent(c) ddct2
real*8 intent(c,in,out,copy,out=y) :: x(*)
integer optional,depend(x),intent(c,in) :: n=size(x)
check(n>0&&n<=size(x)) n
integer depend(x,n),intent(c,hide) :: howmany = size(x)/n
check(n*howmany==size(x)) howmany
integer optional,intent(c,in) :: normalize = 0
end subroutine ddct2
subroutine ddct3(x,n,howmany,normalize)
! y = ddct3(x[,n,normalize,overwrite_x])
intent(c) ddct3
real*8 intent(c,in,out,copy,out=y) :: x(*)
integer optional,depend(x),intent(c,in) :: n=size(x)
check(n>0&&n<=size(x)) n
integer depend(x,n),intent(c,hide) :: howmany = size(x)/n
check(n*howmany==size(x)) howmany
integer optional,intent(c,in) :: normalize = 0
end subroutine ddct3
subroutine dct1(x,n,howmany,normalize)
! y = dct1(x[,n,normalize,overwrite_x])
intent(c) dct1
real*4 intent(c,in,out,copy,out=y) :: x(*)
integer optional,depend(x),intent(c,in) :: n=size(x)
check(n>0&&n<=size(x)) n
integer depend(x,n),intent(c,hide) :: howmany = size(x)/n
check(n*howmany==size(x)) howmany
integer optional,intent(c,in) :: normalize = 0
end subroutine dct1
subroutine dct2(x,n,howmany,normalize)
! y = dct2(x[,n,normalize,overwrite_x])
intent(c) dct2
real*4 intent(c,in,out,copy,out=y) :: x(*)
integer optional,depend(x),intent(c,in) :: n=size(x)
check(n>0&&n<=size(x)) n
integer depend(x,n),intent(c,hide) :: howmany = size(x)/n
check(n*howmany==size(x)) howmany
integer optional,intent(c,in) :: normalize = 0
end subroutine dct2
subroutine dct3(x,n,howmany,normalize)
! y = dct3(x[,n,normalize,overwrite_x])
intent(c) dct3
real*4 intent(c,in,out,copy,out=y) :: x(*)
integer optional,depend(x),intent(c,in) :: n=size(x)
check(n>0&&n<=size(x)) n
integer depend(x,n),intent(c,hide) :: howmany = size(x)/n
check(n*howmany==size(x)) howmany
integer optional,intent(c,in) :: normalize = 0
end subroutine dct3
subroutine destroy_ddct2_cache()
intent(c) destroy_ddct2_cache
end subroutine destroy_ddct2_cache
subroutine destroy_ddct1_cache()
intent(c) destroy_ddct1_cache
end subroutine destroy_ddct1_cache
subroutine destroy_dct2_cache()
intent(c) destroy_dct2_cache
end subroutine destroy_dct2_cache
subroutine destroy_dct1_cache()
intent(c) destroy_dct1_cache
end subroutine destroy_dct1_cache
subroutine ddst1(x,n,howmany,normalize)
! y = ddst1(x[,n,normalize,overwrite_x])
intent(c) ddst1
real*8 intent(c,in,out,copy,out=y) :: x(*)
integer optional,depend(x),intent(c,in) :: n=size(x)
check(n>0&&n<=size(x)) n
integer depend(x,n),intent(c,hide) :: howmany = size(x)/n
check(n*howmany==size(x)) howmany
integer optional,intent(c,in) :: normalize = 0
end subroutine ddst1
subroutine ddst2(x,n,howmany,normalize)
! y = ddst2(x[,n,normalize,overwrite_x])
intent(c) ddst2
real*8 intent(c,in,out,copy,out=y) :: x(*)
integer optional,depend(x),intent(c,in) :: n=size(x)
check(n>0&&n<=size(x)) n
integer depend(x,n),intent(c,hide) :: howmany = size(x)/n
check(n*howmany==size(x)) howmany
integer optional,intent(c,in) :: normalize = 0
end subroutine ddst2
subroutine ddst3(x,n,howmany,normalize)
! y = ddst3(x[,n,normalize,overwrite_x])
intent(c) ddst3
real*8 intent(c,in,out,copy,out=y) :: x(*)
integer optional,depend(x),intent(c,in) :: n=size(x)
check(n>0&&n<=size(x)) n
integer depend(x,n),intent(c,hide) :: howmany = size(x)/n
check(n*howmany==size(x)) howmany
integer optional,intent(c,in) :: normalize = 0
end subroutine ddst3
subroutine dst1(x,n,howmany,normalize)
! y = dst1(x[,n,normalize,overwrite_x])
intent(c) dst1
real*4 intent(c,in,out,copy,out=y) :: x(*)
integer optional,depend(x),intent(c,in) :: n=size(x)
check(n>0&&n<=size(x)) n
integer depend(x,n),intent(c,hide) :: howmany = size(x)/n
check(n*howmany==size(x)) howmany
integer optional,intent(c,in) :: normalize = 0
end subroutine dst1
subroutine dst2(x,n,howmany,normalize)
! y = dst2(x[,n,normalize,overwrite_x])
intent(c) dst2
real*4 intent(c,in,out,copy,out=y) :: x(*)
integer optional,depend(x),intent(c,in) :: n=size(x)
check(n>0&&n<=size(x)) n
integer depend(x,n),intent(c,hide) :: howmany = size(x)/n
check(n*howmany==size(x)) howmany
integer optional,intent(c,in) :: normalize = 0
end subroutine dst2
subroutine dst3(x,n,howmany,normalize)
! y = dst3(x[,n,normalize,overwrite_x])
intent(c) dst3
real*4 intent(c,in,out,copy,out=y) :: x(*)
integer optional,depend(x),intent(c,in) :: n=size(x)
check(n>0&&n<=size(x)) n
integer depend(x,n),intent(c,hide) :: howmany = size(x)/n
check(n*howmany==size(x)) howmany
integer optional,intent(c,in) :: normalize = 0
end subroutine dst3
subroutine destroy_ddst2_cache()
intent(c) destroy_ddst2_cache
end subroutine destroy_ddst2_cache
subroutine destroy_ddst1_cache()
intent(c) destroy_ddst1_cache
end subroutine destroy_ddst1_cache
subroutine destroy_dst2_cache()
intent(c) destroy_dst2_cache
end subroutine destroy_dst2_cache
subroutine destroy_dst1_cache()
intent(c) destroy_dst1_cache
end subroutine destroy_dst1_cache
end interface
end python module _fftpack
! See http://cens.ioc.ee/projects/f2py2e/
|