summaryrefslogtreecommitdiff
path: root/pod/perlsyn.pod
diff options
context:
space:
mode:
authorEugen Konkov <kes-kes@yandex.ru>2018-08-25 10:52:49 -0600
committerKarl Williamson <khw@cpan.org>2018-08-25 10:55:23 -0600
commit0d86a399adab0c79db284d6af794fbd2d7e25b0c (patch)
tree4fdc52d1e23680856285d1ceb34f9416ad224be5 /pod/perlsyn.pod
parent4b0bd159d16700bb745ba6881a38ebdd78163978 (diff)
downloadperl-0d86a399adab0c79db284d6af794fbd2d7e25b0c.tar.gz
perlsyn: Be more explicit about what is faster
This paragraph can lead to ambiguity because it uses at example `for` keyword but then says: Perl executes a foreach statement more rapidly than it would the equivalent **for** loop.
Diffstat (limited to 'pod/perlsyn.pod')
-rw-r--r--pod/perlsyn.pod2
1 files changed, 1 insertions, 1 deletions
diff --git a/pod/perlsyn.pod b/pod/perlsyn.pod
index d63108f275..b49227a882 100644
--- a/pod/perlsyn.pod
+++ b/pod/perlsyn.pod
@@ -581,7 +581,7 @@ between the inner and outer loops later on, the new code won't be
accidentally executed. The C<next> explicitly iterates the other loop
rather than merely terminating the inner one. And it's faster because
Perl executes a C<foreach> statement more rapidly than it would the
-equivalent C<for> loop.
+equivalent C-style C<for> loop.
Perceptive Perl hackers may have noticed that a C<for> loop has a return
value, and that this value can be captured by wrapping the loop in a C<do>