> >Please correct me if I'm mistaken, but I believe that that's the way
> >they are implemented now.  A regex match populates the ->startp and
> >->endp parts of the regex structure, and the elements of these items
> >are byte offsets into the original string.  
> 
> I haven't looked at it at all, and perhaps that 's sometihng Ilya
> did when creating @+ etc.  So you might be right.  

As far as I know it's the same in 5.000.

I thought the problem with $& was that the regex engine has to adjust
the offsets in the startp/endp arrays every time it scans forward a
character or backtracks a character.  

But maybe the effect of $& is greatly exaggerated or is a relic from
perl4?  Has anyone actually benchmarked this recently?

Reply via email to