From 16dc75de447ac3fa3862e9f8584fef00ef8d2fbc Mon Sep 17 00:00:00 2001
From: Andreas Kloeckner <inform@tiker.net>
Date: Mon, 29 Jun 2009 01:21:48 -0400
Subject: [PATCH] (Mostly) whitespace fixes in pymbolic.algorithm.
---
pymbolic/algorithm.py | 36 ++++++++++++++++++------------------
1 file changed, 18 insertions(+), 18 deletions(-)
diff --git a/pymbolic/algorithm.py b/pymbolic/algorithm.py
index 846447b..1d8d4ec 100644
--- a/pymbolic/algorithm.py
+++ b/pymbolic/algorithm.py
@@ -1,7 +1,7 @@
-import traits
-
-
-
+import pymbolic.traits as traits
+
+
+
def integer_power(x, n, one=1):
# http://c2.com/cgi/wiki?IntegerPowerAlgorithm
@@ -9,9 +9,9 @@ def integer_power(x, n, one=1):
if n < 0:
raise RuntimeError, "the integer power algorithm does not work for negative numbers"
-
+
aux = one
-
+
while n > 0:
if n & 1:
aux *= x
@@ -19,9 +19,9 @@ def integer_power(x, n, one=1):
return aux
x = x * x
n //= 2
-
-
-
+
+
+
def gcd(q, r):
return extended_euclidean(q, r)[0]
@@ -29,32 +29,32 @@ def gcd(q, r):
def extended_euclidean(q, r):
- """Return a tuple (p, a, b) such that p = aq + br,
+ """Return a tuple (p, a, b) such that p = aq + br,
where p is the greatest common divisor.
"""
# see [Davenport], Appendix, p. 214
t = traits.common_traits(q, r)
-
+
if t.norm(q) < t.norm(r):
p, a, b = extended_euclidean(r, q)
return p, b, a
-
+
Q = 1, 0
R = 0, 1
-
+
while r:
quot, t = divmod(q, r)
T = Q[0] - quot*R[0], Q[1] - quot*R[1]
q, r = r, t
Q, R = R, T
-
+
return q, Q[0], Q[1]
-
-
-
-
+
+
+
+
if __name__ == "__main__":
import integer
q = integer.Integer(14)
--
GitLab