Remote History: optimised paging iterator and general slicing syntax
Open
Nobody has claimed this yet.
- Dominant language
- Rust
- Stars
- 642
- Forks
- 70
- Avg merge
- 2d 13h
- Merged PRs (30d)
- 21
Description
Remote history iteration currently collects the whole history first; it should stream via a paging iterator. Reversed iteration already routes through __iter__, so it picks the optimised iterator up automatically once implemented. On top of that, general Python slicing syntax (h[a:b], negative steps) can map directly onto the paging APIs.
Raised in review:
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 at the remote history iter entry point and the paging APIs, using the linked review discussion for context. Implement streaming iteration without collecting the full history, then map h[a:b] and negative-step slicing onto paging; verify that reversed iteration still uses the optimized path.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python, rust
- Domain
- database
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Active
- Clarity
- Mostly clear
- Newbie friendliness
- 58/100