this post was submitted on 21 Jun 2023
96 points (99.0% liked)
Lemmy
11947 readers
83 users here now
Everything about Lemmy; bugs, gripes, praises, and advocacy.
For discussion about the lemmy.ml instance, go to [email protected].
founded 4 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
Sorry! My bad, numbers are incorrrect but I'm not sure how to calculate correct numbers lol. Wouldn't it be 700x699 or 699x699 because instance wouldn't have to federate with itself?
oh yeah, it is
n * (n - 1)bc ~700 bots need to do ~700 minus 1 actions
a
continueinside anifstatement checking if the bot domain is the same as the subscribing one would sufficeedit: or use a search algorithm to pop the domain from the stack before starting the loop, that would be more efficient
edit2: even better: assuming all bot names are the same, you just iterate over the stack (constant), and pop each domain (new stack minus popped domain) and feed it to the 2nd loop.
edit3: SCRATCH EVERYTHING. The bot names don't even have to be the same, you just iterate over a constant stack of
botname@domainentries and pop the iteration from it... feed the new stack to the second loop (nested) and done. Why did I take so long to reach this?