embedaddon/pcre/doc/html/pcrelimits.html - diff

Return to pcrelimits.html CVS log

Up to [ELWIX - Embedded LightWeight unIX -] / embedaddon / pcre / doc / html

Diff for /embedaddon/pcre/doc/html/pcrelimits.html between versions 1.1.1.2 and 1.1.1.5

version 1.1.1.2, 2012/02/21 23:50:25	version 1.1.1.5, 2014/06/15 19:46:05
Line 21 practice be relevant.	Line 21 practice be relevant.
</P>	</P>
<P>	<P>
The maximum length of a compiled pattern is approximately 64K data units (bytes	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	for the 8-bit library, 16-bit units for the 16-bit library, and 32-bit units for
with the default internal linkage size of 2 bytes. If you want to process	the 32-bit library) if PCRE is compiled with the default internal linkage size,
regular expressions that are truly enormous, you can compile PCRE with an	which is 2 bytes for the 8-bit and 16-bit libraries, and 4 bytes for the 32-bit
internal linkage size of 3 or 4 (when building the 16-bit library, 3 is rounded	library. If you want to process regular expressions that are truly enormous,
up to 4). See the <b>README</b> file in the source distribution and the	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>	<a href="pcrebuild.html"><b>pcrebuild</b></a>
documentation for details. In these cases the limit is substantially larger.	documentation for details. In these cases the limit is substantially larger.
However, the speed of execution is slower.	However, the speed of execution is slower.
Line 35 All values in repeating quantifiers must be less than	Line 37 All values in repeating quantifiers must be less than
</P>	</P>
<P>	<P>
There is no limit to the number of parenthesized subpatterns, but there can be	There is no limit to the number of parenthesized subpatterns, but there can be
no more than 65535 capturing subpatterns.	no more than 65535 capturing subpatterns. There is, however, a limit to the
	depth of nesting of parenthesized subpatterns of all kinds. This is imposed in
	order to limit the amount of system stack used at compile time. The limit can
	be specified when PCRE is built; the default is 250.
</P>	</P>
<P>	<P>
There is a limit to the number of forward references to subsequent subpatterns	There is a limit to the number of forward references to subsequent subpatterns
Line 48 The maximum length of name for a named subpattern is 3	Line 53 The maximum length of name for a named subpattern is 3
maximum number of named subpatterns is 10000.	maximum number of named subpatterns is 10000.
</P>	</P>
<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 libraries.
	</P>
	<P>
The maximum length of a subject string is the largest positive number that an	The maximum length of a subject string is the largest positive number that an
integer variable can hold. However, when using the traditional matching	integer variable can hold. However, when using the traditional matching
function, PCRE uses recursion to handle subpatterns and indefinite repetition.	function, PCRE uses recursion to handle subpatterns and indefinite repetition.
Line 72 Cambridge CB2 3QH, England.	Line 81 Cambridge CB2 3QH, England.
REVISION	REVISION
</b><br>	</b><br>
<P>	<P>
Last updated: 08 January 2012	Last updated: 05 November 2013
<br>	<br>
Copyright © 1997-2012 University of Cambridge.	Copyright © 1997-2013 University of Cambridge.
<br>	<br>
<p>	<p>
Return to the <a href="index.html">PCRE index page</a>.	Return to the <a href="index.html">PCRE index page</a>.

FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>

Removed from v.1.1.1.2
changed lines
	Added in v.1.1.1.5