=== ANCHOR POEM ===
═════════════════════════════════════════════════════──────────────────────────────
@user-1037
I guess I'm saying that for non-standard functions (most of them) they should
need to make a ticket every time they want to run a function call. Perhaps
only in debug mode...
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧══════════════════════════════════════════════─────────────────────────────┘
=== SIMILARITY RANKED ===
--- #1 fediverse/5189 ---
═══════════════════════════════════════════════════════════════════────────────────
computer programming essentially boils down to putting the right values into
the right datastructures at the right time and in the right order.
If you count a function call as a datastructure, which I do, because I have
opinions.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════════════════════════───────────────┘
--- #2 fediverse/5663 ---
═══════════════════════════════════════════════════════════════════════────────────
I'm going to write some lua code that doesn't do anything useful and which I
don't share with anyone
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════════════════════════════───────────┘
--- #3 fediverse/3274 ---
═══════════════════════════════════════════════════════────────────────────────────
"I can't remember that function, it does too few things"
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════════════───────────────────────────┘
--- #4 fediverse/1482 ---
════════════════════════════════════════════════───────────────────────────────────
@user-192
I feel like SSH keys to log into every website should be a standard
or something similar
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═════════════════════════════════════════──────────────────────────────────┘
--- #5 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 │
╘═════════╧╧════════════════════════════════════════───────────────────────────────────┘
--- #6 fediverse/286 ---
════════════════════════════════════════════───────────────────────────────────────
┌──────────────────────┐
│ CW: re: mathematics │
└──────────────────────┘
@user-211 I agree! The problem is the limit as x->0 from the left and right
trend toward different infinities, meaning it's neither -infinity nor
+infinity. Which makes me think that it's the value that's exactly in the
middle, AKA zero.
Why wouldn't 1/0 be zero? Division is just inverse-multiplication, and
multiplying anything by zero is zero. Why wouldn't division use the same
rules? I don't understaaaaaand T.T
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═════════════════════════════════════──────────────────────────────────────┘
--- #7 fediverse/44 ---
═════════════════════════════════════──────────────────────────────────────────────
@user-36 So, you're saying the tally system doesn't make sense, and instead
what I suggested for base zero is instead base 1?
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧══════════════════════════════─────────────────────────────────────────────┘
--- #8 fediverse/4291 ---
═══════════════════════════════════════════════════════════────────────────────────
complex systems can be simple if you think about what they need, and what they
do.
it's not perfect, but you're always free to zoom in if needed.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════════════════───────────────────────┘
--- #9 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 │
╘═════════╧╧═══════════════════════════════════────────────────────────────────────────┘
--- #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/3124 ---
═══════════════════════════════════════════════════════────────────────────────────
I should not have to follow 16 steps that I don't understand just because you
decided my system wasn't good enough for me.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════════════───────────────────────────┘
--- #12 fediverse/1035 ---
═══════════════════════════════════════════════────────────────────────────────────
@user-757 @user-192
true and my suggestion doesn't provide a tracelog, pretty much just the status
of the variables when it pauses or ends.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════───────────────────────────────────┘
--- #13 messages/972 ---
═════════════════════════════════════════════════════════════════════════──────────
vibecoders write detailed instructions. "A for loop which iterates through all
of the elements" and not "a package manager that stores all of it's instants"
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧══════════════════════════════════════════════════════════════════─────────┘
--- #14 messages/455 ---
═════════════════════════════════════════════════════──────────────────────────────
I don't understand why modern software isn't error correcting. We shouldn't
have any bugs in this day and age.
For example, if you're missing a dependency then why doesn't your program try
to, I dunno, download that dependency to the program's installation directory
and use it there? Seriously there are very few problems that are unsolvable!
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧══════════════════════════════════════════════─────────────────────────────┘
--- #15 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 │
╘═════════╧╧══════════════════════════════════════════════─────────────────────────────┘
--- #16 fediverse/316 ---
════════════════════════════════════════════───────────────────────────────────────
┌──────────────────────┐
│ CW: mathematics │
└──────────────────────┘
ask not "what can logarithms do for you" but rather "what shape does a
logarithm make"
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═════════════════════════════════════──────────────────────────────────────┘
--- #17 fediverse/6348 ---
═════════════════════════════════════════════════════════════════════════════──────
here's a neat function
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧══════════════════════════════════════════════════════════════════════─────┘
--- #18 fediverse/4084 ---
═══════════════════════════════════════════════════════════────────────────────────
┌──────────────────────┐
│ CW: re: -mentioned │
└──────────────────────┘
@user-1074
the more you try, the more you have to calculate, which is a problem, because
endlessly recursive calculations create infinite loops, which frankly are
impossible to compute because they defy computation! Not good, not ideal, no
thank you, not for me, no thanks, not what I'd like.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════════════════───────────────────────┘
--- #19 fediverse/276 ---
════════════════════════════════════════════───────────────────────────────────────
┌──────────────────────┐
│ CW: mathematics │
└──────────────────────┘
why the heck would -11/2 be defined but 1/0 not be? seems kinda sus to me.
maybe it's just... not reducible, the same way that 5+i isn't?
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═════════════════════════════════════──────────────────────────────────────┘
--- #20 messages/412 ---
════════════════════════════════════════════════════───────────────────────────────
Coding superpower:
Start thread
While(true):
Run();
Then, whenever you want it to run something else, change the function pointer
that run() uses to call a function
At the end of the run() function, set the function pointer in the while loop
to the next one. That way you don't stack overflow from the recursion.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═════════════════════════════════════════════──────────────────────────────┘
|