=== ANCHOR POEM ===
══════════════════════════════════════════════─────────────────────────────────────
@user-192
It's totally simple! It's just structs, void pointers, function pointers,
arrays, mallocs, and oh boy I think I see what you mean
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═══════════════════════════════════════────────────────────────────────────┘
=== SIMILARITY RANKED ===
--- #1 fediverse/2922 ---
══════════════════════════════════════════════════════─────────────────────────────
@user-192
now I want to re-implement strings as structs in C! I don't know why I never
thought of them that way.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═══════════════════════════════════════════════────────────────────────────┘
--- #2 fediverse/1810 ---
═════════════════════════════════════════════════════──────────────────────────────
some people hear words like "datastructures" and "object-oriented programming"
and think they're made up terms that don't mean anything important.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧══════════════════════════════════════════════─────────────────────────────┘
--- #3 fediverse/4111 ---
═══════════════════════════════════════════════════════════────────────────────────
@user-1636
... Is that already a thing? I should look around more, teehee
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════════════════───────────────────────┘
--- #4 messages/186 ---
═══════════════════════════════════════════════────────────────────────────────────
It's obfuscated, such that you cannot know the totality of their purpose for
you (via your data)
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════───────────────────────────────────┘
--- #5 fediverse/94 ---
══════════════════════════════════════════─────────────────────────────────────────
@user-107 If you can figure out how to do it well, everything else seems less
difficult. : )
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═══════════════════════════════════────────────────────────────────────────┘
--- #6 fediverse/3817 ---
═════════════════════════════════════════════════════════──────────────────────────
hey, anyone wanna build the matrix with me? minus the human CPUs of course.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧══════════════════════════════════════════════════─────────────────────────┘
--- #7 fediverse/2879 ---
══════════════════════════════════════════════════════─────────────────────────────
┌────────────────────────┐
│ CW: re: tech info-dump │
└────────────────────────┘
@user-1370
I love this a lot! I want to put function pointers in a "matrix architecture
array" and make them point to different functions at different points in the
program. I bet you could even point them at each other, so like if M and Y
then point at N, A, Y or something.
this is really cool I like stuff like this tomorrow I'll take pictures of
something similar I'm working on! I abandoned it tho hehe anyway remind me if
I forget!!
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═══════════════════════════════════════════════────────────────────────────┘
--- #8 fediverse/2918 ---
══════════════════════════════════════════════════════─────────────────────────────
@user-192
You're cool!
I always thought of abstracting something as "applying intelligence to hasten
logical conclusions"
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═══════════════════════════════════════════════────────────────────────────┘
--- #9 fediverse/4083 ---
═══════════════════════════════════════════════════════════────────────────────────
It's easy to stop cringing at others, but how the heck do you stop cringing at
yourself?? it's impossible!!
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════════════════───────────────────────┘
--- #10 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); }](/similar-different/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 │ chronological │ different │
╘═════════╧╧══════════════════════════════════════─────────────────────────────────────┘
--- #11 fediverse/19 ---
═══════════════════════════════════────────────────────────────────────────────────
@user-28 I think about this a lot
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════───────────────────────────────────────────────┘
--- #12 fediverse/111 ---
══════════════════════════════════════════─────────────────────────────────────────
@user-95 that's why I like programming - it's my favorite form of spelling.
i'm not very good at remembering all the names and the numbers, but I like to
think I can make things do a function.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═══════════════════════════════════────────────────────────────────────────┘
--- #13 fediverse/142 ---
══════════════════════════════════════════─────────────────────────────────────────
@user-135 I only sorta know what that means 🙃
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═══════════════════════════════════────────────────────────────────────────┘
--- #14 fediverse_boost/6162 ---
◀─╔═══════════════════════════════[BOOST]═════════════════════════════════───────╗
║ ┌────────────────────────────────────────────────────────────────────────────┐ ║
║ │ i always somehow manage to succeed at things because i'm too silly to realize i was supposed to fail lmao │ ║
║ └────────────────────────────────────────────────────────────────────────────┘ ║
╠─────────┐ ┌───────────╣
║ similar │ chronological │ different ║
╚═════════╧════════════════════════════════════════════════════════════╧───────╝─▶
--- #15 messages/111 ---
═════════════════════════════════════════════──────────────────────────────────────
When someone remakes content into a different expression like a remake or
reboot or whatever it gives a different message in its meaning - some
circumstances and characters can apply for more than one message I'm it's
meaning
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧══════════════════════════════════════─────────────────────────────────────┘
--- #16 fediverse_boost/6053 ---
◀─╔═══════════════════════════════[BOOST]════════════════════════════════────────╗
║ ┌────────────────────────────────────────────────────────────────────────────┐ ║
║ │ i post compulsively lmfao │ ║
║ └────────────────────────────────────────────────────────────────────────────┘ ║
╠─────────┐ ┌───────────╣
║ similar │ chronological │ different ║
╚═════════╧════════════════════════════════════════════════════════════┴───────╝─▶
--- #17 fediverse/4621 ---
═════════════════════════════════════════════════════════════──────────────────────
@user-1716
there's already a web browser named surf 🙃 it's much more minimal than this
one tho
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧══════════════════════════════════════════════════════─────────────────────┘
--- #18 fediverse/4226 ---
═══════════════════════════════════════════════════════════────────────────────────
This should go without saying, but...
I'm here for you.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════════════════───────────────────────┘
--- #19 fediverse/1034 ---
═══════════════════════════════════════════════────────────────────────────────────
@user-192
be careful, recursion can cause stack overflows.
better to run function pointers from a loop. That way you can operate as long
as necessary. Just make sure you don't get in an infinite loop...
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════───────────────────────────────────┘
--- #20 fediverse/3123 ---
═══════════════════════════════════════════════════════────────────────────────────
using linux requires constant maintenance and that's kind of unfair, actually.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════════════───────────────────────────┘
|