In scientific computing, it is often desirable to decompose some large domain into smaller "subdomains", then parallelize the computation by performing the work on each subdomain in parallel and the interaction of a subdomain with its neighboring subdomains. Since these interactions are typically...
I would like to generate (as a return result of a function, or simply as the output of a program) the ordinal suffix of a positive integer concatenated to the number.
Samples:
1st
2nd
3rd
4th
...
11th
12th
13th
...
20th
21st
22nd
23rd
24th
And so on, with the suffix repeat...
Everybody loves nested lists! However, sometimes it's hard to make a nested list. You have to decide if you want to nest it deeper, or if you need to nest it shallower. So for your challenge, you must "Autonest" a list. To autonest a list, compare every pair of items in the list.
If the second ...
@CᴏɴᴏʀO'Bʀɪᴇɴ hey i never said it was finished. I even noted that theres still lots of stuff left before release. but in the past few commits I've made rather huge changes so new bugs have probably popped up
cheddar> Math.fib(1)
readline.js:925
throw err;
^
RangeError: Maximum call stack size exceeded
at Map.has (native)
at fib (/home/ubuntu/workspace/Cheddar/dist/stdlib/ns/math/fib.js:11:25)
at fib (/home/ubuntu/workspace/Cheddar/dist/stdlib/ns/math/fib.js:11:111)
at fib (/home/ubuntu/workspace/Cheddar/dist/stdlib/ns/math/fib.js:11:111)
at fib (/home/ubuntu/workspace/Cheddar/dist/stdlib/ns/math/fib.js:11:111)
at fib (/home/ubuntu/workspace/Cheddar/dist/stdlib/ns/math/fib.js:11:111)
If a program prints out null bytes and those null bytes are not part of the specification. Does this disqualify the program although these bytes are unreadable.
@AShelly Not exactly, but we have recently been making stricter rules about answer validity, which may affect older answers. I'm not sure if the new rules do affect old answers though. Are you talking about a specific post?
I'm not naming names just feeling frustrated. I had a recent post critizized for not meeting criteria added after the fact, then the same person went and commented on a year old post, which did in fact meet the criteria.
@AShelly they were probably just browsing through questions and came upon it. I doubt any user would specifically look through old questions just do find faults in answers
@AShelly yeah. But as the site grows people find more and more ways to abuse loopholes / rules. So we have do to become more strict, and have more specific rules to avoid cheating
I mean, I think the standard loophole exclusion page was a good idea. But I'm not so sure about changing questions after the fact to exclude loopholes people found.
@AShelly i agree but A) after a while loophole abuse gets boring and unfunny B) it's difficult to objectively specify an esoteric language without ruling out valid, but short languages like J, but now golfing languages are a large central position in our site, which we can't really change anymore. I'm sure we'd come up with more specific rules against esoteric languages early on but now it's too late.
@Downgoat, I agree with you about boring and unfunny. I was thinking more about the thing that happened on the UTF8 question, where the Null byte specification was added after a dozen answers were written. No one was specifically abusing a loophole, just taking advantage of an underspecification.
@AShelly I agree with your distaste of esoteric languages, but considering how many people have made them and how much total time people have spent on them, I doubt they'll be given up easily. Especially because all of our moderators have spent lots of time making and maintaining esoteric languages
@Doorknob the moderators do have a very significant influence on our site's rules. I doubt if a mod said "kill esoteric languages" the response would be as critical as if I, for example, were to say "kill esoteric languages".
Though the "J, Golfscript, etc." post, that all "why are golfing langs allowed" questions are closed of dupe of doesn't even really have any consensus. The top voted answer's proposal was never implemented, and the following answers which say "a well golfed answer in a 'normal lang' will get just as many upvotes" is definitely not true. Just take a look at user's rep graphs before and after they made golfing languages
Idk if it's FGITW or modness but anyway, most of our active users (especially the ones on meta) maintain golfing langs which will have some sort of influence on the result
@Downgoat Images don't move (so they don't distract as much) and usually are only a few KB. I've seen (and deleted) embedded GIFs with over 100MB in TNB.
@DrGreenEggsandIronMan I'm not sure I understand how to obtain the output in you latest challenge. In {1, 3, 2}, 1 < 3, everything after 1 should be nested one level deeper, so I'd expect a {3, 2}. Then, since 3 > 2, 2 must be wrapped, so I get {1, {3, {2}}}. What am I misunderstanding?
If I'm answering an old question with vim, should I provide a link to http://v.tryitonline.net/? Since V is mostly backwards compatible with vim, the answer works the same, but it might confuse people providing a link to a different language.
Vim, 27 bytes
:s/\v\c(<\a+>).{-}\zs\s+\1
Note that the 27 bytes is including a trailing carriage return at the end.
Try it online! Side note: This is a link to a different language I'm writing called "V". V is mostly backwards compatible with vim, so for all intents and purposes, it can count...
cheddar> IO.prompt("Enter your name: ", "Enter your goddamn dame: ")
Enter your goddamn dame:
Enter your goddamn dame:
Enter your goddamn dame:
Enter your goddamn dame:
Enter your goddamn dame:
Enter your goddamn dame:
Enter your goddamn dame:
Enter your goddamn dame:
Enter your goddamn dame:
Enter your goddamn dame: ^C
Enter your goddamn dame: ^C
Enter your goddamn dame: ^C
Enter your goddamn dame: ^C
Enter your goddamn dame: ^C
Enter your goddamn dame: ^C
Enter your goddamn dame: ^C
Enter your goddamn dame: ^C
@Downgoat you just need to modify it to add behavior for control c and d then (there is a big switch for those). It'll be missing other features though
I would like to generate (as a return result of a function, or simply as the output of a program) the ordinal suffix of a positive integer concatenated to the number.
Samples:
1st
2nd
3rd
4th
...
11th
12th
13th
...
20th
21st
22nd
23rd
24th
And so on, with the suffix repeat...
Everybody loves nested lists! However, sometimes it's hard to make a nested list. You have to decide if you want to nest it deeper, or if you need to nest it shallower. So for your challenge, you must "Autonest" a list. To autonest a list, compare every pair of items in the list.
If the second ...
If a program prints out null bytes and those null bytes are not part of the specification. Does this disqualify the program although these bytes are unreadable.
