hm 0.0.1 → 0.0.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 49f552a6aaf919dbd0d5909c5e88b6e16a949fe4
-  data.tar.gz: 5d0b3b428620f7542e276ba0431ff9278e256643
+  metadata.gz: 546509d780fa20ac838d7cde7df190a5860df261
+  data.tar.gz: cd18bb35c606420e79056efebd703e5bd9c3962d
 SHA512:
-  metadata.gz: 3f0e5d2db2a5bc0a0e5b39aa05aed137b235d4ec115739e063dc1bdde4eab15842a5220202e5eb4ffb4b42fdc4015cdacb0d97582ac79d4ac92a9f2422b4c881
-  data.tar.gz: 7fd96ca72e8218a82663176b38549f3688e040f6efc74d923bd815006571aae1c83bacf20ff4bb3a0f3609aac0d1ceedf42421019c3f1dff7708f87807780b94
+  metadata.gz: 16c5155264b15632a58896c8e8acd5e26ed10b579bc813e66b4256ae03bfd7ee61a1fd2d702cef0aeda82a9011e193618c4ab00f98c270ff293564d81da82523
+  data.tar.gz: fa1a5b8e97a2a27bb9ab97f156f33d43746301d8b236488c8ea669d7b19c7cffebc80a132cd3a8fb636d159d1940240f2cbaa371cead7b558eb45956f7dd5e95

data/CHANGELOG.md

@@ -0,0 +1,11 @@
+# Hm version history
+
+## 0.0.2 - Feb 24, 2018
+
+* Some profiling and small optimizations;
+* Support for Ruby versions before 2.3, when native #dig was introduced, thanks to
+  [@berniechiu](https://github.com/berniechiu).
+
+## 0.0.1 - Feb 17, 2018
+
+Initial

data/README.md

@@ -73,6 +73,7 @@ pp Hm.new(weather)
   invented on the road, but may not work for yours;
 * Most of the methods work on Arrays and Hashes, but not on `Struct` and `OpenStruct` (which are
   `dig`-able in Ruby), though, base `#dig` and `#dig!` should work on them too;
+* `Hm(hash).dig(...)` works even on versions of Ruby before 2.3 (when native `#dig` was introduced);
 * API is subject to polish and change in future.
 
 ## Usage

data/lib/hm.rb

@@ -475,7 +475,9 @@ class Hm
   end
 end
 
+require_relative 'hm/version'
 require_relative 'hm/algo'
+require_relative 'hm/dig'
 
 # Shortcut for {Hm}.new
 def Hm(hash) # rubocop:disable Naming/MethodName

data/lib/hm/algo.rb

@@ -24,31 +24,25 @@ class Hm
       end
     end
 
-    def to_pairs(collection)
-      case
-      when collection.respond_to?(:each_pair)
-        collection.each_pair.to_a
-      when collection.respond_to?(:each)
-        collection.each_with_index.to_a.map(&:reverse)
-      else
-        fail TypeError, "Can't dig/* in #{collection.class}"
-      end
-    end
-
-    # Enumerates through entire collection with "current key/current values" at each point, even
+    # Enumerates through entire collection with "current key/current value" at each point, even
     # if elements are deleted in a process of enumeration
     def robust_enumerator(collection)
-      return to_pairs(collection) if collection.is_a?(Hash)
-
-      # Only Arrays need this kind of trickery
-      Enumerator.new do |y|
-        cur = collection.size
-        until cur.zero?
-          pairs = to_pairs(collection)
-          pos = pairs.size - cur
-          y << pairs[pos]
-          cur -= 1
+      case collection
+      when Hash, Struct
+        collection.each_pair.to_a
+      when Array
+        Enumerator.new do |y|
+          cur = collection.size
+          until cur.zero?
+            pos = collection.size - cur
+            y << [pos, collection[pos]]
+            cur -= 1
+          end
         end
+      when ->(c) { c.respond_to?(:each_pair) }
+        collection.each_pair.to_a
+      else
+        fail TypeError, "Can't dig/* in #{collection.class}"
       end
     end
 
@@ -60,7 +54,7 @@ class Hm
     end
 
     def visit(what, rest, path = [], not_found: ->(*) {}, &found)
-      what.respond_to?(:dig) or fail TypeError, "#{what.class} is not diggable"
+      Dig.diggable?(what) or fail TypeError, "#{what.class} is not diggable"
 
       key, *rst = rest
       if key == WILDCARD
@@ -73,7 +67,7 @@ class Hm
     def visit_all(what, path = [], &block)
       robust_enumerator(what).each do |key, val|
         yield(what, [*path, key], val)
-        visit_all(val, [*path, key], &block) if val.respond_to?(:dig)
+        visit_all(val, [*path, key], &block) if Dig.diggable?(val)
       end
     end
 
@@ -87,7 +81,7 @@ class Hm
     end
 
     def visit_regular(what, key, rest, path, found:, not_found:) # rubocop:disable Metrics/ParameterLists
-      internal = what.dig(key) or return not_found.(what, [*path, key], rest)
+      internal = Dig.dig(what, key) or return not_found.(what, [*path, key], rest)
       rest.empty? and return found.(what, [*path, key], internal)
       visit(internal, rest, [*path, key], not_found: not_found, &found)
     end

data/lib/hm/dig.rb

@@ -0,0 +1,19 @@
+class Hm
+  # @private
+  module Dig
+    # TODO: Struct/OpenStruct are also diggable in Ruby core, can be added for future implementation
+    DIGGABLE_CLASSES = [Hash, Array].freeze
+
+    def self.dig(what, *keys)
+      return what.dig(*keys) if what.respond_to?(:dig)
+
+      diggable?(what) or fail TypeError, "#{value.class} is not diggable"
+      value = what[keys.shift]
+      value.nil? || keys.empty? ? value : dig(value, *keys)
+    end
+
+    def self.diggable?(what)
+      DIGGABLE_CLASSES.include?(what.class)
+    end
+  end
+end

data/lib/hm/version.rb

@@ -0,0 +1,7 @@
+class Hm
+  MAJOR = 0
+  MINOR = 0
+  PATCH = 2
+  PRE = nil
+  VERSION = [MAJOR, MINOR, PATCH, PRE].compact.join('.')
+end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: hm
 version: !ruby/object:Gem::Version
-  version: 0.0.1
+  version: 0.0.2
 platform: ruby
 authors:
 - Victor Shepelev
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2018-02-17 00:00:00.000000000 Z
+date: 2018-02-24 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: yard
@@ -178,6 +178,20 @@ dependencies:
     - - ">="
       - !ruby/object:Gem::Version
         version: '0'
+- !ruby/object:Gem::Dependency
+  name: ruby-prof
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
 description: |2
       Hm is a library for clean, idiomatic and chainable processing of complicated Ruby structures,
       typically unpacked from JSON. It provides smart dig and bury, keys replacement,
@@ -187,10 +201,13 @@ executables: []
 extensions: []
 extra_rdoc_files: []
 files:
+- CHANGELOG.md
 - LICENSE.txt
 - README.md
 - lib/hm.rb
 - lib/hm/algo.rb
+- lib/hm/dig.rb
+- lib/hm/version.rb
 homepage: https://github.com/zverok/hm
 licenses:
 - MIT
@@ -203,7 +220,7 @@ required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
     - !ruby/object:Gem::Version
-      version: 2.3.0
+      version: 2.1.0
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="