summaryrefslogtreecommitdiff
path: root/pod/perldebug.pod
diff options
context:
space:
mode:
authorGurusamy Sarathy <gsar@cpan.org>1999-02-15 04:06:50 +0000
committerGurusamy Sarathy <gsar@cpan.org>1999-02-15 04:06:50 +0000
commitc2611fb358d57faaf2390cf4e8c5224abf2c4cc4 (patch)
treed0f9e8756b998ca1e637336596f3639eb40a3720 /pod/perldebug.pod
parentd2fe67bec76f22b4a4066b48714199469a8288c2 (diff)
downloadperl-c2611fb358d57faaf2390cf4e8c5224abf2c4cc4.tar.gz
patches suggested by John Bley <jbb6@acpub.duke.edu> (with minor edits)
Date: Wed, 3 Feb 1999 05:24:55 -0500 (EST) Message-ID: <Pine.SOL.3.91.990203051924.302A-100000@soc11.acpub.duke.edu> Subject: [PATCH]5.005_54 (DOC) fix many typos -- Date: Wed, 3 Feb 1999 08:53:53 -0500 (EST) Message-ID: <Pine.SOL.3.91.990203085157.895A-100000@soc11.acpub.duke.edu> Subject: [PATCH]5.005_54 (DOC) typos p4raw-id: //depot/perl@2929
Diffstat (limited to 'pod/perldebug.pod')
-rw-r--r--pod/perldebug.pod8
1 files changed, 4 insertions, 4 deletions
diff --git a/pod/perldebug.pod b/pod/perldebug.pod
index 7a6e814fb1..760d517f97 100644
--- a/pod/perldebug.pod
+++ b/pod/perldebug.pod
@@ -1109,7 +1109,7 @@ or B<pop>, the stack backtrace will not show the original values.
Perl is I<very> frivolous with memory. There is a saying that to
estimate memory usage of Perl, assume a reasonable algorithm of
-allocation, and multiply your estimages by 10. This is not absolutely
+allocation, and multiply your estimates by 10. This is not absolutely
true, but may give you a good grasp of what happens.
Say, an integer cannot take less than 20 bytes of memory, a float
@@ -1161,7 +1161,7 @@ in the following example:
Total sbrk(): 215040/47:145. Odd ends: pad+heads+chain+tail: 0+2192+0+6144.
It is possible to ask for such a statistic at arbitrary moment by
-usind Devel::Peek::mstats() (module Devel::Peek is available on CPAN).
+using Devel::Peek::mstats() (module Devel::Peek is available on CPAN).
Here is the explanation of different parts of the format:
@@ -1195,7 +1195,7 @@ memory footprints of the buckets are between memory footprints of two
buckets "above".
Say, with the above example the memory footprints are (with current
-algorith)
+algorithm)
free: 8 16 32 64 128 256 512 1024 2048 4096 8192
4 12 24 48 80
@@ -1328,7 +1328,7 @@ though the subroutine itself is not defined yet).
It also creates C arrays to keep data for the stash (this is one HV,
but it grows, thus there are 4 big allocations: the big chunks are not
-freeed, but are kept as additional arenas for C<SV> allocations).
+freed, but are kept as additional arenas for C<SV> allocations).
=item C<054>