Parallel parsing
Nobody has claimed this yet.
Assessment
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Newbie friendliness
- 35/100
- Issue type
- Refactor
- Clarity
- Needs clarification
- Activity status
- Stale
- Tech stack
- cpp
- Domain
- cli, performance
Research direction
Start at the entry point for tile-count-create and compare its parsing and reprojection flow with tippecanoe -P; the issue names no source files or tests. Done means parsing and reprojection are parallelized while preserving correct tile counts.
Written by the indexing model from the issue text.
Description
Parsing and reprojecting input is the bottleneck in tile-count-create. It should be parallelized like tippecanoe -P.
- Dominant language
- C++
- Stars
- 32
- Forks
- 9
- PR merge metrics
- No merged PRs in 30d
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.
More from mapbox/tile-count
-
Difficulty 3/5 1-2 days Newbie friendliness 25/100
mapbox/tile-count#57 · 1 comment ·
-
Difficulty 5/5 Over a week Newbie friendliness 25/100
mapbox/tile-count#54 ·
-
Difficulty 5/5 Over a week Newbie friendliness 25/100
mapbox/tile-count#49 · 1 comment ·
-
Difficulty 4/5 3-5 days Newbie friendliness 35/100
mapbox/tile-count#46 · 3 comments ·
-
Difficulty 4/5 3-5 days Newbie friendliness 25/100
mapbox/tile-count#36 ·
All issues in mapbox/tile-count
Similar issues
-
Difficulty 1/5 Under an hour Newbie friendliness 90/100
AXERA-TECH/ax-llm#77 ·
-
Difficulty 1/5 Under an hour Newbie friendliness 90/100
games-on-whales/wolf#509 ·
-
Difficulty 2/5 1-3 hours Newbie friendliness 74/100
-
bug-unconfirmed
Difficulty 2/5 1-3 hours Newbie friendliness 76/100
-
Difficulty 2/5 1-3 hours Newbie friendliness 74/100
NVIDIA/cuda-samples#453 ·