Documentation

Some functions ofdifflib.SequenceMatcher perform very poorly in real-world scenarios (for example get_opcodes() takes several minutes to return a list of tuples for two identical files that are 70kb long). This is reported in different places online, such as onStackOverflow.

It would be nice to add a note about the performance in the doc, with possible workarounds (for example there is a great performance improvement if one opens the files with readlines() and compares two lists of lines, instead of opening files with read() and compare two strings).

Thanks :-)

Linked PRs

• gh-106865: Improvedifflib.find_longest_match performance with cache #106877