mirror of
				https://github.com/ruby/ruby.git
				synced 2022-11-09 12:17:21 -05:00 
			
		
		
		
	git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@30599 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
		
			
				
	
	
		
			71 lines
		
	
	
	
		
			1.5 KiB
		
	
	
	
		
			Ruby
		
	
	
	
	
	
			
		
		
	
	
			71 lines
		
	
	
	
		
			1.5 KiB
		
	
	
	
		
			Ruby
		
	
	
	
	
	
######################################################################
 | 
						|
# This file is imported from the rubygems project.
 | 
						|
# DO NOT make modifications in this repo. They _will_ be reverted!
 | 
						|
# File a patch instead and assign it to Ryan Davis or Eric Hodel.
 | 
						|
######################################################################
 | 
						|
 | 
						|
require 'rubygems'
 | 
						|
 | 
						|
##
 | 
						|
# A collection of text-wrangling methods
 | 
						|
 | 
						|
module Gem::Text
 | 
						|
 | 
						|
  ##
 | 
						|
  # Wraps +text+ to +wrap+ characters and optionally indents by +indent+
 | 
						|
  # characters
 | 
						|
 | 
						|
  def format_text(text, wrap, indent=0)
 | 
						|
    result = []
 | 
						|
    work = text.dup
 | 
						|
 | 
						|
    while work.length > wrap do
 | 
						|
      if work =~ /^(.{0,#{wrap}})[ \n]/ then
 | 
						|
        result << $1
 | 
						|
        work.slice!(0, $&.length)
 | 
						|
      else
 | 
						|
        result << work.slice!(0, wrap)
 | 
						|
      end
 | 
						|
    end
 | 
						|
 | 
						|
    result << work if work.length.nonzero?
 | 
						|
    result.join("\n").gsub(/^/, " " * indent)
 | 
						|
  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
 | 
						|
    max = n/2
 | 
						|
 | 
						|
    return m if (0 == n)
 | 
						|
    return n if (0 == m)
 | 
						|
    return n if (n - m).abs > max
 | 
						|
 | 
						|
    d = (0..m).to_a
 | 
						|
    x = nil
 | 
						|
 | 
						|
    n.times do |i|
 | 
						|
      e = i+1
 | 
						|
 | 
						|
      m.times do |j|
 | 
						|
        cost = (s[i] == t[j]) ? 0 : 1
 | 
						|
        x = [
 | 
						|
             d[j+1] + 1, # insertion
 | 
						|
             e + 1,      # deletion
 | 
						|
             d[j] + cost # substitution
 | 
						|
            ].min
 | 
						|
        d[j] = e
 | 
						|
        e = x
 | 
						|
      end
 | 
						|
 | 
						|
      d[m] = x
 | 
						|
    end
 | 
						|
 | 
						|
    return x
 | 
						|
  end
 | 
						|
end
 | 
						|
 |