File tree 2 files changed +4
-1
lines changed
2 files changed +4
-1
lines changed Original file line number Diff line number Diff line change @@ -7,7 +7,7 @@ A fast implementation of the Aho-Corasick algorithm using the compact double-arr
7
7
[ ![ Rust] ( https://img.shields.io/badge/rust-1.58%2B-blue.svg?maxAge=3600 )] ( https://github.com/daac-tools/daachorse )
8
8
[ ![ Build Status] ( https://github.com/daac-tools/daachorse/actions/workflows/rust.yml/badge.svg )] ( https://github.com/daac-tools/daachorse )
9
9
10
- [ Technical details (Japanese) ] ( https://tech.legalforce.co.jp/entry/2022/02/24/140316 )
10
+ The main technical ideas behind this library appear in [ this paper ] ( https://doi.org/10.48550/arXiv.2207.13870 ) .
11
11
12
12
## Overview
13
13
Original file line number Diff line number Diff line change 13
13
//! only supports constant-time state-to-state traversal but also represents each state in the
14
14
//! space of only 12 bytes.
15
15
//!
16
+ //! The main technical ideas behind this library appear in
17
+ //! [this paper](https://doi.org/10.48550/arXiv.2207.13870).
18
+ //!
16
19
//! ## Example: Finding overlapped occurrences
17
20
//!
18
21
//! To search for all occurrences of registered patterns that allow for positional overlap in the
You can’t perform that action at this time.
0 commit comments