| Crates.io | hwt |
| lib.rs | hwt |
| version | 0.4.2 |
| created_at | 2019-03-04 16:24:31.106846+00 |
| updated_at | 2019-04-29 04:58:58.440085+00 |
| description | Hamming Weight Tree for finding neighbors in Hamming space |
| homepage | |
| repository | https://github.com/vadixidav/hwt |
| max_upload_size | |
| id | 118666 |
| size | 97,113 |
Hamming Weight Tree from the paper Online Nearest Neighbor Search in Hamming Space
To understand how the data structure works, please see the docs.
Most recent benchmark for 1-NN:
You can find benchmark output here.
If you would like to run the benchmarks yourself, just run cargo bench at the command line. I recommend using RUSTFLAGS='-C target-cpu=native' cargo bench instead since both linear search and this tree are both significantly faster when using modern instructions.