Flatten a list: Difference between revisions
m
→Recursive
m (→Recursive) |
m (→Recursive) |
||
Line 2,766:
def concatMap(f, xs):
return sum(map(f, xs), [])</lang>
(This proves slower, as the number of sub-lists rises, (though micro-optimisation is seldom a good use of time), but it may shed useful Rosetta light on the list comprehension version above)
{{Out}}
<pre>
| |||