Finishing the Distributed Data Structures
Roadmap note — open work items #37–40, #45, #46
The DDS layer — distributed sets, lists and trees — is LibreSocial's crown jewel
(Sets, Lists and Trees, 2016).
But one of its four data types has been a partial stub since the Paderborn era:
DistributedLinkedList ships interface methods without implementations.
The GitLab tracker records exactly what is missing:
add(#37),addAll(#41),listIterator(#38, #39),subList(#40) — stub implementations to finish. Each follows a pattern theDistributedListalready proves: chunk the list into content objects, address chunks by key, merge deltas on replicas. These are perfect small, self-contained theses-or-seminar contributions with a clear correctness criterion (equivalence tojava.util.LinkedListsemantics under distribution).- Migrate deprecated storage access (#45): old plugin call sites should move to the current StorageDispatcher API before the deprecated path is removed.
- Refactor oversized communication interfaces (#46): some framework interfaces grew too broad; splitting them simplifies the upcoming Bndtools module boundaries.
Why care: a complete DDS means forum threads, threaded comments and ordered feeds can be built by anyone — the tree and list primitives will finally all be there.