summaryrefslogtreecommitdiffstats
path: root/Modules
diff options
context:
space:
mode:
authorStefan Krah <skrah@bytereef.org>2013-12-08 19:08:32 (GMT)
committerStefan Krah <skrah@bytereef.org>2013-12-08 19:08:32 (GMT)
commit37d4e0be3d8907c8cb0e3822ac28794b58777384 (patch)
tree392b8a4c6908a82a809bb63bffa754516764c4ae /Modules
parent42e3b607cbfe96be2006a4ef702d8d296d13d0e5 (diff)
downloadcpython-37d4e0be3d8907c8cb0e3822ac28794b58777384.zip
cpython-37d4e0be3d8907c8cb0e3822ac28794b58777384.tar.gz
cpython-37d4e0be3d8907c8cb0e3822ac28794b58777384.tar.bz2
Fix two typos.
Diffstat (limited to 'Modules')
-rw-r--r--Modules/_decimal/libmpdec/literature/mulmod-64.txt2
-rw-r--r--Modules/_decimal/libmpdec/transpose.c2
2 files changed, 2 insertions, 2 deletions
diff --git a/Modules/_decimal/libmpdec/literature/mulmod-64.txt b/Modules/_decimal/libmpdec/literature/mulmod-64.txt
index 93bf22e..029b8de 100644
--- a/Modules/_decimal/libmpdec/literature/mulmod-64.txt
+++ b/Modules/_decimal/libmpdec/literature/mulmod-64.txt
@@ -59,7 +59,7 @@ The reduction step b) preserves congruence:
Maximum numbers of step b):
---------------------------
-# To avoid unneccessary formalism, define:
+# To avoid unnecessary formalism, define:
def R(hi, lo, z):
return divmod(hi * z - hi + lo, 2**64)
diff --git a/Modules/_decimal/libmpdec/transpose.c b/Modules/_decimal/libmpdec/transpose.c
index 55ad663..55d6d89 100644
--- a/Modules/_decimal/libmpdec/transpose.c
+++ b/Modules/_decimal/libmpdec/transpose.c
@@ -169,7 +169,7 @@ squaretrans(mpd_uint_t *buf, mpd_size_t cols)
/*
* Transpose 2^n * 2^n matrix. For cache efficiency, the matrix is split into
* square blocks with side length 'SIDE'. First, the blocks are transposed,
- * then a square tranposition is done on each individual block.
+ * then a square transposition is done on each individual block.
*/
static void
squaretrans_pow2(mpd_uint_t *matrix, mpd_size_t size)