forester 0.0.2 → 0.0.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 4a4e20df16f585d00c1a95192215a8d887140273
-  data.tar.gz: 888ae8d298b84192f43cb6b1c4eabef4c1bfa241
+  metadata.gz: fcfc3389bc5fe3a2609c7dbcf6505f6dd60bb36b
+  data.tar.gz: 9ca2ed003e0dd1458ecca549dbeaa61c647def33
 SHA512:
-  metadata.gz: 975ac6670f42492209f6884a9f4a353a5cce36ad04443f96e8aee398ac4a0824cfbe7711c75d3a04bb62bd2f0140fa357958e76ac3e206d950d389b05a7d7265
-  data.tar.gz: 1c0a9bcc4d165439e67582f680c85cc022678ce8db8a02a00c15f53497814e6dd3a17f24c1ee7d0b7d433eb8b07d00623765433446b985767764aac1ec1cc8b9
+  metadata.gz: e85ee1ca2deb3d74be6d3fb99bbe03291ff4977f15578ac64cc1df8f615c0719572ff014b27093bc645783ce9790a33bee5173aae86979899516a09f3a514639
+  data.tar.gz: 48b41a81e8d71cbab0c97d02f19072d4a2945bdb9f233d924d61b136ce6f497862534bb115cb4fee11376194e1ff4b03a7ca50908019d41dd0b580a2d98ca47e

data/forester.gemspec

@@ -19,6 +19,8 @@ Gem::Specification.new do |s|
   s.test_files    = s.files.grep(%r{^(test|spec|features)/})
   s.require_paths = ['lib']
 
+  s.required_ruby_version = '>= 1.9.2'
+
   s.add_runtime_dependency 'rubytree', ['~> 0.9']
   s.add_runtime_dependency 'enzymator', ['~> 0.0']
 

data/lib/forester/tree_node.rb

@@ -19,7 +19,7 @@ module Forester
     end
 
     def each_level
-      breadth_each.slice_when { |prev_node, next_node| prev_node.level < next_node.level }
+      breadth_each.slice_before { |node| !node.is_last_sibling? }
     end
 
     def get(field, &block)

data/lib/forester/version.rb

@@ -2,7 +2,7 @@ module Forester
   class Version
     MAJOR = 0
     MINOR = 0
-    PATCH = 2
+    PATCH = 3
     PRE = nil
 
     class << self

data/test/test_treenode.rb

@@ -12,6 +12,16 @@ class TreeNodeTest < Minitest::Test
 
     assert_equal (0..9).reduce(:+), tree.reduce(0) { |acum, node| acum + node.get('value') }
 
+    expected_levels = [
+                        ["root"],
+                        ["First node of level 1", "Second node of level 1"],
+                        ["First node of level 2", "Second node of level 2", "Third node of level 2"],
+                        ["First node of level 3", "Second node of level 3"],
+                        ["First node of level 4", "Second node of level 4"]
+                      ]
+
+    assert_equal expected_levels, tree.each_level.map { |level| level.map { |n| n.get('name') } }.to_a
+
     expected = {
       ["First node of level 1", "First node of level 2"]  => ["Already in level 2", "I want to be the very best", "like no one ever was"],
       ["First node of level 1", "Second node of level 2"] => ["I have a sibling to my left", "She wants to catch them all"],

data/test/trees/simple_tree.yml

@@ -38,7 +38,7 @@ root:
         children:
         - name: First node of level 4
           value: 8
-        - name: Second child of level 3
+        - name: Second node of level 4
           value: 9
           strings:
             - Could forester handle trees with hundreds of levels?

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: forester
 version: !ruby/object:Gem::Version
-  version: 0.0.2
+  version: 0.0.3
 platform: ruby
 authors:
 - Eugenio Bruno
@@ -114,7 +114,7 @@ required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
     - !ruby/object:Gem::Version
-      version: '0'
+      version: 1.9.2
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="