diff options
| author | Felipe Gasper <felipe@felipegasper.com> | 2021-06-15 00:25:38 -0400 |
|---|---|---|
| committer | James E Keenan <jkeenan@cpan.org> | 2021-06-15 06:35:54 -0400 |
| commit | 5ab5717f6c5cffd470fe7dd317d88f0dbc20903c (patch) | |
| tree | 772aa53fddf046707bf5656292db3e9e99623671 /regcomp.c | |
| parent | 9b7a2e9a504993262ba7201acf590d0b94bf5a9d (diff) | |
| download | perl-5ab5717f6c5cffd470fe7dd317d88f0dbc20903c.tar.gz | |
Fix spelling: precede
Diffstat (limited to 'regcomp.c')
| -rw-r--r-- | regcomp.c | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -3950,7 +3950,7 @@ S_construct_ahocorasick_from_trie(pTHX_ RExC_state_t *pRExC_state, regnode *sour * * XXX khw thinks this should be enhanced to fill EXACT (at least) nodes as full * as possible, even if that means splitting an existing node so that its first - * part is moved to the preceeding node. This would maximise the efficiency of + * part is moved to the preceding node. This would maximise the efficiency of * memEQ during matching. * * If a node is to match under /i (folded), the number of characters it matches |