diff options
| author | Raymond Hettinger <python@rcn.com> | 2002-06-01 14:18:47 +0000 |
|---|---|---|
| committer | Raymond Hettinger <python@rcn.com> | 2002-06-01 14:18:47 +0000 |
| commit | 54f0222547b1e92cd018ef132307a6f793dc9505 (patch) | |
| tree | 667480d89feb3f9c7ca44e4ffa7bf39e725c120d /Lib/difflib.py | |
| parent | 9d5e4aa4149edb92f6d28c9390d776ae4a1d719a (diff) | |
| download | cpython-git-54f0222547b1e92cd018ef132307a6f793dc9505.tar.gz | |
SF 563203. Replaced 'has_key()' with 'in'.
Diffstat (limited to 'Lib/difflib.py')
| -rw-r--r-- | Lib/difflib.py | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Lib/difflib.py b/Lib/difflib.py index 8fd256133c..0637cffb32 100644 --- a/Lib/difflib.py +++ b/Lib/difflib.py @@ -321,7 +321,7 @@ class SequenceMatcher: junkdict[elt] = 1 del d[elt] - # Now for x in b, isjunk(x) == junkdict.has_key(x), but the + # Now for x in b, isjunk(x) == x in junkdict, but the # latter is much faster. Note too that while there may be a # lot of junk in the sequence, the number of *unique* junk # elements is probably small. So the memory burden of keeping |