- cross-posted to:
- fediverse
- fediverse@kbin.social
- fediverse@lemmy.ml
- cross-posted to:
- fediverse
- fediverse@kbin.social
- fediverse@lemmy.ml
Seems like an interesting effort. A developer is building an alternative Java-based backend to Lemmy’s Rust-based one, with the goal of building in a handful of different features. The dev is looking at using this compatibility to migrate their instance over to the new platform, while allowing the community to use their apps of choice.
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.
deleted by creator
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.
deleted by creator
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.