tree_slava 0.0.1 → 0.0.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 10e8b8a006bd0f3453422cf958bfc1d4fba0750fc79f08733bca2cb404d649fa
-  data.tar.gz: 1fa59309fd9dcdb62795aca49255a8c1e04cf7dd826e05f90f1fc72154d7bc9d
+  metadata.gz: 1f4fecaf46075ee7332ff4c9a4488eda846bf210bad6aba0929a475c0cbbf854
+  data.tar.gz: 67814b0d11f65458fbb629d8c79fe7b2d745af9d83049ebeaeff5df810605c85
 SHA512:
-  metadata.gz: 51f6f82ac779be12f186e94b2cbb30d0fe734a0cf21c01956525e430ac693728b32ccb25403d548f1a91e1a7a1136404fdee07193827ad93455369a007690c86
-  data.tar.gz: '08c78f3d71ff2fd2c78ed49e30bf5ecc5a36beacfe6e30c1308357c278fc32db5ef76914ae321702bd129717bee2d031f0758bdb5fe1cf2505efd10cd1f15904'
+  metadata.gz: 4ccf2fe59eff0e4c3364fdb7071d2ec132b94fb92c56a4797b9352c98b3b801dc98a76b7073906dccf8e48cd8495f746194e2756e33b9c2a89bb536cca4cdeba
+  data.tar.gz: 956bca0de38f8da04c721da339641f8a0a4941b6c9826c113551a257e1711a0f78b50aac12c4ad7e435620f29e06feea02e1c9ccc5d830c8097756590b89cae3

data/lib/data_tree/scanner.rb

@@ -0,0 +1,9 @@
+require 'pathname'
+class Scanner
+  def scan(root = Dir.pwd)
+    path_arr = []
+    root = Pathname.new(root)
+    root.find { |v| path_arr << v }
+    Tree.new.make_tree(path_arr, root)
+  end
+end

data/lib/data_tree/tree.rb

@@ -0,0 +1,46 @@
+class Tree
+  def make_tree(path_arr, root)
+    tree_data = path_arr
+    tree_hash = {}
+    branch = '├── '
+    pipe = '│   '
+    leaf = '└── '
+    space = '    '
+    tree_data.sort!
+    i = tree_data.length
+    while i > -1
+      i -= 1
+      level = tree_data[i].to_s.count('/') - root.to_s.count('/')
+      tree_hash[i] = []
+      if level == 1
+        tree_hash[i] << branch
+        tree_hash[i] << File.basename(tree_data[i])
+      else
+        tree_hash[i] << space
+        (level - 2).times { tree_hash[i] << space }
+        tree_hash[i] << branch
+        tree_hash[i] << File.basename(tree_data[i])
+      end
+      (0..tree_hash[i].size).each do |index|
+        if tree_hash[i + 1].nil? && tree_hash[i][index] == branch
+          tree_hash[i][index] = leaf
+        elsif tree_hash[i + 1].nil?
+          next
+        elsif tree_hash[i][index] == space &&
+           (tree_hash[i + 1][index] == branch ||
+            tree_hash[i + 1][index] == pipe ||
+            tree_hash[i + 1][index] == leaf)
+          tree_hash[i][index] = pipe
+        elsif tree_hash[i][index] == branch &&
+              (tree_hash[i + 1][index] != branch &&
+              tree_hash[i + 1][index] != pipe &&
+              tree_hash[i + 1][index] != leaf)
+          tree_hash[i][index] = leaf
+        end
+      end
+    end
+    puts root
+    tree_hash = tree_hash.each.sort_by { |k, _v| k }
+    tree_hash.each { |_k, v| puts v.join }
+  end
+end

data/lib/data_tree.rb

@@ -1,58 +1,5 @@
-require 'pathname'
-class Scanner
-  def scan(root = Dir.pwd)
-    path_arr = []
-    root = Pathname.new(root)
-    root.find { |v| path_arr << v }
-    Tree.new.make_tree(path_arr, root)
-  end
-end
+require_relative 'data_tree/scanner.rb'
+require_relative 'data_tree/tree.rb'
 
-class Tree
-  def make_tree(path_arr, root)
-    tree_data = path_arr
-    tree_hash = {}
-    branch = '├── '
-    pipe = '│   '
-    leaf = '└── '
-    space = '    '
-    tree_data.sort!
-    i = tree_data.length
-    while i > -1
-      i -= 1
-      level = tree_data[i].to_s.count('/') - root.to_s.count('/')
-      tree_hash[i] = []
-      if level == 1
-        tree_hash[i] << branch
-        tree_hash[i] << File.basename(tree_data[i])
-      else
-        tree_hash[i] << space
-        (level - 2).times { tree_hash[i] << space }
-        tree_hash[i] << branch
-        tree_hash[i] << File.basename(tree_data[i])
-      end
-      (0..tree_hash[i].size).each do |index|
-        if tree_hash[i + 1].nil? && tree_hash[i][index] == branch
-          tree_hash[i][index] = leaf
-        elsif tree_hash[i + 1].nil?
-          next
-        elsif tree_hash[i][index] == space &&
-           (tree_hash[i + 1][index] == branch ||
-            tree_hash[i + 1][index] == pipe ||
-            tree_hash[i + 1][index] == leaf)
-          tree_hash[i][index] = pipe
-        elsif tree_hash[i][index] == branch &&
-              (tree_hash[i + 1][index] != branch &&
-              tree_hash[i + 1][index] != pipe &&
-              tree_hash[i + 1][index] != leaf)
-          tree_hash[i][index] = leaf
-        end
-      end
-    end
-    puts root
-    tree_hash = tree_hash.each.sort_by { |k, _v| k }
-    tree_hash.each { |_k, v| puts v.join }
-  end
-end
 tree = Scanner.new
 tree.scan

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: tree_slava
 version: !ruby/object:Gem::Version
-  version: 0.0.1
+  version: 0.0.2
 platform: ruby
 authors:
 - somestyl3
@@ -17,7 +17,9 @@ extensions: []
 extra_rdoc_files: []
 files:
 - lib/data_tree.rb
-homepage: 
+- lib/data_tree/scanner.rb
+- lib/data_tree/tree.rb
+homepage: https://rubygems.org/gems/tree_slava
 licenses:
 - MIT
 metadata: {}