fst 0.3.3

Use finite state transducers to compactly represents sets or maps of many strings (> 1 billion is possible).
Documentation 
[[bench]]
bench = true
name = "build"
path = "./benches/build.rs"
test = false

[[bench]]
bench = true
name = "search"
path = "./benches/search.rs"
test = false
[dependencies.byteorder]
version = "1"

[dependencies.memmap]
optional = true
version = "0.6.0"
[dev-dependencies.fnv]
version = "1.0.5"

[dev-dependencies.fst-levenshtein]
version = "0.2"

[dev-dependencies.fst-regex]
version = "0.2"

[dev-dependencies.lazy_static]
version = "0.2.8"

[dev-dependencies.quickcheck]
default-features = false
version = "0.7"

[dev-dependencies.rand]
version = "0.5"

[features]
default = ["mmap"]
mmap = ["memmap"]

[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"
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.3.3"
[profile.bench]
debug = true
opt-level = 3

[profile.release]
debug = true