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

Add skip predicate to inrange #53

Open
Datseris opened this issue Sep 25, 2017 · 0 comments
Open

Add skip predicate to inrange #53

Datseris opened this issue Sep 25, 2017 · 0 comments

Comments

@Datseris
Copy link

Datseris commented Sep 25, 2017

Is this not possible to be done, which is why it does not exist?
If yes, sorry for the reduntant issue!

Since it is common that inrange can be used for points that also belong in the dataset that composes a tree, a skip predate could be useful. But also generally as well.

For now I use

point = dataset[n]
idxs = inrange(tree, point, ϵ)
deleteat!(idxs, findin(idxs, n))
schmrlng added a commit to schmrlng/NearestNeighbors.jl that referenced this issue Nov 4, 2017
schmrlng added a commit to schmrlng/NearestNeighbors.jl that referenced this issue Nov 4, 2017
schmrlng added a commit to schmrlng/NearestNeighbors.jl that referenced this issue Nov 10, 2017
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