hamming-heap
| Crates.io | hamming-heap |
| lib.rs | hamming-heap |
| version | 0.4.1 |
| source | src |
| created_at | 2019-08-04 04:28:05.488944 |
| updated_at | 2019-08-15 01:24:32.769513 |
| description | Amortized constant time min heaps for binary features in nearest neighbor searches |
| homepage | |
| repository | https://github.com/rust-photogrammetry/hamming-heap |
| max_upload_size | |
| id | 154051 |
| size | 16,649 |
Geordon Worley (vadixidav)
documentation
https://docs.rs/hamming-heap/
README
hamming-heap
Rust crate providing amortized constant time min heaps for binary features using hamming distance
This is used in the HNSW crate. It was originally developed for the HWT crate and continues to be useful for doing fast nearest-neighbor searches. It currently has no tests itself, but it has been tested to varying degrees in integration with the two crates.
Contributions are welcome! Currently benchmarks and tests would be appreciated.