v0.2.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 🎉

A lot of work has been put into making sure the generated trees are valid and working as well.

The whole list of changes

• Ensure the right distance is used when querying a database by @Kerollmops in #28
• Cleanup Documentation by @Kerollmops in #30
• Improve the Reader and Writer creation by @Kerollmops in #27
• Split the import from the searches in the movies example by @irevoire in #25
• Add a way to generate graphs and to get stats about your database by @irevoire in #34
• Use roaring bitmaps to store descendants by @irevoire in #37
• Search filtering by @irevoire in #38
• Build the trees in parallel by @Kerollmops in #32
• Introduce the Reader/Writer::is_empty and contains_item methods by @Kerollmops in #43
• Fix the Angular distance and Windows by @Kerollmops in #46
• Make sure we always build at least one tree by @dureuill in #49
• Incremental indexing by @irevoire in #41
• Update LICENSE by @curquiza in #50
• Re-use deleted node IDs in incremental mode by @irevoire in #56
• Add a fuzzer by @irevoire in #57
• Improve the tmp node deletion by @irevoire in #62

New Contributors

• @dureuill made their first contribution in #49
• @curquiza made their first contribution in #50

Full Changelog: v0.1.0...v0.2.0