class Thor::Options

:nodoc:
under Ruby’s license.
This is a modified version of Daniel Berger’s Getopt::Long class, licensed

def self.to_switches(options)

Receives a hash and makes it switches.
def self.to_switches(options)
  options.map do |key, value|
    case value
      when true
        "--#{key}"
      when Array
        "--#{key} #{value.map{ |v| v.inspect }.join(' ')}"
      when Hash
        "--#{key} #{value.map{ |k,v| "#{k}:#{v}" }.join(' ')}"
      when nil, false
        ""
      else
        "--#{key} #{value.inspect}"
    end
  end.join(" ")
end

def check_unknown!

def check_unknown!
  raise UnknownArgumentError, "Unknown switches '#{@unknown.join(', ')}'" unless @unknown.empty?
end

def current_is_switch?


Returns true if the current value in peek is a registered switch.
def current_is_switch?
  case peek
    when LONG_RE, SHORT_RE, EQ_RE, SHORT_NUM
      switch?($1)
    when SHORT_SQ_RE
      $1.split('').any? { |f| switch?("-#{f}") }
  end
end

def current_is_switch_formatted?

def current_is_switch_formatted?
  switch_formatted? peek
end

def initialize(hash_options={}, defaults={})

Takes a hash of Thor::Option and a hash with defaults.
def initialize(hash_options={}, defaults={})
  options = hash_options.values
  super(options)
  # Add defaults
  defaults.each do |key, value|
    @assigns[key.to_s] = value
    @non_assigned_required.delete(hash_options[key])
  end
  @shorts, @switches, @unknown = {}, {}, []
  options.each do |option|
    @switches[option.switch_name] = option
    option.aliases.each do |short|
      @shorts[short.to_s] ||= option.switch_name
    end
  end
end

def no_or_skip?(arg)

def no_or_skip?(arg)
  arg =~ /^--(no|skip)-([-\w]+)$/
  $2
end

def normalize_switch(arg)


Check if the given argument is actually a shortcut.
def normalize_switch(arg)
  @shorts.key?(arg) ? @shorts[arg] : arg
end

def parse(args)

def parse(args)
  @pile = args.dup
  while peek
    if current_is_switch?
      case shift
        when SHORT_SQ_RE
          unshift($1.split('').map { |f| "-#{f}" })
          next
        when EQ_RE, SHORT_NUM
          unshift($2)
          switch = $1
        when LONG_RE, SHORT_RE
          switch = $1
      end
      switch = normalize_switch(switch)
      option = switch_option(switch)
      @assigns[option.human_name] = parse_peek(switch, option)
    elsif current_is_switch_formatted?
      @unknown << shift
    else
      shift
    end
  end
  check_requirement!
  assigns = Thor::CoreExt::HashWithIndifferentAccess.new(@assigns)
  assigns.freeze
  assigns
end

def parse_boolean(switch)


Parse boolean values which can be given as --foo=true, --foo or --no-foo.
def parse_boolean(switch)
  if current_is_value?
    ["true", "TRUE", "t", "T", true].include?(shift)
  else
    @switches.key?(switch) || !no_or_skip?(switch)
  end
end

def parse_peek(switch, option)


Parse the value at the peek analyzing if it requires an input or not.
def parse_peek(switch, option)
  if current_is_switch_formatted? || last?
    if option.boolean?
      # No problem for boolean types
    elsif no_or_skip?(switch)
      return nil # User set value to nil
    elsif option.string? && !option.required?
      # Return the default if there is one, else the human name
      return option.default || option.human_name
    else
      raise MalformattedArgumentError, "No value provided for option '#{switch}'"
    end
  end
  @non_assigned_required.delete(option)
  send(:"parse_#{option.type}", switch)
end

def switch?(arg)

def switch?(arg)
  switch_option(arg) || @shorts.key?(arg)
end

def switch_formatted?(arg)

def switch_formatted?(arg)
  case arg
  when LONG_RE, SHORT_RE, EQ_RE, SHORT_NUM, SHORT_SQ_RE
    true
  else
    false
  end
end

def switch_option(arg)

def switch_option(arg)
  if match = no_or_skip?(arg)
    @switches[arg] || @switches["--#{match}"]
  else
    @switches[arg]
  end
end