purescript / purescript/pursuit
Search with shuffled argument order
Nobody has claimed this yet.
- Dominant language
- Haskell
- Stars
- 174
- Forks
- 47
- PR merge metrics
- No merged PRs in 30d
Description
I often miss results due to random choice of argument order. For example:
Either a x -> (a -> a) -> Either a xdoesn't return anything useful.(a -> a) -> Either a x -> Either a xpoints tolmapwhich is exactly what I need.
For users who don't yet have that 6th sense of expected argument order and don't remember to try all arrangements, it could be nice for pursuit to handle this shuffling for them.
Contributor guide
No contributing guide indexed for this repository
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 implementation files or tests are named. Start by locating Pursuit's search entry point and query parsing, then compare the two linked example searches. Done means equivalent searches with shuffled argument order return the same useful results, with regression coverage for the examples.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- haskell
- Domain
- search
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100