arroy 0.1.0

Annoy-inspired Approximate Nearest Neighbors in Rust, based on LMDB and optimized for memory usage
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47

[dependencies.bytemuck]
features = ["derive", "extern_crate_alloc"]
version = "1.14.0"

[dependencies.byteorder]
version = "1.5.0"

[dependencies.heed]
version = "0.20.0-alpha.9"

[dependencies.ordered-float]
version = "4.1.1"

[dependencies.rand]
features = ["alloc"]
version = "0.8.5"

[dependencies.thiserror]
version = "1.0.50"
[dev-dependencies.heed]
version = "0.20.0-alpha.9"

[dev-dependencies.insta]
version = "1.34.0"

[dev-dependencies.instant-distance]
version = "0.6.1"

[dev-dependencies.rand]
features = ["std_rng"]
version = "0.8.5"

[dev-dependencies.tempfile]
version = "3.8.1"

[package]
authors = ["Kerollmops <clement@meilisearch.com>", "Tamo <tamo@meilisearch.com>"]
categories = ["algorithms", "database", "data-structures", "science"]
description = "Annoy-inspired Approximate Nearest Neighbors in Rust, based on LMDB and optimized for memory usage"
documentation = "https://docs.rs/arroy"
edition = "2021"
keywords = ["ANN-search", "Graph-algorithms", "Vector-Search", "Store"]
license = "MIT"
name = "arroy"
readme = "README.md"
repository = "https://github.com/meilisearch/arroy"
version = "0.1.0"