facets 2.9.2 → 2.9.3

data/src/core/facets/hash/at.rb

@@ -1,8 +0,0 @@
-class Hash
-
-  # Alias for fetch for greater polymorphism with Array.
-  #
-  alias_method :at, :[]
-
-end
-

data/src/core/facets/hash/autonew.rb

@@ -1,24 +0,0 @@
-class Hash
-
-  # Hash which auto initializes it's children.
-  #
-  #   h = Hash.autonew
-  #   h['s1']['p1'] = 4
-  #   h['s1']['p2'] = 5
-  #   h['s1']['p3'] = 2
-  #   h['s1']['p4'] = 3
-  #
-  #   h #=> {"s1"=>{"p1"=>4, "p4"=>3, "p3"=>2, "p2"=>5}}
-  #
-  #   h['s1'].keys.sort
-  #   #=> ["p1", "p2", "p3", "p4"]
-  #
-  # CREDIT: Trans, Jan Molic
-
-  def self.autonew(*args)
-    leet = lambda{ |hsh, key| hsh[key] = new( &leet ) }
-    new(*args,&leet)
-  end
-
-end
-

data/src/core/facets/hash/collate.rb

@@ -1,62 +0,0 @@
-class Hash
-
-  # Merge the values of this hash with those from another, setting all values
-  # to be arrays representing the values from both hashes.
-  #
-  #   { :a=>1, :b=>2 }.collate(:a=>3, :b=>4, :c=>5)
-  #   #=> { :a=>[1,3], :b=>[2,4], :c=>[5] }
-  #
-  # CREDIT: Tilo Sloboda, Gavin Kistner (Phrogz)
-
-  def collate(other)
-    h = Hash.new
-    (keys + other.keys).each do |key|
-      h[key] = []
-    end
-    each do |key, value|
-      h[key] << value
-    end
-    other.each do |key, value|
-      h[key] << value
-    end
-    h.each{ |k,v| v.flatten! }
-    h
-  end
-
-  # The same as #collate, but modifies the receiver in place.
-  def collate!(other_hash)
-    result = collate(other_hash)
-    replace(result)
-  end
-
-  # Old version ...
-  #
-  #  def collate!(other_hash)
-  #    # Prepare, ensuring every existing key is already an Array
-  #    each do |key, value|
-  #      if value.is_a?(Array)
-  #        self[key] = value
-  #      else
-  #        self[key] = [value]
-  #      end
-  #    end
-  #    # Collate with values from other_hash
-  #    other_hash.each do |key, value|
-  #      if self[key]
-  #        if value.is_a?(Array)
-  #          self[key].concat( value )
-  #        else
-  #          self[key] << value
-  #        end
-  #      elsif value.is_a?(Array)
-  #        self[key] = value
-  #      else
-  #        self[key] = [value]
-  #      end
-  #    end
-  #    #each{ |key, value| value.uniq! } if options[ :uniq ]
-  #    self
-  #  end
-
-end
-

data/src/core/facets/hash/count.rb

@@ -1,12 +0,0 @@
-class Hash
-
-  # Like Enumerable#count, but counts hash values.
-  #
-  #   {:A=>1, :B=>1}.count(1) #=> 2
-  #
-  def count(value)
-    values.count(value)
-  end
-
-end
-

data/src/core/facets/hash/data.rb

@@ -1,41 +0,0 @@
-require 'facets/functor'
-
-class Hash
-
-  # Access to a hash as if it were an OpenStruct.
-  #
-  #   h = {:a=>1, :b=>2}
-  #
-  #   h.data.a  #=> 1
-  #   h.data.b  #=> 2
-  #   h.data.c  #=> nil
-  #
-  #   h.data.c = 3
-  #   h.data.c  #=> 3
-  #
-  #   h.data.a?  #=> true
-  #   h.data.d?  #=> false
-  #
-  # TODO: Change name of Hash#data to something better?
-  #
-  # TODO: Is this really a method worth having?
-  def data
-    this = self
-    Functor.new do |op, *a|
-      case op.to_s
-      when /\=$/
-        op = op.to_s.chomp('=')
-        this[op] = a.first
-      when /\?$/
-        op = op.to_s.chomp('?')
-        this.key?(op.to_s) || this.key?(op.to_sym)
-      when /\!$/
-        op = op.to_s.chomp('!')
-        this[op] # ???
-      else
-        this[op.to_s] || this[op.to_sym]
-      end
-    end
-  end
-
-end

data/src/core/facets/hash/dearray_values.rb

@@ -1,46 +0,0 @@
-class Hash
-
-  # Any array values with be replaced with the first element of the array.
-  # Arrays with no elements will be set to nil.
-  #
-  #   h = { :a=>[1], :b=>[1,2], :c=>3, :d=>[] }
-  #   h.dearray_values  #=> { :a=>1, :b=>1, :c=>3, :d=>nil }
-  #
-  # CREDIT: Trans
-
-  def dearray_values(index=0)
-    h = {}
-    each do |k,v|
-      case v
-      when Array
-        h[k] = v[index] || v[-1]
-      else
-        h[k] = v
-      end
-    end
-    h
-  end
-
-  # Any array values with one or no elements will be set to the element
-  # or nil.
-  #
-  #   h = { :a=>[1], :b=>[1,2], :c=>3, :d=>[] }
-  #   h.dearray_singular_values  #=> { :a=>1, :b=>[1,2], :c=>3, :d=>nil }
-  #
-  # CREDIT: Trans
-
-  def dearray_singular_values
-    h = {}
-    each do |k,v|
-      case v
-      when Array
-        h[k] = (v.size < 2) ? v[0] : v
-      else
-        h[k] = v
-      end
-    end
-    h
-  end
-
-end
-

data/src/core/facets/hash/deep_merge.rb

@@ -1,33 +0,0 @@
-class Hash
-
-  # Same as Hash#merge but recursively merges sub-hashes.
-
-  def deep_merge(other)
-    hash = self.dup
-    other.each do |key, value|
-      myval = self[key]
-      if value.is_a?(Hash) && myval.is_a?(Hash)
-        hash[key] = myval.deep_merge(value)
-      else
-        hash[key] = value
-      end
-    end
-    hash
-  end
-
-  # Same as Hash#merge! but recursively merges sub-hashes.
-
-  def deep_merge!(other)
-    other.each do |key, value|
-      myval = self[key]
-      if value.is_a?(Hash) && myval.is_a?(Hash)
-        myval.deep_merge!(value)
-      else
-        self[key] = value
-      end
-    end
-    self
-  end
-
-end
-

data/src/core/facets/hash/delete.rb

@@ -1,4 +0,0 @@
-# TODO: should we deprecate hash/delete?
-require 'facets/hash/delete_at'
-require 'facets/hash/delete_values'
-require 'facets/hash/delete_unless'

data/src/core/facets/hash/delete_at.rb

@@ -1,7 +0,0 @@
-class Hash
-
-  # Polymorphic with Array#delete_at.
-  alias_method :delete_at, :delete
-
-end
-

data/src/core/facets/hash/delete_unless.rb

@@ -1,17 +0,0 @@
-class Hash
-
-  # Inverse of #delete_if.
-  #
-  #   h = { :a => 1, :b => 2, :c => 3 }
-  #   r = h.delete_unless{|k,v| v == 1}
-  #   r  #=> { :a => 1 }
-  #   h  #=> { :a => 1 }
-  #
-  # CREDIT: Daniel Schierbeck
-
-  def delete_unless #:yield:
-    delete_if{ |key, value| ! yield(key, value) }
-  end
-
-end
-

data/src/core/facets/hash/delete_values.rb

@@ -1,41 +0,0 @@
-class Hash
-
-  # Minor modification to Ruby's Hash#delete method
-  # allowing it to take multiple keys.
-  #
-  #   hsh = { :a => 1, :b => 2 }
-  #   hsh.delete_values(1)
-  #   hsh  #=> { :b => 2 }
-  #
-  # Returns a list of keys of the deleted entries.
-  #
-  # CREDIT: Daniel Schierbeck
-
-  def delete_values(*values)
-    deleted_keys = []
-    keys.each do |key|
-      if values.include?(fetch(key))
-        deleted_keys << key
-        delete(key)
-      end
-    end
-    deleted_keys
-  end
-
-  # Minor modification to Ruby's Hash#delete method
-  # allowing it to take multiple keys.
-  #
-  #    hsh = {:a=>1, :b=>2, :c=>3}
-  #
-  #    a, b, c = hsh.delete_values_at(:a, :b, :c)
-  #
-  #    [a, b, c]  #=> [1, 2, 3]
-  #    hsh        #=> {}
-  #
-  # CREDIT: Daniel Schierbeck
-
-  def delete_values_at(*keys, &yld)
-    keys.map{|key| delete(key, &yld) }
-  end
-
-end

data/src/core/facets/hash/diff.rb

@@ -1,17 +0,0 @@
-class Hash
-
-  # Difference comparison of two hashes.
-  #
-  #   h1 = {:a=>1,:b=>2}
-  #   h2 = {:a=>1,:b=>3}
-  #
-  #   h1.diff(h2)  #=> {:b=>2}
-  #   h2.diff(h1)  #=> {:b=>3}
-  #
-  def diff(hash)
-    h1 = self.dup.delete_if{ |k,v| hash[k] == v }
-    h2 = hash.dup.delete_if{ |k,v| has_key?(k) }
-    h1.merge(h2)
-  end
-
-end

data/src/core/facets/hash/except.rb

@@ -1,25 +0,0 @@
-class Hash
-
-  # Returns a new hash less the given keys.
-  def except(*less_keys)
-    hash = dup
-    less_keys.each{ |k| hash.delete(k) }
-    hash
-  end
-
-  # Replaces hash with new hash less the given keys.
-  # This returns the hash of keys removed.
-  #
-  #   h = {:a=>1, :b=>2, :c=>3}
-  #   h.except!(:a)  #=> {:a=>1}
-  #   h              #=> {:b=>2,:c=>3}
-  #
-  # Returns a Hash of the removed pairs.
-  def except!(*rejected)
-    removed = {}
-    rejected.each{ |k| removed[k] = delete(k) }
-    removed
-  end
-
-end
-

data/src/core/facets/hash/graph.rb

@@ -1,18 +0,0 @@
-require 'facets/enumerable/mash'
-
-class Hash
-
-  # In place version of #graph.
-  #
-  # NOTE: Hash#graph! is only useful for Hash.
-  # It is not generally applicable to Enumerable.
-
-  def graph!(&yld)
-    replace(graph(&yld))
-  end
-
-  # Alias for #graph! as an alliteration for "map hash".
-  alias_method :mash!, :graph!
-
-end
-

data/src/core/facets/hash/insert.rb

@@ -1,19 +0,0 @@
-class Hash
-
-  # As with #store but only if the key isn't
-  # already in the hash.
-  #
-  # TODO: Would #store? be a better name?
-  #
-  # CREDIT: Trans
-
-  def insert(name, value)
-    if key?(name)
-      false
-    else
-      store(name,value)
-      true
-    end
-  end
-
-end

data/src/core/facets/hash/inverse.rb

@@ -1,30 +0,0 @@
-class Hash
-
-  # Create a "true" inverse hash by storing mutliple values in Arrays.
-  #
-  #   h = {"a"=>3, "b"=>3, "c"=>3, "d"=>2, "e"=>9, "f"=>3, "g"=>9}
-  #
-  #   h.invert           #=> {2=>"d", 3=>"f", 9=>"g"}
-  #   h.inverse          #=> {2=>"d", 3=>["f", "c", "b", "a"], 9=>["g", "e"]}
-  #   h.inverse.inverse  #=> {"a"=>3, "b"=>3, "c"=>3, "d"=>2, "e"=>9, "f"=>3, "g"=>9}
-  #
-  # Of course the inverse of the inverse should be the same.
-  #
-  #   (h.inverse.inverse == h)  #=> true
-  #
-  # CREDIT: Tilo Sloboda
-
-  def inverse
-    i = Hash.new
-    self.each_pair{ |k,v|
-      if (Array === v)
-        v.each{ |x| i[x] = ( i.has_key?(x) ? [k,i[x]].flatten : k ) }
-      else
-        i[v] = ( i.has_key?(v) ? [k,i[v]].flatten : k )
-      end
-    }
-    return i
-  end
-
-end
-

data/src/core/facets/hash/join.rb

@@ -1,17 +0,0 @@
-class Hash
-
-  # Like Array#join but specialized to Hash.
-  #
-  # NOTE: Without Ruby 1.9 this would be difficult to rely on becuase
-  # hashes did not have a strict order.
-  #
-  # CREDIT: Mauricio Fernandez
-
-  def join(pair_divider='', elem_divider=nil)
-    elem_divider ||= pair_divider
-    s = []
-    each{ |k,v| s << "#{k}#{pair_divider}#{v}" }
-    s.join(elem_divider)
-  end
-
-end