Annoy-inspired Approximate Nearest Neighbors in Rust, based on LMDB and optimized for memory usage :boom:
Writer::new
by @irevoire in https://github.com/meilisearch/arroy/pull/64
Full Changelog: https://github.com/meilisearch/arroy/compare/v0.2.0...v0.3.0
A lot of stuff was implemented since the last release, but to sum up the most important one: Arroy now comes with multi-threading and incremental indexing. That officially makes it faster than annoy
by a good margin :tada:
A lot of work has been put into making sure the generated trees are valid and working as well.
Reader
and Writer
creation by @Kerollmops in https://github.com/meilisearch/arroy/pull/27
Reader/Writer::is_empty
and contains_item
methods by @Kerollmops in https://github.com/meilisearch/arroy/pull/43
Full Changelog: https://github.com/meilisearch/arroy/compare/v0.1.0...v0.2.0
See the readme to see everything that was implemented.