In doctests, replace floor(.../...) by //

Author: Matthias Koeppe

src/sage/categories/filtered_algebras_with_basis.py

@@ -325,7 +325,7 @@ def induced_graded_map(self, other, f):
                 sage: def map_on_basis(m):  # redefining map_on_basis
                 ....:     d = m.dict()
                 ....:     i = d.get('x', 0); j = d.get('y', 0); k = d.get('z', 0)
-                ....:     g = (h[1] ** i) * (h[2] ** (floor(j/2))) * (h[3] ** (floor(k/3)))
+                ....:     g = (h[1] ** i) * (h[2] ** (j // 2) * (h[3] ** (k // 3)))
                 ....:     g += i * (h[1] ** (i+j+k))
                 ....:     return g
                 sage: f = A.module_morphism(on_basis=map_on_basis,

src/sage/combinat/k_regular_sequence.py

@@ -48,7 +48,7 @@
     ....: def u(n):
     ....:     if n <= 1:
     ....:         return n
-    ....:     return 2*u(floor(n/2)) + u(ceil(n/2))
+    ....:     return 2 * u(n // 2) + u((n+1) // 2)
     sage: tuple(u(n) for n in srange(10))
     (0, 1, 3, 5, 9, 11, 15, 19, 27, 29)
 

src/sage/combinat/similarity_class_type.py

@@ -1201,12 +1201,12 @@ def dictionary_from_generator(gen):
     EXAMPLES::
 
         sage: from sage.combinat.similarity_class_type import dictionary_from_generator
-        sage: dictionary_from_generator(((floor(x/2), x) for x in range(10)))
+        sage: dictionary_from_generator(((x // 2, x) for x in range(10)))
         {0: 1, 1: 5, 2: 9, 3: 13, 4: 17}
 
     It also works with lists::
 
-        sage: dictionary_from_generator([(floor(x/2),x) for x in range(10)])
+        sage: dictionary_from_generator([(x // 2, x) for x in range(10)])
         {0: 1, 1: 5, 2: 9, 3: 13, 4: 17}
 
     .. NOTE::

src/sage/geometry/polyhedron/base3.py

@@ -1502,7 +1502,7 @@ def is_neighborly(self, k=None):
         is neighborly::
 
             sage: testpolys = [polytopes.cube(), polytopes.cyclic_polytope(6, 9), polytopes.simplex(6)]
-            sage: [(P.neighborliness()>=floor(P.dim()/2)) == P.is_neighborly() for P in  testpolys]
+            sage: [(P.neighborliness() >= P.dim() // 2) == P.is_neighborly() for P in testpolys]
             [True, True, True]
 
         """

src/sage/geometry/polyhedron/base_ZZ.py

@@ -806,7 +806,7 @@ def minkowski_decompositions(self):
            sage: [ len(square.dilation(i).minkowski_decompositions())
            ....:   for i in range(6) ]
            [1, 2, 5, 8, 13, 18]
-           sage: [ ceil((i^2+2*i-1)/2)+1 for i in range(10) ]
+           sage: [ integer_ceil((i^2 + 2*i - 1) / 2) + 1 for i in range(10) ]
            [1, 2, 5, 8, 13, 18, 25, 32, 41, 50]
         """
         if self.dim() > 2 or not self.is_compact():

src/sage/quadratic_forms/quadratic_form__local_representation_conditions.py

@@ -48,7 +48,7 @@ class QuadraticFormLocalRepresentationConditions():
              Reals:   [0, +Infinity]
              p = 2:   [0, 0, 0, +Infinity, 0, 0, 0, 0]
         sage: E = [m  for m in range(100)  if not Q3.is_locally_represented_number(m)]
-        sage: E1 = [m  for m in range(1,100)  if m / 2**(2*floor(valuation(m,2)/2)) % 8 == 7]
+        sage: E1 = [m  for m in range(1,100)  if m / 2**(2 * (valuation(m,2) // 2)) % 8 == 7]
         sage: E == E1
         True
         sage: E

src/sage/tests/books/computational-mathematics-with-sagemath/graphtheory_doctest.py

@@ -86,7 +86,7 @@
 Sage example in ./graphtheory.tex, line 340::
 
   sage: all( graphs.KneserGraph(n,k).chromatic_number() == n - 2*k + 2
-  ....:      for n in range(5,9) for k in range(2,floor(n/2)) )
+  ....:      for n in range(5, 9) for k in range(2, n // 2) )
   True
 
 Sage example in ./graphtheory.tex, line 459::

src/sage/tests/books/computational-mathematics-with-sagemath/numbertheory_doctest.py

@@ -105,7 +105,7 @@
   ....:     q = lcm(range(1,n+1))
   ....:     pmax = RR(q*(log(n)+1))
   ....:     m = ZZ(2*pmax^2)
-  ....:     m = ceil(m/q)*q + 1
+  ....:     m = integer_ceil(m / q) * q + 1
   ....:     a = harmonic_mod(n,m)
   ....:     return rational_reconstruction(a,m)