josh/propane
1
0
Fork 0
Code Issues 3 Pull Requests Projects Releases Wiki Activity

token matching loop storing ovector for longest match so the longest-matching token does not need to be re-matched to obtain subpattern match strings

Browse Source
This commit is contained in:
Josh Holtrop 2010-05-07 15:24:50 -04:00
parent 1113cdb7d2
commit 3a8d9ca55d
1 changed files with 4 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
tmpl/parser.cc
View File

@ -1,4 +1,6 @@
#include <string.h> /* memcpy() */
#include <iostream> #include <iostream>
#include <vector> #include <vector>
@ -86,6 +88,7 @@ bool I_CLASSNAME::parse(istream & i)
{ {
int longest_match_length = 0; int longest_match_length = 0;
int longest_match_index; int longest_match_index;
int longest_match_ovector[ovector_size];
for (int i = 0; i < sizeof(tokens)/sizeof(tokens[0]); i++) for (int i = 0; i < sizeof(tokens)/sizeof(tokens[0]); i++)
{ {
int rc = pcre_exec(tokens[i].re, tokens[i].re_extra, int rc = pcre_exec(tokens[i].re, tokens[i].re_extra,
@ -100,6 +103,7 @@ bool I_CLASSNAME::parse(istream & i)
{ {
longest_match_length = len; longest_match_length = len;
longest_match_index = i; longest_match_index = i;
memcpy(longest_match_ovector, ovector, sizeof(ovector));
} }
} }
} }