Lines Matching refs:K
967 Including Unicode property support adds around 30K of tables to the
1057 for a compiled pattern of around 64K. This is sufficient to handle all
1198 whose default value is 20K. The buffer itself is three times this size,
1203 --with-pcregrep-bufsize=50K
1469 5. Because many paths through the tree may be active, the \K escape
1929 since it allows the compiled pattern to be up to 64K in size. Larger
3178 anchored, such a match can occur only if the pattern contains \K.
4239 sequence \K has been encountered, this value is changed to reflect the
5212 The escape sequence \K causes any previously matched characters not to
5220 to be of fixed length, as lookbehind assertions do. The use of \K does
5228 Perl documents that the use of \K within assertions is "not well
5229 defined". In PCRE, \K is acted upon when it occurs inside positive
6310 In some cases, the escape sequence \K (see above) can be used instead
6969 Here is an example of pcretest output, where the /K modifier requests
6972 re> /X(*MARK:A)Y|X(*MARK:B)Z/K
6992 re> /X(*MARK:A)Y|X(*MARK:B)Z/K
7388 \K reset start of match
7990 stack. By default, it uses 32K on the machine stack. However, some
8005 a maximum stack size of 512K to 1M should be more than enough for any
8019 (1) If callback is NULL and data is NULL, an internal 32K block
8028 function is NULL, the internal 32K stack is used; otherwise the
8090 4K) if that is enough. However, we can still grow up to 1M anytime if
8278 string; lookbehind assertions and the \K escape sequence provide ways
8292 behind assertions, or \K, or begin with \b or \B, earlier characters
8524 Note: If the pattern contains lookbehind assertions, or \K, or starts
8836 uses 51K bytes when compiled using the 8-bit library. When PCRE is com-
8838 limit on a compiled pattern is 64K data units, and this is reached with
8849 reduces the memory requirements to 18K, and indeed it remains under 20K
9673 The maximum length of a compiled pattern is approximately 64K data
