# aho-corasick

A library for finding occurrences of many patterns at once with SIMD acceleration in some cases. This library provides multiple pattern search principally through an implementation of the Aho-Corasick algorithm, which builds a finite state machine for executing searches in linear time. Features include case insensitive matching, overlapping matches, fast searching via SIMD and optional full DFA construction and search & replace in streams.

Dual-licensed under MIT or the UNLICENSE.

### Documentation

### Usage

Add this to your `Cargo.toml`

:

```
[]
= "0.7"
```

### Example: basic searching

This example shows how to search for occurrences of multiple patterns simultaneously. Each match includes the pattern that matched along with the byte offsets of the match.

```
use AhoCorasick;
let patterns = &;
let haystack = "Nobody likes maple in their apple flavored Snapple.";
let ac = new;
let mut matches = vec!;
for mat in ac.find_iter
assert_eq!;
```

### Example: case insensitivity

This is like the previous example, but matches `Snapple`

case insensitively
using `AhoCorasickBuilder`

:

```
use AhoCorasickBuilder;
let patterns = &;
let haystack = "Nobody likes maple in their apple flavored Snapple.";
let ac = new
.ascii_case_insensitive
.build;
let mut matches = vec!;
for mat in ac.find_iter
assert_eq!;
```

### Example: replacing matches in a stream

This example shows how to execute a search and replace on a stream without loading the entire stream into memory first.

```
use AhoCorasick;
let patterns = &;
let replace_with = &;
// In a real example, these might be `std::fs::File`s instead. All you need to
// do is supply a pair of `std::io::Read` and `std::io::Write` implementations.
let rdr = "The quick brown fox.";
let mut wtr = vec!;
let ac = new;
ac.stream_replace_all
.expect;
assert_eq!;
```

### Example: finding the leftmost first match

In the textbook description of Aho-Corasick, its formulation is typically structured such that it reports all possible matches, even when they overlap with another. In many cases, overlapping matches may not be desired, such as the case of finding all successive non-overlapping matches like you might with a standard regular expression.

Unfortunately the "obvious" way to modify the Aho-Corasick algorithm to do
this doesn't always work in the expected way, since it will report matches as
soon as they are seen. For example, consider matching the regex `Samwise|Sam`

against the text `Samwise`

. Most regex engines (that are Perl-like, or
non-POSIX) will report `Samwise`

as a match, but the standard Aho-Corasick
algorithm modified for reporting non-overlapping matches will report `Sam`

.

A novel contribution of this library is the ability to change the match
semantics of Aho-Corasick (without additional search time overhead) such that
`Samwise`

is reported instead. For example, here's the standard approach:

```
use AhoCorasick;
let patterns = &;
let haystack = "Samwise";
let ac = new;
let mat = ac.find.expect;
assert_eq!;
```

And now here's the leftmost-first version, which matches how a Perl-like regex will work:

```
use ;
let patterns = &;
let haystack = "Samwise";
let ac = new
.match_kind
.build;
let mat = ac.find.expect;
assert_eq!;
```

In addition to leftmost-first semantics, this library also supports
leftmost-longest semantics, which match the POSIX behavior of a regular
expression alternation. See `MatchKind`

in the docs for more details.

### Minimum Rust version policy

This crate's minimum supported `rustc`

version is `1.41.1`

.

The current policy is that the minimum Rust version required to use this crate
can be increased in minor version updates. For example, if `crate 1.0`

requires
Rust 1.20.0, then `crate 1.0.z`

for all values of `z`

will also require Rust
1.20.0 or newer. However, `crate 1.y`

for `y > 0`

may require a newer minimum
version of Rust.

In general, this crate will be conservative with respect to the minimum supported version of Rust.

### FFI bindings

- G-Research/ahocorasick_rs is a Python wrapper for this library.

### Future work

Here are some plans for the future:

- Assuming the current API is sufficient, I'd like to commit to it and release
a
`1.0`

version of this crate some time in the next 6-12 months. - Support stream searching with leftmost match semantics. Currently, only standard match semantics are supported. Getting this right seems possible, but is tricky since the match state needs to be propagated through multiple searches. (With standard semantics, as soon as a match is seen the search ends.)