summaryrefslogtreecommitdiff
path: root/pod
diff options
context:
space:
mode:
authorGurusamy Sarathy <gsar@cpan.org>1998-09-23 06:56:40 +0000
committerGurusamy Sarathy <gsar@cpan.org>1998-09-23 06:56:40 +0000
commit8d300b32a709a689cc4faaa10b28cbb610d1e846 (patch)
tree24646bc1c0064c96a81756f964bc76852a21cbdd /pod
parentf8b5b99cdebd8b6c68cad87fddf11ad38bd6bcf9 (diff)
downloadperl-8d300b32a709a689cc4faaa10b28cbb610d1e846.tar.gz
re-introduce change#1703
p4raw-link: @1703 on //depot/maint-5.005/perl: af819cba4f44bf2074ec4808e403dedf8c3ce2b2 p4raw-id: //depot/perl@1825
Diffstat (limited to 'pod')
-rw-r--r--pod/perlre.pod2
1 files changed, 1 insertions, 1 deletions
diff --git a/pod/perlre.pod b/pod/perlre.pod
index 6ecb7ad12a..d3d4500ce4 100644
--- a/pod/perlre.pod
+++ b/pod/perlre.pod
@@ -485,7 +485,7 @@ the time when used on a similar string with 1000000 C<a>s. Be aware,
however, that this pattern currently triggers a warning message under
B<-w> saying it C<"matches the null string many times">):
-On simple groups, such as the pattern C<(?> [^()]+ )>, a comparable
+On simple groups, such as the pattern C<(?E<gt> [^()]+ )>, a comparable
effect may be achieved by negative lookahead, as in C<[^()]+ (?! [^()] )>.
This was only 4 times slower on a string with 1000000 C<a>s.