Timeline for Find all unambiguous prefixes of a set of strings
Current License: CC BY-SA 3.0
28 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 1, 2020 at 0:22 | answer | added | Value Ink | timeline score: 0 | |
| Dec 31, 2019 at 22:13 | answer | added | GammaFunction | timeline score: 0 | |
| May 20, 2019 at 21:11 | answer | added | Xcali | timeline score: 1 | |
| May 20, 2019 at 16:27 | answer | added | l4m2 | timeline score: 0 | |
| May 20, 2019 at 0:04 | answer | added | ngn | timeline score: 1 | |
| May 19, 2019 at 22:40 | answer | added | Unrelated String | timeline score: 1 | |
| Mar 21, 2017 at 2:26 | answer | added | Titus | timeline score: 1 | |
| May 29, 2016 at 22:54 | answer | added | J. Sendra | timeline score: 1 | |
| Dec 14, 2015 at 13:12 | history | edited | Doorknob | CC BY-SA 3.0 | added 4 characters in body |
| Jun 27, 2015 at 8:38 | vote | accept | Doorknob | ||
| May 23, 2014 at 2:21 | answer | added | Michael Easter | timeline score: 0 | |
| May 22, 2014 at 17:58 | answer | added | user2846289 | timeline score: 1 | |
| May 22, 2014 at 0:01 | answer | added | Matt | timeline score: 1 | |
| May 21, 2014 at 22:51 | answer | added | Aaron Davies | timeline score: 1 | |
| May 21, 2014 at 11:16 | answer | added | xnor | timeline score: 2 | |
| May 21, 2014 at 8:42 | comment | added | xnor | May one print the same key multiple times (with the same value)? | |
| May 21, 2014 at 7:17 | history | tweeted | twitter.com/#!/StackCodeGolf/status/469014035858739200 | ||
| May 20, 2014 at 21:53 | answer | added | dtldarek | timeline score: 1 | |
| May 20, 2014 at 16:46 | answer | added | marinus | timeline score: 1 | |
| May 20, 2014 at 16:23 | answer | added | lortabac | timeline score: 2 | |
| May 20, 2014 at 16:14 | answer | added | algorithmshark | timeline score: 3 | |
| May 20, 2014 at 15:27 | answer | added | jaybee3 | timeline score: 0 | |
| May 20, 2014 at 14:53 | comment | added | Doorknob | @PeterTaylor Good idea; edited. | |
| May 20, 2014 at 14:53 | history | edited | Doorknob | CC BY-SA 3.0 | Peter Taylor's suggestion |
| May 20, 2014 at 14:05 | comment | added | Peter Taylor | Rather than redefining the word abbreviation you could just use prefix with its standard meaning. And I think unambiguous conveys the desired property of the keys more effectively than unique, for which my first intuition was that you wanted only one prefix per input word. | |
| May 20, 2014 at 14:04 | answer | added | undergroundmonorail | timeline score: 4 | |
| May 20, 2014 at 13:26 | comment | added | undergroundmonorail | Does stdout have to be exactly that format? Or can I do key:value\nkey:value\nkey:value... ? | |
| May 20, 2014 at 13:13 | history | asked | Doorknob | CC BY-SA 3.0 |