ajacoutot
58f1a6f9f6
USE_LIBTOOL=Yes is the default now.
2013-03-21 08:45:11 +00:00
espie
0662a4e9d6
PERMIT_* / REGRESS->TEST sweep
2013-03-11 11:20:26 +00:00
ajacoutot
7ab36748ae
Remove irrelevant $FreeBSD RCS ids.
2012-08-18 12:41:37 +00:00
sthen
d580cde0ab
fix various typos, from Anthony J. Bentley with a few tweaks by myself
2011-03-14 09:15:33 +00:00
steven
80dfe7cfa9
REVISION
2010-07-18 10:30:41 +00:00
steven
907a85c549
remove quotes from COMMENT/PERMIT*/BROKEN
2007-09-15 18:44:36 +00:00
espie
9eafbbfb35
base64 checksums.
2007-04-05 16:19:55 +00:00
sturm
e234467e13
give up MAINTAINER, I don't use these anymore
2006-03-04 15:10:30 +00:00
steven
6cd159341c
make configure test for correct stack alignment evaluate to no on i386
...
(it was returning a pretty much random test result)
go ahead sturm@
2006-01-17 07:18:23 +00:00
steven
0b38e5868e
remove MODGNU_SHARED_LIBS
2006-01-06 18:30:40 +00:00
steven
7ef3fe69d4
SHARED_LIBS
...
ok sturm@
2005-12-25 18:54:32 +00:00
sturm
11a2fc53ac
update to last release of fftw2, 2.1.5
...
USE_LIBTOOL while here
from steven.mestdagh at esat.kuleuven.be
2005-10-03 12:53:33 +00:00
naddy
8e0d7f62ec
SIZE
2005-01-05 17:05:00 +00:00
alek
554de2fd94
Add WANTLIB markers
2004-12-27 07:16:44 +00:00
espie
d7c7e778ad
new style PLISTs
2004-09-15 09:11:58 +00:00
naddy
2276d3b230
remove WWW lines
2003-12-15 21:42:08 +00:00
sturm
8f4c8f2123
one MASTER_SITE disappeared from the net
2003-01-22 15:45:35 +00:00
fgsch
8625bbcf91
byebye NEED_VERSION.
2002-12-29 19:43:49 +00:00
sturm
c539ea8fde
set MAINTAINER to sturm@openbsd.org
...
naddy@ OK
2002-11-22 16:43:44 +00:00
espie
47bb0f3975
uniformize maintainer addresses.
2002-05-11 00:31:22 +00:00
espie
e3edfb9aea
md5->distinfo
2002-03-21 20:20:41 +00:00
wilfried
f33e99a66f
use ports in-tree libtool patches, from maintainer
2001-11-01 21:05:41 +00:00
lebel
b852691a58
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 23:10:44 +00:00
