kmp 0.1.1

Various functions using the Knuth–Morris–Pratt algorithm to efficiently find patterns.
Documentation
[[bench]]
harness = false
name = "table"

[[bench]]
harness = false
name = "find"

[[bench]]
harness = false
name = "match"
[badges.gitlab]
branch = "master"
repository = "bit-refined/kmp"

[badges.maintenance]
status = "experimental"

[dependencies]
[dev-dependencies.criterion]
version = "0.3.0"

[dev-dependencies.proptest]
version = "0.9.4"

[package]
authors = ["Kevin Becker <k.becker@bit-refined.eu>"]
categories = ["algorithms", "no-std"]
description = "Various functions using the Knuth–Morris–Pratt algorithm to efficiently find patterns."
edition = "2018"
homepage = "https://gitlab.com/bit-refined/kmp/"
keywords = ["search", "pattern", "matching", "linear-time", "knuth-morris-pratt"]
license = "LGPL-3.0-or-later"
name = "kmp"
repository = "https://gitlab.com/bit-refined/kmp/"
version = "0.1.1"
[profile.bench]
codegen-units = 1
debug = false
debug-assertions = false
incremental = false
lto = true
opt-level = 3
overflow-checks = false
rpath = false

[profile.dev]
codegen-units = 16
debug = true
debug-assertions = true
incremental = true
lto = false
opt-level = 0
overflow-checks = true
panic = "unwind"
rpath = false

[profile.release]
codegen-units = 1
debug = false
debug-assertions = false
incremental = false
lto = true
opt-level = 3
overflow-checks = false
panic = "unwind"
rpath = false

[profile.test]
codegen-units = 16
debug = true
debug-assertions = true
incremental = true
lto = false
opt-level = 0
overflow-checks = true
rpath = false