tree_uzuki 0.4.1 → 0.4.2
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +4 -4
- data/lib/tree/tree_render.rb +21 -19
- metadata +1 -1
checksums.yaml
CHANGED
@@ -1,7 +1,7 @@
|
|
1
1
|
---
|
2
2
|
SHA256:
|
3
|
-
metadata.gz:
|
4
|
-
data.tar.gz:
|
3
|
+
metadata.gz: 8da4a73ac0227bdd9312c8bee26eb0f1ccdfa67873018cd2ded5ad4bd6efbcc4
|
4
|
+
data.tar.gz: 6002a951e69d5f1d378ecf89508bdd94b9004f6c990a597cf1fc5110f5292bbe
|
5
5
|
SHA512:
|
6
|
-
metadata.gz:
|
7
|
-
data.tar.gz:
|
6
|
+
metadata.gz: c4c9268b6927bc608c7489a5411ce5b010b9ff1b4da2d5e260d84e3682bdaa49e263c620a39568b699717c8d51ff108e9165cdfb297d253772e08f7961bd78e1
|
7
|
+
data.tar.gz: d76930ce93828361d54da0e68bb09ceaa2731d823fd64bdb77324cf8209489f4f4fe45c504ea77de86ad257a212a0b4ca56523f960776e7e1b797fd145ed7142
|
data/lib/tree/tree_render.rb
CHANGED
@@ -8,28 +8,30 @@ class Tree_render
|
|
8
8
|
turn = "└── "
|
9
9
|
space = " "
|
10
10
|
tree_data.sort!
|
11
|
-
tree_data.
|
12
|
-
|
13
|
-
|
11
|
+
i = tree_data.length
|
12
|
+
loop do i-=1
|
13
|
+
break if i == -1
|
14
|
+
leaf_level = tree_data[i].to_s.count('/') - root.to_s.count('/')
|
15
|
+
final_hash[i] = Array.new
|
14
16
|
if leaf_level == 1
|
15
|
-
final_hash[
|
16
|
-
final_hash[
|
17
|
+
final_hash[i] << branch
|
18
|
+
final_hash[i] << File.basename(tree_data[i])
|
17
19
|
else
|
18
|
-
final_hash[
|
19
|
-
(leaf_level-2).times {final_hash[
|
20
|
-
final_hash[
|
21
|
-
final_hash[
|
20
|
+
final_hash[i] << space
|
21
|
+
(leaf_level-2).times {final_hash[i] << space}
|
22
|
+
final_hash[i] << branch
|
23
|
+
final_hash[i] << File.basename(tree_data[i])
|
22
24
|
end
|
23
|
-
|
24
|
-
next if final_hash[
|
25
|
-
if final_hash[
|
26
|
-
|
27
|
-
|
28
|
-
final_hash[
|
29
|
-
elsif final_hash[
|
30
|
-
|
31
|
-
|
32
|
-
final_hash[
|
25
|
+
for index in (0..final_hash[i].size)
|
26
|
+
next if final_hash[i+1] == nil
|
27
|
+
if final_hash[i][index] == space && (final_hash[i+1][index] == branch ||
|
28
|
+
final_hash[i+1][index] == pipe ||
|
29
|
+
final_hash[i+1][index] == turn)
|
30
|
+
final_hash[i][index] = pipe
|
31
|
+
elsif final_hash[i][index] == branch && (final_hash[i+1][index] != branch &&
|
32
|
+
final_hash[i+1][index] != pipe &&
|
33
|
+
final_hash[i+1][index] != turn)
|
34
|
+
final_hash[i][index] = turn
|
33
35
|
end
|
34
36
|
end
|
35
37
|
end
|