[dependencies.utf8-ranges]
optional = true
version = "1.0.4"
[dev-dependencies.doc-comment]
version = "0.3.1"
[dev-dependencies.fnv]
version = "1.0.6"
[dev-dependencies.memmap]
version = "0.7"
[dev-dependencies.quickcheck]
default-features = false
version = "0.9.2"
[dev-dependencies.rand]
version = "0.7.3"
[features]
default = []
levenshtein = ["utf8-ranges"]
[package]
authors = ["Andrew Gallant <jamslam@gmail.com>"]
description = "Use finite state transducers to compactly represents sets or maps of many\nstrings (> 1 billion is possible).\n"
documentation = "https://docs.rs/fst"
edition = "2018"
homepage = "https://github.com/BurntSushi/fst"
keywords = ["search", "information", "retrieval", "dictionary", "map"]
license = "Unlicense/MIT"
name = "fst"
readme = "README.md"
repository = "https://github.com/BurntSushi/fst"
version = "0.4.4"
[package.metadata.docs.rs]
features = ["levenshtein"]
[profile.bench]
debug = true
[profile.release]
debug = true