linksplatform / linksplatform/Data.Doublets
Check if it is possible to use bit by bit addressing of the binary tree sequence without size limitations
Nobody has claimed this yet.
- Dominant language
- C#
- Stars
- 14
- Forks
- 5
- PR merge metrics
- No merged PRs in 30d
Description
For example:
0 means source, 1 means target,
2 means source.source, 3 means source.target, 4 means target.source, 5 means target.target,
6 means source.source.source and so on.
This way it will be possible to address any sequence with any structure, but it may not contain all indexes/addresses.
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start with csharp/Platform.Data.Doublets/ILinksExtensions.cs around line 201 and trace how binary-tree sequence addresses are currently represented. Determine whether bit-by-bit addressing can remove size limits while allowing missing indexes or addresses. Done means recording a clear feasibility result and the required scope, rather than implementing an unspecified design.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- csharp
- Domain
- backend
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100