summaryrefslogtreecommitdiffstats
path: root/Lib/sre_compile.py
diff options
context:
space:
mode:
authorNeal Norwitz <nnorwitz@gmail.com>2007-07-06 04:13:39 (GMT)
committerNeal Norwitz <nnorwitz@gmail.com>2007-07-06 04:13:39 (GMT)
commite3b185f9667488695035983bbbaa84616e6149e2 (patch)
treed4a5f3389c844b6d13d3faae0b8cbda3a44a0f30 /Lib/sre_compile.py
parentd67a3b9503276205857c38f6c1dc5ad20ea1e885 (diff)
downloadcpython-e3b185f9667488695035983bbbaa84616e6149e2.zip
cpython-e3b185f9667488695035983bbbaa84616e6149e2.tar.gz
cpython-e3b185f9667488695035983bbbaa84616e6149e2.tar.bz2
Fix typo in comment
Diffstat (limited to 'Lib/sre_compile.py')
-rw-r--r--Lib/sre_compile.py2
1 files changed, 1 insertions, 1 deletions
diff --git a/Lib/sre_compile.py b/Lib/sre_compile.py
index 1d448da..7109599 100644
--- a/Lib/sre_compile.py
+++ b/Lib/sre_compile.py
@@ -280,7 +280,7 @@ def _mk_bitmap(bits):
# To represent a big charset, first a bitmap of all characters in the
# set is constructed. Then, this bitmap is sliced into chunks of 256
-# characters, duplicate chunks are eliminitated, and each chunk is
+# characters, duplicate chunks are eliminated, and each chunk is
# given a number. In the compiled expression, the charset is
# represented by a 16-bit word sequence, consisting of one word for
# the number of different chunks, a sequence of 256 bytes (128 words)