• Martineski@lemmy.fmhy.ml
    link
    fedilink
    arrow-up
    0
    ·
    edit-2
    1 year ago

    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?

    • mycus@kbin.social
      link
      fedilink
      arrow-up
      1
      ·
      edit-2
      1 year ago

      oh yeah, it is n * (n - 1)

      bc ~700 bots need to do ~700 minus 1 actions

      a continue inside an if statement checking if the bot domain is the same as the subscribing one would suffice


      edit: 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@domain entries 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?