Trac #29719: upgrade to flint 2.6.3

Flint 2.6.3 has been released

tarball: see checksums.ini [upstream_url]

URL: https://trac.sagemath.org/29719
Reported by: vdelecroix
Ticket author(s): Dima Pasechnik, Matthias Koeppe
Reviewer(s): Matthias Koeppe, Dima Pasechnik

build/pkgs/arb/package-version.txt

@@ -1 +1 @@
-2.16.0.p0
+2.16.0.p1

build/pkgs/flint/checksums.ini

@@ -1,4 +1,5 @@
 tarball=flint-VERSION.tar.gz
-sha1=67c747ec92dda0dbc57ab88e2c501b11537299a5
-md5=cda885309362150196aed66a5e0f0383
-cksum=4232495945
+sha1=7d3c6046d87e0ee143d217c76fb8e2e196c36019
+md5=ed3a6cab37fe2298d9cfaead6ccd1dc7
+cksum=2609134913
+upstream_url=http://flintlib.org/flint-VERSION.tar.gz

build/pkgs/flint/package-version.txt

@@ -1 +1 @@
-2.5.2.p5
+2.6.3

src/doc/en/constructions/algebraic_geometry.rst

@@ -142,13 +142,17 @@ Other methods
        sage: I = singular.ideal('[x^4+x, y^4+y]')
        sage: L = singular.closed_points(I)
        sage: # Here you have all the points :
-       sage: print(L)
+       sage: L       # random
        [1]:
-          _[1]=y+1  # 32-bit
-          _[2]=x+1  # 32-bit
-          _[1]=y    # 64-bit
-          _[2]=x    # 64-bit
+          _[1]=y+1
+          _[2]=x+1
        ...
+       sage: l=[L[k].sage() for k in [1..10]]; len(l) # there are 10 points
+       10
+       sage: r=sorted(l[0].ring().gens()); r
+       [y, x]
+       sage: r in [t.gens() for t in l] #  one of them is given by [y,x]
+       True
 
 -  Another way to compute rational points is to use Singular's
    ``NSplaces`` command. Here's the Klein quartic over :math:`GF(8)`

src/doc/en/developer/coding_in_other.rst

@@ -439,21 +439,14 @@ interface to Singular::
     ''
     sage: L = singular.eval("POINTS;")
 
-    sage: print(L)
+    sage: print(L) # random
     [1]:
        [1]:
           0
        [2]:
           1
        [3]:
           0
-    [2]:
-       [1]:
-          -2
-       [2]:
-          -1
-       [3]:
-          1
     ...
 
 From looking at the output, notice that our wrapper function will need

src/sage/modules/fg_pid/fgp_module.py

@@ -127,7 +127,8 @@
 Here we illustrate lifting an element of the image of f, i.e., finding
 an element of M0 that maps to a given element of M1::
 
-    sage: y = f.lift(3*M1.0); y
+    sage: y = f.lift(3*M1.0)
+    sage: y # random
     (0, 13)
     sage: f(y)
     (3)
@@ -1285,7 +1286,7 @@ def coordinate_vector(self, x, reduce=False):
             (0, 4)
             sage: Q.coordinate_vector(x, reduce=True)
             (0, 4)
-            sage: Q.coordinate_vector(-x, reduce=False)
+            sage: Q.coordinate_vector(-x, reduce=False) # random
             (0, -4)
             sage: x == 4*Q.1
             True
@@ -1414,7 +1415,7 @@ def optimized(self):
             Echelon basis matrix:
             [ 0 12  0]
             [ 0  0  4]
-            sage: X
+            sage: X         # random
             [0 4 0]
             [0 1 0]
             [0 0 1]

src/sage/modules/free_module_morphism.py

@@ -350,12 +350,14 @@ def lift(self, x):
             sage: V = X.span([[2, 0], [0, 8]], ZZ)
             sage: W = (QQ**1).span([[1/12]], ZZ)
             sage: f = V.hom([W([1/3]), W([1/2])], W)
-            sage: f.lift([1/3])
+            sage: l=f.lift([1/3]); l # random
             (8, -16)
-            sage: f.lift([1/2])
-            (12, -24)
-            sage: f.lift([1/6])
-            (4, -8)
+            sage: f(l)
+            (1/3)
+            sage: f(f.lift([1/2]))
+            (1/2)
+            sage: f(f.lift([1/6]))
+            (1/6)
             sage: f.lift([1/12])
             Traceback (most recent call last):
             ...