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

Implement nearest neighbor searches on RTree #79

Merged
merged 6 commits into from
Dec 30, 2024

Conversation

kylebarron
Copy link
Owner

@kylebarron kylebarron commented Dec 29, 2024

Perhaps we should just document that inserting NaNs is invalid. And then we have a custom implementation of Ord that just calls PartialOrd and then unwrap().

garro95/priority-queue#27 (comment)

That means we wouldn't have to reach for OrderedFloat and bloat the API.

@kylebarron kylebarron enabled auto-merge (squash) December 30, 2024 00:25
@kylebarron kylebarron merged commit 59fdaa9 into main Dec 30, 2024
5 checks passed
@kylebarron kylebarron deleted the kyle/rtree-nearest-neighbor branch December 30, 2024 00:26
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

Successfully merging this pull request may close these issues.

1 participant