-
Committer:
Ryan Lortie
-
Date:
2012-03-30 13:32:40 UTC
-
Revision ID:
desrt@desrt.ca-20120330133240-pff9qkmlab938p33
Simplify the improve the performance of the distance calculation.
- we now normalise to casefolded normal-form ucs4 ahead of time and
operate on that instead of doing the normalisation at each search.
This removes normalisation steps and utf8 operations from the main
path of searching.
- the innermost loop has been simplified free it of special-cases: it
is now exactly equal to the reference implementation of Levenshtein
distance from Wikipedia
- we continue to support post-drops as a special-case, but other
special cases have been removed. pre-adds were probably a bad idea
to start with, but it's worth talking about bringing back transposes.
- 'bold' highlighting of matching search terms is broken again (and
will come back soon)