summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorGurusamy Sarathy <gsar@cpan.org>2000-02-19 17:44:56 +0000
committerGurusamy Sarathy <gsar@cpan.org>2000-02-19 17:44:56 +0000
commite902a9797e486747cb6f7d090925b6ed8d7801d8 (patch)
tree8c0e156a3815405325031f94d5b79d824d4bf40a
parentbed171dfce7f6c0bdb7207be32c058f4d36fc432 (diff)
downloadperl-e902a9797e486747cb6f7d090925b6ed8d7801d8.tar.gz
remove outdated caveat about C<while ($k = each %foo)> (from
Hugo van der Sanden) p4raw-id: //depot/perl@5154
-rw-r--r--pod/perlfunc.pod4
1 files changed, 1 insertions, 3 deletions
diff --git a/pod/perlfunc.pod b/pod/perlfunc.pod
index 578d62efcd..6b47fc7a41 100644
--- a/pod/perlfunc.pod
+++ b/pod/perlfunc.pod
@@ -1168,9 +1168,7 @@ make your program I<appear> to run faster.
When called in list context, returns a 2-element list consisting of the
key and value for the next element of a hash, so that you can iterate over
it. When called in scalar context, returns the key for only the "next"
-element in the hash. (Note: Keys may be C<"0"> or C<"">, which are logically
-false; you may wish to avoid constructs like C<while ($k = each %foo) {}>
-for this reason.)
+element in the hash.
Entries are returned in an apparently random order. The actual random
order is subject to change in future versions of perl, but it is guaranteed