Beefy Boxes and Bandwidth Generously Provided by pair Networks
Do you know where your variables are?
 
PerlMonks  

Re^2: [RFC] Building Regex Alternations Dynamically

by haukex (Canon)
on Jan 21, 2017 at 17:09 UTC ( #1180085=note: print w/replies, xml ) Need Help??


in reply to Re: [RFC] Building Regex Alternations Dynamically
in thread Building Regex Alternations Dynamically

Hi Rolf,

IIRC there is a hard limit for the length of a regex-string

Other than RAM, I haven't found one yet, I just built a qr// regex from a 1GB text file without alternations and a second from 40MB of text with over 10M alternations.

As you may have seen I added a TL;DR, thanks for the idea!

Regards,
-- Hauke D

Replies are listed 'Best First'.
Re^3: [RFC] Building Regex Alternations Dynamically
by LanX (Archbishop) on Jan 21, 2017 at 18:31 UTC
    Yeah sorry I had

    > > (or was it only the repetition counter .{x} limited to x aprox 32000 ?)

    in mind. Since regexes are compiled to op codes hard limits are unlikely.

    > As you may have seen I added a TL;DR, thanks for the idea!

    Hmm probably it's time to include support for TOC = table of content in my wiki add on :)

    Cheers Rolf
    (addicted to the Perl Programming Language and ☆☆☆☆ :)
    Je suis Charlie!

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1180085]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (3)
As of 2019-02-16 10:22 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I use postfix dereferencing ...









    Results (95 votes). Check out past polls.

    Notices?