hashmap 0.1.0 → 0.2.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: c20f904760916de0dcc2353dbee373135432d9ac
-  data.tar.gz: e4eeb6d7851f489967b7da00ab71adf2c2c004ee
+  metadata.gz: b2582690c253d61d1d0157647883cb1e7e019afd
+  data.tar.gz: 0aef9b23921cfcdd90dba1a1aebe5d8efd383f72
 SHA512:
-  metadata.gz: 08089466608a69e5770cb5b06ded0cda5501cf85dc3b8f160504d378ccc0510b4cfe868fc2b01a657eac9ab2d575c523e03bd3625bff0a181f572a8061b02c8a
-  data.tar.gz: 1ec74d7f3ea5319cd56a035b63ef4140817fc4e6c8250f732b7295dc6dedb16dd67b9726d5a2ff6f9ccbd574a72e245b15c6d7f70780d78f9cb26c7ab45c148a
+  metadata.gz: e6d6f8ac18d9a9189868c67f44bc8d045e973668f511178946769e359004eda17dd9e2949656b67dd1f4a91348a9202f8ec078e84d67465508e53c1c7d19b9ec
+  data.tar.gz: 8e22f67962881997485d48850f929f7a1f8b4e3192b3b0441434182287c79e6ea1dec2417ece098f55c7148f7efca6f70669d0c75bf56ebf343fd3db3e294ed5

data/lib/hashmap.rb

@@ -1,83 +1,112 @@
+
 class Hash
-	#
-	# Returns a new hash which is a copy of the current hash but each
-	# value is replaced by the result of running it through +block+.
-	#
-	#   {'a'=>1, 'b'=>2}.map_values { |v| v*2 } #=> {'a'=>2, 'b'=>4}
-	#   {'a'=>1, 'b'=>2}.map_values { "cat" }   #=> {'a'=>"cat", 'b'=>"cat"}
-	#
-	def map_values &block # :yields: value
-		hsh = {}
-		each do |k, v|
-			hsh[k] = yield v
-		end
-		hsh
-	end
+  #
+  # Returns a new hash which is a copy of the current hash but each
+  # value is replaced by the result of running it through +block+.
+  #
+  #   {'a'=>1, 'b'=>2}.map_values { |v| v*2 } #=> {'a'=>2, 'b'=>4}
+  #   {'a'=>1, 'b'=>2}.map_values { "cat" }   #=> {'a'=>"cat", 'b'=>"cat"}
+  #
+  # If no block is given, an Enumerator is returned instead.
+  #
+  def map_values &block # :yields: value
+    return enum_for(:map_values) unless block_given?
+    hsh = {}
+    each do |k, v|
+      hsh[k] = yield v
+    end
+    hsh
+  end
 
-	#
-	# Replaces the values in +hsh+ by running them each through +block+.
-	#
-	# See: #map_values
-	#
-	def map_values! &block # :yields: value
-		replace map_values(&block)
-	end
+  #
+  # Replaces the values in +hsh+ by running them each through +block+.
+  #
+  # See: #map_values
+  #
+  def map_values! &block # :yields: value
+    return enum_for(:map_values!) unless block_given?
+    replace map_values(&block)
+  end
 
-	#
-	# Returns a new hash which is a copy of the current hash but each
-	# key is replaced by the result of running it through +block+.
-	#
-	# If +block+ returns duplicate keys, they will be overwritten in
-	# the resulting hash.
-	#
-	#   {'a'=>1, 'b'=>2}.map_keys { |k| k*2 } #=> {'aa'=>1, 'bb'=>2}
-	#   {'a'=>1, 'b'=>2}.map_keys { "cat" }   #=> {'cat'=>2}
-	#
-	def map_keys &block # :yields: key
-		hsh = {}
-		each do |k, v|
-			hsh[ yield k ] = v
-		end
-		hsh
-	end
+  #
+  # Returns a new hash which is a copy of the current hash but each
+  # key is replaced by the result of running it through +block+.
+  #
+  # If +block+ returns duplicate keys, they will be overwritten in
+  # the resulting hash.
+  #
+  #   {'a'=>1, 'b'=>2}.map_keys { |k| k*2 } #=> {'aa'=>1, 'bb'=>2}
+  #   {'a'=>1, 'b'=>2}.map_keys { "cat" }   #=> {'cat'=>2}
+  #
+  # If no block is given, an Enumerator is returned instead.
+  #
+  def map_keys &block # :yields: key
+    return enum_for(:map_keys) unless block_given?
+    hsh = {}
+    each do |k, v|
+      hsh[ yield k ] = v
+    end
+    hsh
+  end
 
-	#
-	# Replaces the keys in +hsh+ by running them each through +block+.
-	#
-	# If +block+ returns duplicate keys, they will be overwritten in turn.
-	#
-	# See: #map_keys
-	#
-	def map_keys! &block # :yields: key
-		replace map_keys(&block)
-	end
+  #
+  # Replaces the keys in +hsh+ by running them each through +block+.
+  #
+  # If +block+ returns duplicate keys, they will be overwritten in turn.
+  #
+  # See: #map_keys
+  #
+  def map_keys! &block # :yields: key
+    return enum_for(:map_keys!) unless block_given?
+    replace map_keys(&block)
+  end
 
-	#
-	# Returns a new hash which is a copy of the current hash but each
-	# key-value pair is replaced by the result of running it through +block+.
-	#
-	# If +block+ returns duplicate keys, they will be overwritten in
-	# the resulting hash.
-	#
-	#   {'a'=>1, 'b'=>2}.map_pairs { |k,v| [k*2, v+1] } #=> {'aa'=>2, 'bb'=>3}
-	#   {'a'=>1, 'b'=>2}.map_pairs { ["cat","dog"] }   #=> {'cat'=>'dog'}
-	#
-	def map_pairs &block # :yields: key, value
-		hsh = {}
-		each do |k, v|
-			a, b = yield k, v
-			hsh[a] = b
-		end
-		hsh
-	end
+  #
+  # Returns a new hash which is a copy of the current hash but each
+  # key-value pair is replaced by the result of running it through +block+.
+  #
+  # If +block+ returns duplicate keys, they will be overwritten in
+  # the resulting hash.
+  #
+  #   {'a'=>1, 'b'=>2}.map_pairs { |k,v| [k*2, v+1] } #=> {'aa'=>2, 'bb'=>3}
+  #   {'a'=>1, 'b'=>2}.map_pairs { ["cat","dog"] }   #=> {'cat'=>'dog'}
+  #
+  # If no block is given, an Enumerator is returned instead.
+  #
+  def map_pairs &block # :yields: key, value
+    return enum_for(:map_pairs) unless block_given?
+    hsh = {}
+    each do |k, v|
+      a, b = yield k, v
+      hsh[a] = b
+    end
+    hsh
+  end
 
-	#
-	# Replaces the values in +hsh+ by running them each through +block+.
-	#
-	# See: #map_values
-	#
-	def map_pairs! &block # :yields: key, value
-		replace map_pairs(&block)
-	end
+  #
+  # Replaces the values in +hsh+ by running them each through +block+.
+  #
+  # See: #map_pairs
+  #
+  def map_pairs! &block # :yields: key, value
+    return enum_for(:map_pairs!) unless block_given?
+    replace map_pairs(&block)
+  end
 end
 
+=begin
+Copyright (c) 2013-2016, Matthew Kerwin <matthew@kerwin.net.au>
+
+Permission to use, copy, modify, and/or distribute this software for any
+purpose with or without fee is hereby granted, provided that the above
+copyright notice and this permission notice appear in all copies.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+=end
+

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: hashmap
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.2.0
 platform: ruby
 authors:
 - Matthew Kerwin
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2013-03-13 00:00:00.000000000 Z
+date: 2016-08-15 00:00:00.000000000 Z
 dependencies: []
 description: Defines some new mapping methods for Hash.  See https://bugs.ruby-lang.org/issues/7793
 email: matthew@kerwin.net.au
@@ -19,7 +19,7 @@ files:
 - lib/hashmap.rb
 homepage: http://rubygems.org/gems/hashmap
 licenses:
-- Simplified BSD License
+- ISC
 metadata: {}
 post_install_message: 
 rdoc_options: []
@@ -27,17 +27,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.0
+rubygems_version: 2.5.1
 signing_key: 
 specification_version: 4
 summary: New mappings for Hash