This issue tracker has been migrated to GitHub, and is currently read-only.
For more information, see the GitHub FAQs in the Python's Developer Guide.

Author Lewis Ball
Recipients Lewis Ball
Date 2020-04-26.14:15:58
SpamBayes Score -1.0
Marked as misclassified Yes
Message-id <>
The usage of difflib.SequenceMatcher.find_longest_match could be simplified for the most common use case (finding the longest match between the entirety of the two strings) by taking default args.

At the moment you have to do:

>>> from difflib import SequenceMatcher
>>> a, b = 'foo bar', 'foo baz'
>>> s = SequenceMatcher(a=a, b=b)
>>> s.find_longest_match(0, len(a), 0, len(b))
Match(a=0, b=0, size=6)

but with default args the final line could be simplified to just:

>>> s.find_longest_match()
Match(a=0, b=0, size=6)

which seems to be much cleaned and more readable.

I'd suggest updating the code so that the function signature becomes:

find_longest_match(alo=None, ahi=None, blo=None, bhi=None)

which is consistent with the current docstring of "Find longest matching block in a[alo:ahi] and b[blo:bhi]." as `a[None:None]` is the whole of `a`.

I think this would only be a minor code change, and if it is something that would be useful I'd be happy to have a go at a PR.
Date User Action Args
2020-04-26 14:15:58Lewis Ballsetrecipients: + Lewis Ball
2020-04-26 14:15:58Lewis Ballsetmessageid: <>
2020-04-26 14:15:58Lewis Balllinkissue40394 messages
2020-04-26 14:15:58Lewis Ballcreate