diff options
| author | Hiroshi SHIBATA <[email protected]> | 2021-01-04 10:09:05 +0900 |
|---|---|---|
| committer | Hiroshi SHIBATA <[email protected]> | 2021-01-04 13:14:43 +0900 |
| commit | 5537adf719a37a30b17d39111cc03700f353aa2d () | |
| tree | 7523de9950b8a0118143f4ee0029aee17d043e04 /lib/rubygems/text.rb | |
| parent | 35c3a24c8cbcccff1108079360e2063fc354b4bd (diff) | |
Track RubyGems master(3.3.0.dev) branch at 55634a8af18a52df86c4275d70fa1179118bcc20
Notes: Merged: https://.com/ruby/ruby/pull/4021
| -rw-r--r-- | lib/rubygems/text.rb | 41 |
1 files changed, 21 insertions, 20 deletions
@@ -49,37 +49,38 @@ module Gem::Text end end - # This code is based directly on the Text gem implementation # Returns a value representing the "cost" of transforming str1 into str2 def levenshtein_distance(str1, str2) - s = str1 - t = str2 - n = s.length - m = t.length - - return m if (0 == n) - return n if (0 == m) d = (0..m).to_a x = nil - str1.each_char.each_with_index do |char1,i| - e = i + 1 - str2.each_char.each_with_index do |char2,j| - cost = (char1 == char2) ? 0 : 1 x = min3( - d[j + 1] + 1, # insertion - e + 1, # deletion - d[j] + cost # substitution - ) - d[j] = e - e = x end - d[m] = x end - return x end end |