Implement lazy reverse functions
Open
algo
- Dominant language
- Haskell
- Stars
- 63
- Forks
- 1
- PR merge metrics
- No merged PRs in 30d
Description
Special case of #21
- [ ] `reverseAt`
- [ ] `reverse`
Contributor guide
Research direction
Start with issue #21, which this issue identifies as the broader context, then inspect the treap API and locate the reverseAt and reverse entry points. Determine the intended lazy behavior from that context and add or update tests for both checklist items; done means both functions are implemented and verified.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- haskell
- Domain
- data
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 30/100