If you've ever wondered why G and g are for Maximum and Minimum, my rational was that because M is for mapping, G would be the next best thing, as it could be Greatest item. And because g is the opposite of G (in terms of case), it has the opposite functionality
Also, if I could get some of y'all to have a quick glance at the elements.yaml for my version 3 planning to make sure I'm on the right track, that'd be great
I've got an 8-byte solution, which wasn't too difficult to find, but my instincts are telling me that there's a shorter solution that I just can't seem to find
Repeat List Until Longer
code-golf
The Challenge
The challenge is simple: given an input list a and another list b, repeat a until it is longer than b. Call the repeated list ra. Then the following condition must hold true: len(b) < len(ra) <= len(b) + len(a). That is, a must not be repeated more...
Jyxal quick stats: 50 elements implemented (not including ones requiring special treatment), every structure besides functions implemented, 8.5k lines of code, largest file being BigDecimialMath (surprisingly, RuntimeMethods is 2nd), and BigDecimalMath also having the most comments
and of course, the long dictionary tops the record books with a staggering 46224 lines
btw @Seggan about your idea of a nop flag, at the moment, any flag that isn't implemented acts as a nop, so as long as we don't define a - flag, it can be used as a nop.
I just realized that my 8-byte solution doesn't work if the length of b is a multiple of the length of a, so e.g. [1,2,3] [1,2,3,4,5,6] would return [1,2,3,1,2,3] instead of [1,2,3,1,2,3,1,2,3]. I fixed it, but now it is 9 bytes