From: | Jasen Betts <jasen(at)xnet(dot)co(dot)nz> |
---|---|
To: | pgsql-sql(at)postgresql(dot)org |
Subject: | Re: Extending Regular Expression bounds limit of 255. |
Date: | 2010-05-30 10:37:59 |
Message-ID: | httf67$5rf$1@reversiblemaps.ath.cx |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-sql |
On 2010-05-29, Tim Landscheidt <tim(at)tim-landscheidt(dot)de> wrote:
> Jasen Betts <jasen(at)xnet(dot)co(dot)nz> wrote:
>
>>> It looks like most of our tools are using the Perl version of regular
>>> expressions with an upper limit of a bound being 32766. Is there any way to
>>> change this in PG? Or can I change from POSIX to Perl?
>
>> perhaps you can do something in pl-perl?
>
>> posix regular expressions are different to perl regular expressions in
>> several ways.
>
> Another last resort possibility would of course be to "pre-
> compile" the regular expressions from "A{2000}" to
> "A{255}A{255}A{255}A{255}A{255}A{255}A{255}A{215}"
(A{200}){10}
might work better.
> (with the headaches of "A{1000,2000}" left as an exercise to the read-
> er :-)).
easy enoungh to write, but probably easy to write an expression with
factorial complexity too, but this one should work, having at worst
two ways of matching any string.
(A{200}){5,9}A{0,200}
but
(A{5,10}){200}
is asking for trouble.
From | Date | Subject | |
---|---|---|---|
Next Message | Daniel Migowski | 2010-06-01 11:05:36 | Re: sorry, now with subject... trigger & nextval(seq) |
Previous Message | Tim Landscheidt | 2010-05-29 18:56:49 | Re: Extending Regular Expression bounds limit of 255. |