facets 0.7.2 → 0.9.0

data/lib/facet/hash.rb

@@ -1,9 +1 @@
-
-# base
-require "facet/hash/at"
-require "facet/hash/to_h"
-
-# common
-require "facet/hash/graph"
-require "facet/hash/graph%21"
-require "facet/hash/to_ostruct"
+require 'nano/hash.rb'

data/lib/facet/hash/alias.rb

@@ -0,0 +1 @@
+require 'nano/hash/alias.rb'

data/lib/facet/hash/assert_has_keys.rb

@@ -0,0 +1 @@
+require 'nano/hash/assert_has_keys.rb'

data/lib/facet/hash/assert_has_only_keys.rb

@@ -0,0 +1 @@
+require 'nano/hash/assert_has_only_keys.rb'

data/lib/facet/hash/at.rb

@@ -1,3 +1 @@
-class Hash 
-  alias_method( :at, :[] )
-end
+require 'nano/hash/at.rb'

data/lib/facet/hash/collate.rb

@@ -1,20 +1 @@
-class Hash
-  # Returns a new hash built by iterating through each key,value 
-  # pair and updating the new hash.
-  #
-  #   require 'facet/hash/collate'
-  #
-  #   
-  #
-  #--
-  # Note that this method may get some fine tuning as it
-  # currently expects the block to return a "mini-hash"
-  # pair -- parhaps an 2-element array woud be better?
-  #++
-  def collate  # :yield:
-    newhash = {}
-    each_pair{ |k,v| newhash.update( yield(k,v) ) }
-    newhash
-  end 
-end
-
+require 'nano/hash/collate.rb'

data/lib/facet/hash/delete_unless.rb

@@ -0,0 +1 @@
+require 'nano/hash/delete_unless.rb'

data/lib/facet/hash/each.rb

@@ -1,28 +1 @@
-class Hash
-  # A "smarter" hash#each which iterates through each
-  # _value_ if only one block parameter is given.
-  #
-  #   require 'facet/hash/each'
-  #
-  #   {:a=>"a", 2=>"b", "x"=>"c"}.each{ |v| puts v }
-  #
-  # _produces_
-  #
-  #   a
-  #   b
-  #   c
-  #
-  # WARNING! Use with caution. Methods from other libraries 
-  # may depend on the old behavior, expecting a two element 
-  # array to be passed into a single block argument.
-  def each(&yld)
-    case yld.arity
-    when 0
-    when 1
-      each_value{|v| yield(v)}
-    else
-      each_pair{|k,v| yld.call(k,v)}
-    end
-    self
-  end
-end
+require 'nano/hash/each.rb'

data/lib/facet/hash/each_with_index.rb

@@ -0,0 +1 @@
+require 'nano/hash/each_with_index.rb'

data/lib/facet/hash/each_with_key.rb

@@ -0,0 +1 @@
+require 'nano/hash/each_with_key.rb'

data/lib/facet/hash/graph.rb

@@ -1,26 +1 @@
-#--
-# Credits for original work goes to Zallus Kanite and Gavin Sinclair.
-#++
-class Hash
-  #
-  # Like <tt>#map</tt>/<tt>#collect</tt>, but it generates a Hash.  The block
-  # is expected to return two values: the key and the value for the new hash.
-  #
-  #   require 'facet/enumberable/graph'
-  #
-  #   numbers  = (1..3)
-  #   squares  = numbers.graph { |n| [n, n*n] }   # { 1=>1, 2=>4, 3=>9 }
-  #   sq_roots = numbers.graph { |n| [n*n, n] }   # { 1=>1, 4=>2, 9=>3 }
-  #
-  def graph(&yld)
-    if yld
-      inject({}) do |h,kv|
-        nk, nv = yld[*kv]
-        h[nk] = nv
-        h
-      end
-    else
-      Hash[*self.to_a.flatten]
-    end
-  end   
-end
+require 'nano/hash/graph.rb'

data/lib/facet/hash/has_keys.rb

@@ -1,48 +1 @@
-class Hash
-  
-  #   require 'facet/hash/has_keys?'
-  #
-  #   h = { :a => 1, :b => 2 }
-  #   h.has_keys?( :a )   #=> true
-  #   h.has_keys?( :c )   #=> false
-  #
-  def has_keys?(*check_keys)
-    unknown_keys = check_keys - self.keys
-    return unknown_keys.empty?
-  end
-
-  
-  #   require 'facet/hash/has_keys?'
-  #
-  #   h = { :a => 1, :b => 2 }
-  #   h.has_only_keys?( :a, :b )   #=> true
-  #   h.has_only_keys?( :a )       #=> false
-  #  
-  def has_only_keys?(*check_keys)
-    unknown_keys = self.keys - check_keys
-    return !unknown_keys.empty?
-  end
-  
-  #   require 'facet/hash/has_keys?'
-  #
-  #   h = { :a => 1, :b => 2 }
-  #   h.assert_has_keys( :a )   #=> true
-  #   h.assert_has_keys( :c )   #=> ArgumentError
-  #
-  def assert_has_keys(*check_keys)
-    raise(ArgumentError, "does not have key(s)") unless has_all_keys?
-  end
-  
-  #   require 'facet/hash/has_keys?'
-  #
-  #   h = { :a => 1, :b => 2 }
-  #   h.assert_only_keys( :a, :b )   #=> true
-  #   h.assert_only_keys( :a )       #=> ArgumentError
-  #
-  def assert_has_only_keys(*check_keys)
-    raise(ArgumentError, "has unexpected key(s)") unless has_only_keys?
-  end
-
-end
-
-  
+require 'nano/hash/has_keys.rb'

data/lib/facet/hash/has_only_keys.rb

@@ -0,0 +1 @@
+require 'nano/hash/has_only_keys.rb'

data/lib/facet/hash/inverse.rb

@@ -1,28 +1 @@
-#--
-# Credit goes to Tilo Sloboda.
-#++
-class Hash
-  # Create a "true" inverse hash by storing mutliple values
-  # in Arrays.
-  #
-  #   require 'facet/hash/inverse'
-  #
-  #   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}
-  #   h.inverse.inverse == h  #=> true
-  #
-  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
+require 'nano/hash/inverse.rb'

data/lib/facet/hash/join.rb

@@ -0,0 +1 @@
+require 'nano/hash/join.rb'

data/lib/facet/hash/keys_to_iv.rb

@@ -0,0 +1 @@
+require 'nano/hash/keys_to_iv.rb'

data/lib/facet/hash/keys_to_s.rb

@@ -1,22 +1 @@
-#--
-# Adapted from Gavin Sinclair's #convert_keys.
-#++
-require 'facet/hash/keys_to_s%21'
-class Hash
-  # Converts all keys in the Hash to be String values, returning a new Hash.
-  # With a from_class parameter, limits conversion to only a certain class of keys.
-  # It defaults to nil which convert any key class.
-  #
-  #   require 'facet/hash/keys_to_s'
-  #
-  #   foo = { :name=>'Gavin', :wife=>:Lisa }
-  #   foo.keys_to_s    #=>  { "name"=>"Gavin", "wife"=>:Lisa }
-  #   foo.inspect      #=>  { :name =>"Gavin", :wife=>:Lisa }
-  #
-  def keys_to_s( from_class=nil )
-    raise ArgumentError, "Parameter must be a class" unless from_class.kind_of?(Class) if from_class
-    self.dup.keys_to_s!( from_class )
-  end
-  # Deprecated name.
-  #alias_method( :keys_to_string, :keys_to_s )
-end
+require 'nano/hash/keys_to_s.rb'

data/lib/facet/hash/keys_to_sym.rb

@@ -1,33 +1 @@
-#--
-# Adapted from Gavin Sinclair's graceous work #symbolify_keys.
-#++
-require 'facet/hash/keys_to_sym%21'
-class Hash
-  # Converts all keys in the Hash to be Symbol values, returning a new Hash.
-  # With a from_class parameter, limits conversion to only a certain class of keys.
-  # It defaults to String --use nil to convert any key class.
-  #
-  #   require 'facet/hash/keys_to_sym'
-  #
-  #   foo = { :name=>'Gavin', 'wife'=>:Lisa }
-  #   foo.keys_to_sym    #=>  { :name=>"Gavin", :wife=>:Lisa }
-  #   foo.inspect        #=>  { "name" =>"Gavin", "wife"=>:Lisa }
-  #
-  def keys_to_sym( from_class=String )
-    raise ArgumentError, "Parameter must be a class" unless from_class.kind_of?(Class) if from_class
-    self.dup.keys_to_sym!( from_class )
-  end
-
-  alias_method( :symbolize_keys, :keys_to_sym )
-
-  #--
-  # Old names (deprecated):
-  #alias_method( :keys_to_symbol, :keys_to_sym )
-  #++
-  
-  #--
-  # Rails has these aliases too, but they are not very good for 
-  # gerenal use, IMHO. But perhaps someone can convince me otherwise.
-  #alias_method( :to_options,  :symbolize_keys )
-  #++
-end
+require 'nano/hash/keys_to_sym.rb'

data/lib/facet/hash/op_fetch.rb

@@ -0,0 +1 @@
+require 'nano/hash/op_fetch.rb'

data/lib/facet/hash/op_lshift.rb

@@ -0,0 +1 @@
+require 'nano/hash/op_lshift.rb'

data/lib/facet/hash/op_store.rb

@@ -0,0 +1 @@
+require 'nano/hash/op_store.rb'

data/lib/facet/hash/rand_key.rb

@@ -1,16 +1 @@
-#--
-# Adapted from rand.rb by:
-# * Ilmari Heikkinen <mailto:kig@misfiring.net>
-# * Christian Neukirchen <mailto:chneukirchen@gmail.com>
-#++
-class Hash
-  # Returns a random key.
-  #
-  #   require 'facet/hash/at_rand'
-  #
-  #   {:one => 1, :two => 2, :three => 3}.pick_key  #=> :three
-  #
-  def rand_key
-    keys.at( rand(keys.size) )
-  end
-end
+require 'nano/hash/rand_key.rb'

data/lib/facet/hash/rand_pair.rb

@@ -1,18 +1 @@
-#--
-# Adapted from rand.rb by:
-# * Ilmari Heikkinen <mailto:kig@misfiring.net>
-# * Christian Neukirchen <mailto:chneukirchen@gmail.com>
-#++
-require 'facet/hash/rand_key'
-class Hash
-  # Returns a random key-value pair.
-  #
-  #   require 'facet/hash/at_rand'
-  #
-  #   {:one => 1, :two => 2, :three => 3}.pick  #=> [:one, 1]
-  #
-  def rand_pair
-    k = rand_key
-    return k, fetch(k)
-  end
-end
+require 'nano/hash/rand_pair.rb'

data/lib/facet/hash/rand_value.rb

@@ -1,18 +1 @@
-#--
-# Adapted from rand.rb by:
-# * Ilmari Heikkinen <mailto:kig@misfiring.net>
-# * Christian Neukirchen <mailto:chneukirchen@gmail.com>
-#++
-require 'facet/hash/rand_key'
-class Hash
-  # Returns a random hash value.
-  #
-  #   require 'facet/hash/rand_value'
-  #
-  #   {:one => 1, :two => 2, :three => 3}.rand_value  #=> 2
-  #   {:one => 1, :two => 2, :three => 3}.rand_value  #=> 1
-  #
-  def rand_value
-    fetch( rand_key )
-  end
-end 
+require 'nano/hash/rand_value.rb'

data/lib/facet/hash/replace_each.rb

@@ -0,0 +1 @@
+require 'nano/hash/replace_each.rb'

data/lib/facet/hash/self/zipnew.rb

@@ -0,0 +1 @@
+require 'nano/hash/self/zipnew.rb'

data/lib/facet/hash/shuffle.rb

@@ -1,51 +1 @@
-#--
-# Adapted from rand.rb by:
-# * Ilmari Heikkinen <mailto:kig@misfiring.net>
-# * Christian Neukirchen <mailto:chneukirchen@gmail.com>
-#++
-class Hash
-
-  # Return the key-value pairs with _keys_ and _values_
-  # shuffled independedly.
-  #
-  #   require 'facet/hash/shuffle'
-  #
-  #   {:a=>1, :b=>2, :c=>3}.shuffle_hash_pairs  
-  #
-  # produces
-  #
-  #   [[:a, 3], [:b, 1], [:c, 2]]
-  #
-  def shuffle_hash_pairs
-    keys.shuffle.zip(values.sort_by{Kernel.rand})
-  end
-
-  # Returns a copy of the hash with _values_ arranged
-  # in new random order.
-  #
-  #   require 'facet/hash/shuffle'
-  #
-  #   h = {:a=>1, :b=>2, :c=>3}
-  #   h.shuffle_hash  #=> {:b=>2, :c=>1, :a>3}
-  #
-  def shuffle_hash
-    shuffled = {}
-    shuffle_hash_pairs.each{|k, v| shuffled[k] = v }
-    shuffled
-  end
-
-  # Destructive shuffle_hash.  Arrange the values in 
-  # a new random order.
-  #
-  #   require 'facet/hash/shuffle'
-  #
-  #   h = {:a => 1, :b => 2, :c => 3}
-  #   h.shuffle_hash!
-  #   h  #=> {:b=>2, :c=>1, :a=>3}
-  #
-  def shuffle_hash!
-    shuffle_hash_pairs.each{ |k, v| self[k] = v }
-    self
-  end
-
-end
+require 'nano/hash/shuffle.rb'

data/lib/facet/hash/slice.rb

@@ -1,11 +1 @@
-class Hash
-  # Alias #slice to #values_at.
-  #
-  #   require "facet/hash/slice"
-  # 
-  #   h = { :a => 1, :b => 2, :c => 3 }
-  #   h.slice(:a)      #=> [1]
-  #   h.slice(:a, :b)  #=> [1,2]
-  #
-  alias_method( :slice, :values_at )
-end
+require 'nano/hash/slice.rb'

data/lib/facet/hash/stringify_keys.rb

@@ -0,0 +1 @@
+require 'nano/hash/stringify_keys.rb'

data/lib/facet/hash/swap.rb

@@ -0,0 +1 @@
+require 'nano/hash/swap.rb'

data/lib/facet/hash/swapkey.rb

@@ -0,0 +1 @@
+require 'nano/hash/swapkey.rb'

data/lib/facet/hash/symoblize_keys.rb

@@ -0,0 +1 @@
+require 'nano/hash/symoblize_keys.rb'

data/lib/facet/hash/to_h.rb

@@ -1,13 +1 @@
-class Hash
-  # Return a rehashing of _self_.
-  #
-  #   require 'facet/hash/to_h'
-  #
-  #   {"a"=>1,"b"=>2}.to_h  #=> {"b"=>2,"a"=>1}
-  #
-  #--
-  # A horse is a horse, a horse of course.
-  #++
-  def to_h; rehash; end
-end
-
+require 'nano/hash/to_h.rb'

data/lib/facet/hash/to_ostruct.rb

@@ -1,13 +1 @@
-require 'ostruct'
-class Hash
-  # Turns a hash into a generic object using an OpenStruct.
-  #
-  #   require 'facet/hash/to_ostruct'
-  #
-  #   o = { 'a' => 1 }.to_ostruct
-  #   o.a  #=> 1
-  #
-  def to_ostruct
-    OpenStruct.new( self )
-  end
-end 
+require 'nano/hash/to_ostruct.rb'