class Thor::CoreExt::OrderedHash

def []=(key, value)

def []=(key, value)
  if node = @hash[key]
    node.value = value
  else
    node = Node.new(key, value)
    if @first.nil?
      @first = @last = node
    else
      node.prev = @last
      @last.next = node
      @last = node
    end
  end
  @hash[key] = node
  value
end