parallelize finding siblings function
Nobody has claimed this yet.
- Dominant language
- JavaScript
- Stars
- 6
- Forks
- 1
- PR merge metrics
- No merged PRs in 30d
Description
We currently use nested for loops to traverse the grid of our relevant tile sibling. To avoid a performance penalty if we ever support generating larger images, it could save us some grief to parallelize this step using Promises instead.
Or we could just use the well benched @mapbox/tilebelt & not worry too much about it.
cc/ @corporategoth
Contributor guide
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
The issue names no files, tests, or entry points. Locate the function that finds sibling tiles, then compare the current nested-loop traversal with the proposed Promise approach and the @mapbox/tilebelt alternative. Done should include preserving sibling discovery while showing that the change improves performance for larger images.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- javascript
- Domain
- computer-graphics
- Issue type
- Refactor
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100