hash-tree 0.0.2 → 0.0.3

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: c92972764199548bb71f2e92dbe36e12664e5b21
+  data.tar.gz: ad4c922293c7d57e916ec3c878f83a3425cafd64
+SHA512:
+  metadata.gz: b9fc07836a7a8937e1dd0dfe691b3ec574240ac0ada34efc425ca072bf5e8dc46a0fd84f77af93ac8b39081f8f1a07c598b0f36efe4a40d6c83ac8f78b9833ec
+  data.tar.gz: c3628f1a3d83242e4e52ebc7a0d22f53f296437f16141e6104dd84f3080163ebb8cd45599093c8a21d5526744ec1abe3c17e15b82771f4d5c5a9af351c7f1bac

data/lib/hash-tree.rb

@@ -99,6 +99,38 @@ class HashTree
     end
   end
 
+  # Takes a path (keys separated by dots) and yield an hash of the parents of all level (ascendants) up to the root, along with the value of the path.
+  def each_node(path, options={}, &block)
+    options = { :hash => @hash, :key_path => [], :parents => {} }.merge(options)
+    return unless path && !path.empty?
+
+    all_keys = path.split('.')
+    keys = all_keys[options[:key_path].size..-1]
+    key = keys.shift
+    key_path = [options[:key_path], key].flatten
+    key_path_string = key_path.join('.')
+    value = options[:hash][key]
+
+    if value
+      parents = options[:parents].merge(Hash[key_path_string, options[:hash]])
+
+      # Go no further?
+      if (key_path == all_keys)
+        yield parents, value
+      else
+        if value.kind_of? Array
+          value.each do |item|
+            if item.kind_of? Hash
+              each_node(path, {:hash => item, :key_path => key_path, :parents => parents}, &block)
+            end
+          end
+        elsif value.kind_of? Hash
+          each_node(path, {:hash => value, :key_path => key_path, :parents => parents}, &block)
+        end
+      end
+    end
+  end
+
   def empty?
     @hash.empty?
   end

data/spec/hash-tree_spec.rb

@@ -95,8 +95,101 @@ describe HashTree do
     end
   end
 
+  # nodes are considered nodes when no more hash can be found in the child
   describe "#each" do
-    pending 'TOTEST'
+    subject do
+      HashTree.new({ 'n1' => [
+          { 'l11' => '' },
+          { 'l12' => '', 'n11' => ['l111', 'l112'] },
+          { 'l13' => '', 'n12' => [{'l121' => '', 'l122' => ''}, {}] },
+          {              'n13' => {
+                                    'n131' => {
+                                                'n1311' => ['l311'], 'n1312' => {'l31121' => '', 'n13121' => ['l3121']}
+                                              }
+                                  }
+          }
+        ]})
+    end
+    
+    it { expect { |b| subject.each(&b) }.to yield_successive_args(
+      [{"l11"=>""}, "l11", "", "n1.l11"],
+      [{"l12"=>"", "n11"=>["l111", "l112"]}, "l12", "", "n1.l12"],
+      [{"l12"=>"", "n11"=>["l111", "l112"]}, "n11", "l111", "n1.n11"],
+      [{"l12"=>"", "n11"=>["l111", "l112"]}, "n11", "l112", "n1.n11"],
+      [{"l13"=>"", "n12"=>[{"l121"=>"", "l122"=>""}, {}]}, "l13", "", "n1.l13"],
+      [{"l121"=>"", "l122"=>""}, "l121", "", "n1.n12.l121"],
+      [{"l121"=>"", "l122"=>""}, "l122", "", "n1.n12.l122"],
+      [{"n1311"=>["l311"], "n1312"=>{"l31121"=>"", "n13121"=>["l3121"]}}, "n1311", "l311", "n1.n13.n131.n1311"],
+      [{"l31121"=>"", "n13121"=>["l3121"]}, "l31121", "", "n1.n13.n131.n1312.l31121"],
+      [{"l31121"=>"", "n13121"=>["l3121"]}, "n13121", "l3121", "n1.n13.n131.n1312.n13121"]
+    )}
+  end
+
+  describe "#each_node" do
+    let!(:first_a1) { { 'a11' => 'a111' } }
+    let!(:second_a1) { { 'a11' => 'a112', 'b11' => ['b111', 'b1112'] } }
+
+    let!(:third_a1_first_b11) { {'b111' => 'b31111', 'b112' => 'b31112'} }
+    let!(:third_a1_second_b11) { {'b111' => 'b31113'} }
+    let!(:third_a1) { { 'a11' => 'a113', 'b11' => [third_a1_first_b11, third_a1_second_b11] } }
+
+    let!(:fourth_a1_first_b11) { {'b111' => 'b41111', 'b112' => 'b41112'} }
+    let!(:fourth_a1) { { 'a11' => 'a114', 'b11' => [fourth_a1_first_b11, {}, ['b112'], 'b112', 5] } }
+    
+    let!(:a1) { [first_a1, second_a1, third_a1, fourth_a1] }
+    let!(:first_b1111) { { 'b1111' => 'b11111' } }
+    let!(:second_b1111) { { 'b1111' => 'b11112' } }
+    let!(:b11) { { 'b111' => [first_b1111, second_b1111] } }
+    let!(:b1) { { 'b11' =>  b11 } }
+
+    let!(:tree) { { 'a1' => a1, 'b1' => b1 } }
+
+    subject { HashTree.new(tree) }
+
+    it { expect { |b| subject.each_node(nil, &b) }.to_not yield_control }
+    it { expect { |b| subject.each_node('', &b) }.to_not yield_control }
+    it { expect { |b| subject.each_node('doesnotexist', &b) }.to_not yield_control }
+    it { expect { |b| subject.each_node('does.not.exist', &b) }.to_not yield_control }
+    it { expect { |b| subject.each_node('a1.doesnotexist', &b) }.to_not yield_control }
+
+    # a node is not a leaf
+    it { expect { |b| subject.each_node('a1.a11.a111', &b) }.to_not yield_control }
+
+
+    it { expect { |b| subject.each_node('a1', &b) }.to yield_successive_args(
+      [{'a1' => tree}, a1]
+    )}   
+
+    it { expect { |b| subject.each_node('a1.a11', &b) }.to yield_successive_args(
+      [{'a1' => tree, 'a1.a11' => first_a1}, 'a111'],
+      [{'a1' => tree, 'a1.a11' => second_a1}, 'a112'],
+      [{'a1' => tree, 'a1.a11' => third_a1}, 'a113'],
+      [{'a1' => tree, 'a1.a11' => fourth_a1}, 'a114']
+    )}
+
+    it { expect { |b| subject.each_node('a1.b11', &b) }.to yield_successive_args(
+      [{'a1' => tree, 'a1.b11' => second_a1}, ['b111', 'b1112']],
+      [{'a1' => tree, 'a1.b11' => third_a1}, [third_a1_first_b11, third_a1_second_b11]],
+      [{'a1' => tree, 'a1.b11' => fourth_a1}, [fourth_a1_first_b11, {}, ['b112'], 'b112', 5]]
+    )}
+
+    it { expect { |b| subject.each_node('a1.b11.b111', &b) }.to yield_successive_args(
+      [{'a1' => tree, 'a1.b11' => third_a1, 'a1.b11.b111' => third_a1_first_b11}, 'b31111'],
+      [{'a1' => tree, 'a1.b11' => third_a1, 'a1.b11.b111' => third_a1_second_b11}, 'b31113'],
+      [{'a1' => tree, 'a1.b11' => fourth_a1, 'a1.b11.b111' => fourth_a1_first_b11}, 'b41111']
+    )}
+
+    it { expect { |b| subject.each_node('b1', &b) }.to yield_successive_args(
+      [{'b1' => tree}, b1]
+    )}
+
+    it { expect { |b| subject.each_node('b1.b11', &b) }.to yield_successive_args(
+      [{'b1' => tree, 'b1.b11' => b1}, b11]
+    )}
+
+    it { expect { |b| subject.each_node('b1.b11.b111', &b) }.to yield_successive_args(
+      [{'b1' => tree, 'b1.b11' => b1, 'b1.b11.b111' => b11}, [first_b1111, second_b1111]]
+    )}
   end
 
   describe "#empty?" do

metadata

@@ -1,93 +1,99 @@
 --- !ruby/object:Gem::Specification
 name: hash-tree
 version: !ruby/object:Gem::Version
-  version: 0.0.2
-  prerelease: 
+  version: 0.0.3
 platform: ruby
 authors:
 - Sebastien Rosa
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2012-04-16 00:00:00.000000000 Z
+date: 2014-04-07 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: json
-  requirement: &2152834740 !ruby/object:Gem::Requirement
-    none: false
+  requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - ">="
       - !ruby/object:Gem::Version
         version: 1.5.0
   type: :runtime
   prerelease: false
-  version_requirements: *2152834740
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 1.5.0
 - !ruby/object:Gem::Dependency
   name: ya2yaml
-  requirement: &2152834220 !ruby/object:Gem::Requirement
-    none: false
+  requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - ">="
       - !ruby/object:Gem::Version
         version: '0.30'
   type: :runtime
   prerelease: false
-  version_requirements: *2152834220
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0.30'
 - !ruby/object:Gem::Dependency
   name: nori
-  requirement: &2152833680 !ruby/object:Gem::Requirement
-    none: false
+  requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - "~>"
       - !ruby/object:Gem::Version
         version: 1.1.0
   type: :runtime
   prerelease: false
-  version_requirements: *2152833680
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 1.1.0
 - !ruby/object:Gem::Dependency
   name: rake
-  requirement: &2152832920 !ruby/object:Gem::Requirement
-    none: false
+  requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - ">="
       - !ruby/object:Gem::Version
         version: 0.8.7
   type: :development
   prerelease: false
-  version_requirements: *2152832920
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 0.8.7
 - !ruby/object:Gem::Dependency
   name: rspec
-  requirement: &2152831900 !ruby/object:Gem::Requirement
-    none: false
+  requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - ">="
       - !ruby/object:Gem::Version
         version: '2.0'
   type: :development
   prerelease: false
-  version_requirements: *2152831900
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '2.0'
 - !ruby/object:Gem::Dependency
   name: rspec-aspic
-  requirement: &2152830840 !ruby/object:Gem::Requirement
-    none: false
+  requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - ">="
       - !ruby/object:Gem::Version
         version: 0.0.2
   type: :development
   prerelease: false
-  version_requirements: *2152830840
-- !ruby/object:Gem::Dependency
-  name: rspec-compact-doc-formatter
-  requirement: &2152830140 !ruby/object:Gem::Requirement
-    none: false
+  version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - ">="
       - !ruby/object:Gem::Version
-        version: 0.0.3
-  type: :development
-  prerelease: false
-  version_requirements: *2152830140
+        version: 0.0.2
 description: HashTree help you to work with nested hashes and arrays.
 email:
 - sebastien@demarque.com
@@ -97,6 +103,10 @@ extra_rdoc_files:
 - LICENSE
 - README.md
 files:
+- Gemfile
+- LICENSE
+- README.md
+- Rakefile
 - lib/hash-tree.rb
 - spec/fixtures/book.json
 - spec/fixtures/books.json
@@ -105,33 +115,29 @@ files:
 - spec/hash-tree_spec.rb
 - spec/spec_helper.rb
 - spec/support/application_helpers.rb
-- LICENSE
-- README.md
-- Rakefile
-- Gemfile
 homepage: https://github.com/demarque/hash-tree
 licenses:
 - MIT
+metadata: {}
 post_install_message: 
 rdoc_options: []
 require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
-  none: false
   requirements:
-  - - ! '>='
+  - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 required_rubygems_version: !ruby/object:Gem::Requirement
-  none: false
   requirements:
-  - - ! '>='
+  - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
 rubyforge_project: hash-tree
-rubygems_version: 1.8.17
+rubygems_version: 2.2.1
 signing_key: 
-specification_version: 3
+specification_version: 4
 summary: Manage nested hash
 test_files: []
+has_rdoc: