I was like "oh dang, this is gonna be fun, it's the final battle", and then I was like "oh dang, what the heck is this", and then I was like "oh dang, I'm glad I'm wearing headphones instead of just speakers, but I also wish I wasn't wearing headphones"
Muck is an inherently annoying lang family, but I'm actively working to make it enjoyable and interesting, since most BFs are just pointless. And I actually enjoy it a lot shockingly! This is coming from someone who never understood the BF craze, and never found it fun
@hyper-neutrino I would hope so, because that is where the stuff in elements.md automatically comes from, and that's where the descriptions come from for hovering over the characters in the on-screen keyboard.
@hyper-neutrino I was really confused, then I figured it out. That's a map lambda. With a map lambda, specifying the arity doesn't do anything. So it's taking [4,5,6] and pairing it with itself, producing [[4,4],[5,5],[6,6]]. Also, since it's a map lambda, it gets mapped immediately and doesn't get pushed to the stack. As a result, † is acting as vectorized not, acting on [[4,4],[5,5],[6,6]], producing [[0,0],[0,0],[0,0]].
oh, wait lol. I know why. Internally, map lambdas, filter lambdas, and sort lambdas are all just normal lambdas, but they have an extra command appended after them, namely map, filter, and sort. Those commands only take two arguments: the lambda and the thing to apply it to. so the arity does nothing in those cases.
!!/issue **Character literals shouldn't get decompressed** When using \`\\` to make a character literal, if it is a non-ascii character, the interpreter attempts to decompress it, which returns an empty string since there is no second character to create a SCC. Obviously, you can use the \`D\` flag to combat this, but since a character literal can \*never\* be an SCC, it would make more sense to just make it not try to decompress it.
Example: [Try it Online!](https://lyxal.pythonanywhere.com?flags=&code=%5C%E2%82%B4q&inputs=&header=&footer=) `enhancement`
well, I figured out some of it. k looks to the next token to see what the combined diagraph is. The next token is the string, which gets pushed immediately. Then, the token after the string completes the k diagraph.
the thing is, before transpilation, when it does the parsing, the very first thing it does is group the strings into their own tokens, that way you can have characters like | or ; in the strings with out the parser jumping into a meat grinder
