openbsd-ports/math/p5-Math-FFT/pkg/PLIST

@comment $OpenBSD: PLIST,v 1.3 2004/09/15 09:11:59 espie Exp $
${P5ARCH}/
${P5ARCH}/Math/
${P5ARCH}/Math/FFT.pm
${P5ARCH}/auto/
${P5ARCH}/auto/Math/
${P5ARCH}/auto/Math/FFT/
${P5ARCH}/auto/Math/FFT/FFT.bs
${P5ARCH}/auto/Math/FFT/FFT.so
@man man/man3p/Math::FFT.3p
new style PLISTs 2004-09-15 05:11:58 -04:00			`@comment $OpenBSD: PLIST,v 1.3 2004/09/15 09:11:59 espie Exp $`
			`${P5ARCH}/`
			`${P5ARCH}/Math/`
initial import of p5-Math-FFT-0.25 -- This module implements some algorithms for calculating Fast Fourier Transforms for one-dimensional data sets of size 2^n. The data, assumed to arise from a constant sampling rate, is represented by an array reference, which is then used to create a Math::FFT object. Available methods include complex and real discrete fourier transforms, convolution, power spectra and windowing functions, as well as some statistical utilities. 2003-02-21 08:44:19 -05:00			`${P5ARCH}/Math/FFT.pm`
new style PLISTs 2004-09-15 05:11:58 -04:00			`${P5ARCH}/auto/`
			`${P5ARCH}/auto/Math/`
			`${P5ARCH}/auto/Math/FFT/`
initial import of p5-Math-FFT-0.25 -- This module implements some algorithms for calculating Fast Fourier Transforms for one-dimensional data sets of size 2^n. The data, assumed to arise from a constant sampling rate, is represented by an array reference, which is then used to create a Math::FFT object. Available methods include complex and real discrete fourier transforms, convolution, power spectra and windowing functions, as well as some statistical utilities. 2003-02-21 08:44:19 -05:00			`${P5ARCH}/auto/Math/FFT/FFT.bs`
			`${P5ARCH}/auto/Math/FFT/FFT.so`
new style PLISTs 2004-09-15 05:11:58 -04:00			`@man man/man3p/Math::FFT.3p`