2 releases

Uses old Rust 2015

0.1.1 May 1, 2016
0.1.0 Nov 8, 2015

#1191 in Algorithms

Download history 25764/week @ 2024-08-25 25047/week @ 2024-09-01 22137/week @ 2024-09-08 22747/week @ 2024-09-15 22485/week @ 2024-09-22 23891/week @ 2024-09-29 24773/week @ 2024-10-06 22084/week @ 2024-10-13 21898/week @ 2024-10-20 25711/week @ 2024-10-27 24400/week @ 2024-11-03 31545/week @ 2024-11-10 32261/week @ 2024-11-17 27028/week @ 2024-11-24 25510/week @ 2024-12-01 29026/week @ 2024-12-08

115,391 downloads per month
Used in 99 crates (27 directly)

MIT/Apache

15KB
172 lines

memmem

This is a crate for substring searching (with functionality similar to the memmem function in C). So far, it only contains a copy of the two-way search implementation from rust's standard library (but with an API that allows searching in &[u8]). Eventually, we plan to provide other searching algorithms, and possibly also some heuristics to choose a good searching algorithm based on the substring we are looking for.

Build status Coverage Status

Documentation


lib.rs:

A crate for string searching. The main trait is Searcher, which has a function for finding fixed things in long byte-strings. Currently, the only implementer of Searcher is TwoWaySearcher.

Example

use memmem::{Searcher, TwoWaySearcher};
let search = TwoWaySearcher::new("dog".as_bytes());
assert_eq!(search.search_in("The quick brown fox jumped over the lazy dog.".as_bytes()), Some(41));

No runtime deps