updade from Atlas repo

This commit is contained in:
Luciano Ramalho
2021-05-21 18:56:12 -03:00
parent c518bf851e
commit 8a330d822b
120 changed files with 2190 additions and 1184 deletions

View File

@@ -1,11 +1,11 @@
from tree import tree
SPACES = ' ' * 4
HLINE = '\u2500' # ─ BOX DRAWINGS LIGHT HORIZONTAL
HLINE = '\u2500' # ─ BOX DRAWINGS LIGHT HORIZONTAL
HLINE2 = HLINE * 2
ELBOW = f'\u2514{HLINE2} ' # └ BOX DRAWINGS LIGHT UP AND RIGHT
TEE = f'\u251C{HLINE2} ' # ├ BOX DRAWINGS LIGHT VERTICAL AND RIGHT
PIPE = f'\u2502 ' # │ BOX DRAWINGS LIGHT VERTICAL
ELBOW = f'\u2514{HLINE2} ' # └ BOX DRAWINGS LIGHT UP AND RIGHT
TEE = f'\u251C{HLINE2} ' # ├ BOX DRAWINGS LIGHT VERTICAL AND RIGHT
PIPE = '\u2502 ' # │ BOX DRAWINGS LIGHT VERTICAL
def render_lines(tree_iter):

View File

@@ -1,5 +1,3 @@
import pytest
from pretty_tree import tree, render_lines
def test_1_level():
@@ -7,7 +5,7 @@ def test_1_level():
expected = [
'BrokenPipeError',
]
assert expected == result
assert expected == result
def test_2_levels_1_leaf():
@@ -16,7 +14,7 @@ def test_2_levels_1_leaf():
'IndentationError',
'└── TabError',
]
assert expected == result
assert expected == result
def test_3_levels_1_leaf():
@@ -29,7 +27,7 @@ def test_3_levels_1_leaf():
'└── Y',
' └── Z',
]
assert expected == result
assert expected == result
def test_4_levels_1_leaf():
@@ -98,4 +96,5 @@ def test_4_levels_4_leaves():
]
result = list(render_lines(tree(A)))
assert expected == result
assert expected == result

View File

@@ -5,7 +5,7 @@ def test_1_level():
class One: pass
expected = [('One', 0, True)]
result = list(tree(One))
assert expected == result
assert expected == result
def test_2_levels_2_leaves():
@@ -18,7 +18,7 @@ def test_2_levels_2_leaves():
('Leaf2', 1, True),
]
result = list(tree(Branch))
assert expected == result
assert expected == result
def test_3_levels_1_leaf():
@@ -31,7 +31,7 @@ def test_3_levels_1_leaf():
('Z', 2, True),
]
result = list(tree(X))
assert expected == result
assert expected == result
def test_4_levels_1_leaf():
@@ -47,7 +47,7 @@ def test_4_levels_1_leaf():
]
result = list(tree(Level0))
assert expected == result
assert expected == result
def test_4_levels_3_leaves():
@@ -69,7 +69,7 @@ def test_4_levels_3_leaves():
]
result = list(tree(A))
assert expected == result
assert expected == result
def test_many_levels_1_leaf():
@@ -87,4 +87,4 @@ def test_many_levels_1_leaf():
assert len(result) == level_count
assert result[0] == ('Root', 0, True)
assert result[-1] == ('Sub99', 99, True)
assert expected == result
assert expected == result

View File

@@ -2,7 +2,7 @@ def tree(cls, level=0, last_in_level=True):
yield cls.__name__, level, last_in_level
subclasses = cls.__subclasses__()
if subclasses:
last = subclasses[-1]
last = subclasses[-1]
for sub_cls in subclasses:
yield from tree(sub_cls, level+1, sub_cls is last)