linksplatform / linksplatform/Data.Doublets
A faster way to read incoming and outgoing links from index
Nobody has claimed this yet.
- Dominant language
- C#
- Stars
- 14
- Forks
- 5
- PR merge metrics
- No merged PRs in 30d
Description
A `read from the middle` or `start from the middle` method of reading of the tree.
We can use a root link as a first, two links from left and right subtrees as second and third and so on.
This way it is possible to get the first using only a single jump in memory.
There is no guaranty on the order of incoming and outgoing links set, so it is ok to different order.
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
No file or test is named. Start by locating the index and tree-reading entry points, then determine how root and left/right subtree links are currently traversed; done means a middle-out read is supported with one initial memory jump and accepts any incoming/outgoing link order.
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