Husk

« first day (1360 days earlier) ← previous day next day → last day (418 days later) »

Razetime

4:05 AM

lool

9 hours later…

Zgarb

1:14 PM

@LegionMammal978 No worries! I've been busy with real life stuff (and still am). Your latest patch looks good. You can do a pull request, maybe Leo gets notified.

@DominicvanEssen That's by design

Jul 13 '17 at 10:06, by Zgarb

@MartinEnder It seems mathematically cleaner to me, if you think what happens when you remove the first "digit" in the base b representation of n. In the scheme where negative numbers have all digits negative, this means you get rem n (b^k) for some k (in Haskell syntax), and in the scheme where the first digit is negative, you get mod n (b^k). And mod is nicer than rem.

3 hours later…

LegionMammal978

3:53 PM

Something funny I noticed: η can be used both as intended and not as intended

It seems the inference algorithm doesn't like when you try to apply one argument to another, though

Razetime

4:19 PM

still havent used η in an answer yet

LegionMammal978

Huh, ηÖ is a useful idiom that I've already used twice (to sort indices of a list with respect to values)

Razetime

well, my answer frequency has gone down quite a bit recently

maybe I'll find a place to use it

H.PWiz

@LegionMammal978 I can't really believe that η is useful in that second case. I haven't taken time to try and understand what you're lambda does, but It would surprise me if using η like that is ever useful

ps. I got a 12 byte solution that looks a bit long

ηf is also a nice idiom

LegionMammal978

That would be indices of truthy values?

H.PWiz

right

Razetime

4:31 PM

got 17 byte one: Try it online!

H.PWiz

That's basically mine, but with a longer function in the middle

Razetime