forester 0.0.2 → 0.0.3

Sign up to get free protection for your applications and to get access to all the features.
checksums.yaml CHANGED
@@ -1,7 +1,7 @@
1
1
  ---
2
2
  SHA1:
3
- metadata.gz: 4a4e20df16f585d00c1a95192215a8d887140273
4
- data.tar.gz: 888ae8d298b84192f43cb6b1c4eabef4c1bfa241
3
+ metadata.gz: fcfc3389bc5fe3a2609c7dbcf6505f6dd60bb36b
4
+ data.tar.gz: 9ca2ed003e0dd1458ecca549dbeaa61c647def33
5
5
  SHA512:
6
- metadata.gz: 975ac6670f42492209f6884a9f4a353a5cce36ad04443f96e8aee398ac4a0824cfbe7711c75d3a04bb62bd2f0140fa357958e76ac3e206d950d389b05a7d7265
7
- data.tar.gz: 1c0a9bcc4d165439e67582f680c85cc022678ce8db8a02a00c15f53497814e6dd3a17f24c1ee7d0b7d433eb8b07d00623765433446b985767764aac1ec1cc8b9
6
+ metadata.gz: e85ee1ca2deb3d74be6d3fb99bbe03291ff4977f15578ac64cc1df8f615c0719572ff014b27093bc645783ce9790a33bee5173aae86979899516a09f3a514639
7
+ data.tar.gz: 48b41a81e8d71cbab0c97d02f19072d4a2945bdb9f233d924d61b136ce6f497862534bb115cb4fee11376194e1ff4b03a7ca50908019d41dd0b580a2d98ca47e
data/forester.gemspec CHANGED
@@ -19,6 +19,8 @@ Gem::Specification.new do |s|
19
19
  s.test_files = s.files.grep(%r{^(test|spec|features)/})
20
20
  s.require_paths = ['lib']
21
21
 
22
+ s.required_ruby_version = '>= 1.9.2'
23
+
22
24
  s.add_runtime_dependency 'rubytree', ['~> 0.9']
23
25
  s.add_runtime_dependency 'enzymator', ['~> 0.0']
24
26
 
@@ -19,7 +19,7 @@ module Forester
19
19
  end
20
20
 
21
21
  def each_level
22
- breadth_each.slice_when { |prev_node, next_node| prev_node.level < next_node.level }
22
+ breadth_each.slice_before { |node| !node.is_last_sibling? }
23
23
  end
24
24
 
25
25
  def get(field, &block)
@@ -2,7 +2,7 @@ module Forester
2
2
  class Version
3
3
  MAJOR = 0
4
4
  MINOR = 0
5
- PATCH = 2
5
+ PATCH = 3
6
6
  PRE = nil
7
7
 
8
8
  class << self
@@ -12,6 +12,16 @@ class TreeNodeTest < Minitest::Test
12
12
 
13
13
  assert_equal (0..9).reduce(:+), tree.reduce(0) { |acum, node| acum + node.get('value') }
14
14
 
15
+ expected_levels = [
16
+ ["root"],
17
+ ["First node of level 1", "Second node of level 1"],
18
+ ["First node of level 2", "Second node of level 2", "Third node of level 2"],
19
+ ["First node of level 3", "Second node of level 3"],
20
+ ["First node of level 4", "Second node of level 4"]
21
+ ]
22
+
23
+ assert_equal expected_levels, tree.each_level.map { |level| level.map { |n| n.get('name') } }.to_a
24
+
15
25
  expected = {
16
26
  ["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"],
17
27
  ["First node of level 1", "Second node of level 2"] => ["I have a sibling to my left", "She wants to catch them all"],
@@ -38,7 +38,7 @@ root:
38
38
  children:
39
39
  - name: First node of level 4
40
40
  value: 8
41
- - name: Second child of level 3
41
+ - name: Second node of level 4
42
42
  value: 9
43
43
  strings:
44
44
  - Could forester handle trees with hundreds of levels?
metadata CHANGED
@@ -1,7 +1,7 @@
1
1
  --- !ruby/object:Gem::Specification
2
2
  name: forester
3
3
  version: !ruby/object:Gem::Version
4
- version: 0.0.2
4
+ version: 0.0.3
5
5
  platform: ruby
6
6
  authors:
7
7
  - Eugenio Bruno
@@ -114,7 +114,7 @@ required_ruby_version: !ruby/object:Gem::Requirement
114
114
  requirements:
115
115
  - - ">="
116
116
  - !ruby/object:Gem::Version
117
- version: '0'
117
+ version: 1.9.2
118
118
  required_rubygems_version: !ruby/object:Gem::Requirement
119
119
  requirements:
120
120
  - - ">="