mirror of
https://github.com/meilisearch/meilisearch.git
synced 2025-09-07 13:16:31 +00:00
Introduce a customized A* algorithm.
This custom algo lazily compute the intersections between words, to avoid too much set operations and database reads
This commit is contained in:
@ -28,7 +28,7 @@ structopt = { version = "0.3.14", default-features = false }
|
||||
tempfile = "3.1.0"
|
||||
|
||||
# best proximity
|
||||
pathfinding = "2.0.4"
|
||||
indexmap = "1.4.0"
|
||||
|
||||
# to implement internally
|
||||
itertools = "0.9.0"
|
||||
|
Reference in New Issue
Block a user