summaryrefslogtreecommitdiff
path: root/lib/Benchmark.pm
diff options
context:
space:
mode:
authorPeter J. Acklam) (via RT <perlbug-followup@perl.org>2011-01-06 23:12:59 -0800
committerAbigail <abigail@abigail.be>2011-01-07 11:40:18 +0100
commit98dc955152ee6f0a1849a6e47a0c2c3b5fae00a6 (patch)
tree4a1a6ed94068d15eaf6c1f2ab7a71c3ecc3767ce /lib/Benchmark.pm
parent1b298e71cb5407f2917b03adc3bddf8526e7043d (diff)
downloadperl-98dc955152ee6f0a1849a6e47a0c2c3b5fae00a6.tar.gz
Fix typos (spelling errors) in lib/*
# New Ticket Created by (Peter J. Acklam) # Please include the string: [perl #81890] # in the subject line of all future correspondence about this issue. # <URL: http://rt.perl.org/rt3/Ticket/Display.html?id=81890 > Signed-off-by: Abigail <abigail@abigail.be>
Diffstat (limited to 'lib/Benchmark.pm')
-rw-r--r--lib/Benchmark.pm6
1 files changed, 3 insertions, 3 deletions
diff --git a/lib/Benchmark.pm b/lib/Benchmark.pm
index 269674cfda..7f0f21c8e2 100644
--- a/lib/Benchmark.pm
+++ b/lib/Benchmark.pm
@@ -245,7 +245,7 @@ B<NOTE>: This result value differs from previous versions, which returned
the C<timethese()> result structure. If you want that, just use the two
statement C<timethese>...C<cmpthese> idiom shown above.
-Incidently, note the variance in the result values between the two examples;
+Incidentally, note the variance in the result values between the two examples;
this is typical of benchmarking. If this were a real benchmark, you would
probably want to run a lot more iterations.
@@ -318,7 +318,7 @@ calls like these:
enablecache();
Caching is off by default, as it can (usually slightly) decrease
-accuracy and does not usually noticably affect runtimes.
+accuracy and does not usually noticeably affect runtimes.
=head1 EXAMPLES
@@ -749,7 +749,7 @@ sub countit {
# The 5% fudge is to keep us from iterating again all
# that often (this speeds overall responsiveness when $tmax is big
# and we guess a little low). This does not noticably affect
- # accuracy since we're not couting these times.
+ # accuracy since we're not counting these times.
$n = int( $tpra * 1.05 * $n / $tc ); # Linear approximation.
my $td = timeit($n, $code);
my $new_tc = $td->[1] + $td->[2];