Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Optimize consecutive mole-parse-match #2

Open
felipeochoa opened this issue Mar 26, 2018 · 0 comments
Open

Optimize consecutive mole-parse-match #2

felipeochoa opened this issue Mar 26, 2018 · 0 comments
Labels
optimization

Comments

@felipeochoa
Copy link
Owner

There's some monad-like behavior hiding in mole-parse-match: 'fail ~ Nothing and mole-node ~ Just mole-node. I suspect there's some optimization possible here (https://wiki.haskell.org/Performance/Monads), but I'm not sure...
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
optimization
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@felipeochoa