search

KristofferC / NearestNeighbors.jl

High performance nearest neighbor data structures (KDTree and BallTree) and algorithms for Julia.
Other
413 stars 65 forks source link

Get code running in Julia 1.3 #102

Closed goretkin closed 4 years ago

goretkin commented 4 years ago

These seems like useful benchmarking code for this package.

KristofferC commented 4 years ago

Thanks!

codecov-io commented 4 years ago

Codecov Report

Merging #102 into master will decrease coverage by 0.04%. The diff coverage is n/a.

Impacted file tree graph

@@            Coverage Diff             @@
##           master     #102      +/-   ##
==========================================
- Coverage   95.51%   95.47%   -0.05%     
==========================================
  Files          13       13              
  Lines         468      508      +40     
==========================================
+ Hits          447      485      +38     
- Misses         21       23       +2
Impacted Files Coverage Δ
src/datafreetree.jl 82.14% <0%> (-13.1%) :arrow_down:
src/inrange.jl 95.83% <0%> (-4.17%) :arrow_down:
src/brute_tree.jl 96% <0%> (-4%) :arrow_down:
src/knn.jl 96.42% <0%> (-3.58%) :arrow_down:
src/kd_tree.jl 98.24% <0%> (-0.81%) :arrow_down:
src/tree_data.jl 100% <0%> (ø) :arrow_up:
src/ball_tree.jl 97.46% <0%> (+0.09%) :arrow_up:
src/utilities.jl 100% <0%> (+2.08%) :arrow_up:
src/hyperrectangles.jl 81.81% <0%> (+2.87%) :arrow_up:
src/hyperspheres.jl 100% <0%> (+3.22%) :arrow_up:
... and 2 more

Continue to review full report at Codecov.

Legend - Click here to learn more Δ = absolute <relative> (impact), ø = not affected, ? = missing data Powered by Codecov. Last update 8a37ae5...453a242. Read the comment docs.