1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
|
# prefix components:
space = " "
branch = "│ "
# pointers:
tee = "├── "
last = "└── "
def _tree_generator(response: list, prefix: str = ""):
"""A recursive tree generator,
will yield a visual tree structure line by line
with each line prefixed by the same characters
"""
# response each get pointers that are ├── with a final └── :
pointers = [tee] * (len(response) - 1) + [last]
for pointer, item in zip(pointers, response):
yield prefix + pointer + item["name"]
if "items" in item: # extend the prefix and recurse:
extension = branch if pointer == tee else space
# i.e. space because last, └── , above so no more |
yield from _tree_generator(item["items"], prefix=prefix + extension)
def _url_generator(url: str, country_code: str, api_version: str):
return url.format(country_code.lower(), api_version)
|
