tree_graph 0.2.0 → 0.2.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: ae297d2b5265ef94e73403efb35c9fd1a7348737
-  data.tar.gz: 4fa3803abbc5a6d6509313dc5f2e3ff631c1db89
+  metadata.gz: ab015d3d94eff12b6296b6e1525c1834aaa93993
+  data.tar.gz: 2aef11ef5ecc266b6f222b1ac2174d1cf109e1b1
 SHA512:
-  metadata.gz: d89095d952e52da07dbae183425cb73ae3223597a9a67800e24d97a60ea7aec3b68af1233eb0d7aaa2bc1785f0bedcd48c76966c027e019c471ca59b974b2d43
-  data.tar.gz: f868060e3bc62449d4e3bff34631c0a20df41de532678f4e2a93a5830822bb4fb856c032586682b65a2362b92197e3c94be8dd23a28a9d1dccc652d0d8ade22d
+  metadata.gz: 7aa9c7f03dc01db31e7bf558183b3127e222367cee62cadd47107ba43deb6285d9e398f61905c34792a331a3e10c5b97c8ac739530b19b9b5e36911be6344628
+  data.tar.gz: 94fa4cdc237b6a8ef0f765e158d09c1784c643506f9abb07c4fd2ad7de63da96fdb28e31b957d3e1a47124f46f485e66f65b148cc197c325b594419bf3f230f0

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` 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` and `tree_graph_bottom_up` 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

@@ -3,10 +3,14 @@ require "tree_graph/version"
 module TreeGraph
 
   def tree_graph
-    Node.new(self).tree_graph
+    TopDown.new(self).tree_graph
   end
 
-  class Node
+  def tree_graph_bottom_up
+    BottomUp.new(self).tree_graph
+  end
+
+  module Node
 
     attr_accessor :is_last
     attr_reader :raw_node, :parent
@@ -15,16 +19,10 @@ module TreeGraph
       @raw_node, @parent, @is_last = raw_node, parent, false
     end
 
-    def tree_graph
-      ([level] +
-       children_nodes.map(&:tree_graph)
-      ).join("\n")
-    end
-
     def children_nodes
       children = []
       raw_node.children_for_tree_graph.each do |c|
-        children << Node.new(c, self)
+        children << self.class.new(c, self)
       end
       return children if children.empty?
       children.last.is_last = true
@@ -35,16 +33,15 @@ module TreeGraph
       [indent, branch, raw_node.label_for_tree_graph].join
     end
 
+    def levels
+      [level] + children_nodes.map(&:tree_graph)
+    end
+
     def ancestors
       return [] unless parent
       parent.ancestors + [parent]
     end
 
-    def branch
-      return '' unless parent
-      is_last ? '└─' : '├─'
-    end
-
     def indent
       ancestors.map do |a|
         unless a.parent
@@ -56,4 +53,30 @@ module TreeGraph
     end
 
   end
+
+  class TopDown
+    include Node
+
+    def tree_graph
+      levels.join("\n")
+    end
+
+    def branch
+      return '' unless parent
+      is_last ? '└─' : '├─'
+    end
+  end
+
+  class BottomUp
+    include Node
+
+    def tree_graph
+      levels.reverse.join("\n")
+    end
+
+    def branch
+      return '' unless parent
+      is_last ? '┌─' : '├─'
+    end
+  end
 end

data/lib/tree_graph/version.rb

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

metadata

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