libflint0-3.0~5831-lp152.3.2 RPM for aarch64

From OpenSuSE Ports Leap 15.2 for aarch64

FLINT (Fast Library for Number Theory) is a C library in support of
computations in number theory. It is also a research project into
algorithms in number theory. At this stage, FLINT consists mainly of
fast integer and polynomial arithmetic and linear algebra.

Provides

• libflint0
• libflint.so.0()(64bit)
• libflint0(aarch-64)

Requires

• /sbin/ldconfig
• /sbin/ldconfig
• ld-linux-aarch64.so.1()(64bit)
• ld-linux-aarch64.so.1(GLIBC_2.17)(64bit)
• libc.so.6()(64bit)
• libc.so.6(GLIBC_2.17)(64bit)
• libgcc_s.so.1()(64bit)
• libgcc_s.so.1(GCC_3.0)(64bit)
• libgcc_s.so.1(GCC_4.2.0)(64bit)
• libm.so.6()(64bit)
• libm.so.6(GLIBC_2.17)(64bit)
• libmpfr.so.6()(64bit)
• libntl.so.33()(64bit)
• libpthread.so.0()(64bit)
• libpthread.so.0(GLIBC_2.17)(64bit)
• libstdc++.so.6()(64bit)
• libstdc++.so.6(CXXABI_1.3)(64bit)
• libstdc++.so.6(GLIBCXX_3.4)(64bit)
• rpmlib(CompressedFileNames) <= 3.0.4-1
• rpmlib(FileDigests) <= 4.6.0-1
• rpmlib(PayloadFilesHavePrefix) <= 4.0-1
• rpmlib(PayloadIsXz) <= 5.2-1
• rpmlib(TildeInVersions) <= 4.10.0-1

License

GPL-2.0+

Changelog

* Sun May 28 2017 bwiedemann@suse.com
  - Sort input files to make build reproducible (boo#1041090)
* Sun Nov 13 2016 jengelh@inai.de
  - Adjust 0001-build-provide-autotools-files.patch for new
    NTL-10.x header file names.
* Sun Mar 13 2016 jengelh@inai.de
  - Update to git snapshot of 3.0.x branch
    * Add implementation of Moller-Granlund invert_limb
    * Add implementations of n_div2_preinv and n_divrem2_preinv.
    * Add primitive flint exception mechanism.
    * Add n_powmod2_ui_preinv
    * Add exception for impossible inverse to n_invmod and remove resulting exceptions throughout Flint.
    * Remove smooth factorisation since it is completely broken.
  - Remove 0002-compile-fixes.diff
* Sat Nov 14 2015 jengelh@inai.de
  - Update to new upstream release 2.5.2
    * LLL (rational, Nguyen-Stehle, from Gram matrix, with_removal,
    Storjohann/ULLL)
    * Hermite normal form (naive, xgcd, Domich-Kannan-Trotter,
    Kannan-Bachem, Pernet-Stein)
    * Smith normal form (diagonal, Kannen-Bachem, Iliopoulos)
    * Paterson-Stockmeyer algorithm
    * modular resultant; hgcd resultant; polynomial discriminant
    * multithreaded multimodular Taylor shift
    * multithreaded Brent-Kung composition
    * multithreaded Kaltofen-Shoup distinct degree factorisation
    * multiplication based reduced row echelon form
    * place inline functions in library for foreign function interfaces
    * Primality tests for large integers (Pocklington, Morrison)
    * Probable prime tests for large integers (Lucas, Baillie-PSW,
    strong-psp, Brillhart-Lehmer-Selfridge)
    * CRT for large integers
    * Dixon algorithm for nullspace
    * Brent-Kung composition in irreducibility and distinct degree
    factorisation
    * floating point QR decomposition
    * Schwarz-Rutishauser Gram-Schmidt algorithm
    * Ogita-Rump-Oishi dot product
    * Bodrato matrix squaring
    * matrix concatenation functions
    * additional functions for returning factor of modulus in polys
    over Z/nZ
    * Hadamard matrix construction
    * series addition/subtraction
    * teach flint_printf/sprintf about explicit width format specifiers
* Fri Jun 26 2015 jengelh@inai.de
  - Update to new upstream release 2.4.5
    * fixed a severe bug in flint's fmpz_poly_gcd_heuristic
* Thu Feb 19 2015 jengelh@inai.de
  - Add 0002-compile-fixes.diff to fend off improper usage of NTL
    headers.
* Mon Oct 20 2014 schwab@suse.de
  - Don't use unknown option -mno-popcnt
* Sun Aug 10 2014 jengelh@inai.de
  - Update to new upstream release 2.4.4
    * Fix a bug in the ARM assembly
* Fri Feb 07 2014 jengelh@inai.de
  - Update to new upstream release 2.4.1
    * C++ expressions template wrapper
    * Fast factorisation of polynomials over Z/nZ
    * improved p-adics
    * polynomials/matrices over p-adics
    * qadics
    * Finite fields (small and large F_q), polynomials/matrices over F_q
    * Finite fields with Zech logarithm representation
    * Fast factorisation of polynomials over F_q
    * Faster Brent-Kung modular composition
    * New prime sieving code
    * Lambert-W function
    * Precomputed inverses for polynomials and large integers
    * Williams' P+1 integer factoring algorithm
    * Harvey's KS2/KS4 polynomial multiplication
    * Faster primality testing up to 64 bits
    * Support for GMP
    * Support for Boehm-Demers-Weiser GC
    * Support for flint extension modules
* Thu Dec 06 2012 jengelh@inai.de
  - Initial package (version 2.3+, revision 375f4c8696b4)
    for build.opensuse.org

Files

/usr/lib64/libflint.so.0
/usr/lib64/libflint.so.0.0.0
/usr/share/doc/packages/libflint0
/usr/share/doc/packages/libflint0/gpl-2.0.txt

Generated by rpm2html 1.8.1

Fabrice Bellet, Tue Apr 9 12:09:08 2024