-> file: fediverse/567
══════════════════════════════════════════─────────────────────────────────────────
If I had a MILLION dollars I'd probably spend it all by hiring software
developers to create open source mods for The Legend of Zelda: Ocarina of Time.
But if I had a BILLION dollars you can bet your butt there wouldn't be any
starving kids in my country anymore. At least, until my money ran out, but
frankly it'd be well spent.
┌─────────┐ ┌───────────┐
│ similar │ │ different │
╘═════════╧═══════════════════════════════────────────────────────────┴───────────┘
-> file: fediverse/568
══════════════════════════════════════════─────────────────────────────────────────
@user-410
GISHVESHTEEMAKSOLUBOLESNEVEYLA
Madruk? Dufreyj ni! Ges ne valkio abioshempla ded gurshulpan.
Nedre du fastia - maksur jeveleb. Acksie-eh vembereste, hahahah HAHAHAHA
jashee, amiright?
┌─────────┐ ┌───────────┐
│ similar │ │ different │
╘═════════╧═══════════════════════════════────────────────────────────┴───────────┘
-> file: fediverse/569
══════════════════════════════════════════─────────────────────────────────────────
Billionaires aren't solving childhood food insecurity.
They have the capacity to, with their essentially endless supply of dollars,
which taste good on rye with a dash of mustard.
But alas, they choose not to.
They CHOOSE to STARVE children. They choose that, by not dedicating their lives
to solving that particular problem.
"oh but like, there's so many problems in the world, how can-" shut the fuck
up, spend the dollars, make it happen, and now there's one fewer billionaire
and one fewer problem in the world. The next one can fix the next problem,
that's why we keep them around, isn't it?
https://mkorostoff.github.io/1-pixel-wealth/
┌─────────┐ ┌───────────┐
│ similar │ │ different │
╘═════════╧═══════════════════════════════────────────────────────────┴───────────┘
-> file: fediverse/570
══════════════════════════════════════════─────────────────────────────────────────
@user-410
Heh, majrekevnul. endisovoste, jir mos durenevestele. aksi mekse, dur majre
mirri? ad-fasalibae shurench-k' ere jir dada fahstulae. maksur dekselem.
┌─────────┐ ┌───────────┐
│ similar │ │ different │
╘═════════╧═══════════════════════════════────────────────────────────┴───────────┘
-> file: messages/129
══════════════════════════════════════════─────────────────────────────────────────
So you're telling me the speed difference between Python and C is due not to
the logic that the programmer uses, but rather the optimization capabilities of
the compiler?
(An interpreter includes a compiler, it just runs it in a loop rather than a
single pass)
┌─────────┐ ┌───────────┐
│ similar │ │ different │
╘═════════╧═══════════════════════════════────────────────────────────┴───────────┘
-> file: fediverse/571
══════════════════════════════════════════─────────────────────────────────────────
I wish I could "like" the "so-and-so is typing..." message on messaging
applications
┌─────────┐ ┌───────────┐
│ similar │ │ different │
╘═════════╧═══════════════════════════════────────────────────────────┴───────────┘
-> file: fediverse/572
══════════════════════════════════════════─────────────────────────────────────────
Hi, I'm learning about semaphores right now and trying to explain them to a
friend. But I only sorta understand how they work - can anyone look at this
pseudocode and tell me if I'm on the right track?
![Some C pseudocode working through the semaphore design pattern. Here's the text of the pseudocode: /* no lock example */ void start_thread(int* x) { *x += 1; } int main() { int x = 0; for (1000 times){ start_thread(&x); } print(x); } /* in this case you have no idea what will print because thread A will take x and be like "ah yes it's 423" and then in the next instruction it'll be like "I'll increment this to be 424" and in the next one it'll say "okay now it's time to store 424 in the variable X" but like... there's a thousand threads all doing that at the same time, so odds are you'll have 5 that are like "ah yes this is 423 I'll set it to 424" */ /* not a good plan. Need a lock, so only one thread can use it at once. */ /* mutex example: */ void start_thread(int* x, int* x_mutex) { *x += 1; *x_mutex = 0; } int main() { int x = 0; int x_mutex = 0; for (1000 times){ while (x_mutex != 0){ } /* do nothing */ x_mutex = thread_id; start_thread(&x, &x_mutex); } print(x); } /* this should print 1000, but it's basically as slow as doing it single threaded. */ #define MAX 10 void start_thread(int* x, int* x_semaphore) { *x += 1; *x_semaphore += 1; } int main() { int x[MAX]; int x_semaphore = MAX; for (1000 times) { for (int i = 0; i < MAX; i++) { x_semaphore -= 1; start_thread(&x[i], &x_semaphore); } while (x_semaphore != MAX) { } /* do nothing */ } int value = sum(x, MAX); print(value); }](../media/224b236a8660c34a.png "Some C pseudocode working through the semaphore design pattern. Here's the text of the pseudocode: /* no lock example */ void start_thread(int* x) { *x += 1; } int main() { int x = 0; for (1000 times){ start_thread(&x); } print(x); } /* in this case you have no idea what will print because thread A will take x and be like \"ah yes it's 423\" and then in the next instruction it'll be like \"I'll increment this to be 424\" and in the next one it'll say \"okay now it's time to store 424 in the variable X\" but like... there's a thousand threads all doing that at the same time, so odds are you'll have 5 that are like \"ah yes this is 423 I'll set it to 424\" */ /* not a good plan. Need a lock, so only one thread can use it at once. */ /* mutex example: */ void start_thread(int* x, int* x_mutex) { *x += 1; *x_mutex = 0; } int main() { int x = 0; int x_mutex = 0; for (1000 times){ while (x_mutex != 0){ } /* do nothing */ x_mutex = thread_id; start_thread(&x, &x_mutex); } print(x); } /* this should print 1000, but it's basically as slow as doing it single threaded. */ #define MAX 10 void start_thread(int* x, int* x_semaphore) { *x += 1; *x_semaphore += 1; } int main() { int x[MAX]; int x_semaphore = MAX; for (1000 times) { for (int i = 0; i < MAX; i++) { x_semaphore -= 1; start_thread(&x[i], &x_semaphore); } while (x_semaphore != MAX) { } /* do nothing */ } int value = sum(x, MAX); print(value); }")
┌─────────┐ ┌───────────┐
│ similar │ │ different │
╘═════════╧═══════════════════════════════────────────────────────────┴───────────┘
|