Timeline for Pythonic way to flatten lists or arbitrary depth using assignment expressions
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 22, 2023 at 16:25 | answer | added | nicolaum | timeline score: 3 | |
| Jul 31, 2020 at 18:14 | answer | added | user1717828 | timeline score: 2 | |
| Jul 30, 2020 at 21:00 | history | tweeted | twitter.com/StackCodeReview/status/1288942474237444098 | ||
| Jul 30, 2020 at 20:27 | history | became hot network question | |||
| Jul 30, 2020 at 15:35 | comment | added | Hank Igoe | Sorry if that was confusing, they're just different versions. flatten4 = "Flatten using list comprehension," whereas flatten3_h = "Flatten using a more direct recursive style, like Scheme for example." I did have 2 other previous versions based on ideas from another post on stackoverflow, but they didn't work on any list that had sublists nested deeper than 2 levels. I hope that makes sense. | |
| Jul 30, 2020 at 14:14 | history | edited | Peilonrayz♦ | CC BY-SA 4.0 |
Merge comment into question.
|
| Jul 30, 2020 at 13:59 | comment | added | Mast♦ |
Where's flatten_2? Or, what do the names of your functions signify?
|
|
| Jul 30, 2020 at 13:40 | answer | added | Reinderien | timeline score: 2 | |
| Jul 30, 2020 at 13:32 | answer | added | Dan Oberlam | timeline score: 7 | |
| Jul 30, 2020 at 13:21 | answer | added | Peilonrayz♦ | timeline score: 5 | |
| Jul 30, 2020 at 13:19 | answer | added | hjpotter92 | timeline score: 11 | |
| Jul 30, 2020 at 12:28 | review | First posts | |||
| Jul 30, 2020 at 13:24 | |||||
| Jul 30, 2020 at 12:20 | history | asked | Hank Igoe | CC BY-SA 4.0 |