tree_graph 0.2.1 → 0.2.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: ab015d3d94eff12b6296b6e1525c1834aaa93993
-  data.tar.gz: 2aef11ef5ecc266b6f222b1ac2174d1cf109e1b1
+  metadata.gz: e8ea278383e74d9eee8b9ba0af8fd71c6285195e
+  data.tar.gz: 2438160903879f555690e1b014ed90ed1973eb1e
 SHA512:
-  metadata.gz: 7aa9c7f03dc01db31e7bf558183b3127e222367cee62cadd47107ba43deb6285d9e398f61905c34792a331a3e10c5b97c8ac739530b19b9b5e36911be6344628
-  data.tar.gz: 94fa4cdc237b6a8ef0f765e158d09c1784c643506f9abb07c4fd2ad7de63da96fdb28e31b957d3e1a47124f46f485e66f65b148cc197c325b594419bf3f230f0
+  metadata.gz: 6878272b7f685894423acaa61669f19764b2d19ea839a285862c469ff96a7cfa81182736efe51103268c853440cdae4172f7b7d61d86219baaa02512086c7244
+  data.tar.gz: c5dd31ce5378959315c04ae121a04b95e6b92bb7cb3b6f0bd3ebbbe7334bf779b6c43162a34589fd379ffae7eb26a9b0bdb8ceef2e137572fc61de36c4d7fd6e

data/README.md

@@ -20,7 +20,7 @@ Or install it yourself as:
 
 ## Usage
 
-In Node class, `include TreeGraph`, then implement two methods, `label_for_tree_graph` and `children_for_tree_graph`(which return thing responds to `each`). Then you can call `tree_graph` and `tree_graph_bottom_up` on that Node object.
+In Node class, `include TreeGraph`, then implement two methods, `label_for_tree_graph` and `children_for_tree_graph`(which return thing responds to `each`). Then you can call `tree_graph`, `tree_graph_bottom_up` and `tree_graph_bottom_up_in_same_order` on that Node object.
 
 Or checkout [test/tree_graph_test.rb](https://github.com/turnon/tree_graph/blob/master/test/tree_graph_test.rb) to see how to use.
 

data/lib/tree_graph.rb

@@ -10,6 +10,10 @@ module TreeGraph
     BottomUp.new(self).tree_graph
   end
 
+  def tree_graph_bottom_up_in_same_order
+    BottomUpInSameOrder.new(self).tree_graph
+  end
+
   module Node
 
     attr_accessor :is_last
@@ -20,13 +24,15 @@ module TreeGraph
     end
 
     def children_nodes
-      children = []
-      raw_node.children_for_tree_graph.each do |c|
-        children << self.class.new(c, self)
+      children.map do |c|
+        self.class.new(c, self)
+      end.tap do |nodes|
+        nodes.last.is_last = true unless nodes.empty?
       end
-      return children if children.empty?
-      children.last.is_last = true
-      children
+    end
+
+    def children
+      raw_node.children_for_tree_graph
     end
 
     def level
@@ -79,4 +85,10 @@ module TreeGraph
       is_last ? '┌─' : '├─'
     end
   end
+
+  class BottomUpInSameOrder < BottomUp
+    def children
+      super.reverse
+    end
+  end
 end

data/lib/tree_graph/version.rb

@@ -1,3 +1,3 @@
 module TreeGraph
-  VERSION = "0.2.1"
+  VERSION = "0.2.2"
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: tree_graph
 version: !ruby/object:Gem::Version
-  version: 0.2.1
+  version: 0.2.2
 platform: ruby
 authors:
 - ken
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2017-04-28 00:00:00.000000000 Z
+date: 2017-04-29 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler