Talk:Tree from nesting levels: Difference between revisions
→The target outputs shown clash with the task description
Line 72:
To put this in a Python notation, if we '''start''' with one of these forests ('''lists''' of trees), mapping over each of its members with a foldTree catamorphism, passing a function like this to it:
<lang python>
def levelList(x):
'''A Tree in which
A possible integer, and a list of trees.
(Int or None, [Tree])
Line 81 ⟶ 82:
return (None, concat(xs))
else:
return [(x.get('Just', 0), concat(xs))]
return go</lang>
Line 87 ⟶ 88:
<lang python>[]
[[(1, [(2, [(None, [(4, [])])])])]]
[[(None, [(None, [(3, [])])])], [(1, [(None, [(3, [])])])], [(1, [])]]
[[(1, [(2, [(3, [])])])], [(1, [])]]
[[(None, [(None, [(3, [])]), (2, [])])], [(1, [(None, [(3, [])])])]]
[[(None, [(None, [(3, []), (3, []), (3, [])])])], [(1, [])], [(1, [(None, [(3, []), (3, []), (3, [])])])]]</lang>
[[User:Hout|Hout]] ([[User talk:Hout|talk]]) 14:00, 4 February 2021 (UTC)
| |||