--- code/trunk/doc/html/pcretest.html 2009/09/18 19:12:35 453 +++ code/trunk/doc/html/pcretest.html 2009/10/05 10:59:35 461 @@ -248,7 +248,7 @@ If any call to pcre_exec() in a /g or /G sequence matches an empty string, the next call is done with the PCRE_NOTEMPTY_ATSTART and PCRE_ANCHORED flags set in order to search for another, non-empty, match at the -same point. If this second match fails, the start offset is advanced by one +same point. If this second match fails, the start offset is advanced by one character, and the normal match is retried. This imitates the way Perl handles such cases when using the /g modifier or the split() function.

@@ -371,13 +371,14 @@ \L call pcre_get_substringlist() after a successful match \M discover the minimum MATCH_LIMIT and MATCH_LIMIT_RECURSION settings \N pass the PCRE_NOTEMPTY option to pcre_exec() or pcre_dfa_exec(); if used twice, pass the - PCRE_NOTEMPTY_ATSTART option + PCRE_NOTEMPTY_ATSTART option \Odd set the size of the output vector passed to pcre_exec() to dd (any number of digits) \P pass the PCRE_PARTIAL_SOFT option to pcre_exec() or pcre_dfa_exec(); if used twice, pass the - PCRE_PARTIAL_HARD option + PCRE_PARTIAL_HARD option \Qdd set the PCRE_MATCH_LIMIT_RECURSION limit to dd (any number of digits) \R pass the PCRE_DFA_RESTART option to pcre_dfa_exec() \S output details of memory get/free calls during matching + \Y pass the PCRE_NO_START_OPTIMIZE option to pcre_exec() or pcre_dfa_exec() \Z pass the PCRE_NOTEOL option to pcre_exec() or pcre_dfa_exec() \? pass the PCRE_NO_UTF8_CHECK option to pcre_exec() or pcre_dfa_exec() \>dd start the match at offset dd (any number of digits); @@ -540,7 +541,7 @@ (Using the normal matching function on this data finds only "tang".) The longest matching string is always given first (and numbered zero). After a -PCRE_ERROR_PARTIAL return, the output is "Partial match:", followed by the +PCRE_ERROR_PARTIAL return, the output is "Partial match:", followed by the partially matching substring.

@@ -708,7 +709,7 @@


REVISION

-Last updated: 11 September 2009 +Last updated: 26 September 2009
Copyright © 1997-2009 University of Cambridge.