Timeline for Shortest Unique Substrings
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 5, 2015 at 7:18 | history | edited | Rob Audenaerde | CC BY-SA 3.0 |
removed some spaces
|
| Feb 1, 2015 at 10:51 | comment | added | Zgarb | GHC will accept it. | |
| Feb 1, 2015 at 10:43 | comment | added | Rob Audenaerde |
Leksah compiler does not accept $ followed by a non-space. It will shave of some bytes, but is it in the language spec?
|
|
| Feb 1, 2015 at 10:34 | history | edited | Rob Audenaerde | CC BY-SA 3.0 |
Used info in comments to shorten the code.
|
| Jan 31, 2015 at 15:41 | comment | added | Zgarb |
The parentheses in q are unnecessary, since you can write filter$(==)k.l, as are the last $ and the spaces before the ys in p. You can also remove the semicolons after the imports (Data.Ord seems indeed unnecessary).
|
|
| Jan 30, 2015 at 19:38 | comment | added | nimi |
Using >>= instead of concatMap, i.e. f x=p$concat$q 1$group$sort$(tails x>>=inits) saves 2 bytes. Why the Data.Ord import?
|
|
| Jan 30, 2015 at 12:57 | history | edited | Rob Audenaerde | CC BY-SA 3.0 |
implemented the suggestion from the comments
|
| Jan 30, 2015 at 12:47 | history | edited | Rob Audenaerde | CC BY-SA 3.0 |
implemented the suggestion from the comments
|
| Jan 29, 2015 at 13:54 | comment | added | FUZxxl |
How about you define g y=q(minimum.(map l)$y)$y (are the parentheses around map l really required?) and then f=g.concat.q 1.group.sort.concatMap inits.tails?
|
|
| Jan 29, 2015 at 13:10 | history | edited | Rob Audenaerde | CC BY-SA 3.0 |
replaced map(head) with concat, as the items will be length 1 only.
|
| Jan 29, 2015 at 12:37 | history | edited | Rob Audenaerde | CC BY-SA 3.0 |
removed some spaces
|
| Jan 29, 2015 at 12:31 | history | edited | Rob Audenaerde | CC BY-SA 3.0 |
added 15 characters in body
|
| Jan 29, 2015 at 11:59 | history | answered | Rob Audenaerde | CC BY-SA 3.0 |