--- code/trunk/doc/html/pcretest.html 2009/08/31 17:10:26 428 +++ code/trunk/doc/html/pcretest.html 2009/09/01 16:10:16 429 @@ -372,7 +372,8 @@ \M discover the minimum MATCH_LIMIT and MATCH_LIMIT_RECURSION settings \N pass the PCRE_NOTEMPTY option to pcre_exec() or pcre_dfa_exec() \Odd set the size of the output vector passed to pcre_exec() to dd (any number of digits) - \P pass the PCRE_PARTIAL option to pcre_exec() or pcre_dfa_exec() + \P pass the PCRE_PARTIAL_SOFT option to pcre_exec() or pcre_dfa_exec(); if used twice, pass the + 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 @@ -453,10 +454,10 @@

When a match succeeds, pcretest outputs the list of captured substrings that pcre_exec() returns, starting with number 0 for the string that matched -the whole pattern. Otherwise, it outputs "No match" or "Partial match" -when pcre_exec() returns PCRE_ERROR_NOMATCH or PCRE_ERROR_PARTIAL, -respectively, and otherwise the PCRE negative error number. Here is an example -of an interactive pcretest run. +the whole pattern. Otherwise, it outputs "No match" or "Partial match:" +followed by the partially matching substring when pcre_exec() returns +PCRE_ERROR_NOMATCH or PCRE_ERROR_PARTIAL, respectively, and otherwise the PCRE +negative error number. Here is an example of an interactive pcretest run.

   $ pcretest
   PCRE version 7.0 30-Nov-2006
@@ -536,7 +537,9 @@
    2: tan
 
(Using the normal matching function on this data finds only "tang".) The -longest matching string is always given first (and numbered zero). +longest matching string is always given first (and numbered zero). After a +PCRE_ERROR_PARTIAL return, the output is "Partial match:", followed by the +partially matching substring.

If /g is present on the pattern, the search for further matches resumes @@ -703,7 +706,7 @@


REVISION

-Last updated: 10 March 2009 +Last updated: 29 August 2009
Copyright © 1997-2009 University of Cambridge.