Skip to content

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

License

Apache-2.0, MIT licenses found

Licenses found

Apache-2.0
LICENSE-APACHE
MIT
LICENSE-MIT
Notifications You must be signed in to change notification settings

bluss/knuth-morris-pratt

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

16 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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

About

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

Topics

Resources

License

Apache-2.0, MIT licenses found

Licenses found

Apache-2.0
LICENSE-APACHE
MIT
LICENSE-MIT

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages