foobara-util 0.0.7 → 0.0.8

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 85a512d24b80d3764d64162a9a0307980b4c5b4208fd446ca5eb61e45c12e9d7
-  data.tar.gz: 1830f90dc6c33596d1a66c4971f148ebbb16846e2d1bb07340598ecc2ff38908
+  metadata.gz: f28088a767f0c73ceb7c9bdbe17633935233872900c51bc17a6815e3b2b6e802
+  data.tar.gz: a477c70c401057348f9c3539ffb26e5927ab3b128b51d2c1bba65c64d1fa7432
 SHA512:
-  metadata.gz: aa086713f6a0d871cd43d1884d66b1c009073853cdcaabbbee1b6b2c5099b08c34652dde426030d868267307313df912b549965d40a1d3d07c1724534e716304
-  data.tar.gz: 8a1e198c1b944adc46a54d67981bd724b19e206fec5395eca350a0dffa4a6ab996eb2ad339cb379ec76848d00d41f36c148fcefe6b7ae3ecfe48a5dc53e2365a
+  metadata.gz: b914e2155dcd1b0b4b7dff98555f68cd63b185e6d687b9f6402006b94ab56f572a3322e770f92f163f8ff4dd34e591e0e5e9bb4ec9a75ef7261153f76e7b478d
+  data.tar.gz: 194304d9e788206cb754450244a9b9de6fdec23bbe49ae5534f12f9718669c02027d9cc0c5bbd42208ab7317e7edc5d01a9929e7a2f8db30d77dd57787737ae3

data/CHANGELOG.md

@@ -1,3 +1,7 @@
+## [0.0.8] - 2024-12-05
+
+* Add .print_tree for displaying dependencies/graphs via ASCII art
+
 ## [0.0.7] - 2024-11-30
 
 * Handle kebab-cased strings as expected in .classify

data/lib/foobara/util/tree.rb

@@ -0,0 +1,144 @@
+module Foobara
+  module Util
+    class SubTree
+      attr_accessor :value, :parent_tree, :to_parent
+
+      def initialize(value, to_parent = nil, &block)
+        self.value = value
+        self.to_parent = to_parent.nil? ? block : to_parent.to_proc
+      end
+
+      def root?
+        parent_tree.is_a?(Tree)
+      end
+
+      def children_trees
+        @children_trees ||= []
+      end
+
+      def add(object)
+        return if include?(object)
+
+        parent = to_parent.call(object)
+
+        parent_node = if parent
+                        node_for(parent) || add(parent)
+                      else
+                        self
+                      end
+
+        child_tree = SubTree.new(object, to_parent)
+        child_tree.parent_tree = parent_node
+        parent_node.children_trees << child_tree
+
+        child_tree
+      end
+
+      def node_for(value)
+        return self if value == self.value
+
+        children_trees.each do |child|
+          node = child.node_for(value)
+          return node if node
+        end
+
+        nil
+      end
+
+      def include?(value)
+        !!node_for(value)
+      end
+
+      # TODO: try to break this up a bit
+      def to_s(to_name, padding: "", last_child: true)
+        output = StringIO.new
+        name = to_name.call(value)
+
+        padding = puts_box(output, name, padding, last_child)
+
+        children = children_trees.sort_by { |child_tree| to_name.call(child_tree.value) }
+        last = children.last
+
+        children.each do |child_tree|
+          output.puts child_tree.to_s(to_name, padding:, last_child: child_tree == last)
+        end
+
+        output.string
+      end
+
+      private
+
+      def puts_box(output, name, padding, last_child)
+        name_size = name.size + 1
+        name_size_left = name_size / 2
+        name_size_right = name_size - name_size_left
+
+        bottom_connector = children_trees.any? ? "┬" : "─"
+
+        if root?
+          output.puts "╭#{"─" * (name.size + 2)}╮"
+          output.puts "│ #{name} │"
+          output.puts "╰#{"─" * name_size_left}#{bottom_connector}#{"─" * name_size_right}╯"
+        else
+          padding += " "
+
+          connector = last_child ? "└" : "├"
+          padding_end = last_child ? "  " : "│ "
+
+          output.print padding
+          output.print "│ "
+
+          output.puts "╭#{"─" * (name.size + 2)}╮"
+          output.print "#{padding}#{connector}"
+          output.puts "─┤ #{name} │"
+
+          padding += padding_end
+
+          output.puts "#{padding}╰#{"─" * name_size_left}#{bottom_connector}#{"─" * name_size_right}╯"
+        end
+
+        padding + (" " * (name_size / 2))
+      end
+    end
+
+    class Tree < SubTree
+      def initialize(data, to_parent = nil, &)
+        super(nil, to_parent, &)
+
+        data.each do |object|
+          add(object)
+        end
+      end
+
+      def to_s(to_name = nil, &block)
+        to_name = if to_name
+                    to_name.to_proc
+                  elsif block_given?
+                    block
+                  else
+                    :to_s.to_proc
+                  end
+
+        children_trees.map { |child| child.to_s(to_name) }.join("\n")
+      end
+    end
+
+    module_function
+
+    def print_tree(data, io: $stdout, to_name: nil, to_parent: nil)
+      data = data.to_a if data.is_a?(::Hash)
+
+      if to_name.nil? && to_parent.nil?
+        to_name = :first.to_proc
+        to_parent = proc do |object|
+          parent_name = object.last
+          data.find { |pair| pair.first == parent_name }
+        end
+      end
+
+      tree = Util::Tree.new(data, to_parent)
+
+      io.puts tree.to_s(to_name)
+    end
+  end
+end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: foobara-util
 version: !ruby/object:Gem::Version
-  version: 0.0.7
+  version: 0.0.8
 platform: ruby
 authors:
 - Miles Georgi
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2024-12-01 00:00:00.000000000 Z
+date: 2024-12-05 00:00:00.000000000 Z
 dependencies: []
 description:
 email:
@@ -33,6 +33,7 @@ files:
 - lib/foobara/util/require.rb
 - lib/foobara/util/string.rb
 - lib/foobara/util/structured.rb
+- lib/foobara/util/tree.rb
 homepage: https://github.com/foobara/util
 licenses:
 - Apache-2.0