RexCompile Buffer Length Exceeds

Hi Henry,

I don't think so - 512 characters is as far as I know the limit. Just out of curiosity - what pattern is it that exceeds 512 characters?
You might also try the pcre version of rexCompile - pcreCompile(). Maybe it doesn't have that limitation.

Max

I just did some experiments and pcreCompile allows a pattern which is a maximum of 32764 (slightly less than 2^31) characters long. rexCompile is ancient and very limited, so I'd encourage you to use the pcre functions as Max suggested.

Andrew

This is the pattern
i l'll try using it through pcrecompile()
Thanks

Thanks Andrew

Hi Henry,

That doesn't look like a regular expression pattern... (at least not in most common formats, like PCRE)

If you want to match something that matches all the values between '/' there might be a smarter way to write it

Cheers

Aurélien

If you want to match all the values between '/', a much compact approach, would be to use the following pattern : 

"(225|425|229|429|303)-P([1-9]|1[0-6])"

If you want to match the whole string, this is not a regular expression, but a simple search for a string in another one

_

Also it seems you are tackling your problem the wrong way

I don't know exactly what you are trying to achieve but you might want to use regular expressions to extract <num1>-P<num2> from whatever input string

And then check if num1 belongs to '(225 425 229 429 303) and num2 is between 1 and 16

Here's an example to do that (assuming the string is stored in the variable 'str') :

(when (pcreMatchp "([0-9]+)-P([0-9]+)" str)
  (let ((num0 (atoi (pcreSubstitute "\\1")))
        (num1 (atoi (pcreSubstitute "\\2")))
        )
    (and (member num0 '(225 425 229 429 303))
         1 <= num1
         num1 <= 16
         )))

this is a regular expression of literal characters only - no quantifiers or character classes or anchors or anything that would require a regex engine. If you intend to compare this against whatever else you might as well make it a normal string and the use the equal() function.

Also, if it's a sub-string of the full string you're looking for (and not a regular expression as Max said), you could use nindex() to see whether it is contained within the candidate string..

Andrew