summaryrefslogtreecommitdiff
path: root/Python/bltinmodule.c
diff options
context:
space:
mode:
authorTim Peters <tim.peters@gmail.com>2002-04-29 01:37:32 +0000
committerTim Peters <tim.peters@gmail.com>2002-04-29 01:37:32 +0000
commit81b9251d5996ec89bcc016c29ecc0b5f0204e59b (patch)
tree642fedf48a570b1c7c9b5ecc360ffef8954b58b9 /Python/bltinmodule.c
parent29c0afcfecdd52f6980274e0d613df7bf52bc6a6 (diff)
downloadcpython-git-81b9251d5996ec89bcc016c29ecc0b5f0204e59b.tar.gz
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!
Diffstat (limited to 'Python/bltinmodule.c')
0 files changed, 0 insertions, 0 deletions