passagemath-flint 10.5.43__tar.gz → 10.6.1rc1__tar.gz

{passagemath_flint-10.5.43 → passagemath_flint-10.6.1rc1}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: passagemath-flint
-Version: 10.5.43
+Version: 10.6.1rc1
 Summary: passagemath: Fast computations with MPFI and FLINT
 Author-email: The Sage Developers <sage-support@googlegroups.com>
 Maintainer: Matthias Köppe, passagemath contributors
@@ -19,17 +19,16 @@ Classifier: Intended Audience :: Science/Research
 Classifier: Operating System :: POSIX
 Classifier: Operating System :: MacOS :: MacOS X
 Classifier: Programming Language :: Python :: 3 :: Only
-Classifier: Programming Language :: Python :: 3.9
 Classifier: Programming Language :: Python :: 3.10
 Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: 3.12
 Classifier: Programming Language :: Python :: 3.13
 Classifier: Programming Language :: Python :: Implementation :: CPython
 Classifier: Topic :: Scientific/Engineering :: Mathematics
-Requires-Python: <3.14,>=3.9
+Requires-Python: <3.14,>=3.10
 Description-Content-Type: text/x-rst
-Requires-Dist: passagemath-categories~=10.5.43.0
-Requires-Dist: passagemath-ntl~=10.5.43.0
+Requires-Dist: passagemath-categories==10.6.1rc1
+Requires-Dist: passagemath-ntl==10.6.1rc1
 Requires-Dist: numpy>=1.19
 Requires-Dist: numpy>=1.22.4
 Provides-Extra: test
@@ -77,7 +76,7 @@ passagemath attempts to support all major Linux distributions and recent version
 macOS. Use on Windows currently requires the use of Windows Subsystem for Linux or
 virtualization.
 
-Complete sets of binary wheels are provided on PyPI for Python versions 3.9.x-3.12.x.
+Complete sets of binary wheels are provided on PyPI for Python versions 3.10.x-3.13.x.
 Python 3.13.x is also supported, but some third-party packages are still missing wheels,
 so compilation from source is triggered for those.
 

{passagemath_flint-10.5.43 → passagemath_flint-10.6.1rc1}/README.rst

@@ -39,7 +39,7 @@ passagemath attempts to support all major Linux distributions and recent version
 macOS. Use on Windows currently requires the use of Windows Subsystem for Linux or
 virtualization.
 
-Complete sets of binary wheels are provided on PyPI for Python versions 3.9.x-3.12.x.
+Complete sets of binary wheels are provided on PyPI for Python versions 3.10.x-3.13.x.
 Python 3.13.x is also supported, but some third-party packages are still missing wheels,
 so compilation from source is triggered for those.
 

passagemath_flint-10.6.1rc1/VERSION.txt

@@ -0,0 +1 @@
+10.6.1.rc1

{passagemath_flint-10.5.43 → passagemath_flint-10.6.1rc1}/passagemath_flint.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: passagemath-flint
-Version: 10.5.43
+Version: 10.6.1rc1
 Summary: passagemath: Fast computations with MPFI and FLINT
 Author-email: The Sage Developers <sage-support@googlegroups.com>
 Maintainer: Matthias Köppe, passagemath contributors
@@ -19,17 +19,16 @@ Classifier: Intended Audience :: Science/Research
 Classifier: Operating System :: POSIX
 Classifier: Operating System :: MacOS :: MacOS X
 Classifier: Programming Language :: Python :: 3 :: Only
-Classifier: Programming Language :: Python :: 3.9
 Classifier: Programming Language :: Python :: 3.10
 Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: 3.12
 Classifier: Programming Language :: Python :: 3.13
 Classifier: Programming Language :: Python :: Implementation :: CPython
 Classifier: Topic :: Scientific/Engineering :: Mathematics
-Requires-Python: <3.14,>=3.9
+Requires-Python: <3.14,>=3.10
 Description-Content-Type: text/x-rst
-Requires-Dist: passagemath-categories~=10.5.43.0
-Requires-Dist: passagemath-ntl~=10.5.43.0
+Requires-Dist: passagemath-categories==10.6.1rc1
+Requires-Dist: passagemath-ntl==10.6.1rc1
 Requires-Dist: numpy>=1.19
 Requires-Dist: numpy>=1.22.4
 Provides-Extra: test
@@ -77,7 +76,7 @@ passagemath attempts to support all major Linux distributions and recent version
 macOS. Use on Windows currently requires the use of Windows Subsystem for Linux or
 virtualization.
 
-Complete sets of binary wheels are provided on PyPI for Python versions 3.9.x-3.12.x.
+Complete sets of binary wheels are provided on PyPI for Python versions 3.10.x-3.13.x.
 Python 3.13.x is also supported, but some third-party packages are still missing wheels,
 so compilation from source is triggered for those.
 

{passagemath_flint-10.5.43 → passagemath_flint-10.6.1rc1}/passagemath_flint.egg-info/requires.txt

@@ -1,5 +1,5 @@
-passagemath-categories~=10.5.43.0
-passagemath-ntl~=10.5.43.0
+passagemath-categories==10.6.1rc1
+passagemath-ntl==10.6.1rc1
 numpy>=1.19
 numpy>=1.22.4
 

{passagemath_flint-10.5.43 → passagemath_flint-10.6.1rc1}/pyproject.toml

@@ -4,13 +4,13 @@
 # sage_conf is needed for library name of the flint library.
 requires = [
     'setuptools >= 77.0.0',
-    'passagemath-setup ~= 10.5.43.0',
-    'passagemath-conf ~= 10.5.43.0',
+    'passagemath-setup == 10.6.1rc1',
+    'passagemath-conf == 10.6.1rc1',
     'numpy >=1.19', 'numpy >=1.22.4',
-    'passagemath-environment ~= 10.5.43.0',
-    'passagemath-categories ~= 10.5.43.0',
-    'passagemath-modules ~= 10.5.43.0',
-    'passagemath-ntl ~= 10.5.43.0',
+    'passagemath-environment == 10.6.1rc1',
+    'passagemath-categories == 10.6.1rc1',
+    'passagemath-modules == 10.6.1rc1',
+    'passagemath-ntl == 10.6.1rc1',
     'cython >=3.0, != 3.0.3, <4.0', 'cython >=3.0.8,<3.1.0',
     'gmpy2 ~=2.1.b999',
     'cysignals >=1.11.2, != 1.12.0',
@@ -22,8 +22,8 @@ build-backend = "setuptools.build_meta"
 name = "passagemath-flint"
 description = "passagemath: Fast computations with MPFI and FLINT"
 dependencies = [
-    'passagemath-categories ~= 10.5.43.0',
-    'passagemath-ntl ~= 10.5.43.0',
+    'passagemath-categories == 10.6.1rc1',
+    'passagemath-ntl == 10.6.1rc1',
     'numpy >=1.19', 'numpy >=1.22.4',
 ]
 dynamic = ["version"]
@@ -40,7 +40,6 @@ classifiers = [
     "Operating System :: POSIX",
     "Operating System :: MacOS :: MacOS X",
     "Programming Language :: Python :: 3 :: Only",
-    "Programming Language :: Python :: 3.9",
     "Programming Language :: Python :: 3.10",
     "Programming Language :: Python :: 3.11",
     "Programming Language :: Python :: 3.12",
@@ -48,7 +47,7 @@ classifiers = [
     "Programming Language :: Python :: Implementation :: CPython",
     "Topic :: Scientific/Engineering :: Mathematics",
 ]
-requires-python = ">=3.9, <3.14"
+requires-python = ">=3.10, <3.14"
 
 [project.urls]
 "release notes" = "https://github.com/passagemath/passagemath/releases"

{passagemath_flint-10.5.43 → passagemath_flint-10.6.1rc1}/sage/data_structures/bounded_integer_sequences.pyx

@@ -196,7 +196,7 @@ cdef bint biseq_init_list(biseq_t R, list data, size_t bound) except -1:
         sig_check()
         item_c = item
         if item_c > bound:
-            raise OverflowError("list item {!r} larger than {}".format(item, bound) )
+            raise OverflowError("list item {!r} larger than {}".format(item, bound))
         biseq_inititem(R, index, item_c)
         index += 1
 
@@ -390,7 +390,8 @@ cdef mp_size_t biseq_contains(biseq_t S1, biseq_t S2, mp_size_t start) except -2
     sig_on()
     for index from start <= index <= S1.length-S2.length:
         if mpn_equal_bits_shifted(S2.data.bits, S1.data.bits,
-                S2.length*S2.itembitsize, index*S2.itembitsize):
+                                  S2.length * S2.itembitsize,
+                                  index * S2.itembitsize):
             sig_off()
             return index
     sig_off()
@@ -425,7 +426,8 @@ cdef mp_size_t biseq_startswith_tail(biseq_t S1, biseq_t S2, mp_size_t start) ex
     sig_on()
     for index from start <= index < S2.length:
         if mpn_equal_bits_shifted(S1.data.bits, S2.data.bits,
-                (S2.length - index)*S2.itembitsize, index*S2.itembitsize):
+                                  (S2.length - index) * S2.itembitsize,
+                                  index * S2.itembitsize):
             sig_off()
             return index
     sig_off()
@@ -1382,35 +1384,35 @@ def _biseq_stresstest():
     cdef list L = [BoundedIntegerSequence(6, [randint(0, 5) for z in range(randint(4, 10))]) for y in range(100)]
     cdef BoundedIntegerSequence S, T
     while True:
-        branch = randint(0,4)
+        branch = randint(0, 4)
         if branch == 0:
-            L[randint(0,99)] = L[randint(0,99)]+L[randint(0,99)]
+            L[randint(0, 99)] = L[randint(0, 99)] + L[randint(0, 99)]
         elif branch == 1:
-            x = randint(0,99)
+            x = randint(0, 99)
             if len(L[x]):
-                y = randint(0,len(L[x])-1)
-                z = randint(y,len(L[x])-1)
-                L[randint(0,99)] = L[x][y:z]
+                y = randint(0, len(L[x]) - 1)
+                z = randint(y, len(L[x]) - 1)
+                L[randint(0, 99)] = L[x][y:z]
             else:
-                L[x] = BoundedIntegerSequence(6, [randint(0,5) for z in range(randint(4,10))])
+                L[x] = BoundedIntegerSequence(6, [randint(0, 5) for z in range(randint(4, 10))])
         elif branch == 2:
-            t = list(L[randint(0,99)])
-            t = repr(L[randint(0,99)])
-            t = L[randint(0,99)].list()
+            t = list(L[randint(0, 99)])
+            t = repr(L[randint(0, 99)])
+            t = L[randint(0, 99)].list()
         elif branch == 3:
-            x = randint(0,99)
+            x = randint(0, 99)
             if len(L[x]):
-                y = randint(0,len(L[x])-1)
+                y = randint(0, len(L[x])-1)
                 t = L[x][y]
                 try:
                     t = L[x].index(t)
                 except ValueError:
-                    raise ValueError("{} should be in {} (bound {}) at position {}".format(t,L[x],L[x].bound(),y))
+                    raise ValueError("{} should be in {} (bound {}) at position {}".format(t, L[x], L[x].bound(), y))
             else:
-                L[x] = BoundedIntegerSequence(6, [randint(0,5) for z in range(randint(4,10))])
+                L[x] = BoundedIntegerSequence(6, [randint(0, 5) for z in range(randint(4, 10))])
         elif branch == 4:
-            S = L[randint(0,99)]
-            T = L[randint(0,99)]
-            biseq_startswith(S.data,T.data)
+            S = L[randint(0, 99)]
+            T = L[randint(0, 99)]
+            biseq_startswith(S.data, T.data)
             biseq_contains(S.data, T.data, 0)
             biseq_startswith_tail(S.data, T.data, 0)

{passagemath_flint-10.5.43 → passagemath_flint-10.6.1rc1}/sage/graphs/chrompoly.pyx

@@ -11,8 +11,9 @@ AUTHORS:
 
 REFERENCE:
 
-    Ronald C Read, An improved method for computing the chromatic polynomials of
-    sparse graphs.
+    See [Rea1968]_ and the :wikipedia:`Chromatic_polynomial` for more details
+    on this notion in graphs.
+
 """
 
 # ****************************************************************************
@@ -42,7 +43,7 @@ def chromatic_polynomial(G, return_tree_basis=False, algorithm='C', cache=None):
     Compute the chromatic polynomial of the graph G.
 
     The algorithm used is a recursive one, based on the following observations
-    of Read:
+    of Read [Rea1968]_:
 
         - The chromatic polynomial of a tree on n vertices is x(x-1)^(n-1).
 

{passagemath_flint-10.5.43 → passagemath_flint-10.6.1rc1}/sage/libs/flint/flint.pxd

@@ -20,8 +20,8 @@ cdef extern from "flint_wrap.h":
     void * flint_realloc(void * ptr, size_t size) noexcept
     void * flint_calloc(size_t num, size_t size) noexcept
     void flint_free(void * ptr) noexcept
-    flint_rand_s * flint_rand_alloc() noexcept
-    void flint_rand_free(flint_rand_s * state) noexcept
+    flint_rand_struct * flint_rand_alloc() noexcept
+    void flint_rand_free(flint_rand_struct * state) noexcept
     void flint_randinit(flint_rand_t state) noexcept
     void flint_randclear(flint_rand_t state) noexcept
     void flint_set_num_threads(int num_threads) noexcept

{passagemath_flint-10.5.43 → passagemath_flint-10.6.1rc1}/sage/libs/flint/flint_wrap.h

@@ -32,6 +32,10 @@
 #pragma push_macro("I")
 #define I Iv
 
+/* flint 3.2 will rename flint_rand_s to flint_rand_struct
+ * the following line can be removed when flint 3.1 is gone */
+#define flint_rand_s flint_rand_struct
+
 #include <flint/flint.h>
 
 /* If flint was already previously included via another header (e.g.

{passagemath_flint-10.5.43 → passagemath_flint-10.6.1rc1}/sage/libs/flint/nmod_poly_linkage.pxi

@@ -6,8 +6,9 @@ This file provides the backend for \class{Polynomial_zmod_flint} via
 templating.
 
 AUTHOR:
-    -- Martin Albrecht (2009-01) another initial implementation
-    -- Burcin Erocal (2008-11) initial implementation
+
+- Martin Albrecht (2009-01) another initial implementation
+- Burcin Erocal (2008-11) initial implementation
 """
 #*****************************************************************************
 #       Copyright (C) 2008-2009 Burcin Erocal <burcin@erocal.org>
@@ -15,7 +16,7 @@ AUTHOR:
 #
 #  Distributed under the terms of the GNU General Public License (GPL),
 #  version 2 or any later version.  The full text of the GPL is available at:
-#                  http://www.gnu.org/licenses/
+#                  https://www.gnu.org/licenses/
 #*****************************************************************************
 
 from cysignals.signals cimport sig_on, sig_off
@@ -338,7 +339,7 @@ cdef inline int celement_mul_scalar(nmod_poly_t res, nmod_poly_t p,
         sage: (p*9836).coefficients() == [x*9836 for x in p.coefficients()]
         True
     """
-    nmod_poly_scalar_mul_nmod(res, p, (<unsigned long>c)%n)
+    nmod_poly_scalar_mul_nmod(res, p, (<unsigned long>c) % n)
 
 cdef inline int celement_mul(nmod_poly_t res, nmod_poly_t a, nmod_poly_t b, unsigned long n) except -2:
     """

{passagemath_flint-10.5.43 → passagemath_flint-10.6.1rc1}/sage/libs/flint/types.pxd

@@ -267,9 +267,9 @@ cdef extern from "flint_wrap.h":
 
 
     # flint/flint.h
-    ctypedef struct flint_rand_s:
+    ctypedef struct flint_rand_struct:
         pass
-    ctypedef flint_rand_s flint_rand_t[1]
+    ctypedef flint_rand_struct flint_rand_t[1]
 
     cdef long FLINT_BITS
     cdef long FLINT_D_BITS

{passagemath_flint-10.5.43 → passagemath_flint-10.6.1rc1}/sage/matrix/matrix_cyclo_dense.pyx

@@ -1230,7 +1230,7 @@ cdef class Matrix_cyclo_dense(Matrix_dense):
             sage: Matrix(CyclotomicField(10),0).charpoly()
             1
         """
-        key = 'charpoly-%s-%s'%(algorithm,proof)
+        key = 'charpoly-%s-%s' % (algorithm, proof)
         f = self.fetch(key)
         if f is not None:
             return f.change_variable_name(var)
@@ -1525,7 +1525,7 @@ cdef class Matrix_cyclo_dense(Matrix_dense):
             sage: a == b  # long time (depends on previous)
             True
         """
-        key = 'echelon_form-%s'%algorithm
+        key = 'echelon_form-%s' % algorithm
         E = self.fetch(key)
         if E is not None:
             return E
@@ -1631,7 +1631,7 @@ cdef class Matrix_cyclo_dense(Matrix_dense):
             ...
             ValueError: echelon form mod 7 not defined
         """
-        cdef int i
+        cdef Py_ssize_t i
 
         # Initialize variables
         ls, _ = self._reductions(p)

{passagemath_flint-10.5.43 → passagemath_flint-10.6.1rc1}/sage/matrix/matrix_integer_dense.pyx

@@ -60,7 +60,7 @@ TESTS::
 from libc.stdint cimport int64_t
 from libc.string cimport strcpy, strlen
 
-from sage.cpython.string cimport char_to_str, str_to_bytes
+from sage.cpython.string cimport char_to_str
 from sage.ext.stdsage cimport PY_NEW
 from cysignals.signals cimport sig_check, sig_on, sig_str, sig_off
 from cysignals.memory cimport sig_malloc, sig_free, check_allocarray
@@ -446,7 +446,7 @@ cdef class Matrix_integer_dense(Matrix_dense):
             sage: matrix(ZZ,1,3,[1,193,15])._pickle() == (b'1 61 f', 0)   # indirect doctest
             True
         """
-        return str_to_bytes(self._export_as_string(32), 'ascii')
+        return self._export_as_string(32).encode('ascii')
 
     cpdef _export_as_string(self, int base=10):
         """
@@ -467,7 +467,8 @@ cdef class Matrix_integer_dense(Matrix_dense):
         """
         # TODO: *maybe* redo this to use mpz_import and mpz_export
         # from sec 5.14 of the GMP manual. ??
-        cdef int i, j, len_so_far, m, n
+        cdef Py_ssize_t i, j, len_so_far
+        cdef int m, n
         cdef char *s
         cdef char *t
         cdef char *tmp
@@ -530,18 +531,18 @@ cdef class Matrix_integer_dense(Matrix_dense):
                 self._unpickle_matrix_2x2_version0(data)
             else:
                 raise RuntimeError("invalid pickle data")
+
         else:
-            raise RuntimeError("unknown matrix version (=%s)"%version)
+            raise RuntimeError(f"unknown matrix version (={version})")
 
     cdef _unpickle_version0(self, data):
-        cdef Py_ssize_t i, j, n, k
+        cdef Py_ssize_t i, j, k
         data = data.split()
-        n = self._nrows * self._ncols
-        if len(data) != n:
+        if len(data) != self._nrows * self._ncols:
             raise RuntimeError("invalid pickle data")
         k = 0
-        for i from 0 <= i < self._nrows:
-            for j from 0 <= j < self._ncols:
+        for i in range(self._nrows):
+            for j in range(self._ncols):
                 s = data[k]
                 k += 1
                 if fmpz_set_str(fmpz_mat_entry(self._matrix, i, j), s, 32):
@@ -1321,7 +1322,7 @@ cdef class Matrix_integer_dense(Matrix_dense):
         elif algorithm == 'generic':
             g = Matrix_dense.charpoly(self, var)
         else:
-            raise ValueError("no algorithm '%s'"%algorithm)
+            raise ValueError("no algorithm '%s'" % algorithm)
 
         self.cache(cache_key, g)
         return g
@@ -1396,7 +1397,7 @@ cdef class Matrix_integer_dense(Matrix_dense):
             else:
                 algorithm = 'linbox'
 
-        key = 'minpoly_%s'%(algorithm)
+        key = 'minpoly_%s' % (algorithm)
         g = self.fetch(key)
         if g is not None:
             return g.change_variable_name(var)
@@ -1407,7 +1408,7 @@ cdef class Matrix_integer_dense(Matrix_dense):
         elif algorithm == 'generic':
             g = Matrix_dense.minpoly(self, var)
         else:
-            raise ValueError("no algorithm '%s'"%algorithm)
+            raise ValueError("no algorithm '%s'" % algorithm)
 
         self.cache(key, g)
         return g
@@ -1561,7 +1562,7 @@ cdef class Matrix_integer_dense(Matrix_dense):
             [  1  -2 -45]
         """
         w = self._export_as_string(base=10)
-        return 'Matrix(IntegerRing(),%s,%s,StringToIntegerSequence("%s"))'%(
+        return 'Matrix(IntegerRing(),%s,%s,StringToIntegerSequence("%s"))' % (
             self.nrows(), self.ncols(), w)
 
     def symplectic_form(self):
@@ -1864,7 +1865,7 @@ cdef class Matrix_integer_dense(Matrix_dense):
             sage: H == U*m
             True
         """
-        key = 'hnf-%s-%s'%(include_zero_rows,transformation)
+        key = 'hnf-%s-%s' % (include_zero_rows, transformation)
         ans = self.fetch(key)
         if ans is not None:
             return ans
@@ -2261,7 +2262,7 @@ cdef class Matrix_integer_dense(Matrix_dense):
             if i > 0:
                 d = d[i:] + [d[0]]*i
         else:
-            raise ValueError("algorithm (='%s') unknown"%algorithm)
+            raise ValueError("algorithm (='%s') unknown" % algorithm)
 
         self.cache('elementary_divisors', d)
         return d[:]
@@ -2615,7 +2616,7 @@ cdef class Matrix_integer_dense(Matrix_dense):
             K = _rational_kernel_iml(self).transpose().saturation(proof=proof)
             format = 'computed-iml-int'
         else:
-            raise ValueError('unknown algorithm: %s'%algorithm)
+            raise ValueError('unknown algorithm: %s' % algorithm)
         tm = verbose("done computing right kernel matrix over the integers for %sx%s matrix" % (self.nrows(), self.ncols()),level=1, t=tm)
         return (format, K)
 
@@ -3093,7 +3094,9 @@ cdef class Matrix_integer_dense(Matrix_dense):
         cdef Matrix_integer_dense R = None  # LLL-reduced matrix
         cdef Matrix_integer_dense U = None  # transformation matrix
 
-        tm = verbose("LLL of %sx%s matrix (algorithm %s)"%(self.nrows(), self.ncols(), algorithm))
+        tm = verbose("LLL of %sx%s matrix (algorithm %s)" % (self.nrows(),
+                                                             self.ncols(),
+                                                             algorithm))
         import sage.libs.ntl.all
         ntl_ZZ = sage.libs.ntl.all.ZZ
 
@@ -3171,7 +3174,7 @@ cdef class Matrix_integer_dense(Matrix_dense):
                 else:
                     r = A.LLL_XD(delta, verbose=verb, return_U=transformation)
             else:
-                raise TypeError("algorithm %s not supported"%algorithm)
+                raise TypeError("algorithm %s not supported" % algorithm)
 
             if isinstance(r, tuple):
                 r, UNTL = r
@@ -3209,7 +3212,7 @@ cdef class Matrix_integer_dense(Matrix_dense):
             from .matrix_integer_pari import _lll_pari
             R, U, r = _lll_pari(self)
         else:
-            raise TypeError("algorithm %s not supported"%algorithm)
+            raise TypeError("algorithm %s not supported" % algorithm)
 
         verbose("LLL finished", tm)
         if r is not None:
@@ -3455,7 +3458,7 @@ cdef class Matrix_integer_dense(Matrix_dense):
                 num_per_row = int(density * nc)
                 for i from 0 <= i < self._nrows:
                     for j from 0 <= j < num_per_row:
-                        k = rstate.c_random()%nc
+                        k = rstate.c_random() % nc
                         the_integer_ring._randomize_mpz(tmp,
                                                         x, y, distribution)
                         self.set_unsafe_mpz(i,k,tmp)
@@ -3759,7 +3762,7 @@ cdef class Matrix_integer_dense(Matrix_dense):
         elif algorithm == 'ntl':
             d = self._det_ntl()
         else:
-            raise TypeError("algorithm '%s' not known"%(algorithm))
+            raise TypeError("algorithm '%s' not known" % (algorithm))
 
         self.cache('det', d)
         return d
@@ -3977,7 +3980,7 @@ cdef class Matrix_integer_dense(Matrix_dense):
         cdef fmpz_t fden
         fmpz_init(fden)
         M = self._new(self._nrows,self._ncols)
-        verbose('computing inverse of %s x %s matrix using FLINT'%(self._nrows, self._ncols))
+        verbose('computing inverse of %s x %s matrix using FLINT' % (self._nrows, self._ncols))
         sig_on()
         res = fmpz_mat_inv(M._matrix,fden,self._matrix)
         fmpz_get_mpz(den.value,fden)
@@ -4190,13 +4193,13 @@ cdef class Matrix_integer_dense(Matrix_dense):
             from .matrix_integer_iml import _solve_iml
             X, d = _solve_iml(self, C, right=True)
         else:
-            raise ValueError("Unknown algorithm '%s'"%algorithm)
+            raise ValueError("Unknown algorithm '%s'" % algorithm)
         if d != 1:
             X = (1/d) * X
         if not matrix:
             # Convert back to a vector
             X = (X.base_ring() ** X.nrows())(X.list())
-        verbose('finished solve_right via %s'%algorithm, t)
+        verbose('finished solve_right via %s' % algorithm, t)
         return X
 
     def _solve_iml(self, Matrix_integer_dense B, right=True):
@@ -4560,13 +4563,15 @@ cdef class Matrix_integer_dense(Matrix_dense):
             pivots_ = set(pivots)
             non_pivots = [i for i in range(B.ncols()) if i not in pivots_]
             D = B.matrix_from_columns(non_pivots)
-            t = verbose('calling %s solver'%solver, level=2, caller_name='p-adic echelon')
+            t = verbose('calling %s solver' % solver,
+                        level=2, caller_name='p-adic echelon')
             if solver == 'iml':
                 from .matrix_integer_iml import _solve_iml
                 X, d = _solve_iml(C, D, right=True)
             else:
                 X, d = C._solve_flint(D, right=True)
-            t = verbose('finished %s solver'%solver, level=2, caller_name='p-adic echelon', t=t)
+            t = verbose('finished %s solver' % solver,
+                        level=2, caller_name='p-adic echelon', t=t)
 
             # Step 6: Verify that we had chosen the correct pivot columns.
             pivots_are_right = True
@@ -4786,7 +4791,7 @@ cdef class Matrix_integer_dense(Matrix_dense):
         new_pivots = list(pivots)
         if v != 0:
             i = v.nonzero_positions()[0]
-            assert not (i in pivots), 'WARNING: bug in add_row -- i (=%s) should not be a pivot'%i
+            assert not (i in pivots), 'WARNING: bug in add_row -- i (=%s) should not be a pivot' % i
 
             # If pivot entry is negative negate this row.
             if v[i] < 0:
@@ -4929,7 +4934,7 @@ cdef class Matrix_integer_dense(Matrix_dense):
                 for k from 0 <= k < i:
                     res_rows[i][k] = 0
                 for k from i <= k < ncols:
-                    t = ((<int64_t>u)*T_rows[i][k])%R
+                    t = ((<int64_t>u)*T_rows[i][k]) % R
                     if t < 0:
                         t += R
                     res_rows[i][k] = t
@@ -4939,7 +4944,7 @@ cdef class Matrix_integer_dense(Matrix_dense):
                 for j from 0 <= j < i:
                     q = res_rows[j][i]/d
                     for k from i <= k < ncols:
-                        u = (res_rows[j][k] - (<int64_t>q)*res_rows[i][k])%R
+                        u = (res_rows[j][k] - (<int64_t>q)*res_rows[i][k]) % R
                         if u < 0:
                             u += R
                         res_rows[j][k] = u
@@ -4962,11 +4967,11 @@ cdef class Matrix_integer_dense(Matrix_dense):
             d = ai.c_xgcd_int(T_i_i, T_j_i, &u, &v)
             if d != T_i_i:
                 for k from i <= k < ncols:
-                    B[k] = ((<int64_t>u)*T_rows[i][k] + (<int64_t>v)*T_rows[j][k])%R
+                    B[k] = ((<int64_t>u)*T_rows[i][k] + (<int64_t>v)*T_rows[j][k]) % R
             c1 = T_i_i/d
             c2 = -T_j_i/d
             for k from i <= k < ncols:
-                T_rows[j][k] = ((<int64_t>c1)*T_rows[j][k] + (<int64_t>c2)*T_rows[i][k])%R
+                T_rows[j][k] = ((<int64_t>c1)*T_rows[j][k] + (<int64_t>c2)*T_rows[i][k]) % R
             if d != T_i_i:
                 for k from i <= k < ncols:
                     T_rows[i][k] = B[k]
@@ -5239,6 +5244,16 @@ cdef class Matrix_integer_dense(Matrix_dense):
             [  3   4   5]
             [  6   7   8]
             [  1   5 -10]
+
+        TESTS:
+
+        Ensure that :issue:`11328` is fixed::
+
+            sage: m = matrix([[int(1),int(1)],[int(1),int(1)]])
+            sage: m.insert_row(1,[int(2),int(3)])
+            [1 1]
+            [2 3]
+            [1 1]
         """
         cdef Matrix_integer_dense res = self._new(self._nrows + 1, self._ncols)
         cdef Py_ssize_t j
@@ -5254,7 +5269,8 @@ cdef class Matrix_integer_dense(Matrix_dense):
             for i from 0 <= i < index:
                 fmpz_init_set(fmpz_mat_entry(res._matrix,i,j), fmpz_mat_entry(self._matrix,i,j))
 
-            z = row[j]
+            z = ZZ(row[j])
+
             fmpz_set_mpz(zflint,z.value)
             fmpz_init_set(fmpz_mat_entry(res._matrix,index,j), zflint)
 
@@ -5437,7 +5453,8 @@ cdef class Matrix_integer_dense(Matrix_dense):
 
         name = singular._next_var_name()
         values = str(self.list())[1:-1]
-        singular.eval("intmat %s[%d][%d] = %s"%(name, self.nrows(), self.ncols(), values))
+        singular.eval("intmat %s[%d][%d] = %s" % (name, self.nrows(),
+                                                  self.ncols(), values))
 
         from sage.interfaces.singular import SingularElement
         return SingularElement(singular, 'foobar', name, True)

{passagemath_flint-10.5.43 → passagemath_flint-10.6.1rc1}/sage/matrix/matrix_integer_sparse.pyx

@@ -660,7 +660,7 @@ cdef class Matrix_integer_sparse(Matrix_sparse):
             r = Matrix_sparse.rank(self)
             self.cache("rank", r)
         else:
-            raise ValueError("no algorithm '%s'"%algorithm)
+            raise ValueError("no algorithm '%s'" % algorithm)
 
         return r