class Thor::CoreExt::OrderedHash

def []=(key, value)
  @keys << key unless key?(key)
  super
end

def clear
  super
  @keys.clear
  self
end

def delete(key)
  if key? key
    index = @keys.index(key)
    @keys.delete_at index
  end
  super
end

def delete_if
  super
  sync_keys!
  self
end

def each
  return to_enum(:each) unless block_given?
  @keys.each { |key| yield([key, self[key]]) }
  self
end

def each_key
  return to_enum(:each_key) unless block_given?
  @keys.each { |key| yield(key) }
  self
end

def each_pair
  return to_enum(:each_pair) unless block_given?
  @keys.each { |key| yield(key, self[key]) }
  self
end

def each_value
  return to_enum(:each_value) unless block_given?
  @keys.each { |key| yield(self[key]) }
  self
end

def initialize(*args, &block)
  super
  @keys = []
end

def initialize_copy(other)
  super
  # make a deep copy of keys
  @keys = other.keys
end

def inspect
  "#<#{self.class} #{super}>"
end

def keys
  @keys.dup
end

def merge(other_hash, &block)
  dup.merge!(other_hash, &block)
end

def merge!(other_hash)
  if block_given?
    other_hash.each { |k, v| self[k] = key?(k) ? yield(k, self[k], v) : v }
  else
    other_hash.each { |k, v| self[k] = v }
  end
  self
end

def reject(&block)
  dup.reject!(&block)
end

def replace(other)
  super
  @keys = other.keys
  self
end

def shift
  k = @keys.first
  v = delete(k)
  [k, v]
end

def sync_keys!
  @keys.delete_if { |k| !key?(k) }
end

def to_a
  @keys.map { |key| [key, self[key]] }
end

def to_hash
  self
end

def values
  @keys.map { |key| self[key] }
end