orthogonal_polynomials.py: use xrange everywhere.

[sage.d.git] / mjo / orthogonal_polynomials.py

diff --git a/mjo/orthogonal_polynomials.py b/mjo/orthogonal_polynomials.py
index 7e094fc201076938120972f268b55fd628470a47..fd5fd75317b9f07b9108dd41ebd74d6606f9fd12 100644 (file)
--- a/mjo/orthogonal_polynomials.py
+++ b/mjo/orthogonal_polynomials.py
@@ -82,7 +82,7 @@ def legendre_p(n, x, a = -1, b = 1):
         ...                    for b in basis])
         ...
         sage: f = sin(x)
-        sage: legendre_basis = [ legendre_p(k, x, a, b) for k in range(0,4) ]
+        sage: legendre_basis = [ legendre_p(k, x, a, b) for k in xrange(4) ]
         sage: proj = project(legendre_basis, f)
         sage: proj.simplify_trig()
         5/2*(7*(pi^2 - 15)*x^3 - 3*(pi^4 - 21*pi^2)*x)/pi^6
@@ -92,7 +92,7 @@ def legendre_p(n, x, a = -1, b = 1):
     We should agree with Maxima for all `n`::
 
         sage: eq = lambda k: bool(legendre_p(k,x) == legendre_P(k,x))
-        sage: all([eq(k) for k in range(0,20) ]) # long time
+        sage: all([eq(k) for k in xrange(20) ]) # long time
         True
 
     We can evaluate the result of the zeroth polynomial::
@@ -196,6 +196,6 @@ def legendre_p(n, x, a = -1, b = 1):
 
     # From Abramowitz & Stegun, (22.3.2) with alpha = beta = 0.
     # Also massaged to support finite field elements.
-    P = sum([ c(m)*g(m) for m in range(0,n+1) ])/(2**n)
+    P = sum([ c(m)*g(m) for m in xrange(n+1) ])/(2**n)
 
     return P