Howard Hinnant
|
0cbed7e140
|
Redesign number 3. The previous design was not handling matching of empty strings inside of loops.
llvm-svn: 108151
|
2010-07-12 15:51:17 +00:00 |
|
Howard Hinnant
|
87ec03a2ea
|
weekly update to by-chapter-summary, plus left and right anchor support in basic posix.
llvm-svn: 107938
|
2010-07-09 00:15:26 +00:00 |
|
Howard Hinnant
|
8c459a14a9
|
Marked subexpressions in a loop in basic posix working (only lightly tested so far)
llvm-svn: 107889
|
2010-07-08 17:43:58 +00:00 |
|
Howard Hinnant
|
189b212662
|
First loop test passed. The data structure and search algorithm is still crude and in-flux. But this milestone needed to be locked in. Right now every loop is implemented in terms of a structure that will handle the most complicated {min, max} loop. Though only *-loops are tested at the moment. In a future iteration *-loops will likely be optimized a little more. The only tests are for basic posix so far, but I have prototype code running for extended posix and ecma. The prototype code lacks the complicating properties of the real <regex> requirements though.
llvm-svn: 107803
|
2010-07-07 19:14:52 +00:00 |
|
Howard Hinnant
|
928658cd70
|
First test for marked subexpressions
llvm-svn: 107317
|
2010-06-30 20:30:19 +00:00 |
|
Howard Hinnant
|
237ee6fef8
|
First, very primitive, search results on one engine
llvm-svn: 107294
|
2010-06-30 17:22:19 +00:00 |