<p>类似于上面的答案,但对于python3来说,可以说是可读的,也可以说是可扩展的:</p>
<pre><code>from pathlib import Path
class DisplayablePath(object):
display_filename_prefix_middle = '├──'
display_filename_prefix_last = '└──'
display_parent_prefix_middle = ' '
display_parent_prefix_last = '│ '
def __init__(self, path, parent_path, is_last):
self.path = Path(str(path))
self.parent = parent_path
self.is_last = is_last
if self.parent:
self.depth = self.parent.depth + 1
else:
self.depth = 0
@property
def displayname(self):
if self.path.is_dir():
return self.path.name + '/'
return self.path.name
@classmethod
def make_tree(cls, root, parent=None, is_last=False, criteria=None):
root = Path(str(root))
criteria = criteria or cls._default_criteria
displayable_root = cls(root, parent, is_last)
yield displayable_root
children = sorted(list(path
for path in root.iterdir()
if criteria(path)),
key=lambda s: str(s).lower())
count = 1
for path in children:
is_last = count == len(children)
if path.is_dir():
yield from cls.make_tree(path,
parent=displayable_root,
is_last=is_last,
criteria=criteria)
else:
yield cls(path, displayable_root, is_last)
count += 1
@classmethod
def _default_criteria(cls, path):
return True
@property
def displayname(self):
if self.path.is_dir():
return self.path.name + '/'
return self.path.name
def displayable(self):
if self.parent is None:
return self.displayname
_filename_prefix = (self.display_filename_prefix_last
if self.is_last
else self.display_filename_prefix_middle)
parts = ['{!s} {!s}'.format(_filename_prefix,
self.displayname)]
parent = self.parent
while parent and parent.parent is not None:
parts.append(self.display_parent_prefix_middle
if parent.is_last
else self.display_parent_prefix_last)
parent = parent.parent
return ''.join(reversed(parts))
</code></pre>
<p>示例用法:</p>
<pre><code>paths = DisplayablePath.make_tree(Path('doc'))
for path in paths:
print(path.displayable())
</code></pre>
<p>示例输出:</p>
<pre><code>doc/
├── _static/
│ ├── embedded/
│ │ ├── deep_file
│ │ └── very/
│ │ └── deep/
│ │ └── folder/
│ │ └── very_deep_file
│ └── less_deep_file
├── about.rst
├── conf.py
└── index.rst
</code></pre>
<h3>注释</h3>
<ul>
<li>这使用递归。它将在真正<strong>深的文件夹树上引发一个<a href="https://docs.python.org/3/library/exceptions.html#RecursionError" rel="noreferrer" title="RecursionError">RecursionError</a></li>
<li>这棵树评估得很慢。它应该在真正的<strong>宽的</strong>文件夹树上表现良好。不过,给定文件夹的直接子级不会被惰性地计算。</li>
</ul>
<h3>编辑:</h3>
<ul>
<li>增加奖金!筛选路径的条件回调。</li>
</ul>