this post was submitted on 23 Jan 2024
363 points (96.7% liked)
Fediverse
28237 readers
314 users here now
A community to talk about the Fediverse and all it's related services using ActivityPub (Mastodon, Lemmy, KBin, etc).
If you wanted to get help with moderating your own community then head over to !moderators@lemmy.world!
Rules
- Posts must be on topic.
- Be respectful of others.
- Cite the sources used for graphs and other statistics.
- Follow the general Lemmy.world rules.
Learn more at these websites: Join The Fediverse Wiki, Fediverse.info, Wikipedia Page, The Federation Info (Stats), FediDB (Stats), Sub Rehab (Reddit Migration), Search Lemmy
founded 1 year ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
I think how quickly this project has gotten to near feature parity is a testament to how slow Lemmy development has been. Think about scaled sort (a feature that has been hotly requested since the migration) and how long that took to get merged in. A sort should not by any means be slow to implement.
Sure but even just recently there was the example of breaking federation over Christmas. Some of those issues persist through 0.19.3 which came out today
Similarly scaled sort would have made a huge difference for small communities in the period directly after the migration.
Quite the opposite, often it's a benefit as you don't end up wasting time and changing code for features where you don't actually know yet whether your current usage demands or supports them. There's a lot of genefit in not moving fast and not breaking things. Mostly that, well, you don't constantly break things.
Sure, if the sort key is something readily available. But for scaled sort they have to compute relative size/activity of the communities the specific user is in. The cost isn't the sort, it's computing the metric.
I'm not talking about the literal sorting algorithm. Pretty sure scaled sort is exactly one more operation than hot.