Timeline for Can you pretty-print a tree?
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 9, 2021 at 20:59 | answer | added | jeptguy | timeline score: 3 | |
| Sep 9, 2021 at 19:50 | answer | added | Denis Ibaev | timeline score: 4 | |
| Sep 9, 2021 at 9:27 | answer | added | Razetime | timeline score: 3 | |
| Nov 24, 2016 at 16:12 | answer | added | edc65 | timeline score: 3 | |
| Nov 24, 2016 at 16:02 | comment | added | edc65 | The characters │, ├, └, ─ are conveniently available in most languages, but each one requires 3 bytes in UTF8, so using the ASCII gives a better score | |
| Nov 23, 2016 at 14:45 | answer | added | TFeld | timeline score: 1 | |
| Nov 23, 2016 at 12:40 | answer | added | Angs | timeline score: 3 | |
| Nov 22, 2016 at 22:07 | comment | added | wim | @Ludonope Whatever makes your code easier. See note 3. I expect most people will use an object, because writing a parser is probably not fun, but I don't want to discourage any possible interesting stack based approaches. | |
| Nov 22, 2016 at 22:00 | comment | added | Ludonope | what is the exact input format? Is it a string or an object? | |
| Nov 22, 2016 at 21:48 | history | edited | wim | CC BY-SA 3.0 | added 6 characters in body |
| Nov 22, 2016 at 21:47 | comment | added | wim | I'm not a regular on this site, if you think the question can be improved please comment or edit directly. Thanks! | |
| Nov 22, 2016 at 21:47 | comment | added | Martin Ender | Closely related. (Same output, different input.) | |
| Nov 22, 2016 at 21:43 | history | asked | wim | CC BY-SA 3.0 |