Neighborhood.jl is a Julia package that provides a unified interface for doing neighbor searches in Julia. This interface is described in this page.
searchstructure
All currently supported search structures are:
using Neighborhood # hide
for ss in Neighborhood.SSS # hide
println(ss) # hide
end # hide
The following functions are defined for search structures:
Neighborhood.datatype
Neighborhood.getmetric
search
isearch
inrange
inrangecount
knn
SearchType
WithinRange
NeighborNumber
Some packages support higher performance when doing bulk searches (instead of individually calling search many times).
bulksearch
bulkisearch
The BruteForce "search structure" performs a linear search
through its data array, calculating the distance from the query to each data
point. This is the slowest possible implementation but can be used to check
results from other search structures for correctness. The
Neighborhood.bruteforcesearch function can be used instead without
having to create the search structure.
Neighborhood.bruteforcesearch
BruteForce
Theiler