[clfft] 73/109: better dependencies for dbg
Jérôme Kieffer
kieffer-guest at moszumanska.debian.org
Wed May 20 07:29:31 UTC 2015
This is an automated email from the git hooks/post-receive script.
kieffer-guest pushed a commit to branch debian
in repository clfft.
commit b50cb49e458de507643ca05745ac3855100685ed
Author: Jerome Kieffer <jerome.kieffer at esrf.fr>
Date: Fri Apr 10 09:27:57 2015 +0200
better dependencies for dbg
---
debian/control | 10 +++++-----
1 file changed, 5 insertions(+), 5 deletions(-)
diff --git a/debian/control b/debian/control
index da2b9a5..599365f 100644
--- a/debian/control
+++ b/debian/control
@@ -12,7 +12,7 @@ Architecture: any
Multi-Arch: same
Depends: libclfft2 (= ${binary:Version}), ocl-icd-dev
Pre-Depends: ${misc:Pre-Depends}
-Description: clFFT is an open source OpenCL library implementation of FFT
+Description: clFFT is an OpenCL library for of FFT - development files
The FFT is an implementation of the Discrete Fourier Transform (DFT) that
makes use of symmetries in the FFT definition to reduce the mathematical
intensity required from O(N2) to O(N log2( N )) when the sequence length
@@ -29,7 +29,7 @@ Multi-Arch: same
Architecture: any
Depends: ${shlibs:Depends}, ${misc:Depends}, opencl-icd
Pre-Depends: ${misc:Pre-Depends}
-Description: clFFT is an open source OpenCL library implementation of FFT
+Description: clFFT is an OpenCL library for of FFT - actual library
The FFT is an implementation of the Discrete Fourier Transform (DFT) that
makes use of symmetries in the FFT definition to reduce the mathematical
intensity required from O(N2) to O(N log2( N )) when the sequence length
@@ -46,7 +46,7 @@ Multi-Arch: same
Architecture: any
Depends: libclfft2 (= ${binary:Version})
Pre-Depends: ${misc:Pre-Depends}
-Description: clFFT is an open source OpenCL library implementation of FFT
+Description: clFFT is an OpenCL library for of FFT - test and benchmarks
The FFT is an implementation of the Discrete Fourier Transform (DFT) that
makes use of symmetries in the FFT definition to reduce the mathematical
intensity required from O(N2) to O(N log2( N )) when the sequence length
@@ -61,9 +61,9 @@ Package: libclfft2-dbg
Section: libs
Multi-Arch: same
Architecture: any
-Depends: ${shlibs:Depends}, ${misc:Depends}, opencl-icd
+Depends: libclfft2 (= ${binary:Version})
Pre-Depends: ${misc:Pre-Depends}
-Description: clFFT is an open source OpenCL library implementation of FFT
+Description: clFFT is an OpenCL library for of FFT - debug symbols
The FFT is an implementation of the Discrete Fourier Transform (DFT) that
makes use of symmetries in the FFT definition to reduce the mathematical
intensity required from O(N2) to O(N log2( N )) when the sequence length
--
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/debian-science/packages/clfft.git
More information about the debian-science-commits
mailing list