]> granicus.if.org Git - python/commit
Mostly in SequenceMatcher.{__chain_b, find_longest_match}:
authorTim Peters <tim.peters@gmail.com>
Mon, 29 Apr 2002 01:37:32 +0000 (01:37 +0000)
committerTim Peters <tim.peters@gmail.com>
Mon, 29 Apr 2002 01:37:32 +0000 (01:37 +0000)
commit81b9251d5996ec89bcc016c29ecc0b5f0204e59b
tree642fedf48a570b1c7c9b5ecc360ffef8954b58b9
parent29c0afcfecdd52f6980274e0d613df7bf52bc6a6
Mostly in SequenceMatcher.{__chain_b, find_longest_match}:
This now does a dynamic analysis of which elements are so frequently
repeated as to constitute noise.  The primary benefit is an enormous
speedup in find_longest_match, as the innermost loop can have factors
of 100s less potential matches to worry about, in cases where the
sequences have many duplicate elements.  In effect, this zooms in on
sequences of non-ubiquitous elements now.

While I like what I've seen of the effects so far, I still consider
this experimental.  Please give it a try!
Doc/lib/libdifflib.tex
Lib/difflib.py
Misc/NEWS