%global module anfft Summary: ANFFT is an FFT package for Python, based on FFTW Name: python-%{module} Version: 0.1 Release: 3%{?dist} Source0: http://anfft.googlecode.com/files/%{module}-%{version}.tar.gz License: GPLv3+ Group: Development/Languages URL: http://anfft.googlecode.com/ BuildRequires: numpy fftw-libs fftw-libs-threads python2 Requires: numpy fftw-libs fftw-libs-threads python2 BuildArch: noarch %description ANFFT is intended to be used in situations where large numbers of expensive FFTs must be performed, and for which the speed of the built-in NumPy or SciPy functions has been found insufficient. By default, ANFFT provides immediate results by using FFTW's "estimate" mode, which does not require tuning and is still very fast. However, each high-level function provides a keyword named "measure" which will invoke the full FFTW planning machinery. FFTW will investigate which implementations are fastest on your hardware for the given problem size, and ANFFT will transparently cache this information to speed up later transforms on arrays of the same size and type. Accumulated FFTW "wisdom" about which methods work best is stored across Python sessions in a configuration file in ~/.anfft %prep %setup -q -n %{module}-%{version} %build python setup.py build %check libdir=build/lib export PYTHONPATH=`pwd`/build/$libdir echo "import anfft; anfft.test()" > test.py python test.py %install python setup.py install -O1 --skip-build --root=%{buildroot} %files %doc COPYING.txt README.txt %{python_sitelib}/anfft/ %{python_sitelib}/anfft-%{version}-py*.egg-info %changelog * Thu Feb 2 2012 Thibault North - 0.1-3 - Fix requires again (thanks oget) * Mon Jan 30 2012 Thibault North - 0.1-2 - Various fixes (requires, cleaning) * Sun Jan 8 2012 Thibault North - 0.1-1 - Initial import