/knuth-morris-pratt

Generic substring search for sequences. Requires elements that are equality comparable.

Primary LanguageRustApache License 2.0Apache-2.0

Knuth-Morris-Pratt

Reference: ESMAJ Knuth-Morris-Pratt algorithm http://www-igm.univ-mlv.fr/~lecroq/string/node8.html

Substring search algorithm for an slices of elements that are comparable with ==.

Documentation not available yet. Not yet published.

Please read the API documentation here

build_status crates

How to contribute:

  • Fix a bug or implement a new thing
  • Include tests for your new feature, preferably a quickcheck test
  • Make a Pull Request

Recent Changes

    • No releases