Source: fplll
Section: math
Priority: optional
Maintainer: Debian Math Team <team+math@tracker.debian.org>
Uploaders: Tim Abbott <tabbott@mit.edu>,
           Julien Puydt <jpuydt@debian.org>,
           Ximin Luo <infinity0@debian.org>
Homepage: https://github.com/fplll/fplll/
Build-Depends: dpkg-dev (>= 1.22.5), debhelper-compat (= 13), libmpfr-dev, pkg-config
Standards-Version: 4.6.2
Rules-Requires-Root: no
Vcs-Git: https://salsa.debian.org/math-team/fplll.git
Vcs-Browser: https://salsa.debian.org/math-team/fplll

Package: libfplll8t64
Provides: ${t64:Provides}
Replaces: libfplll8
Breaks: libfplll8 (<< ${source:Version})
Architecture: any
Multi-Arch: same
Section: libs
Pre-Depends: ${misc:Pre-Depends}
Depends: ${shlibs:Depends}, ${misc:Depends}, libfplll8-data (= ${source:Version})
Description: Library for LLL-reduction of Euclidean lattices, runtime
 fpLLL is a library for computing reduced (nearly orthogonal) bases
 for Euclidean lattices using the LLL algorithm.
 .
 fpLLL contains multiple different implementations of the
 floating-point LLL reduction algorithm, offering multiple different
 speed/guarantees ratios.
 .
 It contains a 'wrapper' that chooses the estimated best sequence of
 variants in order to provide a guaranteed output as fast as possible.
 In the case of the wrapper, the succession of variants is oblivious
 to the user.
 .
 This package contains the shared library libfplll.

Package: libfplll8-data
Architecture: all
Multi-Arch: foreign
Section: libs
Depends: ${misc:Depends}
Breaks: libfplll7-data (= 5.4.3-2)
Replaces: libfplll7-data (= 5.4.3-2)
Description: Library for LLL-reduction of Euclidean lattices, data
 fpLLL is a library for computing reduced (nearly orthogonal) bases
 for Euclidean lattices using the LLL algorithm.
 .
 fpLLL contains multiple different implementations of the
 floating-point LLL reduction algorithm, offering multiple different
 speed/guarantees ratios.
 .
 It contains a 'wrapper' that chooses the estimated best sequence of
 variants in order to provide a guaranteed output as fast as possible.
 In the case of the wrapper, the succession of variants is oblivious
 to the user.
 .
 This package contains the architecture-independent data.

Package: libfplll-dev
Architecture: any
Multi-Arch: same
Section: libdevel
Depends: ${misc:Depends}, libgmp-dev, libmpfr-dev, libfplll8t64 (= ${binary:Version})
Description: Library for LLL-reduction of Euclidean lattices, development
 fpLLL is a library for computing reduced (nearly orthogonal) bases
 for Euclidean lattices using the floating-point LLL algorithm.
 .
 fpLLL contains multiple different implementations of the
 floating-point LLL reduction algorithm, offering multiple different
 speed/guarantees ratios.
 .
 It contains a 'wrapper' that chooses the estimated best sequence of
 variants in order to provide a guaranteed output as fast as possible.
 In the case of the wrapper, the succession of variants is oblivious
 to the user.
 .
 This package contains development files for libfplll.

Package: fplll-tools
Architecture: any
Depends: libfplll8t64 (= ${binary:Version}), ${shlibs:Depends}, ${misc:Depends}
Description: Tools to compute LLL-reduction of Euclidian lattices
 fpLLL is a library for computing reduced (nearly orthogonal) bases
 for Euclidean lattices using the floating-point LLL algorithm.
 .
 fpLLL contains multiple different implementations of the
 floating-point LLL reduction algorithm, offering multiple different
 speed/guarantees ratios.
 .
 It contains a 'wrapper' that chooses the estimated best sequence of
 variants in order to provide a guaranteed output as fast as possible.
 In the case of the wrapper, the succession of variants is oblivious
 to the user.
 .
 This package contains the base tools using libfplll.