mirror of
https://github.com/meilisearch/MeiliSearch
synced 2024-12-24 13:40:31 +01:00
a8cda248b4
This custom algo lazily compute the intersections between words, to avoid too much set operations and database reads
43 lines
1017 B
TOML
43 lines
1017 B
TOML
[package]
|
|
name = "mega-mini-indexer"
|
|
version = "0.1.0"
|
|
authors = ["Kerollmops <clement@meilisearch.com>"]
|
|
edition = "2018"
|
|
default-run = "indexer"
|
|
|
|
[dependencies]
|
|
anyhow = "1.0.28"
|
|
bitpacking = "0.8.2"
|
|
byteorder = "1.3.4"
|
|
cow-utils = "0.1.2"
|
|
csv = "1.1.3"
|
|
fst = "0.4.3"
|
|
fxhash = "0.2.1"
|
|
heed = { version = "0.8.0", default-features = false, features = ["lmdb"] }
|
|
jemallocator = "0.3.2"
|
|
levenshtein_automata = { version = "0.2.0", features = ["fst_automaton"] }
|
|
memmap = "0.7.0"
|
|
once_cell = "1.4.0"
|
|
oxidized-mtbl = { git = "https://github.com/Kerollmops/oxidized-mtbl.git", rev = "9451be8" }
|
|
rayon = "1.3.0"
|
|
roaring = "0.5.2"
|
|
slice-group-by = "0.2.6"
|
|
smallstr = "0.2.0"
|
|
smallvec = "1.4.0"
|
|
structopt = { version = "0.3.14", default-features = false }
|
|
tempfile = "3.1.0"
|
|
|
|
# best proximity
|
|
indexmap = "1.4.0"
|
|
|
|
# to implement internally
|
|
itertools = "0.9.0"
|
|
|
|
# http server
|
|
serde = { version = "1.0", features = ["derive"] }
|
|
tokio = { version = "0.2.15", features = ["full"] }
|
|
warp = "0.2.2"
|
|
|
|
[profile.release]
|
|
debug = true
|