Timeline for Solve a Diagonal Burrows-Wheeler transform
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 28, 2015 at 2:05 | comment | added | Ismael Miguel | I'm glad you cut down the byte count. | |
| Feb 28, 2015 at 1:43 | comment | added | NinjaBearMonkey | @IsmaelMiguel Now that I think about it, I think anonymous functions are allowed by themselves, so using that saves me even more bytes. | |
| Feb 28, 2015 at 1:42 | history | edited | NinjaBearMonkey | CC BY-SA 3.0 |
anonymous functions
|
| Feb 28, 2015 at 0:47 | comment | added | Ismael Miguel | That's still 2 functions. The rules don't specify names or ways to access the functions. It only says that you must use 2 functions. | |
| Feb 27, 2015 at 23:24 | comment | added | NinjaBearMonkey | Thanks, bu it says to write 2 functions, and I don't think this would count. | |
| Feb 27, 2015 at 20:24 | comment | added | Ismael Miguel |
How about this: [t=>t.replace(/./g,(_,o)=>t[o*2%t.length]),t=>t.replace(/./g,(_,o)=>t[(1+(l=t.length))/2*o%l])]? You use it like [...][0]('encode string') and [...][1]('decode string'). There is nothing saying that this can't be done! And you save 1 byte.
|
|
| Feb 27, 2015 at 4:30 | history | edited | NinjaBearMonkey | CC BY-SA 3.0 |
added 442 characters in body
|
| Feb 27, 2015 at 4:22 | history | answered | NinjaBearMonkey | CC BY-SA 3.0 |