codecov-io
commented
5 years ago Codecov Report
Merging #21 into develop will increase coverage by
0.03%. The diff coverage is99.22%.
@@ Coverage Diff @@
## develop #21 +/- ##
===========================================
+ Coverage 98.89% 98.93% +0.03%
===========================================
Files 46 51 +5
Lines 3895 4129 +234
Branches 400 432 +32
===========================================
+ Hits 3852 4085 +233
Misses 24 24
- Partials 19 20 +1| Impacted Files | Coverage Δ | |
|---|---|---|
| skhubness/neighbors/__init__.py | 85.71% <100%> (+0.71%) |
:arrow_up: |
| skhubness/utils/tests/test_io.py | 100% <100%> (ø) |
|
| skhubness/utils/io.py | 100% <100%> (ø) |
|
| skhubness/neighbors/tests/test_rptree.py | 100% <100%> (ø) |
|
| skhubness/utils/check.py | 100% <100%> (ø) |
|
| skhubness/neighbors/hnsw.py | 100% <100%> (ø) |
:arrow_up: |
| skhubness/neighbors/tests/test_neighbors.py | 99.78% <100%> (ø) |
:arrow_up: |
| skhubness/neighbors/base.py | 95.4% <91.66%> (+0.08%) |
:arrow_up: |
| skhubness/neighbors/random_projection_trees.py | 98.97% <98.97%> (ø) |
|
| ... and 4 more |
Continue to review full report at Codecov.
Legend - Click here to learn more
Δ = absolute <relative> (impact),ø = not affected,? = missing dataPowered by Codecov. Last update 96fa2ef...d7e88ff. Read the comment docs.
lgtm-com[bot]
Let's introduce another approximate nearest neighbor methods: random projection trees, provided by the
annoylibrary.This faces the same problem as mentioned in issue #20 but solves it by memmapping the
annoy.Indexto a temporary file, preferably in /dev/shm.