lists should be backed by a data structure offering O(1)-ish append and prepend
Open
Nobody has claimed this yet.
enhancement
- Dominant language
- CoffeeScript
- Stars
- 57
- Forks
- 28
- PR merge metrics
- No merged PRs in 30d
Description
on the JVM we use scala.collection.immutable.Vector for this
ClojureScript offers something similar, so at least one JS-based implementation exists. @qiemem has found ClojureScript's data structures packaged separately as http://swannodette.github.io/mori/
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
No files, tests, or entry points are named. Start by locating the list implementation and its callers, then compare the JVM Vector and ClojureScript mori references described in the issue. Done means lists use a structure with roughly constant-time append and prepend without breaking existing behavior.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- coffeescript, javascript
- Domain
- backend
- Issue type
- Refactor
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100