Timeline for Generate a Universal-binary-function Lookup Table
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 27, 2023 at 3:02 | comment | added | l4m2 |
f=(n=64)=>n--?f(n)+(n>>(n>>4)&1)+(~n%16?'':"\n"):''; with a trailing newline, which seems more reasonable
|
|
| Sep 21, 2016 at 9:59 | comment | added | Titus |
hmm ... and .replace(/.{16}/g,"$0\n") has the same length. Too bad.
|
|
| Sep 21, 2016 at 9:41 | comment | added | Arnauld |
@Titus - Well. At first glance, I don't have any good solution for that. Here is a (very bad) attempt: (f=(n=64)=>n--?f(n)+(n>>(n>>4)&1):'')().match(/.{16}/g).join`\n` (63 bytes)
|
|
| Sep 21, 2016 at 9:25 | comment | added | Titus | What would it take to split after the 35 bytes? | |
| Sep 19, 2016 at 9:04 | history | edited | Arnauld | CC BY-SA 3.0 |
saved 6 bytes
|
| Sep 19, 2016 at 8:11 | history | edited | Arnauld | CC BY-SA 3.0 |
minor update
|
| Sep 19, 2016 at 8:03 | history | edited | Arnauld | CC BY-SA 3.0 |
added the 'how it works' section
|
| Sep 18, 2016 at 8:30 | comment | added | user58988 | In ideone with both languages JavaScript not compile in the exapme above there is one let more.... It is good the idea of one recursive function... | |
| Sep 17, 2016 at 23:33 | history | answered | Arnauld | CC BY-SA 3.0 |