=== ANCHOR POEM ===
══════════════════════════════════════════════════════─────────────────────────────
this is the simplest implementation of scalable anarchism I could think of.
tell me how it's flawed so I can improve it before I need it.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═══════════════════════════════════════════════────────────────────────────┘
=== SIMILARITY RANKED ===
--- #1 fediverse/2878 ---
══════════════════════════════════════════════════════─────────────────────────────
advice is always solicited.
help meeee e tell me how I'm wrong so I can get better
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═══════════════════════════════════════════════────────────────────────────┘
--- #2 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 │
╘═════════╧╧════════════════════════════════════════───────────────────────────────────┘
--- #3 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 │
╘═════════╧╧══════════════════════════════════════─────────────────────────────────────┘
--- #4 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 │
╘═════════╧╧═══════════════════════════════════════════════────────────────────────────┘
--- #5 messages/1129 ---
═══════════════════════════════════════════════════════════════════════════════────
ai-stuff - this is how to program a society. (or software project) there are
lots of other implementations
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════════════════════════════════════───┘
--- #6 fediverse/5168 ---
═══════════════════════════════════════════════════════════════════────────────────
this is one of the first scripts I wrote
I can't believe I put the --no-ls AFTER the argument, ha, what a noob.
ah well if it works it works and I can't refactor now because I built it into
random scripts and I'd be fixing errors all the time.
![script 1: #!/bin/bash # sort by filetype would be nice alias cd="cd-improved" function cd-improved(){ if [ "${1}" = "..." ] ; then builtin cd .. && builtin cd .. elif [ "${1}" = "...." ] ; then builtin cd .. && builtin cd .. && builtin cd .. elif [ "${1}" = "....." ] ; then builtin cd .. && builtin cd .. && builtin cd .. && builtin cd .. elif [ -d "./${1}" ] ; then local target_dir="./${1}" elif [ "${1}" = "cdir" ] ; then local target_dir="$(tail -n 1 '/home/ritz/scripts/.cdir-target')" echo ${target_dir} else local target_dir="${1}" fi if [ ! "${2}" = '--no-ls' ] ; then builtin cd "${target_dir}" && ls -v --color=auto else builtin cd "${target_dir}" fi # if the qcd function is defined if declare qcd > /dev/null; then quick_cd -d DEFAULT quick_cd -a DEFAULT fi } script 2: #!/bin/bash function cdir(){ if [ "$#" -eq 0 ]; then pwd | cat >> ~/scripts/.cdir-target elif [ "${1}" == "-l" ]; then cat ~/scripts/.cdir-target fi }](/similar-different/media/f15c9d1918bf9b2e.png "script 1: #!/bin/bash # sort by filetype would be nice alias cd=\"cd-improved\" function cd-improved(){ if [ \"${1}\" = \"...\" ] ; then builtin cd .. && builtin cd .. elif [ \"${1}\" = \"....\" ] ; then builtin cd .. && builtin cd .. && builtin cd .. elif [ \"${1}\" = \".....\" ] ; then builtin cd .. && builtin cd .. && builtin cd .. && builtin cd .. elif [ -d \"./${1}\" ] ; then local target_dir=\"./${1}\" elif [ \"${1}\" = \"cdir\" ] ; then local target_dir=\"$(tail -n 1 '/home/ritz/scripts/.cdir-target')\" echo ${target_dir} else local target_dir=\"${1}\" fi if [ ! \"${2}\" = '--no-ls' ] ; then builtin cd \"${target_dir}\" && ls -v --color=auto else builtin cd \"${target_dir}\" fi # if the qcd function is defined if declare qcd > /dev/null; then quick_cd -d DEFAULT quick_cd -a DEFAULT fi } script 2: #!/bin/bash function cdir(){ if [ \"$#\" -eq 0 ]; then pwd | cat >> ~/scripts/.cdir-target elif [ \"${1}\" == \"-l\" ]; then cat ~/scripts/.cdir-target fi }")
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════════════════════════───────────────┘
--- #7 fediverse/1762 ---
═════════════════════════════════════════════════════──────────────────────────────
This was the first bash script I ever wrote.
It's been updated a little, it was a bash alias first, but this is what it
looks like now.
Kinda shows what kinds of problems I needed to solve most.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧══════════════════════════════════════════════─────────────────────────────┘
--- #8 fediverse/4274 ---
═══════════════════════════════════════════════════════════────────────────────────
this is how I nourish my brain.
By being hopelessly profane.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════════════════───────────────────────┘
--- #9 fediverse/3123 ---
═══════════════════════════════════════════════════════────────────────────────────
using linux requires constant maintenance and that's kind of unfair, actually.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════════════───────────────────────────┘
--- #10 fediverse/2900 ---
══════════════════════════════════════════════════════─────────────────────────────
┌───────────────────────────────────────────────────┐
│ CW: capitalism-mentioned-AI-dataservers-mentioned │
└───────────────────────────────────────────────────┘
what if all the AI advancements they're doing are just them building more
hardware infrastructure in datacenters and not actually improving the software
that much
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═══════════════════════════════════════════════────────────────────────────┘
--- #11 fediverse/1178 ---
═══════════════════════════════════════════════────────────────────────────────────
@user-883
copyright is a flawed system, I'm not surprised it would keep us from the best
path forward. >: (
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════───────────────────────────────────┘
--- #12 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 │
╘═════════╧╧══════════════════════════════════════════════─────────────────────────────┘
--- #13 fediverse/617 ---
═════════════════════════════════════════════──────────────────────────────────────
So much of computing is just... handling the quirks of hardware and presenting
it to the user (programmer) in a way that is sane and makes sense, instead of
the arcane and [nebulous/confabulous/incomprehensible] way that physical
nature demands our absurdly potentialized computational endeavors be.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧══════════════════════════════════════─────────────────────────────────────┘
--- #14 fediverse/5297 ---
═════════════════════════════════════════════════════════════════════──────────────
┌──────────────────────┐
│ CW: re: piss, ?? │
└──────────────────────┘
@user-1797
this is something I routinely fail at T.T
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧══════════════════════════════════════════════════════════════─────────────┘
--- #15 fediverse/4804 ---
═══════════════════════════════════════════════════════════════────────────────────
I love it when wine doesn't work because it "failed to open program.exe"
... okay, can you tell me why it failed?
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════════════════════───────────────────┘
--- #16 fediverse/3680 ---
════════════════════════════════════════════════════════───────────────────────────
it's probably a good idea to write pseudocode, then real code, instead of
starting with real code, and bugfixing something incomplete and more difficult
to reason with.
unless you write real code easier than pseudocode. idk do what works for you.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═════════════════════════════════════════════════──────────────────────────┘
--- #17 fediverse/94 ---
══════════════════════════════════════════─────────────────────────────────────────
@user-107 If you can figure out how to do it well, everything else seems less
difficult. : )
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═══════════════════════════════════────────────────────────────────────────┘
--- #18 fediverse/4118 ---
═══════════════════════════════════════════════════════════────────────────────────
all modern software should be written in a multithreaded way, change my mind
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧════════════════════════════════════════════════════───────────────────────┘
--- #19 fediverse/1977 ---
═════════════════════════════════════════════════════──────────────────────────────
functions should be forced to describe the context of why they were being
called. I think it would help debug a lot if we supplied a reasoning for each
and every request [function call] that we made. We might even be able to parse
them into semantic pyramids which we could sorta use to estimate [tree-like
scanning] how and why the program did do wrong.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧══════════════════════════════════════════════─────────────────────────────┘
--- #20 fediverse/2400 ---
══════════════════════════════════════════════════════─────────────────────────────
@user-1165
I am an anarchist. My strategy is to let the DSA be the centralized vanguard
party. If another emerges, let them share responsibilities - every burden
taken off your back is more energy that can be applied to what you are sworn
to care for.
┌─────────┐ ┌───────────┐
│ similar │ chronological │ different │
╘═════════╧╧═══════════════════════════════════════════════────────────────────────────┘
|