From: "John W. Krahn" <[EMAIL PROTECTED]>
> Pavle Lukic wrote:
> > Problem
> > Given a string and a pattern, construct new string
> > by removing part of the string equal to pattern.
> > Remove only first occurrence of the pattern.
> >
> > Problem solutions
> >
> > Solution #1 ($x = $a) =~ s/\Q$b
nd perhaps
why the second takes appx half the time to do?
I'd love to understand this better.
Thanks
Dan
-Original Message-
From: John W. Krahn [mailto:[EMAIL PROTECTED]]
Sent: Wednesday, January 08, 2003 9:37 AM
To: [EMAIL PROTECTED]
Subject: Re: String manipulation benchmark
Pavle Lukic wrote:
>
> Hi
Hello,
> I did a little benchmarking in regard to the
> string manipulation issue raised on this forum.
>
> Here are relevant parameters and benchmark results.
>
> Problem
> Given a string and a pattern, construct new string
> by removing part of the string equal to p
