Open
Conversation
Contributor
Author
|
I removed the |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This PR rewrites some of the core distance calculations in Rust, using crates such as kiddo (k-d trees) and rayon (parallelization) to faithfully re-implement this logic. The result is a drop-in replacement for the original, passing all tests and running significantly faster.
A few notes:
uvfor dependency management and to run CI testspyproject.toml, I went ahead and bumped the version to 0.4.0I recommend releasing something like 0.4.0-alpha to ensure the package distributes correctly, and give end users the chance to test this package in their environments before making a full 0.4.0 release.