Skip to content

Commit

Permalink
Fix typos (spelling errors) in lib/*
Browse files Browse the repository at this point in the history
# 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>
  • Loading branch information
Peter J. Acklam) (via RT authored and Abigail committed Jan 7, 2011
1 parent 1b298e7 commit 98dc955
Show file tree
Hide file tree
Showing 26 changed files with 63 additions and 63 deletions.
6 changes: 3 additions & 3 deletions lib/Benchmark.pm
Expand Up @@ -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.
Expand Down Expand Up @@ -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
Expand Down Expand Up @@ -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];
Expand Down
6 changes: 3 additions & 3 deletions lib/Benchmark.t
Expand Up @@ -28,7 +28,7 @@ my $Noc_Pattern =
qr/(\d+) +wallclock secs? +\( *(-?\d+\.\d\d) +usr +\+ +(-?\d+\.\d\d) +sys += +(-?\d+\.\d\d) +CPU\)/;
my $Nop_Pattern =
qr/(\d+) +wallclock secs? +\( *(-?\d+\.\d\d) +cusr +\+ +(-?\d+\.\d\d) +csys += +\d+\.\d\d +CPU\)/;
# Please don't trust the matching parenthises to be useful in this :-)
# Please don't trust the matching parentheses to be useful in this :-)
my $Default_Pattern = qr/$All_Pattern|$Noc_Pattern/;

my $t0 = new Benchmark;
Expand Down Expand Up @@ -111,7 +111,7 @@ is ($auto, $default, 'timestr ($diff, "auto") matches timestr ($diff)');

my ($wallclock, $usr, $sys, $cusr, $csys, $cpu) = $all =~ $All_Pattern;

is (timestr ($diff, 'none'), '', "none supresses output");
is (timestr ($diff, 'none'), '', "none suppresses output");

my $noc = timestr ($diff, 'noc');
like ($noc, qr/$wallclock +wallclock secs? +\( *$usr +usr +\+ +$sys +sys += +$cpu +CPU\)/, 'timestr ($diff, "noc")');
Expand Down Expand Up @@ -529,7 +529,7 @@ undef $debug;
untie *STDERR;

# To check the cache we are poking where we don't belong, inside the namespace.
# The way benchmark is written We can't actually check whehter the cache is
# The way benchmark is written we can't actually check whether the cache is
# being used, merely what's become cached.

clearallcache();
Expand Down
2 changes: 1 addition & 1 deletion lib/File/Basename.pm
Expand Up @@ -166,7 +166,7 @@ sub fileparse {
}
}

# Ensure taint is propgated from the path to its pieces.
# Ensure taint is propagated from the path to its pieces.
$tail .= $taint;
wantarray ? ($basename .= $taint, $dirpath .= $taint, $tail)
: ($basename .= $taint);
Expand Down
2 changes: 1 addition & 1 deletion lib/File/DosGlob.pm
Expand Up @@ -306,7 +306,7 @@ sub glob {
my $tmp = "$start$match$end";
while ( $tmp =~ s/^(.*?)(?<!\\)\{(?:.*(?<!\\)\,)?(.*\Q$match\E.*?)(?:(?<!\\)\,.*)?(?<!\\)\}(.*)$/$1$2$3/ ) {
#print "Striped: $tmp\n";
# these expanshions will be preformed by the original,
# these expansions will be preformed by the original,
# when we call REHASH.
}
push @appendpat, ("$tmp");
Expand Down
4 changes: 2 additions & 2 deletions lib/File/Find.pm
Expand Up @@ -8,7 +8,7 @@ require Exporter;
require Cwd;

#
# Modified to ensure sub-directory traversal order is not inverded by stack
# Modified to ensure sub-directory traversal order is not inverted by stack
# push and pops. That is remains in the same order as in the directory file,
# or user pre-processing (EG:sorted).
#
Expand Down Expand Up @@ -847,7 +847,7 @@ sub _find_dir($$$) {
@filenames = $pre_process->(@filenames) if $pre_process;
push @Stack,[$CdLvl,$dir_name,"",-2] if $post_process;

# default: use whatever was specifid
# default: use whatever was specified
# (if $nlink >= 2, and $avoid_nlink == 0, this will switch back)
$no_nlink = $avoid_nlink;
# if dir has wrong nlink count, force switch to slower stat method
Expand Down
2 changes: 1 addition & 1 deletion lib/File/stat.pm
Expand Up @@ -84,7 +84,7 @@ else {
my ($s, $mode, $eff) = @_;
my $uid = $eff ? $> : $<;

# If we're root on unix and we are not testing for exectable
# If we're root on unix and we are not testing for executable
# status, then all file tests are true.
$^O ne "VMS" and $uid == 0 and !($mode & 0111) and return 1;

Expand Down
2 changes: 1 addition & 1 deletion lib/File/stat.t
Expand Up @@ -93,7 +93,7 @@ for (split //, "rwxoRWXOezsfdlpSbcugkMCA") {

SKIP: {
my $file = '../perl';
-e $file && -x $file or skip "$file is not present and exectable", 4;
-e $file && -x $file or skip "$file is not present and executable", 4;
$^O eq "VMS" and skip "File::stat ignores VMS ACLs", 4;

my $stat = File::stat::stat( $file ); # This is the OO stat.
Expand Down
2 changes: 1 addition & 1 deletion lib/Pod/t/InputObjects.t
Expand Up @@ -31,7 +31,7 @@ use_ok( 'Pod::InputObjects' );
{ # test package Pod::Paragraph
my $p_p1 = Pod::Paragraph->new( -text => 'NAME', -name => 'head2' );
my $p_p2 = Pod::Paragraph->new( 'test - This is the test suite' );
isa_ok( $p_p1, 'Pod::Paragraph', 'Pod::Paragraph constuctor' );
isa_ok( $p_p1, 'Pod::Paragraph', 'Pod::Paragraph constructor' );
isa_ok( $p_p2, 'Pod::Paragraph', 'Pod::Paragraph constructor revisited' );

is( $p_p1->cmd_name(), 'head2', 'Pod::Paragraph->cmd_name()' );
Expand Down
2 changes: 1 addition & 1 deletion lib/Tie/Handle/stdhandle_from_handle.t
Expand Up @@ -14,5 +14,5 @@ use Tie::Handle;
@ISA = qw(Tie::StdHandle);
}

# For backwards compatabilty with 5.8.x
# For backwards compatibility with 5.8.x
ok( Foo->can("TIEHANDLE"), "loading Tie::Handle loads TieStdHandle" );
6 changes: 3 additions & 3 deletions lib/UNIVERSAL.pm
Expand Up @@ -99,7 +99,7 @@ If you're not sure what you have (the C<VAL> case), wrap the method call in an
C<eval> block to catch the exception if C<VAL> is undefined.
If you want to be sure that you're calling C<isa> as a method, not a class,
check the invocant with C<blessed> from L<Scalar::Util> first:
check the invocand with C<blessed> from L<Scalar::Util> first:
use Scalar::Util 'blessed';
Expand All @@ -119,7 +119,7 @@ itself. For example, logging or serialization may be roles.
C<DOES> and C<isa> are similar, in that if either is true, you know that the
object or class on which you call the method can perform specific behavior.
However, C<DOES> is different from C<isa> in that it does not care I<how> the
invocant performs the operations, merely that it does. (C<isa> of course
invocand performs the operations, merely that it does. (C<isa> of course
mandates an inheritance relationship. Other relationships include aggregation,
delegation, and mocking.)
Expand Down Expand Up @@ -157,7 +157,7 @@ calling the coderef will cause an error.
You may call C<can> as a class (static) method or an object method.
Again, the same rule about having a valid invocant applies -- use an C<eval>
Again, the same rule about having a valid invocand applies -- use an C<eval>
block or C<blessed> if you need to be extra paranoid.
=item C<VERSION ( [ REQUIRE ] )>
Expand Down
2 changes: 1 addition & 1 deletion lib/bigint.pl
Expand Up @@ -167,7 +167,7 @@ sub main'bsub { #(num_str, num_str) return num_str
&'badd($_[0],&'bneg($_[1]));
}

# GCD -- Euclids algorithm Knuth Vol 2 pg 296
# GCD -- Euclid's algorithm Knuth Vol 2 pg 296
sub main'bgcd { #(num_str, num_str) return num_str
local($x,$y) = (&'bnorm($_[0]),&'bnorm($_[1]));
if ($x eq 'NaN' || $y eq 'NaN') {
Expand Down
2 changes: 1 addition & 1 deletion lib/bigrat.pl
Expand Up @@ -28,7 +28,7 @@ package bigrat;
# The string 'NaN' is used to represent the result when input arguments
# that are not numbers, as well as the result of dividing by zero and
# the sqrt of a negative number.
# Extreamly naive algorthims are used.
# Extremely naive algorithms are used.
#
# Routines provided are:
#
Expand Down
6 changes: 3 additions & 3 deletions lib/charnames.pm
Expand Up @@ -626,7 +626,7 @@ sub lookup_name ($$$) {
}
else {

# Not algorthmically determinable; look up in the table.
# Not algorithmically determinable; look up in the table.
if ($txt =~ /\t\Q$name\E$/m) {
@off = ($-[0] + 1, $+[0]); # The 1 is for the tab
$found_full_in_table = 1;
Expand Down Expand Up @@ -669,9 +669,9 @@ sub lookup_name ($$$) {

# Here, we haven't set up the output, but we know where in the string
# the name starts. The string is set up so that for single characters
# (and not named sequences), the name is preceeded immediately by a
# (and not named sequences), the name is preceded immediately by a
# tab and 5 hex digits for its code, with a \n before those. Named
# sequences won't have the 7th preceeding character be a \n.
# sequences won't have the 7th preceding character be a \n.
# (Actually, for the very first entry in the table this isn't strictly
# true: subtracting 7 will yield -1, and the substr below will
# therefore yield the very last character in the table, which should
Expand Down
2 changes: 1 addition & 1 deletion lib/charnames.t
Expand Up @@ -661,7 +661,7 @@ is($_, 'foobar');

# Unicode slowdown noted by Phil Pennock, traced to a bug fix in index
# SADAHIRO Tomoyuki's suggestion is to ensure that the UTF-8ness of both
# arguments are indentical before calling index.
# arguments are identical before calling index.
# To do this can take advantage of the fact that unicore/Name.pl is 7 bit
# (or at least should be). So assert that that it's true here. EBCDIC
# may be a problem (khw).
Expand Down
2 changes: 1 addition & 1 deletion lib/diagnostics.pm
Expand Up @@ -554,7 +554,7 @@ sub splainthis {
s/, <.*?> (?:line|chunk).*$//;

# Discard 1st " at <file> line <no>" and all text beyond
# but be aware of messsages containing " at this-or-that"
# but be aware of messages containing " at this-or-that"
my $real = 0;
my @secs = split( / at / );
return unless @secs;
Expand Down
2 changes: 1 addition & 1 deletion lib/exceptions.pl
Expand Up @@ -12,7 +12,7 @@
# programming techniques.

# Here's a little code I use for exception handling. It's really just
# glorfied eval/die. The way to use use it is when you might otherwise
# glorified eval/die. The way to use use it is when you might otherwise
# exit, use &throw to raise an exception. The first enclosing &catch
# handler looks at the exception and decides whether it can catch this kind
# (catch takes a list of regexps to catch), and if so, it returns the one it
Expand Down
2 changes: 1 addition & 1 deletion lib/locale.t
Expand Up @@ -258,7 +258,7 @@ debug "# Scanning for locales...\n";
# Note that it's okay that some languages have their native names
# capitalized here even though that's not "right". They are lowercased
# anyway later during the scanning process (and besides, some clueless
# vendor might have them capitalized errorneously anyway).
# vendor might have them capitalized erroneously anyway).

my $locales = <<EOF;
Afrikaans:af:za:1 15
Expand Down
2 changes: 1 addition & 1 deletion lib/newgetopt.pl
Expand Up @@ -18,7 +18,7 @@
$PERMUTE = 1;
$RETURN_IN_ORDER = 2;

# Handle POSIX compliancy.
# Handle POSIX compliance.
if ( defined $ENV{"POSIXLY_CORRECT"} ) {
$autoabbrev = 0; # no automatic abbrev of options (???)
$getopt_compat = 0; # disallow '+' to start options
Expand Down
24 changes: 12 additions & 12 deletions lib/perl5db.pl
Expand Up @@ -890,7 +890,7 @@ sub eval {
# + Forgot a my() declaration (Ilya Zakharevich in 11085)
# Changes: 1.15: Nov 6, 2001 Michael G Schwern <schwern@pobox.com>
# + Updated 1.14 change log
# + Added *dbline explainatory comments
# + Added *dbline explanatory comments
# + Mentioning perldebguts man page
# Changes: 1.16: Feb 15, 2002 Mark-Jason Dominus <mjd@plover.com>
# + $onetimeDump improvements
Expand Down Expand Up @@ -984,7 +984,7 @@ =head2 BASIC SETUP
# Needed for the statement after exec():
#
# This BEGIN block is simply used to switch off warnings during debugger
# compiliation. Probably it would be better practice to fix the warnings,
# compilation. Probably it would be better practice to fix the warnings,
# but this is how it's done at the moment.

BEGIN {
Expand Down Expand Up @@ -2809,7 +2809,7 @@ =head4 C<r> - return from a subroutine
# r - return from the current subroutine.
$cmd =~ /^r$/ && do {

# Can't do anythign if the program's over.
# Can't do anything if the program's over.
end_report(), next CMD if $finished and $level <= 1;

# Turn on stack trace.
Expand Down Expand Up @@ -3225,7 +3225,7 @@ =head4 C<=> - define command alias
# List aliases.
for my $k (@keys) {

# Messy metaquoting: Trim the substiution code off.
# Messy metaquoting: Trim the substitution code off.
# We use control-G as the delimiter because it's not
# likely to appear in the alias.
if ( ( my $v = $alias{$k} ) =~ ss\a$k\a(.*)\a$1 ) {
Expand Down Expand Up @@ -3684,7 +3684,7 @@ sub sub {
)
if $frame;

# Determine the sub's return type,and capture approppriately.
# Determine the sub's return type, and capture appropriately.
if (wantarray) {

# Called in array context. call sub and capture output.
Expand Down Expand Up @@ -3748,7 +3748,7 @@ sub sub {

# If we're doing exit messages...
(
$frame & 4 # Extended messsages
$frame & 4 # Extended messages
? (
print_lineinfo( ' ' x $stack_depth, "out " ),
print_trace( $LINEINFO, -1, 1, 1, "$sub$al" )
Expand Down Expand Up @@ -5512,7 +5512,7 @@ sub postponed {
# Yes. Mark this file as having breakpoints.
$had_breakpoints{$filename} |= 1;

# "Cannot be done: unsufficient magic" - we can't just put the
# "Cannot be done: insufficient magic" - we can't just put the
# breakpoints saved in %postponed_file into %dbline by assigning
# the whole hash; we have to do it one item at a time for the
# breakpoints to be set properly.
Expand Down Expand Up @@ -6488,7 +6488,7 @@ sub readline {
# Nothing on the filehandle stack. Socket?
if ( ref $OUT and UNIVERSAL::isa( $OUT, 'IO::Socket::INET' ) ) {

# Send anyting we have to send.
# Send anything we have to send.
$OUT->write( join( '', @_ ) );

# Receive anything there is to receive.
Expand Down Expand Up @@ -7289,7 +7289,7 @@ sub sethelp {
B<H> I<*> Delete complete history.
B<p> I<expr> Same as \"I<print {DB::OUT} expr>\" in current package.
B<|>I<dbcmd> Run debugger command, piping DB::OUT to current pager.
B<||>I<dbcmd> Same as B<|>I<dbcmd> but DB::OUT is temporarilly select()ed as well.
B<||>I<dbcmd> Same as B<|>I<dbcmd> but DB::OUT is temporarily select()ed as well.
B<\=> [I<alias> I<value>] Define a command alias, or list current aliases.
I<command> Execute as a perl statement in current package.
B<R> Pure-man-restart of debugger, some of debugger state
Expand Down Expand Up @@ -7774,7 +7774,7 @@ sub dbdie {
die @_ if $^S; # in eval propagate
}

# The code used to check $^S to see if compiliation of the current thing
# The code used to check $^S to see if compilation of the current thing
# hadn't finished. We don't do it anymore, figuring eval is pretty stable.
eval { require Carp };

Expand Down Expand Up @@ -8880,7 +8880,7 @@ sub expand_DollarCaretP_flags {
rerun -4 current command minus 4 (go back 4 steps)
Whether this always makes sense, in the current context is unknowable, and is
in part left as a useful exersize for the reader. This sub returns the
in part left as a useful exercise for the reader. This sub returns the
appropriate arguments to rerun the current session.
=cut
Expand Down Expand Up @@ -9074,7 +9074,7 @@ sub restart {
set_list( "PERLDB_POST", @$post );
set_list( "PERLDB_TYPEAHEAD", @typeahead );

# We are oficially restarting.
# We are officially restarting.
$ENV{PERLDB_RESTART} = 1;

# We are junking all child debuggers.
Expand Down
2 changes: 1 addition & 1 deletion lib/unicore/PropValueAliases.txt
Expand Up @@ -35,7 +35,7 @@
# Loose matching should be applied to all property names and property values, with
# the exception of String Property values. With loose matching of property names and
# values, the case distinctions, whitespace, and '_' are ignored. For Numeric Property
# values, numeric equivalencies are applied: thus "01.00" is equivalent to "1".
# values, numeric equivalences are applied: thus "01.00" is equivalent to "1".
#
# NOTE: Property value names are NOT unique across properties. For example:
#
Expand Down
2 changes: 1 addition & 1 deletion lib/unicore/PropertyAliases.txt
Expand Up @@ -27,7 +27,7 @@
# Loose matching should be applied to all property names and property values, with
# the exception of String Property values. With loose matching of property names and
# values, the case distinctions, whitespace, and '_' are ignored. For Numeric Property
# values, numeric equivalencies are applied: thus "01.00" is equivalent to "1".
# values, numeric equivalences are applied: thus "01.00" is equivalent to "1".
#
# NOTE: Property value names are NOT unique across properties. For example:
#
Expand Down
2 changes: 1 addition & 1 deletion lib/unicore/StandardizedVariants.txt
Expand Up @@ -11,7 +11,7 @@
# For terms of use, see http://www.unicode.org/terms_of_use.html
#
# Standardized variation sequences are defined in this file.
# Ideographic variation sequences are defined acording to the registration
# Ideographic variation sequences are defined according to the registration
# process specified in UTS #37, and are listed in the Ideographic
# Variation Database. Only those two types of variation sequences
# are sanctioned for use by conformant implementations.
Expand Down

0 comments on commit 98dc955

Please sign in to comment.