Timeline for Text compression
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 15, 2018 at 12:31 | comment | added | Jonathan Allan |
@tox the two programs are currently not working in the same way (although both of us have used similar ideas as each other in the history of revisions). This one is using compressed string lists (“...“...») to form most of the four lines and then interleaving (ż) with the less repetitive parts (like ',\nIf'), again with compressed string lists; you can see how mine works from the description.
|
|
| Oct 14, 2018 at 23:34 | comment | added | Misha Lavrov | A lot of the overlap in the code is the identical compressed strings, which is not surprising. | |
| Oct 14, 2018 at 22:14 | comment | added | tox123 | Wow, surprisingly similar to another answer, with the same language and same byte count. I don't actually know what's happening in this language, so is the code basicically the same? | |
| Oct 14, 2018 at 14:22 | history | edited | Dennis | CC BY-SA 4.0 |
deleted 911 characters in body
|
| Oct 14, 2018 at 5:10 | history | edited | Dennis | CC BY-SA 4.0 |
added 25 characters in body
|
| Oct 14, 2018 at 4:54 | history | edited | Dennis | CC BY-SA 4.0 |
added 34 characters in body
|
| Oct 14, 2018 at 4:32 | history | edited | Dennis | CC BY-SA 4.0 |
added 1 character in body
|
| Oct 14, 2018 at 4:27 | history | edited | Dennis | CC BY-SA 4.0 |
added 6 characters in body
|
| Oct 14, 2018 at 4:17 | history | edited | Dennis | CC BY-SA 4.0 |
added 6 characters in body
|
| Oct 14, 2018 at 4:11 | history | answered | Dennis | CC BY-SA 4.0 |