When a string is sent from the frontend, ws decodes that as a Buffer on the node.js end, and when that's sent back it becomes a Blob on the frontend ಠ_ಠ
trying it out myself reminds me i really need to relearn actual typing skills
i actually have learned proper home row based typing for russian since my keycaps don't exactly match the layout and it's still slower than my english typing since i don't do all that much russian but it feels good to not just have my hands flying everywhere
@RadvylfPrograms rather than learn touch typing for QWERTY i decided to learn Colemak, and it's very satisfying to type so much without having to leave the home row most of the time
Translate Text into Matoran
The Matoran Alphabet is the alphabet used by many of the characters in the Bionicle universe.
Your challenge is to create a program or function that takes a string as input and creates an image of the input written in the Matoran alphabet.
The input will only consist ...
for nominations for lotm, can i nominate langs which im not really familiar with but i think would be interesting to learn and use, or do i have to know how to use that lang before nominating it
[ is POSIX standard (also test), and normally just implemented as a system binary (check /bin/[); [[ is an extension which some shells use to provide special syntax
because [[ is a reserved word, so the parser can treat it differently to a normal command
Introduction
In our recent effort to collect catalogues of shortest solutions for standard programming exercises, here is PPCG's first ever vanilla FizzBuzz challenge. If you wish to see other catalogue challenges, there is "Hello World!" and "Is this number a prime?".
Challenge
Write a progra...
@pxeger so, in shell script, how would you say, "compile a.c if any of a.h, b.h and d.h are updated, but if only c.h is updated, you only need to compile b.c and c.c"
I was thinking about something this morning. I wonder if there's a formula that would be a good approximation for how well an ordinary stack-based or prefix language does with n operators. Like, a full SBCS with 256 ops will obviously do better than one with 128 ops, but by how much?
My guess right now is roughly log_n(ops), for some n
Since I'd predict the 128 new ops you get with 128 vs. 256 are used roughly half (or some other fraction, the reciprocal of which is n) as often as those you'd add to get from 64 to 128
So while a 20 bit language with a million operators has thousands of times more than an SBCS lang, I'd predict it would only be about 2-3 times shorter in practice
oh dont worry, for golfing reasons my piet is actually going to be turned into ASCII-piet encoding which will make a long string of indecipherable letters as the final solution
KotHs vary a lot in what their arena looks like. One bot vs. another in a card game, or a giant square grid with all the bots on it, or a toroidal grid with multiple copies of every bot, etc.
bots = rto_koth.bots_from("https://codegolf.stackexchange.com/questions/217972/bot-factory-koth-2-0")
bot_insts = [rto_koth.start_bot(bot.lang, bot.code) for bot in bots]
for i in range(10):
action = Null
for bot of bot_insts:
action = bot.tick(data)
do_stuff(action)