Index index by Group index by Distribution index by Vendor index by creation date index by Name Mirrors Help Search

flint-devel-3.0~5831-lp152.3.2 RPM for armv7hl

From OpenSuSE Ports Leap 15.2 for armv7hl

Name: flint-devel Distribution: openSUSE Leap 15.2
Version: 3.0~5831 Vendor: openSUSE
Release: lp152.3.2 Build date: Sat Nov 9 10:26:22 2019
Group: Development/Libraries/C and C++ Build host: armbuild14
Size: 1050031 Source RPM: flint-3.0~5831-lp152.3.2.src.rpm
Packager: https://bugs.opensuse.org
Url: http://flintlib.org/
Summary: Development files for flint
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.

This subpackage contains the include files and library links for
developing against the FLINT library.

Provides

Requires

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/include/flint
/usr/include/flint/NTL-interface.h
/usr/include/flint/aprcl.h
/usr/include/flint/arith.h
/usr/include/flint/arithxx.h
/usr/include/flint/d_mat.h
/usr/include/flint/d_vec.h
/usr/include/flint/double_extras.h
/usr/include/flint/exception.h
/usr/include/flint/fft.h
/usr/include/flint/fft_tuning.h
/usr/include/flint/fft_tuning32.h
/usr/include/flint/fft_tuning64.h
/usr/include/flint/flint.h
/usr/include/flint/flintxx.h
/usr/include/flint/fmpq.h
/usr/include/flint/fmpq_mat.h
/usr/include/flint/fmpq_matxx.h
/usr/include/flint/fmpq_poly.h
/usr/include/flint/fmpq_polyxx.h
/usr/include/flint/fmpq_vec.h
/usr/include/flint/fmpqxx.h
/usr/include/flint/fmpz-conversions-reentrant.h
/usr/include/flint/fmpz-conversions-single.h
/usr/include/flint/fmpz-conversions.h
/usr/include/flint/fmpz.h
/usr/include/flint/fmpz_factor.h
/usr/include/flint/fmpz_factorxx.h
/usr/include/flint/fmpz_lll.h
/usr/include/flint/fmpz_mat.h
/usr/include/flint/fmpz_matxx.h
/usr/include/flint/fmpz_mod_poly.h
/usr/include/flint/fmpz_mod_poly_factor.h
/usr/include/flint/fmpz_mod_poly_factorxx.h
/usr/include/flint/fmpz_mod_polyxx.h
/usr/include/flint/fmpz_poly.h
/usr/include/flint/fmpz_poly_factor.h
/usr/include/flint/fmpz_poly_factorxx.h
/usr/include/flint/fmpz_poly_mat.h
/usr/include/flint/fmpz_poly_matxx.h
/usr/include/flint/fmpz_poly_q.h
/usr/include/flint/fmpz_poly_qxx.h
/usr/include/flint/fmpz_polyxx.h
/usr/include/flint/fmpz_vec.h
/usr/include/flint/fmpz_vecxx.h
/usr/include/flint/fmpzxx.h
/usr/include/flint/fq.h
/usr/include/flint/fq_mat.h
/usr/include/flint/fq_mat_templates.h
/usr/include/flint/fq_nmod.h
/usr/include/flint/fq_nmod_mat.h
/usr/include/flint/fq_nmod_poly.h
/usr/include/flint/fq_nmod_poly_factor.h
/usr/include/flint/fq_nmod_vec.h
/usr/include/flint/fq_poly.h
/usr/include/flint/fq_poly_factor.h
/usr/include/flint/fq_poly_factor_templates.h
/usr/include/flint/fq_poly_templates.h
/usr/include/flint/fq_templates.h
/usr/include/flint/fq_vec.h
/usr/include/flint/fq_vec_templates.h
/usr/include/flint/fq_zech.h
/usr/include/flint/fq_zech_mat.h
/usr/include/flint/fq_zech_poly.h
/usr/include/flint/fq_zech_poly_factor.h
/usr/include/flint/fq_zech_vec.h
/usr/include/flint/gmpcompat.h
/usr/include/flint/long_extras.h
/usr/include/flint/longlong.h
/usr/include/flint/mpf_mat.h
/usr/include/flint/mpf_vec.h
/usr/include/flint/mpfr_mat.h
/usr/include/flint/mpfr_vec.h
/usr/include/flint/mpn_extras.h
/usr/include/flint/nmod_mat.h
/usr/include/flint/nmod_matxx.h
/usr/include/flint/nmod_poly.h
/usr/include/flint/nmod_poly_factor.h
/usr/include/flint/nmod_poly_mat.h
/usr/include/flint/nmod_poly_matxx.h
/usr/include/flint/nmod_polyxx.h
/usr/include/flint/nmod_vec.h
/usr/include/flint/nmod_vecxx.h
/usr/include/flint/padic.h
/usr/include/flint/padic_mat.h
/usr/include/flint/padic_matxx.h
/usr/include/flint/padic_poly.h
/usr/include/flint/padic_polyxx.h
/usr/include/flint/padicxx.h
/usr/include/flint/perm.h
/usr/include/flint/permxx.h
/usr/include/flint/profiler.h
/usr/include/flint/qadic.h
/usr/include/flint/qadicxx.h
/usr/include/flint/qsieve.h
/usr/include/flint/templates.h
/usr/include/flint/ulong_extras.h
/usr/lib/libflint.so


Generated by rpm2html 1.8.1

Fabrice Bellet, Tue Jul 9 12:19:47 2024