[badges.maintenance]
status = "deprecated"
[dependencies.galil-seiferas]
optional = true
version = "0.1.1"
[dependencies.jetscii]
features = ["unstable"]
optional = true
version = "0.3"
[dependencies.memchr]
default-features = false
version = "2.0"
[dependencies.unchecked-index]
version = "0.2.2"
[dev-dependencies.itertools]
version = "0.8.0"
[dev-dependencies.macro-attr]
version = "0.2"
[dev-dependencies.newtype_derive]
version = "0.1"
[dev-dependencies.odds]
features = ["std-string"]
version = "0.3"
[dev-dependencies.quickcheck]
default-features = false
version = "0.8"
[dev-dependencies.rand]
version = "0.6"
[features]
all = ["jetscii", "pattern"]
benchmarks = ["galil-seiferas", "pattern"]
default = ["use_std"]
pattern = []
use_std = ["memchr/use_std"]
[package]
authors = ["bluss"]
categories = ["algorithms", "no-std"]
description = "(Deprecated - use crate memchr instead.) Fast substring search for strings and byte strings. Optional SSE4.2 acceleration (if detected at runtime) using pcmpestri. Memchr is the only mandatory dependency. The two way algorithm is also used by rust's libstd itself, but here it is exposed both for byte strings, using memchr, and optionally using a SSE4.2 accelerated version."
documentation = "https://docs.rs/twoway/"
keywords = ["substring-search", "string", "pcmpestri", "find", "memmem"]
license = "MIT/Apache-2.0"
name = "twoway"
repository = "https://github.com/bluss/twoway"
version = "0.2.2"
[package.metadata.release]
no-dev-version = true
tag-name = "{{version}}"