openbsd-ports/math/fftw/pkg/PLIST

@comment $OpenBSD: PLIST,v 1.2 2004/09/15 09:11:59 espie Exp $
include/fftw.h
include/rfftw.h
@info info/fftw.info
lib/libfftw.a
lib/libfftw.la
lib/librfftw.a
lib/librfftw.la
share/doc/fftw/
share/doc/fftw/fftw.ps
%%SHARED%%
new style PLISTs 2004-09-15 05:11:58 -04:00			`@comment $OpenBSD: PLIST,v 1.2 2004/09/15 09:11:59 espie Exp $`
initial port of fftw-2.1.3: -- FFTW is a free collection of fast C routines for computing the Discrete Fourier Transform in one or more dimensions. It includes complex, real, and parallel transforms, and can handle arbitrary array sizes efficiently. FFTW is typically faster than other publically-available FFT implementations, and is even competitive with vendor-tuned libraries. (See our web page for extensive benchmarks.) To achieve this performance, FFTW uses novel code-generation and runtime self-optimization techniques (along with many other tricks). WWW: http://www.fftw.org/ Submitted by Nikolay Sturm <Nikolay.Sturm@desy.de> 2001-07-01 19:10:44 -04:00			`include/fftw.h`
			`include/rfftw.h`
new style PLISTs 2004-09-15 05:11:58 -04:00			`@info info/fftw.info`
initial port of fftw-2.1.3: -- FFTW is a free collection of fast C routines for computing the Discrete Fourier Transform in one or more dimensions. It includes complex, real, and parallel transforms, and can handle arbitrary array sizes efficiently. FFTW is typically faster than other publically-available FFT implementations, and is even competitive with vendor-tuned libraries. (See our web page for extensive benchmarks.) To achieve this performance, FFTW uses novel code-generation and runtime self-optimization techniques (along with many other tricks). WWW: http://www.fftw.org/ Submitted by Nikolay Sturm <Nikolay.Sturm@desy.de> 2001-07-01 19:10:44 -04:00			`lib/libfftw.a`
			`lib/libfftw.la`
			`lib/librfftw.a`
			`lib/librfftw.la`
new style PLISTs 2004-09-15 05:11:58 -04:00			`share/doc/fftw/`
initial port of fftw-2.1.3: -- FFTW is a free collection of fast C routines for computing the Discrete Fourier Transform in one or more dimensions. It includes complex, real, and parallel transforms, and can handle arbitrary array sizes efficiently. FFTW is typically faster than other publically-available FFT implementations, and is even competitive with vendor-tuned libraries. (See our web page for extensive benchmarks.) To achieve this performance, FFTW uses novel code-generation and runtime self-optimization techniques (along with many other tricks). WWW: http://www.fftw.org/ Submitted by Nikolay Sturm <Nikolay.Sturm@desy.de> 2001-07-01 19:10:44 -04:00			`share/doc/fftw/fftw.ps`
new style PLISTs 2004-09-15 05:11:58 -04:00			`%%SHARED%%`