summaryrefslogtreecommitdiff
path: root/dump.c
diff options
context:
space:
mode:
authorAbhijit Menon-Sen <ams@wiw.org>2001-09-22 12:04:28 +0000
committerAbhijit Menon-Sen <ams@wiw.org>2001-09-22 12:04:28 +0000
commite76cd0fa90cfef515d9c98e6ea89eed39812246c (patch)
tree42d56ed372ec67bae2813d0c80c52618f75268b6 /dump.c
parent83240b2c29db6229dacef05064a026a4843b3e11 (diff)
downloadperl-e76cd0fa90cfef515d9c98e6ea89eed39812246c.tar.gz
What's a backet?
p4raw-id: //depot/perl@12127
Diffstat (limited to 'dump.c')
-rw-r--r--dump.c4
1 files changed, 2 insertions, 2 deletions
diff --git a/dump.c b/dump.c
index 8bde2f5fe3..509df7916e 100644
--- a/dump.c
+++ b/dump.c
@@ -1191,8 +1191,8 @@ Perl_do_sv_dump(pTHX_ I32 level, PerlIO *file, SV *sv, I32 nest, I32 maxnest, bo
to the expected number needed for a random hash.
The total number of comparisons is equal to the sum of
- the squares of the number of entries in each backet.
- For a random hash of n keys into k backets, the expected
+ the squares of the number of entries in each bucket.
+ For a random hash of n keys into k buckets, the expected
value is
n + n(n-1)/2k
*/