schmrlng/NearestNeighbors.jl#56.md

## NearestNeighbors.jl#56.md

      
    Raw
  

              NearestNeighbors.jl#56.md
            
          
    Comparison (PR#56 vs master)

A ratio greater than 1.0 denotes a possible regression (marked with ❌), while a ratio less
than 1.0 denotes a possible improvement (marked with ✅). Only significant results - results
that indicate possible regressions or improvements - are shown below (thus, an empty table means that all
benchmark results remained invariant between builds).


ID
time ratio
memory ratio


["inrange", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1000, r = 1.91e-01"]
0.92 (5%) ✅
1.00 (1%)


["inrange", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1000, r = 1.91e-01"]
0.92 (5%) ✅
1.00 (1%)


["inrange", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1, r = 1.91e-01"]
0.92 (5%) ✅
1.00 (1%)


["inrange", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1, r = 1.91e-01"]
0.95 (5%) ✅
1.00 (1%)


["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1, k = 1"]
0.84 (5%) ✅
1.00 (1%)


["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1, k = 10"]
0.89 (5%) ✅
1.00 (1%)


["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1000, k = 1"]
0.74 (5%) ✅
1.00 (1%)


["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1000, k = 10"]
0.87 (5%) ✅
1.00 (1%)


["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1, k = 1"]
0.85 (5%) ✅
1.00 (1%)


["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1, k = 10"]
0.85 (5%) ✅
1.00 (1%)


["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1000, k = 1"]
0.75 (5%) ✅
1.00 (1%)


["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1000, k = 10"]
0.81 (5%) ✅
1.00 (1%)


["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1, k = 1"]
0.88 (5%) ✅
1.00 (1%)


["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1, k = 10"]
0.88 (5%) ✅
1.00 (1%)


["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1000, k = 1"]
0.82 (5%) ✅
1.00 (1%)


["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1000, k = 10"]
0.90 (5%) ✅
1.00 (1%)


["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1, k = 1"]
0.86 (5%) ✅
1.00 (1%)


["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1, k = 10"]
0.88 (5%) ✅
1.00 (1%)


["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1000, k = 1"]
0.83 (5%) ✅
1.00 (1%)


["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1000, k = 10"]
0.86 (5%) ✅
1.00 (1%)


["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1, k = 1"]
0.90 (5%) ✅
1.00 (1%)


["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1000, k = 1"]
0.92 (5%) ✅
1.00 (1%)


["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1, k = 1"]
0.91 (5%) ✅
1.00 (1%)


["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1, k = 10"]
0.94 (5%) ✅
1.00 (1%)


["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1000, k = 1"]
0.92 (5%) ✅
1.00 (1%)


["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1, k = 1"]
0.74 (5%) ✅
0.98 (1%) ✅


["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1, k = 10"]
0.77 (5%) ✅
0.98 (1%) ✅


["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1000, k = 1"]
0.41 (5%) ✅
0.88 (1%) ✅


["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1000, k = 10"]
0.60 (5%) ✅
0.92 (1%) ✅


["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1, k = 1"]
0.74 (5%) ✅
0.98 (1%) ✅


["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1, k = 10"]
0.76 (5%) ✅
0.98 (1%) ✅


["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1000, k = 1"]
0.44 (5%) ✅
0.88 (1%) ✅


["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1000, k = 10"]
0.58 (5%) ✅
0.92 (1%) ✅


["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1, k = 1"]
0.75 (5%) ✅
0.98 (1%) ✅


["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1, k = 10"]
0.77 (5%) ✅
0.98 (1%) ✅


["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1000, k = 1"]
0.51 (5%) ✅
0.88 (1%) ✅


["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1000, k = 10"]
0.66 (5%) ✅
0.92 (1%) ✅


["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1, k = 1"]
0.75 (5%) ✅
0.98 (1%) ✅


["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1, k = 10"]
0.77 (5%) ✅
0.98 (1%) ✅


["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1000, k = 1"]
0.52 (5%) ✅
0.88 (1%) ✅


["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1000, k = 10"]
0.64 (5%) ✅
0.92 (1%) ✅


["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1, k = 1"]
0.80 (5%) ✅
0.97 (1%) ✅


["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1, k = 10"]
0.84 (5%) ✅
0.97 (1%) ✅


["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1000, k = 1"]
0.46 (5%) ✅
0.85 (1%) ✅


["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1000, k = 10"]
0.85 (5%) ✅
0.89 (1%) ✅


["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1, k = 1"]
0.80 (5%) ✅
0.97 (1%) ✅


["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1, k = 10"]
0.84 (5%) ✅
0.97 (1%) ✅


["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1000, k = 1"]
0.47 (5%) ✅
0.85 (1%) ✅


["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1000, k = 10"]
0.80 (5%) ✅
0.89 (1%) ✅


["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1, k = 1"]
0.81 (5%) ✅
0.97 (1%) ✅


["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1, k = 10"]
0.88 (5%) ✅
0.97 (1%) ✅


["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1000, k = 1"]
0.56 (5%) ✅
0.85 (1%) ✅


["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1000, k = 10"]
0.89 (5%) ✅
0.89 (1%) ✅


["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1, k = 1"]
0.79 (5%) ✅
0.97 (1%) ✅


["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1, k = 10"]
0.85 (5%) ✅
0.97 (1%) ✅


["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1000, k = 1"]
0.57 (5%) ✅
0.85 (1%) ✅


["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1000, k = 10"]
0.86 (5%) ✅
0.89 (1%) ✅


Single Reports

pull request #56 (https://github.com/KristofferC/NearestNeighbors.jl/tree/49f89e8b9879b77084bca56158c5b8df82299c8e)


ID
time
GC time
memory
allocations


["build tree", "NearestNeighbors.BallTree 1 × 1000, ls = 1"]
234.793 μs (5%)
0.000 ns
41.84 KiB (1%)
47


["build tree", "NearestNeighbors.BallTree 1 × 1000, ls = 10"]
110.338 μs (5%)
0.000 ns
13.77 KiB (1%)
46


["build tree", "NearestNeighbors.BallTree 1 × 100000, ls = 1"]
32.371 ms (5%)
0.000 ns
3.82 MiB (1%)
48


["build tree", "NearestNeighbors.BallTree 1 × 100000, ls = 10"]
19.943 ms (5%)
0.000 ns
1.07 MiB (1%)
48


["build tree", "NearestNeighbors.BallTree 3 × 1000, ls = 1"]
515.412 μs (5%)
0.000 ns
73.14 KiB (1%)
47


["build tree", "NearestNeighbors.BallTree 3 × 1000, ls = 10"]
249.881 μs (5%)
0.000 ns
16.94 KiB (1%)
46


["build tree", "NearestNeighbors.BallTree 3 × 100000, ls = 1"]
81.096 ms (5%)
0.000 ns
6.87 MiB (1%)
48


["build tree", "NearestNeighbors.BallTree 3 × 100000, ls = 10"]
54.936 ms (5%)
0.000 ns
1.38 MiB (1%)
48


["build tree", "NearestNeighbors.KDTree 1 × 1000, ls = 1"]
129.945 μs (5%)
0.000 ns
42.05 KiB (1%)
48


["build tree", "NearestNeighbors.KDTree 1 × 1000, ls = 10"]
61.857 μs (5%)
0.000 ns
13.97 KiB (1%)
47


["build tree", "NearestNeighbors.KDTree 1 × 100000, ls = 1"]
18.868 ms (5%)
0.000 ns
3.82 MiB (1%)
49


["build tree", "NearestNeighbors.KDTree 1 × 100000, ls = 10"]
12.303 ms (5%)
0.000 ns
1.07 MiB (1%)
49


["build tree", "NearestNeighbors.KDTree 3 × 1000, ls = 1"]
233.511 μs (5%)
0.000 ns
42.11 KiB (1%)
48


["build tree", "NearestNeighbors.KDTree 3 × 1000, ls = 10"]
125.607 μs (5%)
0.000 ns
14.03 KiB (1%)
47


["build tree", "NearestNeighbors.KDTree 3 × 100000, ls = 1"]
41.893 ms (5%)
0.000 ns
3.82 MiB (1%)
49


["build tree", "NearestNeighbors.KDTree 3 × 100000, ls = 10"]
30.853 ms (5%)
0.000 ns
1.07 MiB (1%)
49


["inrange", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1, r = 8.86e-03"]
2.685 μs (5%)
0.000 ns
1.72 KiB (1%)
24


["inrange", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1000, r = 8.86e-03"]
824.807 μs (5%)
0.000 ns
565.67 KiB (1%)
4663


["inrange", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1, r = 8.86e-03"]
2.355 μs (5%)
0.000 ns
1.72 KiB (1%)
24


["inrange", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1000, r = 8.86e-03"]
672.228 μs (5%)
0.000 ns
565.67 KiB (1%)
4663


["inrange", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1, r = 8.86e-03"]
24.166 μs (5%)
0.000 ns
33.56 KiB (1%)
30


["inrange", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1000, r = 8.86e-03"]
23.809 ms (5%)
0.000 ns
31.67 MiB (1%)
11013


["inrange", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1, r = 8.86e-03"]
13.145 μs (5%)
0.000 ns
33.56 KiB (1%)
30


["inrange", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1000, r = 8.86e-03"]
13.481 ms (5%)
0.000 ns
31.67 MiB (1%)
11013


["inrange", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1, r = 1.91e-01"]
7.435 μs (5%)
0.000 ns
1.73 KiB (1%)
24


["inrange", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1000, r = 1.91e-01"]
4.775 ms (5%)
0.000 ns
700.28 KiB (1%)
4981


["inrange", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1, r = 1.91e-01"]
5.090 μs (5%)
0.000 ns
1.73 KiB (1%)
24


["inrange", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1000, r = 1.91e-01"]
2.941 ms (5%)
0.000 ns
700.28 KiB (1%)
4981


["inrange", "NearestNeighbors.BallTree 3 × 100000, ls = 1, input_size = 1, r = 1.91e-01"]
150.775 μs (5%)
0.000 ns
65.64 KiB (1%)
31


["inrange", "NearestNeighbors.BallTree 3 × 100000, ls = 1, input_size = 1000, r = 1.91e-01"]
128.402 ms (5%)
0.000 ns
52.70 MiB (1%)
11674


["inrange", "NearestNeighbors.BallTree 3 × 100000, ls = 10, input_size = 1, r = 1.91e-01"]
97.113 μs (5%)
0.000 ns
65.64 KiB (1%)
31


["inrange", "NearestNeighbors.BallTree 3 × 100000, ls = 10, input_size = 1000, r = 1.91e-01"]
76.911 ms (5%)
1.956 ms
52.70 MiB (1%)
11674


["inrange", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1, r = 8.86e-03"]
2.314 μs (5%)
0.000 ns
1.72 KiB (1%)
24


["inrange", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1000, r = 8.86e-03"]
667.821 μs (5%)
0.000 ns
565.67 KiB (1%)
4663


["inrange", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1, r = 8.86e-03"]
2.094 μs (5%)
0.000 ns
1.72 KiB (1%)
24


["inrange", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1000, r = 8.86e-03"]
478.022 μs (5%)
0.000 ns
565.67 KiB (1%)
4663


["inrange", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1, r = 8.86e-03"]
34.946 μs (5%)
0.000 ns
33.56 KiB (1%)
30


["inrange", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1000, r = 8.86e-03"]
38.671 ms (5%)
0.000 ns
31.67 MiB (1%)
11013


["inrange", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1, r = 8.86e-03"]
20.148 μs (5%)
0.000 ns
33.56 KiB (1%)
30


["inrange", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1000, r = 8.86e-03"]
21.869 ms (5%)
0.000 ns
31.67 MiB (1%)
11013


["inrange", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1, r = 1.91e-01"]
3.767 μs (5%)
0.000 ns
1.73 KiB (1%)
24


["inrange", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1000, r = 1.91e-01"]
2.464 ms (5%)
0.000 ns
700.28 KiB (1%)
4981


["inrange", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1, r = 1.91e-01"]
3.106 μs (5%)
0.000 ns
1.73 KiB (1%)
24


["inrange", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1000, r = 1.91e-01"]
1.457 ms (5%)
0.000 ns
700.28 KiB (1%)
4981


["inrange", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1, r = 1.91e-01"]
114.636 μs (5%)
0.000 ns
65.64 KiB (1%)
31


["inrange", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1000, r = 1.91e-01"]
106.069 ms (5%)
1.929 ms
52.70 MiB (1%)
11674


["inrange", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1, r = 1.91e-01"]
70.142 μs (5%)
0.000 ns
65.64 KiB (1%)
31


["inrange", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1000, r = 1.91e-01"]
61.077 ms (5%)
1.979 ms
52.70 MiB (1%)
11674


["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1, k = 1"]
2.044 μs (5%)
0.000 ns
1.38 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1, k = 10"]
2.765 μs (5%)
0.000 ns
1.50 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1000, k = 1"]
366.722 μs (5%)
0.000 ns
235.59 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1000, k = 10"]
856.977 μs (5%)
0.000 ns
360.59 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1, k = 1"]
2.024 μs (5%)
0.000 ns
1.38 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1, k = 10"]
2.194 μs (5%)
0.000 ns
1.50 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1000, k = 1"]
377.362 μs (5%)
0.000 ns
235.59 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1000, k = 10"]
583.171 μs (5%)
0.000 ns
360.59 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1, k = 1"]
2.384 μs (5%)
0.000 ns
1.38 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1, k = 10"]
2.855 μs (5%)
0.000 ns
1.50 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1000, k = 1"]
569.665 μs (5%)
0.000 ns
235.59 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1000, k = 10"]
1.126 ms (5%)
0.000 ns
360.59 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1, k = 1"]
2.234 μs (5%)
0.000 ns
1.38 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1, k = 10"]
2.444 μs (5%)
0.000 ns
1.50 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1000, k = 1"]
584.984 μs (5%)
0.000 ns
235.59 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1000, k = 10"]
842.711 μs (5%)
0.000 ns
360.59 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1, k = 1"]
4.689 μs (5%)
0.000 ns
1.42 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1, k = 10"]
8.987 μs (5%)
0.000 ns
1.55 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1000, k = 1"]
2.175 ms (5%)
0.000 ns
266.86 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1000, k = 10"]
6.187 ms (5%)
0.000 ns
391.86 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1, k = 1"]
4.849 μs (5%)
0.000 ns
1.42 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1, k = 10"]
7.864 μs (5%)
0.000 ns
1.55 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1000, k = 1"]
1.808 ms (5%)
0.000 ns
266.86 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1000, k = 10"]
4.206 ms (5%)
0.000 ns
391.86 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 1, input_size = 1, k = 1"]
24.316 μs (5%)
0.000 ns
1.42 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 1, input_size = 1, k = 10"]
44.324 μs (5%)
0.000 ns
1.55 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 1, input_size = 1000, k = 1"]
13.335 ms (5%)
0.000 ns
266.86 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 1, input_size = 1000, k = 10"]
27.927 ms (5%)
0.000 ns
391.86 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 10, input_size = 1, k = 1"]
19.326 μs (5%)
0.000 ns
1.42 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 10, input_size = 1, k = 10"]
28.985 μs (5%)
0.000 ns
1.55 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 10, input_size = 1000, k = 1"]
10.784 ms (5%)
0.000 ns
266.86 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 10, input_size = 1000, k = 10"]
19.403 ms (5%)
0.000 ns
391.86 KiB (1%)
4020


["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1, k = 1"]
1.893 μs (5%)
0.000 ns
1.38 KiB (1%)
24


["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1, k = 10"]
2.234 μs (5%)
0.000 ns
1.50 KiB (1%)
24


["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1000, k = 1"]
231.217 μs (5%)
0.000 ns
235.59 KiB (1%)
4020


["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1000, k = 10"]
515.442 μs (5%)
0.000 ns
360.59 KiB (1%)
4020


["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1, k = 1"]
1.914 μs (5%)
0.000 ns
1.38 KiB (1%)
24


["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1, k = 10"]
2.044 μs (5%)
0.000 ns
1.50 KiB (1%)
24


["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1000, k = 1"]
249.110 μs (5%)
0.000 ns
235.59 KiB (1%)
4020


["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1000, k = 10"]
454.097 μs (5%)
0.000 ns
360.59 KiB (1%)
4020


["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1, k = 1"]
1.973 μs (5%)
0.000 ns
1.38 KiB (1%)
24


["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1, k = 10"]
2.224 μs (5%)
0.000 ns
1.50 KiB (1%)
24


["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1000, k = 1"]
349.720 μs (5%)
0.000 ns
235.59 KiB (1%)
4020


["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1000, k = 10"]
674.693 μs (5%)
0.000 ns
360.59 KiB (1%)
4020


["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1, k = 1"]
1.973 μs (5%)
0.000 ns
1.38 KiB (1%)
24


["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1, k = 10"]
2.154 μs (5%)
0.000 ns
1.50 KiB (1%)
24


["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1000, k = 1"]
367.854 μs (5%)
0.000 ns
235.59 KiB (1%)
4020


["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1000, k = 10"]
598.990 μs (5%)
0.000 ns
360.59 KiB (1%)
4020


["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1, k = 1"]
1.933 μs (5%)
0.000 ns
1.42 KiB (1%)
24


["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1, k = 10"]
2.665 μs (5%)
0.000 ns
1.55 KiB (1%)
24


["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1000, k = 1"]
265.741 μs (5%)
0.000 ns
266.86 KiB (1%)
4020


["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1000, k = 10"]
1.789 ms (5%)
0.000 ns
391.86 KiB (1%)
4020


["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1, k = 1"]
1.933 μs (5%)
0.000 ns
1.42 KiB (1%)
24


["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1, k = 10"]
2.785 μs (5%)
0.000 ns
1.55 KiB (1%)
24


["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1000, k = 1"]
269.338 μs (5%)
0.000 ns
266.86 KiB (1%)
4020


["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1000, k = 10"]
1.230 ms (5%)
0.000 ns
391.86 KiB (1%)
4020


["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1, k = 1"]
2.114 μs (5%)
0.000 ns
1.42 KiB (1%)
24


["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1, k = 10"]
3.136 μs (5%)
0.000 ns
1.55 KiB (1%)
24


["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1000, k = 1"]
399.664 μs (5%)
0.000 ns
266.86 KiB (1%)
4020


["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1000, k = 10"]
2.835 ms (5%)
0.000 ns
391.86 KiB (1%)
4020


["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1, k = 1"]
1.994 μs (5%)
0.000 ns
1.42 KiB (1%)
24


["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1, k = 10"]
3.013 μs (5%)
0.000 ns
1.55 KiB (1%)
24


["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1000, k = 1"]
404.343 μs (5%)
0.000 ns
266.86 KiB (1%)
4020


["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1000, k = 10"]
1.957 ms (5%)
0.000 ns
391.86 KiB (1%)
4020


master (https://github.com/KristofferC/NearestNeighbors.jl/tree/3ad1e2edd146cd7b700d9a3c3716963b116fb927)


ID
time
GC time
memory
allocations


["build tree", "NearestNeighbors.BallTree 1 × 1000, ls = 1"]
236.086 μs (5%)
0.000 ns
41.84 KiB (1%)
47


["build tree", "NearestNeighbors.BallTree 1 × 1000, ls = 10"]
111.119 μs (5%)
0.000 ns
13.77 KiB (1%)
46


["build tree", "NearestNeighbors.BallTree 1 × 100000, ls = 1"]
32.506 ms (5%)
0.000 ns
3.82 MiB (1%)
48


["build tree", "NearestNeighbors.BallTree 1 × 100000, ls = 10"]
20.026 ms (5%)
0.000 ns
1.07 MiB (1%)
48


["build tree", "NearestNeighbors.BallTree 3 × 1000, ls = 1"]
518.889 μs (5%)
0.000 ns
73.14 KiB (1%)
47


["build tree", "NearestNeighbors.BallTree 3 × 1000, ls = 10"]
251.245 μs (5%)
0.000 ns
16.94 KiB (1%)
46


["build tree", "NearestNeighbors.BallTree 3 × 100000, ls = 1"]
81.308 ms (5%)
0.000 ns
6.87 MiB (1%)
48


["build tree", "NearestNeighbors.BallTree 3 × 100000, ls = 10"]
54.922 ms (5%)
0.000 ns
1.38 MiB (1%)
48


["build tree", "NearestNeighbors.KDTree 1 × 1000, ls = 1"]
128.282 μs (5%)
0.000 ns
42.05 KiB (1%)
48


["build tree", "NearestNeighbors.KDTree 1 × 1000, ls = 10"]
63.169 μs (5%)
0.000 ns
13.97 KiB (1%)
47


["build tree", "NearestNeighbors.KDTree 1 × 100000, ls = 1"]
18.829 ms (5%)
0.000 ns
3.82 MiB (1%)
49


["build tree", "NearestNeighbors.KDTree 1 × 100000, ls = 10"]
12.273 ms (5%)
0.000 ns
1.07 MiB (1%)
49


["build tree", "NearestNeighbors.KDTree 3 × 1000, ls = 1"]
233.170 μs (5%)
0.000 ns
42.11 KiB (1%)
48


["build tree", "NearestNeighbors.KDTree 3 × 1000, ls = 10"]
125.607 μs (5%)
0.000 ns
14.03 KiB (1%)
47


["build tree", "NearestNeighbors.KDTree 3 × 100000, ls = 1"]
42.018 ms (5%)
0.000 ns
3.82 MiB (1%)
49


["build tree", "NearestNeighbors.KDTree 3 × 100000, ls = 10"]
30.835 ms (5%)
0.000 ns
1.07 MiB (1%)
49


["inrange", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1, r = 8.86e-03"]
2.645 μs (5%)
0.000 ns
1.72 KiB (1%)
24


["inrange", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1000, r = 8.86e-03"]
810.970 μs (5%)
0.000 ns
565.67 KiB (1%)
4663


["inrange", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1, r = 8.86e-03"]
2.344 μs (5%)
0.000 ns
1.72 KiB (1%)
24


["inrange", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1000, r = 8.86e-03"]
678.110 μs (5%)
0.000 ns
565.67 KiB (1%)
4663


["inrange", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1, r = 8.86e-03"]
24.176 μs (5%)
0.000 ns
33.56 KiB (1%)
30


["inrange", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1000, r = 8.86e-03"]
23.735 ms (5%)
0.000 ns
31.67 MiB (1%)
11013


["inrange", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1, r = 8.86e-03"]
13.105 μs (5%)
0.000 ns
33.56 KiB (1%)
30


["inrange", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1000, r = 8.86e-03"]
13.866 ms (5%)
0.000 ns
31.67 MiB (1%)
11013


["inrange", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1, r = 1.91e-01"]
7.494 μs (5%)
0.000 ns
1.73 KiB (1%)
24


["inrange", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1000, r = 1.91e-01"]
4.718 ms (5%)
0.000 ns
700.28 KiB (1%)
4981


["inrange", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1, r = 1.91e-01"]
5.010 μs (5%)
0.000 ns
1.73 KiB (1%)
24


["inrange", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1000, r = 1.91e-01"]
2.883 ms (5%)
0.000 ns
700.28 KiB (1%)
4981


["inrange", "NearestNeighbors.BallTree 3 × 100000, ls = 1, input_size = 1, r = 1.91e-01"]
149.402 μs (5%)
0.000 ns
65.64 KiB (1%)
31


["inrange", "NearestNeighbors.BallTree 3 × 100000, ls = 1, input_size = 1000, r = 1.91e-01"]
125.669 ms (5%)
0.000 ns
52.70 MiB (1%)
11674


["inrange", "NearestNeighbors.BallTree 3 × 100000, ls = 10, input_size = 1, r = 1.91e-01"]
96.773 μs (5%)
0.000 ns
65.64 KiB (1%)
31


["inrange", "NearestNeighbors.BallTree 3 × 100000, ls = 10, input_size = 1000, r = 1.91e-01"]
76.343 ms (5%)
0.000 ns
52.70 MiB (1%)
11674


["inrange", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1, r = 8.86e-03"]
2.334 μs (5%)
0.000 ns
1.72 KiB (1%)
24


["inrange", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1000, r = 8.86e-03"]
665.515 μs (5%)
0.000 ns
565.67 KiB (1%)
4663


["inrange", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1, r = 8.86e-03"]
2.094 μs (5%)
0.000 ns
1.72 KiB (1%)
24


["inrange", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1000, r = 8.86e-03"]
471.179 μs (5%)
0.000 ns
565.67 KiB (1%)
4663


["inrange", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1, r = 8.86e-03"]
34.666 μs (5%)
0.000 ns
33.56 KiB (1%)
30


["inrange", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1000, r = 8.86e-03"]
37.577 ms (5%)
0.000 ns
31.67 MiB (1%)
11013


["inrange", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1, r = 8.86e-03"]
19.898 μs (5%)
0.000 ns
33.56 KiB (1%)
30


["inrange", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1000, r = 8.86e-03"]
21.645 ms (5%)
0.000 ns
31.67 MiB (1%)
11013


["inrange", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1, r = 1.91e-01"]
3.957 μs (5%)
0.000 ns
1.73 KiB (1%)
24


["inrange", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1000, r = 1.91e-01"]
2.676 ms (5%)
0.000 ns
700.28 KiB (1%)
4981


["inrange", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1, r = 1.91e-01"]
3.266 μs (5%)
0.000 ns
1.73 KiB (1%)
24


["inrange", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1000, r = 1.91e-01"]
1.576 ms (5%)
0.000 ns
700.28 KiB (1%)
4981


["inrange", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1, r = 1.91e-01"]
124.215 μs (5%)
0.000 ns
65.64 KiB (1%)
31


["inrange", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1000, r = 1.91e-01"]
111.466 ms (5%)
0.000 ns
52.70 MiB (1%)
11674


["inrange", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1, r = 1.91e-01"]
74.000 μs (5%)
0.000 ns
65.64 KiB (1%)
31


["inrange", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1000, r = 1.91e-01"]
63.075 ms (5%)
1.902 ms
52.70 MiB (1%)
11674


["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1, k = 1"]
2.424 μs (5%)
0.000 ns
1.38 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1, k = 10"]
3.116 μs (5%)
0.000 ns
1.50 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1000, k = 1"]
493.090 μs (5%)
0.000 ns
235.59 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1000, k = 10"]
984.077 μs (5%)
0.000 ns
360.59 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1, k = 1"]
2.394 μs (5%)
0.000 ns
1.38 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1, k = 10"]
2.585 μs (5%)
0.000 ns
1.50 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1000, k = 1"]
502.278 μs (5%)
0.000 ns
235.59 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1000, k = 10"]
720.179 μs (5%)
0.000 ns
360.59 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1, k = 1"]
2.705 μs (5%)
0.000 ns
1.38 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1, k = 10"]
3.226 μs (5%)
0.000 ns
1.50 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1000, k = 1"]
694.050 μs (5%)
0.000 ns
235.59 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1000, k = 10"]
1.254 ms (5%)
0.000 ns
360.59 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1, k = 1"]
2.585 μs (5%)
0.000 ns
1.38 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1, k = 10"]
2.785 μs (5%)
0.000 ns
1.50 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1000, k = 1"]
707.314 μs (5%)
0.000 ns
235.59 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1000, k = 10"]
974.700 μs (5%)
0.000 ns
360.59 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1, k = 1"]
5.199 μs (5%)
0.000 ns
1.42 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1, k = 10"]
9.338 μs (5%)
0.000 ns
1.55 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1000, k = 1"]
2.354 ms (5%)
0.000 ns
266.86 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1000, k = 10"]
6.224 ms (5%)
0.000 ns
391.86 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1, k = 1"]
5.300 μs (5%)
0.000 ns
1.42 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1, k = 10"]
8.366 μs (5%)
0.000 ns
1.55 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1000, k = 1"]
1.957 ms (5%)
0.000 ns
266.86 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1000, k = 10"]
4.292 ms (5%)
0.000 ns
391.86 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 1, input_size = 1, k = 1"]
24.777 μs (5%)
0.000 ns
1.42 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 1, input_size = 1, k = 10"]
44.193 μs (5%)
0.000 ns
1.55 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 1, input_size = 1000, k = 1"]
13.399 ms (5%)
0.000 ns
266.86 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 1, input_size = 1000, k = 10"]
27.629 ms (5%)
0.000 ns
391.86 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 10, input_size = 1, k = 1"]
19.658 μs (5%)
0.000 ns
1.42 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 10, input_size = 1, k = 10"]
29.545 μs (5%)
0.000 ns
1.55 KiB (1%)
24


["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 10, input_size = 1000, k = 1"]
10.877 ms (5%)
0.000 ns
266.86 KiB (1%)
4020


["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 10, input_size = 1000, k = 10"]
19.267 ms (5%)
0.000 ns
391.86 KiB (1%)
4020


["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1, k = 1"]
2.565 μs (5%)
0.000 ns
1.41 KiB (1%)
26


["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1, k = 10"]
2.895 μs (5%)
0.000 ns
1.53 KiB (1%)
26


["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1000, k = 1"]
559.486 μs (5%)
0.000 ns
266.84 KiB (1%)
6020


["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1000, k = 10"]
860.213 μs (5%)
0.000 ns
391.84 KiB (1%)
6020


["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1, k = 1"]
2.574 μs (5%)
0.000 ns
1.41 KiB (1%)
26


["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1, k = 10"]
2.696 μs (5%)
0.000 ns
1.53 KiB (1%)
26


["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1000, k = 1"]
572.360 μs (5%)
0.000 ns
266.84 KiB (1%)
6020


["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1000, k = 10"]
777.207 μs (5%)
0.000 ns
391.84 KiB (1%)
6020


["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1, k = 1"]
2.615 μs (5%)
0.000 ns
1.41 KiB (1%)
26


["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1, k = 10"]
2.885 μs (5%)
0.000 ns
1.53 KiB (1%)
26


["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1000, k = 1"]
687.036 μs (5%)
0.000 ns
266.84 KiB (1%)
6020


["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1000, k = 10"]
1.025 ms (5%)
0.000 ns
391.84 KiB (1%)
6020


["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1, k = 1"]
2.635 μs (5%)
0.000 ns
1.41 KiB (1%)
26


["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1, k = 10"]
2.796 μs (5%)
0.000 ns
1.53 KiB (1%)
26


["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1000, k = 1"]
701.003 μs (5%)
0.000 ns
266.84 KiB (1%)
6020


["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1000, k = 10"]
937.039 μs (5%)
0.000 ns
391.84 KiB (1%)
6020


["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1, k = 1"]
2.424 μs (5%)
0.000 ns
1.47 KiB (1%)
26


["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1, k = 10"]
3.166 μs (5%)
0.000 ns
1.59 KiB (1%)
26


["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1000, k = 1"]
571.609 μs (5%)
0.000 ns
313.73 KiB (1%)
6020


["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1000, k = 10"]
2.102 ms (5%)
0.000 ns
438.73 KiB (1%)
6020


["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1, k = 1"]
2.404 μs (5%)
0.000 ns
1.47 KiB (1%)
26


["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1, k = 10"]
3.306 μs (5%)
0.000 ns
1.59 KiB (1%)
26


["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1000, k = 1"]
578.302 μs (5%)
0.000 ns
313.73 KiB (1%)
6020


["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1000, k = 10"]
1.543 ms (5%)
0.000 ns
438.73 KiB (1%)
6020


["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1, k = 1"]
2.605 μs (5%)
0.000 ns
1.47 KiB (1%)
26


["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1, k = 10"]
3.547 μs (5%)
0.000 ns
1.59 KiB (1%)
26


["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1000, k = 1"]
718.816 μs (5%)
0.000 ns
313.73 KiB (1%)
6020


["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1000, k = 10"]
3.193 ms (5%)
0.000 ns
438.73 KiB (1%)
6020


["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1, k = 1"]
2.515 μs (5%)
0.000 ns
1.47 KiB (1%)
26


["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1, k = 10"]
3.535 μs (5%)
0.000 ns
1.59 KiB (1%)
26


["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1000, k = 1"]
714.558 μs (5%)
0.000 ns
313.73 KiB (1%)
6020


["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1000, k = 10"]
2.278 ms (5%)
0.000 ns
438.73 KiB (1%)
6020
ID	time ratio	memory ratio
`["inrange", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1000, r = 1.91e-01"]`	0.92 (5%) ✅	1.00 (1%)
`["inrange", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1000, r = 1.91e-01"]`	0.92 (5%) ✅	1.00 (1%)
`["inrange", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1, r = 1.91e-01"]`	0.92 (5%) ✅	1.00 (1%)
`["inrange", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1, r = 1.91e-01"]`	0.95 (5%) ✅	1.00 (1%)
`["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1, k = 1"]`	0.84 (5%) ✅	1.00 (1%)
`["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1, k = 10"]`	0.89 (5%) ✅	1.00 (1%)
`["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1000, k = 1"]`	0.74 (5%) ✅	1.00 (1%)
`["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1000, k = 10"]`	0.87 (5%) ✅	1.00 (1%)
`["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1, k = 1"]`	0.85 (5%) ✅	1.00 (1%)
`["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1, k = 10"]`	0.85 (5%) ✅	1.00 (1%)
`["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1000, k = 1"]`	0.75 (5%) ✅	1.00 (1%)
`["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1000, k = 10"]`	0.81 (5%) ✅	1.00 (1%)
`["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1, k = 1"]`	0.88 (5%) ✅	1.00 (1%)
`["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1, k = 10"]`	0.88 (5%) ✅	1.00 (1%)
`["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1000, k = 1"]`	0.82 (5%) ✅	1.00 (1%)
`["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1000, k = 10"]`	0.90 (5%) ✅	1.00 (1%)
`["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1, k = 1"]`	0.86 (5%) ✅	1.00 (1%)
`["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1, k = 10"]`	0.88 (5%) ✅	1.00 (1%)
`["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1000, k = 1"]`	0.83 (5%) ✅	1.00 (1%)
`["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1000, k = 10"]`	0.86 (5%) ✅	1.00 (1%)
`["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1, k = 1"]`	0.90 (5%) ✅	1.00 (1%)
`["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1000, k = 1"]`	0.92 (5%) ✅	1.00 (1%)
`["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1, k = 1"]`	0.91 (5%) ✅	1.00 (1%)
`["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1, k = 10"]`	0.94 (5%) ✅	1.00 (1%)
`["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1000, k = 1"]`	0.92 (5%) ✅	1.00 (1%)
`["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1, k = 1"]`	0.74 (5%) ✅	0.98 (1%) ✅
`["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1, k = 10"]`	0.77 (5%) ✅	0.98 (1%) ✅
`["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1000, k = 1"]`	0.41 (5%) ✅	0.88 (1%) ✅
`["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1000, k = 10"]`	0.60 (5%) ✅	0.92 (1%) ✅
`["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1, k = 1"]`	0.74 (5%) ✅	0.98 (1%) ✅
`["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1, k = 10"]`	0.76 (5%) ✅	0.98 (1%) ✅
`["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1000, k = 1"]`	0.44 (5%) ✅	0.88 (1%) ✅
`["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1000, k = 10"]`	0.58 (5%) ✅	0.92 (1%) ✅
`["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1, k = 1"]`	0.75 (5%) ✅	0.98 (1%) ✅
`["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1, k = 10"]`	0.77 (5%) ✅	0.98 (1%) ✅
`["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1000, k = 1"]`	0.51 (5%) ✅	0.88 (1%) ✅
`["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1000, k = 10"]`	0.66 (5%) ✅	0.92 (1%) ✅
`["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1, k = 1"]`	0.75 (5%) ✅	0.98 (1%) ✅
`["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1, k = 10"]`	0.77 (5%) ✅	0.98 (1%) ✅
`["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1000, k = 1"]`	0.52 (5%) ✅	0.88 (1%) ✅
`["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1000, k = 10"]`	0.64 (5%) ✅	0.92 (1%) ✅
`["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1, k = 1"]`	0.80 (5%) ✅	0.97 (1%) ✅
`["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1, k = 10"]`	0.84 (5%) ✅	0.97 (1%) ✅
`["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1000, k = 1"]`	0.46 (5%) ✅	0.85 (1%) ✅
`["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1000, k = 10"]`	0.85 (5%) ✅	0.89 (1%) ✅
`["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1, k = 1"]`	0.80 (5%) ✅	0.97 (1%) ✅
`["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1, k = 10"]`	0.84 (5%) ✅	0.97 (1%) ✅
`["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1000, k = 1"]`	0.47 (5%) ✅	0.85 (1%) ✅
`["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1000, k = 10"]`	0.80 (5%) ✅	0.89 (1%) ✅
`["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1, k = 1"]`	0.81 (5%) ✅	0.97 (1%) ✅
`["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1, k = 10"]`	0.88 (5%) ✅	0.97 (1%) ✅
`["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1000, k = 1"]`	0.56 (5%) ✅	0.85 (1%) ✅
`["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1000, k = 10"]`	0.89 (5%) ✅	0.89 (1%) ✅
`["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1, k = 1"]`	0.79 (5%) ✅	0.97 (1%) ✅
`["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1, k = 10"]`	0.85 (5%) ✅	0.97 (1%) ✅
`["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1000, k = 1"]`	0.57 (5%) ✅	0.85 (1%) ✅
`["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1000, k = 10"]`	0.86 (5%) ✅	0.89 (1%) ✅
ID	time	GC time	memory	allocations
`["build tree", "NearestNeighbors.BallTree 1 × 1000, ls = 1"]`	234.793 μs (5%)	0.000 ns	41.84 KiB (1%)	47
`["build tree", "NearestNeighbors.BallTree 1 × 1000, ls = 10"]`	110.338 μs (5%)	0.000 ns	13.77 KiB (1%)	46
`["build tree", "NearestNeighbors.BallTree 1 × 100000, ls = 1"]`	32.371 ms (5%)	0.000 ns	3.82 MiB (1%)	48
`["build tree", "NearestNeighbors.BallTree 1 × 100000, ls = 10"]`	19.943 ms (5%)	0.000 ns	1.07 MiB (1%)	48
`["build tree", "NearestNeighbors.BallTree 3 × 1000, ls = 1"]`	515.412 μs (5%)	0.000 ns	73.14 KiB (1%)	47
`["build tree", "NearestNeighbors.BallTree 3 × 1000, ls = 10"]`	249.881 μs (5%)	0.000 ns	16.94 KiB (1%)	46
`["build tree", "NearestNeighbors.BallTree 3 × 100000, ls = 1"]`	81.096 ms (5%)	0.000 ns	6.87 MiB (1%)	48
`["build tree", "NearestNeighbors.BallTree 3 × 100000, ls = 10"]`	54.936 ms (5%)	0.000 ns	1.38 MiB (1%)	48
`["build tree", "NearestNeighbors.KDTree 1 × 1000, ls = 1"]`	129.945 μs (5%)	0.000 ns	42.05 KiB (1%)	48
`["build tree", "NearestNeighbors.KDTree 1 × 1000, ls = 10"]`	61.857 μs (5%)	0.000 ns	13.97 KiB (1%)	47
`["build tree", "NearestNeighbors.KDTree 1 × 100000, ls = 1"]`	18.868 ms (5%)	0.000 ns	3.82 MiB (1%)	49
`["build tree", "NearestNeighbors.KDTree 1 × 100000, ls = 10"]`	12.303 ms (5%)	0.000 ns	1.07 MiB (1%)	49
`["build tree", "NearestNeighbors.KDTree 3 × 1000, ls = 1"]`	233.511 μs (5%)	0.000 ns	42.11 KiB (1%)	48
`["build tree", "NearestNeighbors.KDTree 3 × 1000, ls = 10"]`	125.607 μs (5%)	0.000 ns	14.03 KiB (1%)	47
`["build tree", "NearestNeighbors.KDTree 3 × 100000, ls = 1"]`	41.893 ms (5%)	0.000 ns	3.82 MiB (1%)	49
`["build tree", "NearestNeighbors.KDTree 3 × 100000, ls = 10"]`	30.853 ms (5%)	0.000 ns	1.07 MiB (1%)	49
`["inrange", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1, r = 8.86e-03"]`	2.685 μs (5%)	0.000 ns	1.72 KiB (1%)	24
`["inrange", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1000, r = 8.86e-03"]`	824.807 μs (5%)	0.000 ns	565.67 KiB (1%)	4663
`["inrange", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1, r = 8.86e-03"]`	2.355 μs (5%)	0.000 ns	1.72 KiB (1%)	24
`["inrange", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1000, r = 8.86e-03"]`	672.228 μs (5%)	0.000 ns	565.67 KiB (1%)	4663
`["inrange", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1, r = 8.86e-03"]`	24.166 μs (5%)	0.000 ns	33.56 KiB (1%)	30
`["inrange", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1000, r = 8.86e-03"]`	23.809 ms (5%)	0.000 ns	31.67 MiB (1%)	11013
`["inrange", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1, r = 8.86e-03"]`	13.145 μs (5%)	0.000 ns	33.56 KiB (1%)	30
`["inrange", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1000, r = 8.86e-03"]`	13.481 ms (5%)	0.000 ns	31.67 MiB (1%)	11013
`["inrange", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1, r = 1.91e-01"]`	7.435 μs (5%)	0.000 ns	1.73 KiB (1%)	24
`["inrange", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1000, r = 1.91e-01"]`	4.775 ms (5%)	0.000 ns	700.28 KiB (1%)	4981
`["inrange", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1, r = 1.91e-01"]`	5.090 μs (5%)	0.000 ns	1.73 KiB (1%)	24
`["inrange", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1000, r = 1.91e-01"]`	2.941 ms (5%)	0.000 ns	700.28 KiB (1%)	4981
`["inrange", "NearestNeighbors.BallTree 3 × 100000, ls = 1, input_size = 1, r = 1.91e-01"]`	150.775 μs (5%)	0.000 ns	65.64 KiB (1%)	31
`["inrange", "NearestNeighbors.BallTree 3 × 100000, ls = 1, input_size = 1000, r = 1.91e-01"]`	128.402 ms (5%)	0.000 ns	52.70 MiB (1%)	11674
`["inrange", "NearestNeighbors.BallTree 3 × 100000, ls = 10, input_size = 1, r = 1.91e-01"]`	97.113 μs (5%)	0.000 ns	65.64 KiB (1%)	31
`["inrange", "NearestNeighbors.BallTree 3 × 100000, ls = 10, input_size = 1000, r = 1.91e-01"]`	76.911 ms (5%)	1.956 ms	52.70 MiB (1%)	11674
`["inrange", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1, r = 8.86e-03"]`	2.314 μs (5%)	0.000 ns	1.72 KiB (1%)	24
`["inrange", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1000, r = 8.86e-03"]`	667.821 μs (5%)	0.000 ns	565.67 KiB (1%)	4663
`["inrange", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1, r = 8.86e-03"]`	2.094 μs (5%)	0.000 ns	1.72 KiB (1%)	24
`["inrange", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1000, r = 8.86e-03"]`	478.022 μs (5%)	0.000 ns	565.67 KiB (1%)	4663
`["inrange", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1, r = 8.86e-03"]`	34.946 μs (5%)	0.000 ns	33.56 KiB (1%)	30
`["inrange", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1000, r = 8.86e-03"]`	38.671 ms (5%)	0.000 ns	31.67 MiB (1%)	11013
`["inrange", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1, r = 8.86e-03"]`	20.148 μs (5%)	0.000 ns	33.56 KiB (1%)	30
`["inrange", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1000, r = 8.86e-03"]`	21.869 ms (5%)	0.000 ns	31.67 MiB (1%)	11013
`["inrange", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1, r = 1.91e-01"]`	3.767 μs (5%)	0.000 ns	1.73 KiB (1%)	24
`["inrange", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1000, r = 1.91e-01"]`	2.464 ms (5%)	0.000 ns	700.28 KiB (1%)	4981
`["inrange", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1, r = 1.91e-01"]`	3.106 μs (5%)	0.000 ns	1.73 KiB (1%)	24
`["inrange", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1000, r = 1.91e-01"]`	1.457 ms (5%)	0.000 ns	700.28 KiB (1%)	4981
`["inrange", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1, r = 1.91e-01"]`	114.636 μs (5%)	0.000 ns	65.64 KiB (1%)	31
`["inrange", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1000, r = 1.91e-01"]`	106.069 ms (5%)	1.929 ms	52.70 MiB (1%)	11674
`["inrange", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1, r = 1.91e-01"]`	70.142 μs (5%)	0.000 ns	65.64 KiB (1%)	31
`["inrange", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1000, r = 1.91e-01"]`	61.077 ms (5%)	1.979 ms	52.70 MiB (1%)	11674
`["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1, k = 1"]`	2.044 μs (5%)	0.000 ns	1.38 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1, k = 10"]`	2.765 μs (5%)	0.000 ns	1.50 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1000, k = 1"]`	366.722 μs (5%)	0.000 ns	235.59 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1000, k = 10"]`	856.977 μs (5%)	0.000 ns	360.59 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1, k = 1"]`	2.024 μs (5%)	0.000 ns	1.38 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1, k = 10"]`	2.194 μs (5%)	0.000 ns	1.50 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1000, k = 1"]`	377.362 μs (5%)	0.000 ns	235.59 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1000, k = 10"]`	583.171 μs (5%)	0.000 ns	360.59 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1, k = 1"]`	2.384 μs (5%)	0.000 ns	1.38 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1, k = 10"]`	2.855 μs (5%)	0.000 ns	1.50 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1000, k = 1"]`	569.665 μs (5%)	0.000 ns	235.59 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1000, k = 10"]`	1.126 ms (5%)	0.000 ns	360.59 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1, k = 1"]`	2.234 μs (5%)	0.000 ns	1.38 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1, k = 10"]`	2.444 μs (5%)	0.000 ns	1.50 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1000, k = 1"]`	584.984 μs (5%)	0.000 ns	235.59 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1000, k = 10"]`	842.711 μs (5%)	0.000 ns	360.59 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1, k = 1"]`	4.689 μs (5%)	0.000 ns	1.42 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1, k = 10"]`	8.987 μs (5%)	0.000 ns	1.55 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1000, k = 1"]`	2.175 ms (5%)	0.000 ns	266.86 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1000, k = 10"]`	6.187 ms (5%)	0.000 ns	391.86 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1, k = 1"]`	4.849 μs (5%)	0.000 ns	1.42 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1, k = 10"]`	7.864 μs (5%)	0.000 ns	1.55 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1000, k = 1"]`	1.808 ms (5%)	0.000 ns	266.86 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1000, k = 10"]`	4.206 ms (5%)	0.000 ns	391.86 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 1, input_size = 1, k = 1"]`	24.316 μs (5%)	0.000 ns	1.42 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 1, input_size = 1, k = 10"]`	44.324 μs (5%)	0.000 ns	1.55 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 1, input_size = 1000, k = 1"]`	13.335 ms (5%)	0.000 ns	266.86 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 1, input_size = 1000, k = 10"]`	27.927 ms (5%)	0.000 ns	391.86 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 10, input_size = 1, k = 1"]`	19.326 μs (5%)	0.000 ns	1.42 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 10, input_size = 1, k = 10"]`	28.985 μs (5%)	0.000 ns	1.55 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 10, input_size = 1000, k = 1"]`	10.784 ms (5%)	0.000 ns	266.86 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 10, input_size = 1000, k = 10"]`	19.403 ms (5%)	0.000 ns	391.86 KiB (1%)	4020
`["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1, k = 1"]`	1.893 μs (5%)	0.000 ns	1.38 KiB (1%)	24
`["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1, k = 10"]`	2.234 μs (5%)	0.000 ns	1.50 KiB (1%)	24
`["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1000, k = 1"]`	231.217 μs (5%)	0.000 ns	235.59 KiB (1%)	4020
`["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1000, k = 10"]`	515.442 μs (5%)	0.000 ns	360.59 KiB (1%)	4020
`["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1, k = 1"]`	1.914 μs (5%)	0.000 ns	1.38 KiB (1%)	24
`["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1, k = 10"]`	2.044 μs (5%)	0.000 ns	1.50 KiB (1%)	24
`["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1000, k = 1"]`	249.110 μs (5%)	0.000 ns	235.59 KiB (1%)	4020
`["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1000, k = 10"]`	454.097 μs (5%)	0.000 ns	360.59 KiB (1%)	4020
`["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1, k = 1"]`	1.973 μs (5%)	0.000 ns	1.38 KiB (1%)	24
`["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1, k = 10"]`	2.224 μs (5%)	0.000 ns	1.50 KiB (1%)	24
`["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1000, k = 1"]`	349.720 μs (5%)	0.000 ns	235.59 KiB (1%)	4020
`["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1000, k = 10"]`	674.693 μs (5%)	0.000 ns	360.59 KiB (1%)	4020
`["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1, k = 1"]`	1.973 μs (5%)	0.000 ns	1.38 KiB (1%)	24
`["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1, k = 10"]`	2.154 μs (5%)	0.000 ns	1.50 KiB (1%)	24
`["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1000, k = 1"]`	367.854 μs (5%)	0.000 ns	235.59 KiB (1%)	4020
`["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1000, k = 10"]`	598.990 μs (5%)	0.000 ns	360.59 KiB (1%)	4020
`["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1, k = 1"]`	1.933 μs (5%)	0.000 ns	1.42 KiB (1%)	24
`["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1, k = 10"]`	2.665 μs (5%)	0.000 ns	1.55 KiB (1%)	24
`["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1000, k = 1"]`	265.741 μs (5%)	0.000 ns	266.86 KiB (1%)	4020
`["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1000, k = 10"]`	1.789 ms (5%)	0.000 ns	391.86 KiB (1%)	4020
`["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1, k = 1"]`	1.933 μs (5%)	0.000 ns	1.42 KiB (1%)	24
`["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1, k = 10"]`	2.785 μs (5%)	0.000 ns	1.55 KiB (1%)	24
`["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1000, k = 1"]`	269.338 μs (5%)	0.000 ns	266.86 KiB (1%)	4020
`["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1000, k = 10"]`	1.230 ms (5%)	0.000 ns	391.86 KiB (1%)	4020
`["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1, k = 1"]`	2.114 μs (5%)	0.000 ns	1.42 KiB (1%)	24
`["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1, k = 10"]`	3.136 μs (5%)	0.000 ns	1.55 KiB (1%)	24
`["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1000, k = 1"]`	399.664 μs (5%)	0.000 ns	266.86 KiB (1%)	4020
`["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1000, k = 10"]`	2.835 ms (5%)	0.000 ns	391.86 KiB (1%)	4020
`["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1, k = 1"]`	1.994 μs (5%)	0.000 ns	1.42 KiB (1%)	24
`["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1, k = 10"]`	3.013 μs (5%)	0.000 ns	1.55 KiB (1%)	24
`["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1000, k = 1"]`	404.343 μs (5%)	0.000 ns	266.86 KiB (1%)	4020
`["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1000, k = 10"]`	1.957 ms (5%)	0.000 ns	391.86 KiB (1%)	4020
ID	time	GC time	memory	allocations
`["build tree", "NearestNeighbors.BallTree 1 × 1000, ls = 1"]`	236.086 μs (5%)	0.000 ns	41.84 KiB (1%)	47
`["build tree", "NearestNeighbors.BallTree 1 × 1000, ls = 10"]`	111.119 μs (5%)	0.000 ns	13.77 KiB (1%)	46
`["build tree", "NearestNeighbors.BallTree 1 × 100000, ls = 1"]`	32.506 ms (5%)	0.000 ns	3.82 MiB (1%)	48
`["build tree", "NearestNeighbors.BallTree 1 × 100000, ls = 10"]`	20.026 ms (5%)	0.000 ns	1.07 MiB (1%)	48
`["build tree", "NearestNeighbors.BallTree 3 × 1000, ls = 1"]`	518.889 μs (5%)	0.000 ns	73.14 KiB (1%)	47
`["build tree", "NearestNeighbors.BallTree 3 × 1000, ls = 10"]`	251.245 μs (5%)	0.000 ns	16.94 KiB (1%)	46
`["build tree", "NearestNeighbors.BallTree 3 × 100000, ls = 1"]`	81.308 ms (5%)	0.000 ns	6.87 MiB (1%)	48
`["build tree", "NearestNeighbors.BallTree 3 × 100000, ls = 10"]`	54.922 ms (5%)	0.000 ns	1.38 MiB (1%)	48
`["build tree", "NearestNeighbors.KDTree 1 × 1000, ls = 1"]`	128.282 μs (5%)	0.000 ns	42.05 KiB (1%)	48
`["build tree", "NearestNeighbors.KDTree 1 × 1000, ls = 10"]`	63.169 μs (5%)	0.000 ns	13.97 KiB (1%)	47
`["build tree", "NearestNeighbors.KDTree 1 × 100000, ls = 1"]`	18.829 ms (5%)	0.000 ns	3.82 MiB (1%)	49
`["build tree", "NearestNeighbors.KDTree 1 × 100000, ls = 10"]`	12.273 ms (5%)	0.000 ns	1.07 MiB (1%)	49
`["build tree", "NearestNeighbors.KDTree 3 × 1000, ls = 1"]`	233.170 μs (5%)	0.000 ns	42.11 KiB (1%)	48
`["build tree", "NearestNeighbors.KDTree 3 × 1000, ls = 10"]`	125.607 μs (5%)	0.000 ns	14.03 KiB (1%)	47
`["build tree", "NearestNeighbors.KDTree 3 × 100000, ls = 1"]`	42.018 ms (5%)	0.000 ns	3.82 MiB (1%)	49
`["build tree", "NearestNeighbors.KDTree 3 × 100000, ls = 10"]`	30.835 ms (5%)	0.000 ns	1.07 MiB (1%)	49
`["inrange", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1, r = 8.86e-03"]`	2.645 μs (5%)	0.000 ns	1.72 KiB (1%)	24
`["inrange", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1000, r = 8.86e-03"]`	810.970 μs (5%)	0.000 ns	565.67 KiB (1%)	4663
`["inrange", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1, r = 8.86e-03"]`	2.344 μs (5%)	0.000 ns	1.72 KiB (1%)	24
`["inrange", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1000, r = 8.86e-03"]`	678.110 μs (5%)	0.000 ns	565.67 KiB (1%)	4663
`["inrange", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1, r = 8.86e-03"]`	24.176 μs (5%)	0.000 ns	33.56 KiB (1%)	30
`["inrange", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1000, r = 8.86e-03"]`	23.735 ms (5%)	0.000 ns	31.67 MiB (1%)	11013
`["inrange", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1, r = 8.86e-03"]`	13.105 μs (5%)	0.000 ns	33.56 KiB (1%)	30
`["inrange", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1000, r = 8.86e-03"]`	13.866 ms (5%)	0.000 ns	31.67 MiB (1%)	11013
`["inrange", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1, r = 1.91e-01"]`	7.494 μs (5%)	0.000 ns	1.73 KiB (1%)	24
`["inrange", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1000, r = 1.91e-01"]`	4.718 ms (5%)	0.000 ns	700.28 KiB (1%)	4981
`["inrange", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1, r = 1.91e-01"]`	5.010 μs (5%)	0.000 ns	1.73 KiB (1%)	24
`["inrange", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1000, r = 1.91e-01"]`	2.883 ms (5%)	0.000 ns	700.28 KiB (1%)	4981
`["inrange", "NearestNeighbors.BallTree 3 × 100000, ls = 1, input_size = 1, r = 1.91e-01"]`	149.402 μs (5%)	0.000 ns	65.64 KiB (1%)	31
`["inrange", "NearestNeighbors.BallTree 3 × 100000, ls = 1, input_size = 1000, r = 1.91e-01"]`	125.669 ms (5%)	0.000 ns	52.70 MiB (1%)	11674
`["inrange", "NearestNeighbors.BallTree 3 × 100000, ls = 10, input_size = 1, r = 1.91e-01"]`	96.773 μs (5%)	0.000 ns	65.64 KiB (1%)	31
`["inrange", "NearestNeighbors.BallTree 3 × 100000, ls = 10, input_size = 1000, r = 1.91e-01"]`	76.343 ms (5%)	0.000 ns	52.70 MiB (1%)	11674
`["inrange", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1, r = 8.86e-03"]`	2.334 μs (5%)	0.000 ns	1.72 KiB (1%)	24
`["inrange", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1000, r = 8.86e-03"]`	665.515 μs (5%)	0.000 ns	565.67 KiB (1%)	4663
`["inrange", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1, r = 8.86e-03"]`	2.094 μs (5%)	0.000 ns	1.72 KiB (1%)	24
`["inrange", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1000, r = 8.86e-03"]`	471.179 μs (5%)	0.000 ns	565.67 KiB (1%)	4663
`["inrange", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1, r = 8.86e-03"]`	34.666 μs (5%)	0.000 ns	33.56 KiB (1%)	30
`["inrange", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1000, r = 8.86e-03"]`	37.577 ms (5%)	0.000 ns	31.67 MiB (1%)	11013
`["inrange", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1, r = 8.86e-03"]`	19.898 μs (5%)	0.000 ns	33.56 KiB (1%)	30
`["inrange", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1000, r = 8.86e-03"]`	21.645 ms (5%)	0.000 ns	31.67 MiB (1%)	11013
`["inrange", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1, r = 1.91e-01"]`	3.957 μs (5%)	0.000 ns	1.73 KiB (1%)	24
`["inrange", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1000, r = 1.91e-01"]`	2.676 ms (5%)	0.000 ns	700.28 KiB (1%)	4981
`["inrange", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1, r = 1.91e-01"]`	3.266 μs (5%)	0.000 ns	1.73 KiB (1%)	24
`["inrange", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1000, r = 1.91e-01"]`	1.576 ms (5%)	0.000 ns	700.28 KiB (1%)	4981
`["inrange", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1, r = 1.91e-01"]`	124.215 μs (5%)	0.000 ns	65.64 KiB (1%)	31
`["inrange", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1000, r = 1.91e-01"]`	111.466 ms (5%)	0.000 ns	52.70 MiB (1%)	11674
`["inrange", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1, r = 1.91e-01"]`	74.000 μs (5%)	0.000 ns	65.64 KiB (1%)	31
`["inrange", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1000, r = 1.91e-01"]`	63.075 ms (5%)	1.902 ms	52.70 MiB (1%)	11674
`["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1, k = 1"]`	2.424 μs (5%)	0.000 ns	1.38 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1, k = 10"]`	3.116 μs (5%)	0.000 ns	1.50 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1000, k = 1"]`	493.090 μs (5%)	0.000 ns	235.59 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 1, input_size = 1000, k = 10"]`	984.077 μs (5%)	0.000 ns	360.59 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1, k = 1"]`	2.394 μs (5%)	0.000 ns	1.38 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1, k = 10"]`	2.585 μs (5%)	0.000 ns	1.50 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1000, k = 1"]`	502.278 μs (5%)	0.000 ns	235.59 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 1 × 1000, ls = 10, input_size = 1000, k = 10"]`	720.179 μs (5%)	0.000 ns	360.59 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1, k = 1"]`	2.705 μs (5%)	0.000 ns	1.38 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1, k = 10"]`	3.226 μs (5%)	0.000 ns	1.50 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1000, k = 1"]`	694.050 μs (5%)	0.000 ns	235.59 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 1, input_size = 1000, k = 10"]`	1.254 ms (5%)	0.000 ns	360.59 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1, k = 1"]`	2.585 μs (5%)	0.000 ns	1.38 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1, k = 10"]`	2.785 μs (5%)	0.000 ns	1.50 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1000, k = 1"]`	707.314 μs (5%)	0.000 ns	235.59 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 1 × 100000, ls = 10, input_size = 1000, k = 10"]`	974.700 μs (5%)	0.000 ns	360.59 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1, k = 1"]`	5.199 μs (5%)	0.000 ns	1.42 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1, k = 10"]`	9.338 μs (5%)	0.000 ns	1.55 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1000, k = 1"]`	2.354 ms (5%)	0.000 ns	266.86 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 1, input_size = 1000, k = 10"]`	6.224 ms (5%)	0.000 ns	391.86 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1, k = 1"]`	5.300 μs (5%)	0.000 ns	1.42 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1, k = 10"]`	8.366 μs (5%)	0.000 ns	1.55 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1000, k = 1"]`	1.957 ms (5%)	0.000 ns	266.86 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 3 × 1000, ls = 10, input_size = 1000, k = 10"]`	4.292 ms (5%)	0.000 ns	391.86 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 1, input_size = 1, k = 1"]`	24.777 μs (5%)	0.000 ns	1.42 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 1, input_size = 1, k = 10"]`	44.193 μs (5%)	0.000 ns	1.55 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 1, input_size = 1000, k = 1"]`	13.399 ms (5%)	0.000 ns	266.86 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 1, input_size = 1000, k = 10"]`	27.629 ms (5%)	0.000 ns	391.86 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 10, input_size = 1, k = 1"]`	19.658 μs (5%)	0.000 ns	1.42 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 10, input_size = 1, k = 10"]`	29.545 μs (5%)	0.000 ns	1.55 KiB (1%)	24
`["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 10, input_size = 1000, k = 1"]`	10.877 ms (5%)	0.000 ns	266.86 KiB (1%)	4020
`["knn", "NearestNeighbors.BallTree 3 × 100000, ls = 10, input_size = 1000, k = 10"]`	19.267 ms (5%)	0.000 ns	391.86 KiB (1%)	4020
`["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1, k = 1"]`	2.565 μs (5%)	0.000 ns	1.41 KiB (1%)	26
`["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1, k = 10"]`	2.895 μs (5%)	0.000 ns	1.53 KiB (1%)	26
`["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1000, k = 1"]`	559.486 μs (5%)	0.000 ns	266.84 KiB (1%)	6020
`["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 1, input_size = 1000, k = 10"]`	860.213 μs (5%)	0.000 ns	391.84 KiB (1%)	6020
`["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1, k = 1"]`	2.574 μs (5%)	0.000 ns	1.41 KiB (1%)	26
`["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1, k = 10"]`	2.696 μs (5%)	0.000 ns	1.53 KiB (1%)	26
`["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1000, k = 1"]`	572.360 μs (5%)	0.000 ns	266.84 KiB (1%)	6020
`["knn", "NearestNeighbors.KDTree 1 × 1000, ls = 10, input_size = 1000, k = 10"]`	777.207 μs (5%)	0.000 ns	391.84 KiB (1%)	6020
`["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1, k = 1"]`	2.615 μs (5%)	0.000 ns	1.41 KiB (1%)	26
`["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1, k = 10"]`	2.885 μs (5%)	0.000 ns	1.53 KiB (1%)	26
`["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1000, k = 1"]`	687.036 μs (5%)	0.000 ns	266.84 KiB (1%)	6020
`["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 1, input_size = 1000, k = 10"]`	1.025 ms (5%)	0.000 ns	391.84 KiB (1%)	6020
`["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1, k = 1"]`	2.635 μs (5%)	0.000 ns	1.41 KiB (1%)	26
`["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1, k = 10"]`	2.796 μs (5%)	0.000 ns	1.53 KiB (1%)	26
`["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1000, k = 1"]`	701.003 μs (5%)	0.000 ns	266.84 KiB (1%)	6020
`["knn", "NearestNeighbors.KDTree 1 × 100000, ls = 10, input_size = 1000, k = 10"]`	937.039 μs (5%)	0.000 ns	391.84 KiB (1%)	6020
`["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1, k = 1"]`	2.424 μs (5%)	0.000 ns	1.47 KiB (1%)	26
`["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1, k = 10"]`	3.166 μs (5%)	0.000 ns	1.59 KiB (1%)	26
`["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1000, k = 1"]`	571.609 μs (5%)	0.000 ns	313.73 KiB (1%)	6020
`["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 1, input_size = 1000, k = 10"]`	2.102 ms (5%)	0.000 ns	438.73 KiB (1%)	6020
`["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1, k = 1"]`	2.404 μs (5%)	0.000 ns	1.47 KiB (1%)	26
`["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1, k = 10"]`	3.306 μs (5%)	0.000 ns	1.59 KiB (1%)	26
`["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1000, k = 1"]`	578.302 μs (5%)	0.000 ns	313.73 KiB (1%)	6020
`["knn", "NearestNeighbors.KDTree 3 × 1000, ls = 10, input_size = 1000, k = 10"]`	1.543 ms (5%)	0.000 ns	438.73 KiB (1%)	6020
`["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1, k = 1"]`	2.605 μs (5%)	0.000 ns	1.47 KiB (1%)	26
`["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1, k = 10"]`	3.547 μs (5%)	0.000 ns	1.59 KiB (1%)	26
`["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1000, k = 1"]`	718.816 μs (5%)	0.000 ns	313.73 KiB (1%)	6020
`["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 1, input_size = 1000, k = 10"]`	3.193 ms (5%)	0.000 ns	438.73 KiB (1%)	6020
`["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1, k = 1"]`	2.515 μs (5%)	0.000 ns	1.47 KiB (1%)	26
`["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1, k = 10"]`	3.535 μs (5%)	0.000 ns	1.59 KiB (1%)	26
`["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1000, k = 1"]`	714.558 μs (5%)	0.000 ns	313.73 KiB (1%)	6020
`["knn", "NearestNeighbors.KDTree 3 × 100000, ls = 10, input_size = 1000, k = 10"]`	2.278 ms (5%)	0.000 ns	438.73 KiB (1%)	6020