We're the creators of Lemmy, Ask Us Anything. *Starts Monday, 7 Aug, 1500 CEST* - eviltoast

This is an opportunity for any users, server admins, or interested third parties to ask anything they’d like to @nutomic@lemmy.ml and I about Lemmy. This includes its development and future, as well as wider issues relevant to the social media landscape today.

Note: This will be the thread tmrw, so you can use this thread to ask and vote on questions beforehand.

Original Announcement thread

  • Dessalines@lemmy.mlOPM
    link
    fedilink
    English
    arrow-up
    13
    ·
    1 year ago

    We have an open issue for collections of communities, but not for any complicated trees of communities. Creating and linking community trees sounds really complicated, and I don’t know how all that would work.

    • TheWanderer@lemmy.ml
      link
      fedilink
      English
      arrow-up
      5
      ·
      1 year ago

      I don’t know how the code is currently working, but I like this feature idea and would suggest to start very simple and proceed from there.

      For example you could: a) Make a list of communities that are siblings with their id and instance b) add a toggle to view sister community posts yes /no c) query all communities, list the last x posts from each with time constraints, e.g. not older than 1 day or hour depending on the community post frequency d) list them sorted by time of x , depending on what was chosen

      The biggest issue I see with this simple approach, besides others, is that different communities are different in terms of activity / post frequency. So ideally the better, but more effort, way would be to let each community instance communicate their posts themselves via a query with activity metric parameters. Basically the amount of returned posts would depend on common parameters set by the most active instance.

      It’s not yet thought out, but just getting an mvp started and test the waters would probably be better than having it perfect right away while working on it for months