cone/rearrangement.py: use xrange everywhere.

diff --git a/mjo/cone/rearrangement.py b/mjo/cone/rearrangement.py
index b2ccfcb58f8aa58b52a8d724ca42725593ed7463..bdf72ebd49edf8fa4d90a9ec3b8c65b9a8d44278 100644 (file)
--- a/mjo/cone/rearrangement.py
+++ b/mjo/cone/rearrangement.py
@@ -53,20 +53,20 @@ def rearrangement_cone(p,n):
     All rearrangement cones are proper::
 
         sage: all( rearrangement_cone(p,n).is_proper()
-        ....:              for n in range(10)
-        ....:              for p in range(n) )
+        ....:              for n in xrange(10)
+        ....:              for p in xrange(n) )
         True
 
     The Lyapunov rank of the rearrangement cone of order ``p`` in ``n``
     dimensions is ``n`` for ``p == 1`` or ``p == n`` and one otherwise::
 
         sage: all( rearrangement_cone(p,n).lyapunov_rank() == n
-        ....:              for n in range(2, 10)
+        ....:              for n in xrange(2, 10)
         ....:              for p in [1, n-1] )
         True
         sage: all( rearrangement_cone(p,n).lyapunov_rank() == 1
-        ....:              for n in range(3, 10)
-        ....:              for p in range(2, n-1) )
+        ....:              for n in xrange(3, 10)
+        ....:              for p in xrange(2, n-1) )
         True
 
     TESTS:
@@ -88,7 +88,7 @@ def rearrangement_cone(p,n):
         return v
 
     V = VectorSpace(QQ, n)
-    G = V.basis() + [ d(j) for j in range(n) ]
+    G = V.basis() + [ d(j) for j in xrange(n) ]
     return Cone(G)
 
 
@@ -137,8 +137,8 @@ def has_rearrangement_property(v, p):
         ....:        rearrangement_cone(p,n).random_element(),
         ....:        p
         ....:      )
-        ....:      for n in range(2, 10)
-        ....:      for p in range(1, n-1)
+        ....:      for n in xrange(2, 10)
+        ....:      for p in xrange(1, n-1)
         ....: )
         True