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

Re: Is there a way to allow consecutive zero-length matches without using pos()?

by Anonymous Monk
on Nov 03, 2017 at 13:23 UTC ( #1202686=note: print w/replies, xml ) Need Help??


in reply to Is there a way to allow consecutive zero-length matches without using pos()?

It would help tremendously if you could concoct a little example program which creates the strings that you speak of, then illustrates the particular approach(es) that you have taken and/or that you are now considering. Especially if the scripts are such that we can, also, profile it on our own machines.
  • Comment on Re: Is there a way to allow consecutive zero-length matches without using pos()?

Replies are listed 'Best First'.
Re^2: Is there a way to allow consecutive zero-length matches without using pos()?
by jsm (Novice) on Nov 06, 2017 at 22:47 UTC

    OK, I'm putting together a test case now. It's turning out more complicated than I thought, but I'll post it here when I get it working.

    I profiled this with NYTProf and it is indeed the pos()= pos() statement that is taking all the extra time. However, the exact conditions that trigger it are currently eluding me; I'll continue to isolate it.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1202686]
help
Chatterbox?
and the daffodils sway...

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (1)
As of 2018-07-22 16:30 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    It has been suggested to rename Perl 6 in order to boost its marketing potential. Which name would you prefer?















    Results (454 votes). Check out past polls.

    Notices?