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.

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

Improve sorting performance #6

Open
eytans opened this issue Apr 24, 2022 · 0 comments
Open

Improve sorting performance #6

eytans opened this issue Apr 24, 2022 · 0 comments

Comments

@eytans
Copy link
Owner

eytans commented Apr 24, 2022

Currently when we sort parents or nodes we need to clone each node (to be able to use it as a sorting key). We can overcome this by using the "permutations" crate. This will complicate the API a bit, so we should first check how much of an overhead the cloning takes.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant