sixarm_ruby_ramp 3.0.0 → 4.0.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 5dbd872b8c2a8f3732dad03323ac18e1e818a7a0
-  data.tar.gz: 89e1ed1eb27a9249bb1742f13b50db9e25babe0c
+  metadata.gz: 15836defff39ae99045d8296deb36ef351e6029c
+  data.tar.gz: 7182b4e6c8df8418d04960e4a8d2d52bd2da9492
 SHA512:
-  metadata.gz: 9636b6fc7048ba889b1f46d5887bf07778045ebd4544ab18a20204e81095b17ea25dd51ed3e3de6b2744d11d301b4597ec91016050ffd3d6792cf46260e70170
-  data.tar.gz: 9359784e5fd0ad168d5a618334a06e18b6d4fd8d420654331ea8ff540f09fd5b85d29469665464ce901620fdb1d561d9593a628129c775e7f3f5da585e39ea3a
+  metadata.gz: 288170ce6181ac89d943ec7abe6065ea67a6b64df274efb2038cb1db16566e88d84d861aef98ae19ee9a12888d3b8ca0e0b36d9df10dfb8a4e984bd3a4da8dd4
+  data.tar.gz: 8aa243bfb866ae9470bbb6bcb9cbbebb69466263bbded9be671cef88ff3ca2e9efaff35f788359418e2e69a2388114c98c781158388c2cfe30f586e9b504d570

data/README.md

@@ -1,5 +1,8 @@
 # SixArm.com » Ruby » <br> Ramp gem is a toolkit of Ruby base class extensions
 
+[![Code Climate](https://codeclimate.com/github/SixArm/sixarm_ruby_ramp.png)](https://codeclimate.com/github/SixArm/sixarm_ruby_ramp)
+[![Build Status](https://travis-ci.org/SixArm/sixarm_ruby_ramp.png)](https://travis-ci.org/SixArm/sixarm_ruby_ramp)
+
 * Doc: <http://sixarm.com/sixarm_ruby_ramp/doc>
 * Gem: <http://rubygems.org/gems/sixarm_ruby_ramp>
 * Repo: <http://github.com/sixarm/sixarm_ruby_ramp>
@@ -10,7 +13,7 @@
 
 Ramp is a library of extensions to Ruby base classes.
 
-We extend Array, Date, Enumerable, Hash, Kernel, Numeric, Object, Process, String, Time, and YAML. 
+We extend Array, Date, Enumerable, Hash, Kernel, Numeric, Object, Process, String, Time, and YAML.
 
 For docs go to <http://sixarm.com/sixarm_ruby_ramp/doc>
 
@@ -25,7 +28,7 @@ Install:
 
 Bundler:
 
-    gem "sixarm_ruby_ramp", "~>3.0.0"
+    gem "sixarm_ruby_ramp", "~>4.0.0"
 
 Require:
 
@@ -93,7 +96,7 @@ To install with high security:
 * map_with_index: for each item, yield to a block with the item and its incrementing index
 * nitems_until, select_until: return the number of, or an array containing, the leading elements for which block is false or nil.
 * nitems_while, select_while: return the number of items, or an array containing the leading elements, for which block is not false or nil.
-* nitems_with_index, select_with_index: calls block with two arguments, the item and its index, for each item in enum. Return the number of, or an array containing, the leading elements for which block is not false or nil. 
+* nitems_with_index, select_with_index: calls block with two arguments, the item and its index, for each item in enum. Return the number of, or an array containing, the leading elements for which block is not false or nil.
 * power_set: return an array with all subsets of the enum's elements
 
 
@@ -116,8 +119,12 @@ To install with high security:
 * each_key!: passes each key to a specified block and updates hash in place if the key changes
 * each_pair!: passes each key value pair to a specified block and updates the hash in place if the key or value change.
 * each_value!: passes each value to a specified block and updates the hash in place if the value changes.
+* map_key: map each key-value pair's key by calling a a block
 * map_pair: map each key-value pair by calling a a block
-* pivot: aggregates subtotals by keys and values, such as a rollup and rolldown 
+* map_value: map each key-value pair by calling a a block
+* merge_recurse: merge two hashes plus recurse whenever a key is a hash.
+* pivot: aggregates subtotals by keys and values, such as a rollup and rolldown
+* yield_pair: yield each key-value pair by calling a a block
 
 
 ## Integer
@@ -128,7 +135,7 @@ To install with high security:
 
 ## IO
 
-* readrow: reads a row line as with IO#readline, and return the row split it into fields 
+* readrow: reads a row line as with IO#readline, and return the row split it into fields
 * IO.readrows: reads the entire file specified by name as individual row lines, and return those rows split into fields, in an array of arrays.
 
 
@@ -220,7 +227,9 @@ Extensions that help debug Ruby programs.
 
 ## Changes
 
-* 2013-08-18 3.0.0 Upgrade to Ruby 2
+* 2014-12-17 4.0.0 Add `Pairable` methods; change semantics of `Hash#map_pair`
+* 2013-08-19 3.0.1 Update for Code Climate, Travis CI, gem dependencies
+* 2013-08-18 3.0.0 Update to Ruby 2
 * 2012-09-01 2.1.7 Add Numeric#floor_precision
 * 2012-03-14 2.1.6 Update docs, tests
 * 2.1.6 Refactor XML#strip* methods to new sixarm_ruby_xml_strip gem.
@@ -250,17 +259,17 @@ You may choose any of these open source licenses:
   * Perl Artistic License
   * Ruby License
 
-The software is provided "as is", without warranty of any kind, 
-express or implied, including but not limited to the warranties of 
-merchantability, fitness for a particular purpose and noninfringement. 
+The software is provided "as is", without warranty of any kind,
+express or implied, including but not limited to the warranties of
+merchantability, fitness for a particular purpose and noninfringement.
 
-In no event shall the authors or copyright holders be liable for any 
-claim, damages or other liability, whether in an action of contract, 
-tort or otherwise, arising from, out of or in connection with the 
+In no event shall the authors or copyright holders be liable for any
+claim, damages or other liability, whether in an action of contract,
+tort or otherwise, arising from, out of or in connection with the
 software or the use or other dealings in the software.
 
 This license is for the included software that is created by SixArm;
-some of the included software may have its own licenses, copyrights, 
+some of the included software may have its own licenses, copyrights,
 authors, etc. and these do take precedence over the SixArm license.
 
 Copyright (c) 2005-2012 Joel Parker Henderson

data/Rakefile

@@ -6,3 +6,5 @@ Rake::TestTask.new(:test) do |t|
   t.libs << 'lib' << 'test'
   t.pattern = 'test/*.rb'
 end
+
+task :default => [:test]

data/VERSION

@@ -1 +1 @@
-3.0.0
+4.0.0

data/lib/sixarm_ruby_ramp/hash.rb

@@ -1,145 +1,60 @@
 # -*- coding: utf-8 -*-
 
 require 'yaml'
+require_relative 'pairable'
 
 # Hash extensions
 
 class Hash
+  include Pairable
 
-
+  # Does the hash contain any items?
+  #
   # @return [Boolean] true if size > 0
-
+  #
   def size?
     size>0
   end
 
+  # Sort the hsh items by the keys.
+  #
   # @return [Hash] a new hash sorted by the keys
   #
   # @example
   #    h = {"c" => "cherry", "b" => "banana", "a" =>"apple" }
   #    h.sort_keys => {"a" => "apple", "b" => "banana", "c" => "cherry"}
-
+  #
   def sort_by_keys
     Hash[sort]
   end
 
-  
-  # Calls block once for each key in hsh, passing the key and value to the block as a two-element array.
-  #
-  # The keys are sorted.
+  # Return a new hash containing the contents of other_hash and the
+  # contents of hsh.
   #
-  # @example
-  #   h = { "xyz" => "123", "abc" => "789" }
-  #   h.each_sort {|key, val| ... }
-  #   => calls the block with "abc" => "789", then with "xyz" => "123"
-
-  def each_sort
-    keys.sort.each{|key| yield key,self[key] }
-  end
-
-
-  # Calls block once for each key in hsh, 
-  # passing the key as a parameter,
-  # and updating it in place.
+  # If no block is specified, the value for entries with duplicate
+  # keys will be that of other_hash; if the values are both hashes,
+  # then this method recurses.
   #
-  # @example
-  #   h = { "a" => "b", "c" => "d" }
-  #   h.each_key! {|key| key.upcase }
-  #   h => { "A" => "b", "C" => "d" }
+  # Otherwise the  value for each duplicate key is determined by calling
+  # the block with the key, its value in hsh and its value in other_hash.
   #
-  # @return self
-
-  def each_key!
-    replacements=[]
-    keys.each{|key|
-      value=self[key]
-      key2=yield(key)
-      if key===key2
-        #nop
-      else
-        replacements << [key,key2,value]
-      end
-    }
-    replacements.each{|key,key2,value|
-      self.delete(key)
-      self[key2]=value
-    }
-    return self
-  end
-
-
-  # Calls block once for each key in hsh,
-  # passing the key and value as parameters,
-  # and updated them in place.
+  # @example:
   #
-  # @example
-  #   h = { "a" => "b", "c" => "d" }
-  #   h.each_pair! {|key,value| key.upcase, value.upcase }
-  #   h => { "A" => "B", "C" => "D" }
+  #   h1 = {a: 'b', c: {d: 'e'}}
+  #   h2 = {a: 'B', c: {d: 'E'}}
+  #   h1.merge_recurse(h2)
+  #   #=> {a: 'B', c: {d: 'E'}}
   #
-  # @return self.
-
-  def each_pair!
-    replacements=[]
-    keys.each{|key|
-      value=self[key]
-      key2,value2=yield(key,value)
-      if key===key2
-        if value===value2
-          #nop
-        else
-          self[key]=value2
-        end
+  def merge_recurse(other_hash)
+    merge(other_hash){|key, oldval, newval|
+      if oldval.is_a?(Hash) && newval.is_a?(Hash)
+        oldval.merge_recurse(newval)
       else
-        replacements << [key,key2,value2]
+        newval
       end
     }
-    replacements.each{|key,key2,value2|
-      self.delete(key)
-      self[key2]=value2
-    }
-    return self
-  end
-
-
-  # Calls block once for each key in hsh,
-  # passing the value as a parameter, 
-  # and updating it in place.
-  #
-  # @example
-  #   h = { "a" => "b", "c" => "d" }
-  #   h.each_value! {|value| value.upcase }
-  #   h => { "a" => "B", "c" => "d" }
-  #
-  # @return self.
-
-  def each_value!
-    keys.each{|key|
-      value=self[key]
-      value2=yield(value)
-      if value===value2
-        #nop
-      else
-        self[key]=yield(value) 
-      end
-    }
-    return self
   end
 
-
-  # Calls block once for each key-value pair in hsh,
-  # passing the key and value as paramters to the block.
-  #
-  # @example
-  #   h = {"a"=>"b", "c"=>"d", "e"=>"f" }
-  #   h.map_pair{|key,value| key+value }
-  #   => ["ab","cd","ef"]
-
-  def map_pair
-    keys.map{|key| yield key, self[key] }
-  end
-
-
   # Hash#pivot aggregates values for a hash of hashes,
   # for example to calculate subtotals and groups.
   #
@@ -150,32 +65,32 @@ class Hash
   #     "Goggle"    => {"Accountants" => 44, "Designers" => 55, "Developers" => 66},
   #     "Microsoft" => {"Accountants" => 77, "Designers" => 88, "Developers" => 99},
   #   }
-  # 
+  #
   # To calculate each company's total headcount, you pivot up, then sum:
-  # 
+  #
   #   data.pivot(:up,&:sum)
   #   => {
-  #    "Apple"=>66, 
-  #    "Goggle"=>165, 
+  #    "Apple"=>66,
+  #    "Goggle"=>165,
   #    "Microsoft"=>264
   #   }
-  # 
+  #
   # To calculate each role's total headcount, you pivot down, then sum:
-  # 
+  #
   #   data.pivot(:down,&:sum)
   #   => {
   #    "Accountants"=>132,
   #    "Designers"=>165,
   #    "Developers"=>198
   #   }
-  # 
+  #
   #  Generic example:
   #   h={
   #    "a"=>{"x"=>1,"y"=>2,"z"=>3},
   #    "b"=>{"x"=>4,"y"=>5,"z"=>6},
   #    "c"=>{"x"=>7,"y"=>8,"z"=>9},
   #   }
-  #   h.pivot(:keys) => {"a"=>[1,2,3],"b"=>[4,5,6],"c"=>[7,8,9]} 
+  #   h.pivot(:keys) => {"a"=>[1,2,3],"b"=>[4,5,6],"c"=>[7,8,9]}
   #   h.pivot(:vals) => {"x"=>[1,4,7],"y"=>[2,5,8],"z"=>[3,6,9]}
   #
   # = Calculating subtotals
@@ -206,7 +121,7 @@ class Hash
   # @example
   #   h.pivot(:vals){|items| items.max } => {"a"=>7,"b"=>8,"c"=>9}
   #   h.pivot(:vals){|items| items.join("-") } => {"a"=>"1-4-7","b"=>"2-5-8","c"=>"3-6-9"}
-  #   h.pivot(:vals){|items| items.inject{|sum,x| sum+=x } } => {"a"=>12,"b"=>15,"c"=>18}   
+  #   h.pivot(:vals){|items| items.inject{|sum,x| sum+=x } } => {"a"=>12,"b"=>15,"c"=>18}
 
   def pivot(direction='keys',&block)
     a=self.class.new

data/lib/sixarm_ruby_ramp/pairable.rb

@@ -0,0 +1,177 @@
+# -*- coding: utf-8 -*-
+
+# Extensions for a class that provides key-value pairs.
+#
+# The including class must provide these methods:
+#
+#  * obj[key] → value
+#  * obj[key] = value
+#  * keys → enumerable
+#
+module Pairable
+
+  # Call block once for each key-value pair in self,
+  # passing the key and value to the block
+  # as a two-element array.
+  #
+  # The keys are sorted.
+  #
+  # @example
+  #   h = { "c" => "d", "a" => "b" }
+  #   h.each_sort {|key, val| ... }
+  #   => calls the block with "a" => "b", then with "c" => "d"
+  #
+  def each_sort
+    keys.sort.each{|key| yield key, self[key] }
+  end
+
+  # Call block once for each key-value pair in self,
+  # passing the key as a parameter,
+  # and updating it in place.
+  #
+  # @example
+  #   h = { "a" => "b", "c" => "d" }
+  #   h.each_key! {|key| key.upcase }
+  #   h => { "A" => "b", "C" => "d" }
+  #
+  # @return self
+  #
+  def each_key!
+    replacements=[]
+    keys.each{|key|
+      value=self[key]
+      key2=yield(key)
+      if key===key2
+        #nop
+      else
+        replacements << [key,key2,value]
+      end
+    }
+    replacements.each{|key,key2,value|
+      self.delete(key)
+      self[key2]=value
+    }
+    return self
+  end
+
+  # Call block once for each key-value pair in self,
+  # passing the value as a parameter,
+  # and updating it in place.
+  #
+  # @example
+  #   h = { "a" => "b", "c" => "d" }
+  #   h.each_value! {|value| value.upcase }
+  #   h => { "a" => "B", "c" => "d" }
+  #
+  # @return self
+  #
+  def each_value!
+    keys.each{|key|
+      value=self[key]
+      value2=yield(value)
+      if value===value2
+        #nop
+      else
+        self[key]=yield(value)
+      end
+    }
+    return self
+  end
+
+  # Call block once for each key-value pair in self,
+  # passing the key and value as parameters,
+  # and updating it in place.
+  #
+  # @example
+  #   h = { "a" => "b", "c" => "d" }
+  #   h.each_pair! {|key,value| key.upcase, value.upcase }
+  #   h => { "A" => "B", "C" => "D" }
+  #
+  # @return self
+  #
+  def each_pair!
+    replacements=[]
+    keys.each{|key|
+      value=self[key]
+      key2,value2=yield(key,value)
+      if key===key2
+        if value===value2
+          #nop
+        else
+          self[key]=value2
+        end
+      else
+        replacements << [key,key2,value2]
+      end
+    }
+    replacements.each{|key,key2,value2|
+      self.delete(key)
+      self[key2]=value2
+    }
+    return self
+  end
+
+  # Call block once for each key-pair value in self,
+  # passing the key as a parameter to the block,
+  # and mapping it to a result.
+  #
+  # @example
+  #   h = {"a" => "b"}
+  #   h.map_key{|key| key.upcase }
+  #   => {"A" => "b"}
+  #
+  # @return [self.class] a new object with the mapped keys and existing values.
+  #
+  def map_key
+    result = self.class.new
+    keys.each{|key| result[yield key] = self[key]}
+    result
+  end
+
+  # Call block once for each key-value pair in self,
+  # passing the value as a parameter to the block,
+  # and mapping it to a result.
+  #
+  # @example
+  #   h = {"a" => "b"}
+  #   h.map_value{|value| value.upcase }
+  #   => {"a" => "B"}
+  #
+  # @return [self.class] a new object with the existing keys and mapped values.
+  #
+  def map_value
+    result = self.class.new
+    keys.each{|key| result[key] = yield self[key]}
+    result
+  end
+
+  # Call block once for each key-value pair in self,
+  # passing the key and value as parameters to the block.
+  # and mapping these to a result.
+  #
+  # @example
+  #   h = {"a" => "b"}
+  #   h.map_pair{|key, value| key.upcase, value.upcase }
+  #   => {"A" => "B"}
+  #
+  # @return [self.class] a new object with the mapped keys and mapped values.
+  #
+  def map_pair
+    result = self.class.new
+    keys.each{|key| k, v = yield key, self[key]; result[k] = v}
+    result
+  end
+
+  # Calls block once for each key-value pair in self,
+  # passing the key and value as paramters to the block.
+  #
+  # @example
+  #   h = {"a"=>"b", "c"=>"d", "e"=>"f" }
+  #   h.map_pair{|key,value| key+value }
+  #   => ["ab","cd","ef"]
+  #
+  def yield_pair
+    keys.map{|key| yield key, self[key] }
+  end
+
+end

data/lib/sixarm_ruby_ramp.rb

@@ -3,6 +3,6 @@
 Please see README
 =end
 
-['array','class','csv','date','enumerable','file','fixnum','hash','integer','io','kernel','math','nil','numeric','object','process','string','symbol','time','xml','yaml'].map{|x|
+['array','class','csv','date','enumerable','file','fixnum','hash','integer','io','kernel','math','nil','numeric','object','pairable','process','string','symbol','time','xml','yaml'].map{|x|
   require File.dirname(__FILE__) + "/sixarm_ruby_ramp/#{x}.rb"
 }

data/test/sixarm_ruby_ramp_test/hash_test.rb

@@ -4,25 +4,21 @@ require 'sixarm_ruby_ramp'
 
 class HashTest < Minitest::Test
 
-
   def test_size_true
     h = {'a'=>'b'}
     assert(h.size?)
   end
 
-
   def test_size_false
     h = {}
     assert(!h.size?)
   end
 
-
   def test_sort_by_keys
     h = {'c' => 'z', 'b' => 'y', 'a' => 'x'}
     assert_equal({'a' => 'x', 'b' => 'y', 'c' => 'z'}, h.sort_by_keys)
   end
 
-
   def test_each_sort
     out = []
     h = {'c' => 'z', 'b' => 'y', 'a' => 'x'}
@@ -30,7 +26,6 @@ class HashTest < Minitest::Test
     assert_equal(['A','X','B','Y','C','Z'], out)
   end
 
-
   def test_each_sort_with_empty
     out = []
     h = {}
@@ -38,7 +33,6 @@ class HashTest < Minitest::Test
     assert_equal([], out)
   end
 
-
   def test_each_key_bang
     actual = { "a" => "b", "c" => "d" }
     expect = { "A" => "b", "C" => "d" }
@@ -46,7 +40,6 @@ class HashTest < Minitest::Test
     assert_equal(expect,actual)
   end
 
-
   def test_each_key_bang_with_empty
     actual = {}
     expect = {}
@@ -54,7 +47,6 @@ class HashTest < Minitest::Test
     assert_equal(expect,actual)
   end
 
-
   def test_each_pair_bang
     actual = { "a" => "b", "c" => "d" }
     expect = { "A" => "B", "C" => "D" }
@@ -62,7 +54,6 @@ class HashTest < Minitest::Test
     assert_equal(expect,actual)
   end
 
-
   def test_each_pair_bang_with_empty
     actual = {}
     expect = {}
@@ -70,7 +61,6 @@ class HashTest < Minitest::Test
     assert_equal(expect,actual)
   end
 
-
   def test_each_pair_bang_with_same_key_different_value
     actual = { "a" => "b", "c" => "d" }
     expect = { "a" => "B", "c" => "D" }
@@ -78,7 +68,6 @@ class HashTest < Minitest::Test
     assert_equal(expect,actual)
   end
 
-
   def test_each_pair_bang_with_same_key_same_value
     actual = { "a" => "b", "c" => "d" }
     expect = { "a" => "b", "c" => "d" }
@@ -86,7 +75,6 @@ class HashTest < Minitest::Test
     assert_equal(expect,actual)
   end
 
-
   def test_each_value_bang
     actual = { "a" => "b", "c" => "d" }
     expect = { "a" => "B", "c" => "D" }
@@ -94,7 +82,6 @@ class HashTest < Minitest::Test
     assert_equal(expect,actual)
   end
 
-
   def test_each_value_bang_with_empty
     actual = {}
     expect = {}
@@ -102,22 +89,73 @@ class HashTest < Minitest::Test
     assert_equal(expect,actual)
   end
 
+  def test_map_key
+    h = {"a"=>"b"}
+    expect = {"A" => "b"}
+    actual = h.map_key{|key| key.upcase }.sort
+    assert_equal(expect,actual,h.inspect)
+  end
 
-  def test_map_pair
-    h = {"a"=>"b", "c"=>"d", "e"=>"f" }
-    expect=["ab","cd","ef"]  
-    actual=h.map_pair{|key,value| key+value }.sort
+  def test_map_value
+    h = {"a"=>"b"}
+    expect = {"a" => "B"}
+    actual = h.map_value{|value| value.upcase }.sort
+    assert_equal(expect,actual,h.inspect)
+  end
+
+  def test_map_value
+    h = {"a"=>"b"}
+    expect = {"A" => "B"}
+    actual = h.map_value{|key, value| key.upcase, value.upcase }.sort
     assert_equal(expect,actual,h.inspect)
   end
 
+  def test_yield_pair
+    h = {"a"=>"b", "c"=>"d", "e"=>"f" }
+    expect=["ab","cd","ef"]
+    actual=h.yield_pair{|key,value| key+value }.sort
+    assert_equal(expect,actual,h.inspect)
+  end
 
-  def test_map_pair_with_empty
+  def test_yield_pair_with_empty
     h = {}
     expect=[]
-    actual=h.map_pair{|key,value| key+value }.sort
+    actual=h.yield_pair{|key,value| key+value }.sort
+    assert_equal(expect,actual,h.inspect)
+  end
+
+  def test_map_key
+    h={"a"=>"b", "c"=>"d", "e"=>"f" }
+    expect={"a1"=>"b", "c1"=>"d", "e1"=>"f" }
+    actual=h.map_pair{|key,value| "#{key}1" }.sort
+    assert_equal(expect,actual,h.inspect)
+  end
+
+  def test_map_value
+    h={"a"=>"b", "c"=>"d", "e"=>"f" }
+    expect={"a"=>"b2", "c"=>"d2", "e"=>"f2" }
+    actual=h.map_pair{|key,value| "#{value}2" }.sort
+    assert_equal(expect,actual,h.inspect)
+  end
+
+  def test_map_pair
+    h={"a"=>"b", "c"=>"d", "e"=>"f" }
+    expect={"a1"=>"b2", "c1"=>"d2", "e1"=>"f2" }
+    actual=h.map_pair{|key,value| ["#{key}1", "#{value}2" }.sort
     assert_equal(expect,actual,h.inspect)
   end
-   
+
+  def test_merge_recurse
+    # Test with three kinds of items:
+    #   * same key => same value #=> must stay the same
+    #   * same key => other value #=> must use the other value
+    #   * different key => any value #=> output must contain the key and value
+    h1={ "a" => "b", "c" => "d", "e" => "f", "g" => { "h" => "i", "j" => "k", "l" => "m"}}
+    h2={ "a" => "b", "c" => "D", "E" => "F", "g" => { "h" => "i", "j" => "K", "L" => "M"}}
+    expect={ "a" => "b", "c" => "D", "e" => "f", "g" => { "h" => "i", "j" => "K", "l" => "m", "L" => "M"}, "E" => "F"}
+    actual=h1.merge_recurse(h2)
+    assert_equal(expect,actual,h1.inspect+h2.inspect)
+  end
 
   def pivotable
     h=Hash.new
@@ -134,8 +172,7 @@ class HashTest < Minitest::Test
     h['c']['y']='t'
     h['c']['z']='u'
     return h
-  end  
-
+  end
 
   def test_pivot_vals
     p=pivotable.pivot(:vals)
@@ -145,7 +182,6 @@ class HashTest < Minitest::Test
     assert_equal(['o','r','u'], p['z'].sort)
   end
 
-
   def test_pivot_vals_with_block
     p=pivotable.pivot(:vals){|items| items.sort.join }
     assert_equal(['x','y','z'], p.keys.sort)
@@ -154,7 +190,6 @@ class HashTest < Minitest::Test
     assert_equal('oru', p['z'])
   end
 
-
   def test_pivot_keys
     p=pivotable.pivot(:keys)
     assert_equal(['a','b','c'], p.keys.sort)
@@ -163,7 +198,6 @@ class HashTest < Minitest::Test
     assert_equal(['s','t','u'], p['c'].sort)
   end
 
-
   def test_pivot_keys_with_block
     p=pivotable.pivot(:keys){|items| items.sort.join }
     assert_equal(['a','b','c'], p.keys.sort)
@@ -172,7 +206,6 @@ class HashTest < Minitest::Test
     assert_equal('stu', p['c'])
   end
 
-
   def test_pivot_direction_up_with_true
     Hash.publicize_methods do
       assert({}.pivot_direction_up?('key'))
@@ -183,7 +216,6 @@ class HashTest < Minitest::Test
     end
   end
 
-
   def test_pivot_direction_up_with_false
     Hash.publicize_methods do
       assert(!{}.pivot_direction_up?('val'))
@@ -194,16 +226,10 @@ class HashTest < Minitest::Test
     end
   end
 
-
   def test_pivot_direction_up_with_invalid
     Hash.publicize_methods do
       assert_raises(ArgumentError){ {}.pivot_direction_up?('nonsense') }
     end
   end
 
-
 end
-
-
-
-

data/test/sixarm_ruby_ramp_test/pairable_test.rb

@@ -0,0 +1,117 @@
+# -*- coding: utf-8 -*-
+require 'minitest/autorun'
+require 'sixarm_ruby_ramp'
+
+class PairableTest < Minitest::Test
+
+  def test_sort_by_keys
+    h = {'c' => 'z', 'b' => 'y', 'a' => 'x'}
+    assert_equal({'a' => 'x', 'b' => 'y', 'c' => 'z'}, h.sort_by_keys)
+  end
+
+  def test_each_sort
+    out = []
+    h = {'c' => 'z', 'b' => 'y', 'a' => 'x'}
+    h.each_sort{|key,val| out << key.upcase; out << val.upcase}
+    assert_equal(['A','X','B','Y','C','Z'], out)
+  end
+
+  def test_each_sort_with_empty
+    out = []
+    h = {}
+    h.each_sort{|key,val| out << key.upcase; out << val.upcase}
+    assert_equal([], out)
+  end
+
+  def test_each_key_bang
+    actual = { "a" => "b", "c" => "d" }
+    expect = { "A" => "b", "C" => "d" }
+    actual.each_key! {|key| key.upcase }
+    assert_equal(expect,actual)
+  end
+
+  def test_each_key_bang_with_empty
+    actual = {}
+    expect = {}
+    actual.each_key! {|key| key.upcase }
+    assert_equal(expect,actual)
+  end
+
+  def test_each_pair_bang
+    actual = { "a" => "b", "c" => "d" }
+    expect = { "A" => "B", "C" => "D" }
+    actual.each_pair! {|key,value| [key.upcase, value.upcase] }
+    assert_equal(expect,actual)
+  end
+
+  def test_each_pair_bang_with_empty
+    actual = {}
+    expect = {}
+    actual.each_pair! {|key,value| [key.upcase, value.upcase] }
+    assert_equal(expect,actual)
+  end
+
+  def test_each_pair_bang_with_same_key_different_value
+    actual = { "a" => "b", "c" => "d" }
+    expect = { "a" => "B", "c" => "D" }
+    actual.each_pair! {|key,value| [key, value.upcase] }
+    assert_equal(expect,actual)
+  end
+
+  def test_each_pair_bang_with_same_key_same_value
+    actual = { "a" => "b", "c" => "d" }
+    expect = { "a" => "b", "c" => "d" }
+    actual.each_pair! {|key,value| [key, value] }
+    assert_equal(expect,actual)
+  end
+
+  def test_each_value_bang
+    actual = { "a" => "b", "c" => "d" }
+    expect = { "a" => "B", "c" => "D" }
+    actual.each_value! {|value| value.upcase }
+    assert_equal(expect,actual)
+  end
+
+  def test_each_value_bang_with_empty
+    actual = {}
+    expect = {}
+    actual.each_value! {|value| value.upcase }
+    assert_equal(expect,actual)
+  end
+
+  def test_map_key
+    h={"a"=>"b", "c"=>"d"}
+    expect={"A"=>"b", "C"=>"d"}
+    actual=h.map_key{|key| key.upcase }
+    assert_equal(expect,actual,h.inspect)
+  end
+
+  def test_map_value
+    h={"a"=>"b", "c"=>"d"}
+    expect={"a"=>"B", "c"=>"D"}
+    actual=h.map_value{|value| value.upcase }
+    assert_equal(expect,actual,h.inspect)
+  end
+
+  def test_map_pair
+    h={"a"=>"b", "c"=>"d"}
+    expect={"A"=>"B", "C"=>"D"}
+    actual=h.map_pair{|key,value| [key.upcase, value.upcase] }
+    assert_equal(expect,actual,h.inspect)
+  end
+
+  def test_yield_pair
+    h = {"a"=>"b", "c"=>"d" }
+    expect=["ab","cd"]
+    actual=h.yield_pair{|key,value| key+value }
+    assert_equal(expect,actual,h.inspect)
+  end
+
+  def test_yield_pair_with_empty
+    h = {}
+    expect=[]
+    actual=h.yield_pair{|key,value| key+value }
+    assert_equal(expect,actual,h.inspect)
+  end
+
+end

data/test/sixarm_ruby_ramp_test.rb

@@ -1,9 +1,9 @@
 # -*- coding: utf-8 -*-
 require 'minitest/autorun'
+Minitest::Test ||= MiniTest::Unit::TestCase
 require 'simplecov'
 SimpleCov.start
 
-['array','class','csv','date','enumerable','file','fixnum','hash','integer','io','kernel','math','nil','numeric','object','process','string','symbol','time','xml','yaml'].map{|x|
+['array','class','csv','date','enumerable','file','fixnum','hash','integer','io','kernel','math','nil','numeric','object','pairable','process','string','symbol','time','xml','yaml'].map{|x|
   require "sixarm_ruby_ramp_test/#{x}_test.rb"
 }
-

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: sixarm_ruby_ramp
 version: !ruby/object:Gem::Version
-  version: 3.0.0
+  version: 4.0.0
 platform: ruby
 authors:
 - SixArm
@@ -10,78 +10,98 @@ bindir: bin
 cert_chain:
 - |
   -----BEGIN CERTIFICATE-----
-  MIIDBDCCAm2gAwIBAgIJAKPwEETU5bHoMA0GCSqGSIb3DQEBBQUAMGAxCzAJBgNV
-  BAYTAlVTMRMwEQYDVQQIEwpDYWxpZm9ybmlhMRYwFAYDVQQHEw1TYW4gRnJhbmNp
-  c2NvMQ8wDQYDVQQKEwZTaXhBcm0xEzARBgNVBAMTCnNpeGFybS5jb20wHhcNMTAx
-  MjEzMjMyNzEzWhcNMTMwOTA4MjMyNzEzWjBgMQswCQYDVQQGEwJVUzETMBEGA1UE
-  CBMKQ2FsaWZvcm5pYTEWMBQGA1UEBxMNU2FuIEZyYW5jaXNjbzEPMA0GA1UEChMG
-  U2l4QXJtMRMwEQYDVQQDEwpzaXhhcm0uY29tMIGfMA0GCSqGSIb3DQEBAQUAA4GN
-  ADCBiQKBgQC94mD9JDwBsunsOI0VR3CXXbOWg9cWaWciwFyJNFiM7A9I8KPLfXUw
-  QC4czUe5ZuG4WHvinrWhkrCK+1dWBqoEClxdF/FoKO5a+tonGCjjmfy81JmFjjyx
-  eTsjsHyvw+Qik9kpf9aj6+pnkNrVswgNHVea2o9yabbEiS6VSeJWoQIDAQABo4HF
-  MIHCMB0GA1UdDgQWBBQzPJtqmSgc53eDN7aSzDQwr9TALDCBkgYDVR0jBIGKMIGH
-  gBQzPJtqmSgc53eDN7aSzDQwr9TALKFkpGIwYDELMAkGA1UEBhMCVVMxEzARBgNV
-  BAgTCkNhbGlmb3JuaWExFjAUBgNVBAcTDVNhbiBGcmFuY2lzY28xDzANBgNVBAoT
-  BlNpeEFybTETMBEGA1UEAxMKc2l4YXJtLmNvbYIJAKPwEETU5bHoMAwGA1UdEwQF
-  MAMBAf8wDQYJKoZIhvcNAQEFBQADgYEAooEexP/oPam1TP71SyuhxMb+uTrZbSQe
-  jVB+ExRwWadGwaNPUA56d39qwavwP+iu+3JpeonNMVvbWXF5naCX/dNFIeREHzER
-  ZDRQYMqru9TEMna6HD9zpcstF7vwThGovlOQ+3Y6plQ4nMzipXcZ9THqs65PIL0q
-  eabwpCbAopo=
+  MIIDbDCCAlSgAwIBAgIBATANBgkqhkiG9w0BAQUFADA+MQ8wDQYDVQQDDAZzaXhh
+  cm0xFjAUBgoJkiaJk/IsZAEZFgZzaXhhcm0xEzARBgoJkiaJk/IsZAEZFgNjb20w
+  HhcNMTQwMzEzMDQyMjE4WhcNMTUwMzEzMDQyMjE4WjA+MQ8wDQYDVQQDDAZzaXhh
+  cm0xFjAUBgoJkiaJk/IsZAEZFgZzaXhhcm0xEzARBgoJkiaJk/IsZAEZFgNjb20w
+  ggEiMA0GCSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQC5MZYB72Amo9DyeqBdJeEx
+  r4togM0+diNuL1nCH2FSO/+LX5L9mTPEEW5gexYCasmlOfmk5255EToJNtu1JUM/
+  dMqUbNS5LZ1srFVcyDzIe/wQ9f2OSmb+lAGmlnFLfYSpduMv9fPNISlcs5nFYSR9
+  mpS0kTWcXQPLNDl2cfnkYYjDsuyJ8FmDyG7TTF0c4OWJNLxNDE8To2n8GmmDSwr3
+  0K71F278CJlFoIaSSjnhKxkH8/l+z/Vs58KkjX/7M6nwNgNZMQaFBIO02UDtCi2F
+  ICVtDuWdK0YLv3JnIzvSQPQsfArrw2s8RVKjXlelPMeHJIcCEZcS4K6HIg7vQCkP
+  AgMBAAGjdTBzMAkGA1UdEwQCMAAwCwYDVR0PBAQDAgSwMB0GA1UdDgQWBBQrbLvF
+  TNv9r72z+hpCl3BkTPbzwTAcBgNVHREEFTATgRFzaXhhcm1Ac2l4YXJtLmNvbTAc
+  BgNVHRIEFTATgRFzaXhhcm1Ac2l4YXJtLmNvbTANBgkqhkiG9w0BAQUFAAOCAQEA
+  H08J7cTJyfm4mXpdM0FFr/f/syQSl2ymJWtcosuKA79A/vYMZ+n9B1gpuJmegjNt
+  lmYByeU50jJJ7JNdkvkTagHCZaxtzclWx6AR5gTd8V/sBKbTWtHe72pOWz/stQs2
+  xD8tQZvdAuBtRXx4ys6e3vigvYjdmTHUR9tT/NGCwmWj7KTk3mwNKBmuQGWTVWrV
+  h6r4cFMt3X5Zu+euYxHqDuwWyub9hp4s30/ea38CoYNdIZcSFtpGuvhwVDU0x5dg
+  sWRVEyjnjnNuAeLP9zv43IDXjS22L2efhap7IOinYjcecpfXJgQaU+6BFAY4sdkQ
+  S1STYSfs3qySBxxAeEyZTw==
   -----END CERTIFICATE-----
-date: 2013-08-19 00:00:00.000000000 Z
+date: 2014-12-18 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: sixarm_ruby_rexml
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - '>='
+    - - "~>"
       - !ruby/object:Gem::Version
-        version: 2.0.6
+        version: '2.1'
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 2.1.0
   type: :runtime
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - '>='
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '2.1'
+    - - ">="
       - !ruby/object:Gem::Version
-        version: 2.0.6
+        version: 2.1.0
 - !ruby/object:Gem::Dependency
   name: sixarm_ruby_xml_load
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - '>='
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '2.1'
+    - - ">="
       - !ruby/object:Gem::Version
-        version: 2.0.0
+        version: 2.1.0
   type: :runtime
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - '>='
+    - - "~>"
       - !ruby/object:Gem::Version
-        version: 2.0.0
+        version: '2.1'
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 2.1.0
 - !ruby/object:Gem::Dependency
   name: sixarm_ruby_xml_strip
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - '>='
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '2.1'
+    - - ">="
       - !ruby/object:Gem::Version
-        version: 2.0.4
+        version: 2.1.0
   type: :runtime
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - '>='
+    - - "~>"
       - !ruby/object:Gem::Version
-        version: 2.0.4
+        version: '2.1'
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 2.1.0
 description: Adds extensions to Array, Date, File, Hash, IO, String, Time, etc.
 email: sixarm@sixarm.com
 executables: []
 extensions: []
 extra_rdoc_files: []
 files:
-- .gemtest
+- ".gemtest"
 - CONTRIBUTING.md
-- Rakefile
 - README.md
+- Rakefile
 - VERSION
 - lib/sixarm_ruby_ramp.rb
 - lib/sixarm_ruby_ramp/array.rb
@@ -99,6 +119,7 @@ files:
 - lib/sixarm_ruby_ramp/nil.rb
 - lib/sixarm_ruby_ramp/numeric.rb
 - lib/sixarm_ruby_ramp/object.rb
+- lib/sixarm_ruby_ramp/pairable.rb
 - lib/sixarm_ruby_ramp/process.rb
 - lib/sixarm_ruby_ramp/string.rb
 - lib/sixarm_ruby_ramp/symbol.rb
@@ -116,20 +137,26 @@ files:
 - test/sixarm_ruby_ramp_test/hash_test.rb
 - test/sixarm_ruby_ramp_test/integer_test.rb
 - test/sixarm_ruby_ramp_test/io_test.rb
+- test/sixarm_ruby_ramp_test/io_test.txt
 - test/sixarm_ruby_ramp_test/kernel_test.rb
 - test/sixarm_ruby_ramp_test/math_test.rb
 - test/sixarm_ruby_ramp_test/nil_test.rb
 - test/sixarm_ruby_ramp_test/numeric_test.rb
 - test/sixarm_ruby_ramp_test/object_test.rb
+- test/sixarm_ruby_ramp_test/pairable_test.rb
 - test/sixarm_ruby_ramp_test/process_test.rb
 - test/sixarm_ruby_ramp_test/string_test.rb
 - test/sixarm_ruby_ramp_test/symbol_test.rb
 - test/sixarm_ruby_ramp_test/time_test.rb
 - test/sixarm_ruby_ramp_test/xml_test.rb
 - test/sixarm_ruby_ramp_test/yaml_test.rb
-- test/sixarm_ruby_ramp_test/io_test.txt
 homepage: http://sixarm.com/
-licenses: []
+licenses:
+- BSD
+- GPL
+- MIT
+- PAL
+- Various
 metadata: {}
 post_install_message: 
 rdoc_options: []
@@ -137,17 +164,17 @@ require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
-  - - '>='
+  - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
-  - - '>='
+  - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.0.3
+rubygems_version: 2.2.2
 signing_key: 
 specification_version: 4
 summary: SixArm.com » Ruby » Ramp gem provides base extensions to ruby classes.
@@ -168,6 +195,7 @@ test_files:
 - test/sixarm_ruby_ramp_test/nil_test.rb
 - test/sixarm_ruby_ramp_test/numeric_test.rb
 - test/sixarm_ruby_ramp_test/object_test.rb
+- test/sixarm_ruby_ramp_test/pairable_test.rb
 - test/sixarm_ruby_ramp_test/process_test.rb
 - test/sixarm_ruby_ramp_test/string_test.rb
 - test/sixarm_ruby_ramp_test/symbol_test.rb
@@ -175,4 +203,3 @@ test_files:
 - test/sixarm_ruby_ramp_test/xml_test.rb
 - test/sixarm_ruby_ramp_test/yaml_test.rb
 - test/sixarm_ruby_ramp_test/io_test.txt
-has_rdoc: true