D. Reeds wrote:
Lars T. Kyllingstad Wrote:
Fun fact: There is already a Levenshtein distance algorithm in Phobos
for D2:
http://www.digitalmars.com/d/2.0/phobos/std_algorithm#levenshteinDistance
I know you said you use D1+Tango, I just thought I should mention it.
The source code is available, if you want to check it out:
http://www.dsource.org/projects/phobos/browser/trunk/phobos/std/algorithm.d
-Lars
awesome, exactly what im looking for. thanks alot.
No problem. :)
Here's a small warning, though: You should be aware that D2 is the
experimental branch of the D language. It is very different from D1, so
it is unlikely that you can just copy and paste the code into your program.
-Lars
