Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re: How to match more than 32766 times in regex?

by rsFalse (Chaplain)
on Nov 01, 2018 at 11:32 UTC ( [id://1225048]=note: print w/replies, xml ) Need Help??


in reply to How to match more than 32766 times in regex?

perlre: "This is usually 32766 on the most common platforms"

What do you think about the need to expand the perlre section about quantifiers with the suggestion how to handy overcome '+' and '*' limitation and make the equivalent regex which matches {0,infty}? The regex should be readable and not slow in performance.
  • Comment on Re: How to match more than 32766 times in regex?

Replies are listed 'Best First'.
Re^2: How to match more than 32766 times in regex?
by choroba (Cardinal) on Nov 06, 2018 at 16:13 UTC
    Feel free to send a perlbug with the patch to the documentation.

    ($q=q:Sq=~/;[c](.)(.)/;chr(-||-|5+lengthSq)`"S|oS2"`map{chr |+ord
}map{substrSq`S_+|`|}3E|-|`7**2-3:)=~y+S|`+$1,++print+eval$q,q,a,

    [download]
[reply]
[d/l]

In Section Seekers of Perl Wisdom

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://1225048]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? • Last hour • Other CB clients
Other Users?
Others chanting in the Monastery: (7)
As of 2024-04-19 10:21 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found