модуль Rails::Generators

# File railties/lib/rails/generators.rb, line 110
def self.api_only!
  hide_namespaces "assets", "helper", "css", "js"

  options[:rails].merge!(
    api: true,
    assets: false,
    helper: false,
    template_engine: nil
  )

  if ARGV.first == 'mailer'
    options[:rails].merge!(template_engine: :erb)
  end
end

# File railties/lib/rails/generators.rb, line 102
def self.fallbacks
  @fallbacks ||= {}
end

# File railties/lib/rails/generators.rb, line 235
def self.help(command = 'generate')
  puts "Usage: rails #{command} GENERATOR [args] [options]"
  puts
  puts "General options:"
  puts "  -h, [--help]     # Print generator's options and usage"
  puts "  -p, [--pretend]  # Run but do not make any changes"
  puts "  -f, [--force]    # Overwrite files that already exist"
  puts "  -s, [--skip]     # Skip files that already exist"
  puts "  -q, [--quiet]    # Suppress status output"
  puts
  puts "Please choose a generator below."
  puts

  print_generators
end

# File railties/lib/rails/generators.rb, line 196
def self.hidden_namespaces
  @hidden_namespaces ||= begin
    orm      = options[:rails][:orm]
    test     = options[:rails][:test_framework]
    template = options[:rails][:template_engine]
    css      = options[:rails][:stylesheet_engine]

    [
      "rails",
      "resource_route",
      "#{orm}:migration",
      "#{orm}:model",
      "#{test}:controller",
      "#{test}:helper",
      "#{test}:integration",
      "#{test}:mailer",
      "#{test}:model",
      "#{test}:scaffold",
      "#{test}:view",
      "#{test}:job",
      "#{template}:controller",
      "#{template}:scaffold",
      "#{template}:mailer",
      "#{css}:scaffold",
      "#{css}:assets",
      "css:assets",
      "css:scaffold"
    ]
  end
end

# File railties/lib/rails/generators.rb, line 228
def hide_namespaces(*namespaces)
  hidden_namespaces.concat(namespaces)
end

# File railties/lib/rails/generators.rb, line 176
def self.invoke(namespace, args=ARGV, config={})
  names = namespace.to_s.split(':')
  if klass = find_by_namespace(names.pop, names.any? && names.join(':'))
    args << "--help" if args.empty? && klass.arguments.any?(&:required?)
    klass.start(args, config)
  else
    options     = sorted_groups.flat_map(&:last)
    suggestions = options.sort_by {|suggested| levenshtein_distance(namespace.to_s, suggested) }.first(3)
    msg =  "Could not find generator '#{namespace}'. "
    msg << "Maybe you meant #{ suggestions.map {|s| "'#{s}'"}.to_sentence(last_word_connector: " or ", locale: :en) }\n"
    msg << "Run `rails generate --help` for more options."
    puts msg
  end
end

# File railties/lib/rails/generators.rb, line 126
def self.no_color!
  Thor::Base.shell = Thor::Shell::Basic
end

# File railties/lib/rails/generators.rb, line 256
def self.print_generators
  sorted_groups.each { |b, n| print_list(b, n) }
end

# File railties/lib/rails/generators.rb, line 251
def self.public_namespaces
  lookup!
  subclasses.map(&:namespace)
end

# File railties/lib/rails/generators.rb, line 260
def self.sorted_groups
  namespaces = public_namespaces
  namespaces.sort!
  groups = Hash.new { |h,k| h[k] = [] }
  namespaces.each do |namespace|
    base = namespace.split(':').first
    groups[base] << namespace
  end
  rails = groups.delete("rails")
  rails.map! { |n| n.sub(/^rails:/, '') }
  rails.delete("app")
  rails.delete("plugin")

  hidden_namespaces.each { |n| groups.delete(n.to_s) }

  [["rails", rails]] + groups.sort.to_a
end

# File railties/lib/rails/generators.rb, line 131
def self.subclasses
  @subclasses ||= []
end

# File railties/lib/rails/generators.rb, line 284
def self.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

  # avoid duplicating an enumerable object in the loop
  str2_codepoint_enumerable = str2.each_codepoint

  str1.each_codepoint.with_index do |char1, i|
    e = i+1

    str2_codepoint_enumerable.with_index do |char2, j|
      cost = (char1 == char2) ? 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

  x
end