Aggregate points by shapes lazily
Open
Nobody has claimed this yet.
- Dominant language
- Python
- Stars
- 394
- Forks
- 95
- Avg merge
- 4d 3h
- Merged PRs (30d)
- 7
Description
Issue to keep track of this particular aggregation case.
Currently when aggregating points by shapes, all the points are loaded into memory. Ideally this would be done incrementally by keeping the data lazy.
When implemented, remove the docstring in aggregate() that explains the current performance limitation.
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
Start by locating the aggregate() entry point and read its docstring, which describes the current performance limitation. Trace how points are loaded during aggregation by shapes, then verify the operation remains lazy and incremental; when complete, remove that limitation docstring.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- data
- Issue type
- Refactor
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 38/100