embedaddon/pcre/doc/pcrelimits.3 - diff

Return to pcrelimits.3 CVS log

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

Diff for /embedaddon/pcre/doc/pcrelimits.3 between versions 1.1 and 1.1.1.3

version 1.1, 2012/02/21 23:05:52	version 1.1.1.3, 2012/10/09 09:19:17
Line 1	Line 1
.TH PCRELIMITS 3	.TH PCRELIMITS 3 "04 May 2012" "PCRE 8.30"
.SH NAME	.SH NAME
PCRE - Perl-compatible regular expressions	PCRE - Perl-compatible regular expressions
.SH "SIZE AND OTHER LIMITATIONS"	.SH "SIZE AND OTHER LIMITATIONS"
Line 7 PCRE - Perl-compatible regular expressions	Line 7 PCRE - Perl-compatible regular expressions
There are some size limitations in PCRE but it is hoped that they will never in	There are some size limitations in PCRE but it is hoped that they will never in
practice be relevant.	practice be relevant.
.P	.P
The maximum length of a compiled pattern is 65539 (sic) bytes if PCRE is	The maximum length of a compiled pattern is approximately 64K data units (bytes
compiled with the default internal linkage size of 2. If you want to process	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	regular expressions that are truly enormous, you can compile PCRE with an
internal linkage size of 3 or 4 (see the \fBREADME\fP file in the source	internal linkage size of 3 or 4 (when building the 16-bit library, 3 is rounded
distribution and the	up to 4). See the \fBREADME\fP file in the source distribution and the
.\" HREF	.\" HREF
\fBpcrebuild\fP	\fBpcrebuild\fP
.\"	.\"
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.
.P	.P
All values in repeating quantifiers must be less than 65536.	All values in repeating quantifiers must be less than 65536.
Line 31 the count. There is no limit to the number of backward	Line 32 the count. There is no limit to the number of backward
The maximum length of name for a named subpattern is 32 characters, and the	The maximum length of name for a named subpattern is 32 characters, and the
maximum number of named subpatterns is 10000.	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 library.
	.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 57 Cambridge CB2 3QH, England.	Line 61 Cambridge CB2 3QH, England.
.rs	.rs
.sp	.sp
.nf	.nf
Last updated: 30 November 2011	Last updated: 04 May 2012
Copyright (c) 1997-2011 University of Cambridge.	Copyright (c) 1997-2012 University of Cambridge.
.fi	.fi

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

Removed from v.1.1
changed lines
	Added in v.1.1.1.3