tree_graph 0.2.0 → 0.2.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
-SHA1:
-  metadata.gz: ae297d2b5265ef94e73403efb35c9fd1a7348737
-  data.tar.gz: 4fa3803abbc5a6d6509313dc5f2e3ff631c1db89
+SHA256:
+  metadata.gz: b955eb6cbbadd1046da5a1b57d0e309e1409a7383a0f1eb139a4d9a8796c2a1c
+  data.tar.gz: e597fd6a7e69411b2da4a59314fca704f3c19ecffe35b58c51b4c73c1db19a9e
 SHA512:
-  metadata.gz: d89095d952e52da07dbae183425cb73ae3223597a9a67800e24d97a60ea7aec3b68af1233eb0d7aaa2bc1785f0bedcd48c76966c027e019c471ca59b974b2d43
-  data.tar.gz: f868060e3bc62449d4e3bff34631c0a20df41de532678f4e2a93a5830822bb4fb856c032586682b65a2362b92197e3c94be8dd23a28a9d1dccc652d0d8ade22d
+  metadata.gz: ea5e1e665570c6cb644024ea8b763733c601d844c3afc42ce514ff464cf4222716cfb2e7b065b241885e0b308dfedcb1a29e447be5b057a151dbe18c6e5e2ba5
+  data.tar.gz: 3ce2e2b287dc19265f2fcc14358fc0dd5925864a6f0141148a471a435e2641457c39fc4457b8dbc56b9055e11454fa4346b2fdb86495db98a119a0674866a627

data/.gitignore

@@ -9,3 +9,4 @@
 /tmp/
 *.swp
 *.gem
+.tool-versions

data/README.md

@@ -20,7 +20,9 @@ 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`, `tree_graph_bottom_up` and `tree_graph_bottom_up_in_same_order` on that Node object.
+
+By default, `::Object#label_for_tree_graph` call `to_s`, and `::Object#children_for_tree_graph` return empty array.
 
 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/version.rb

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

data/lib/tree_graph.rb

@@ -3,10 +3,30 @@ 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
+
+  def tree_graph_bottom_up_in_same_order
+    BottomUpInSameOrder.new(self).tree_graph
+  end
+
+  EMPTY_ARRAY = []
+
+  class ::Object
+    def label_for_tree_graph
+      to_s
+    end
+
+    def children_for_tree_graph
+      EMPTY_ARRAY
+    end
+  end
+
+  module Node
 
     attr_accessor :is_last
     attr_reader :raw_node, :parent
@@ -15,34 +35,29 @@ 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.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
       [indent, branch, raw_node.label_for_tree_graph].join
     end
 
-    def ancestors
-      return [] unless parent
-      parent.ancestors + [parent]
+    def levels
+      [level] + children_nodes.map(&:tree_graph)
     end
 
-    def branch
-      return '' unless parent
-      is_last ? '└─' : '├─'
+    def ancestors
+      return EMPTY_ARRAY unless parent
+      parent.ancestors + [parent]
     end
 
     def indent
@@ -56,4 +71,36 @@ 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
+
+  class BottomUpInSameOrder < BottomUp
+    def children
+      super.reverse
+    end
+  end
 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.3
 platform: ruby
 authors:
 - ken
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2017-02-20 00:00:00.000000000 Z
+date: 2022-05-21 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -89,8 +89,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubyforge_project: 
-rubygems_version: 2.6.8
+rubygems_version: 3.1.6
 signing_key: 
 specification_version: 4
 summary: A mixin to help you generate tree graph