« first day (1363 days earlier)      last day (415 days later) » 

LegionMammal978
LegionMammal978
12:19 AM
Protip: If you need the alphabet at the end of a line, …"az is shorter than …'a'z.
 
 
3 hours later…
LegionMammal978
LegionMammal978
3:37 AM
Ha, also managed to beat the longstanding shortest answer on this challenge
 
 
1 hour later…
Razetime
Razetime
5:00 AM
@LegionMammal978 yup dominic showed that in an answer
@LegionMammal978 that's crazy
@Zgarb Husk wishlist addition: P called with a TNum returns permutations of range 1..n
 
LegionMammal978
LegionMammal978
If we're asking for things that small, you might as well have a multiple ! of type [TNum] -> [x] -> [x] which acts just like M!
 
 
1 hour later…
Razetime
Razetime
6:05 AM
well, the small things save single bytes a lot
Jelly and pothers have the power of auto vectorization, so it's probably better to have flexible functions to make up
 
 
3 hours later…
Razetime
Razetime
9:07 AM
Try it online! @LegionMammal978 I get your rant on ternaries now
 
 
3 hours later…
Dominic van Essen
Dominic van Essen
12:27 PM
Happy Halloween & last day of Husk LOTM. I'm trying this. So far stuck at 18 bytes...
 
LegionMammal978
LegionMammal978
12:41 PM
@DominicvanEssen A stupid simple solution for 17 bytes: Σës⁰¨²żOy¨s+2⁰"me
Also, the inability to regularly shuffle two lists is annoying
It's implemented as merge2 in the definitions, but then it isn't used except as a component of func_powst
 
Dominic van Essen
Dominic van Essen
1:06 PM
That's nice! I never got as far as ë in the list of commands...
Merge 2 lists costs 2 bytes as z+, right? My 18-byter used that in Σz+¤es⁰+2⁰w¨²żOyṁm
 
 
1 hour later…
Razetime
Razetime
2:15 PM
@DominicvanEssen yep
 
 
1 hour later…
Razetime
Razetime
3:43 PM
whats going wrong here?
 
LegionMammal978
LegionMammal978
@Razetime The first ₁ should be a ₁⁰
Also, don't forget about overflowing line labels
 
Razetime
Razetime
4:02 PM
you mean, type mismatches?
 
LegionMammal978
LegionMammal978
4:12 PM
Try it online! ⁰ needs to be given to ₁ each time for it to know how many times to repeat
 
Razetime
Razetime
yup
but now, adding mw to the beginning kills type inference
dammit
 
Razetime
Razetime
4:39 PM
0
A: Output visual diagram of picture

RazetimeHusk, 29 bytes mm;₁'#⁰₁'+²RR'X ‼(T₂³¹m↔₂ m+R Try it online! Ah, this was convoluted. The input order is Matte,Frame,Width,Height. Explanation Function ₂: appends a side m+R parameters a(char),n(int),m(matrix) R Repeat the input character a n times m+ join it with each row of m Function ₁: fr...

found a workaround lol
 
LegionMammal978
LegionMammal978
4:51 PM
Argh, somehow I managed to mess up my Cabal packages and I had to nuke my Haskell installation to get Husk to work again
 
Razetime
Razetime
5:03 PM
well just don't build from source and you'll be alright
 
LegionMammal978
LegionMammal978
5:52 PM
An annoying unhandled edgecase: If you try to use an overflowed line label past all of the defined ones, it causes Haskell to crash when parsing the program.
I've been trying to write a bruteforcer for small programs, and it makes it a fair bit more difficult.
 

« first day (1363 days earlier)      last day (415 days later) »