You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Jan 28, 2024. It is now read-only.
The use of the HashMap to calculate the indices is fine for most applications. However, if there is some application where there is some metadata attached to the items in the tree and there are two items that have the same position, then only one such item will be returned. That is, if both points are k-nearest neighbors, then the returned value with include a duplicate of one of them instead of both unique elements.
The text was updated successfully, but these errors were encountered:
Sign up for freeto subscribe to this conversation on GitHub.
Already have an account?
Sign in.
The use of the
HashMap
to calculate the indices is fine for most applications. However, if there is some application where there is some metadata attached to the items in the tree and there are two items that have the same position, then only one such item will be returned. That is, if both points are k-nearest neighbors, then the returned value with include a duplicate of one of them instead of both unique elements.The text was updated successfully, but these errors were encountered: