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

Determine ideal ordering of parsers in recursiveQ #167

Open
valencik opened this issue Nov 11, 2024 · 0 comments
Open

Determine ideal ordering of parsers in recursiveQ #167

valencik opened this issue Nov 11, 2024 · 0 comments

Comments

@valencik
Copy link
Collaborator

valencik commented Nov 11, 2024 •
edited
Loading

Good point!
I tested with termAndWildCardQ last and all tests still passed.
However, these cases are checked in order, so moving it around could have some performance implications.
In the sense that it could be faster or slower, I don't know.
I'm going to open an issue to look into this, and perhaps use our benchmarks to help come up with a principled approach to deciding on this order.

Originally posted by @valencik in #154 (comment)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@valencik