« first day (439 days earlier)      last day (825 days later) » 

09:40
Thanks! I still have a question, anyone ping me if I can ask them live?
@DuctrTape you can try :)
So I'm trying to solve the clock challenge. Using ØHḟp” (trailing space) I can create what I think is the map to replace everything but the input into a space (input in hex for now).
But I can't get it to act as a map, see here (as a nilad for first experiments).
If If just take the output from ØHḟp” as a string literal it does work, but not if I use it as a niladic chain.
09:57
You need a single list: TIO
also, not sure if the compression will be of use here
Wasn't it a list? And it should save 2 bytes.
It was a list of lists
I can do 29 with both a string and a compressed string, although the former can go in one link.
... in fact 28
Neat! what does µ do there?
it's monadic chain separation
basically saying everything to the left should be parsed as a one-input function (the implicit input is 0)
10:16
Yeah, I've read that a few times.
Anyway, thanks!
10:27
@DuctrTape might be better to use a base250 compressed number to store indexes into a string that is mostly spaces. I'll give it a go.
How do you mean?
make a string just with the * and O and the rest spaces, then place the other * in at a location by looking it's index up in a list formed from a base conversion of a number using the base-250 compression form.
So for each time you look up where it should be inserted? Looking forward to see that!
10:49
@DuctrTape posted a preliminary version, it may well be golfable.
That's already a lot better than what I've been trying so far.
11:03
Looking forward to an explanation because don't understand everything yet.
yeah I will post one, I always do :)
12:03
What exactly does the ¤ do? I figured it takes the left side as a nilad (a constant) - but what about the right side (the followed by a nilad part)?
It tells the parser that stuff to the left is of the form nilad + some link(s) (+possible last nilad). It does not do anything specific to the right hand side, other than that direct effect.
found a two byte save using some of my own contributions...
oh 1 byte :(
the "+ some links" are also in the left side?
12:30
yeah, so the code could end with a nilad too (since you dont need it for a single nilad on it's own and it's useful to be able to end with one, a simple example might be that you want the string "123456 " within your chain, and you know you can join a space onto the end of the list [1,2,3,4,5,6] to do so, so you want to do 6R;⁶ but you want that all as one nilad...
so you add the ¤ to instruct the parser that's what you want - it goes left to the next nilad, but ignores the , since if you just want a space you dont need the ¤.
if you have two nilads in the piece of code you may need to use two ¤, but then it might be cheaper (or the same and more readable) to use ¢.
@Dennis - we had ṖṖCG, now we have tI©! ...ị“ tI©’Œ?Ḋ¤µ⁶ẋ13”*⁸¦Ṗ;“**o”ṙ7s5ZY
Alright, that's a good explanation, I think I get it now.
 
7 hours later…
19:41
I just used Æ¡ in an answer; now I'm curious as to how often it's useful
it seems fairly specific
@JonathanAllan The separators apply to the chain to the right, not the left.
oops yes "everything to the left is the input into" was what I had meant
@JonathanAllan That's probably at least as useful as the list.
cool beans :)
Oh yey ,v.cool...
3
A: Reverse Insertion sort

ais523Jelly, 12 bytes L!_UÆ¡$œ?J’U Try it online! Explanation We can basically see the two lists (the input and the output) as encoding an integer; the input encodes an integer in factorial base, and the output encodes an integer as a permutation. Luckily, Jelly has builtins that are already very ...


« first day (439 days earlier)      last day (825 days later) »