--- embedaddon/pcre/doc/html/pcrelimits.html	2012/02/21 23:50:25	1.1.1.2
+++ embedaddon/pcre/doc/html/pcrelimits.html	2013/07/22 08:25:57	1.1.1.4
@@ -21,11 +21,12 @@ practice be relevant.
 </P>
 <P>
 The maximum length of a compiled pattern is approximately 64K data units (bytes
-for the 8-bit library, 16-bit units for the 16-bit library) if PCRE is compiled
-with the default internal linkage size of 2 bytes. If you want to process
-regular expressions that are truly enormous, you can compile PCRE with an
-internal linkage size of 3 or 4 (when building the 16-bit library, 3 is rounded
-up to 4). See the <b>README</b> file in the source distribution and the
+for the 8-bit library, 32-bit units for the 32-bit library, and 32-bit units for
+the 32-bit library) if PCRE is compiled with the default internal linkage size
+of 2 bytes. If you want to process regular expressions that are truly enormous,
+you can compile PCRE with an internal linkage size of 3 or 4 (when building the
+16-bit or 32-bit library, 3 is rounded up to 4). See the <b>README</b> file in
+the source distribution and the
 <a href="pcrebuild.html"><b>pcrebuild</b></a>
 documentation for details. In these cases the limit is substantially larger.
 However, the speed of execution is slower.
@@ -48,6 +49,10 @@ The maximum length of name for a named subpattern is 3
 maximum number of named subpatterns is 10000.
 </P>
 <P>
+The maximum length of a name in a (*MARK), (*PRUNE), (*SKIP), or (*THEN) verb
+is 255 for the 8-bit library and 65535 for the 16-bit and 32-bit library.
+</P>
+<P>
 The maximum length of a subject string is the largest positive number that an
 integer variable can hold. However, when using the traditional matching
 function, PCRE uses recursion to handle subpatterns and indefinite repetition.
@@ -72,7 +77,7 @@ Cambridge CB2 3QH, England.
 REVISION
 </b><br>
 <P>
-Last updated: 08 January 2012
+Last updated: 04 May 2012
 <br>
 Copyright &copy; 1997-2012 University of Cambridge.
 <br>