diff options
author | David Steinbrunner <dsteinbrunner@pobox.com> | 2013-05-21 06:47:05 -0400 |
---|---|---|
committer | James E Keenan <jkeenan@cpan.org> | 2013-05-22 19:06:14 -0400 |
commit | b6a6e9564d193cb709231fad4f4816f447263147 (patch) | |
tree | 35b879e91992c64547495ea14d60ba30e6a65b96 /regen | |
parent | 2effe01f18007a1b28e11f29b319f2b5cd0ae4df (diff) | |
download | perl-b6a6e9564d193cb709231fad4f4816f447263147.tar.gz |
typo fixes for regen scripts
Diffstat (limited to 'regen')
-rw-r--r-- | regen/mk_invlists.pl | 4 | ||||
-rw-r--r-- | regen/reentr.pl | 4 | ||||
-rwxr-xr-x | regen/regcharclass.pl | 12 | ||||
-rw-r--r-- | regen/regen_lib.pl | 2 |
4 files changed, 11 insertions, 11 deletions
diff --git a/regen/mk_invlists.pl b/regen/mk_invlists.pl index 843d6e77c3..67b6e417fc 100644 --- a/regen/mk_invlists.pl +++ b/regen/mk_invlists.pl @@ -118,7 +118,7 @@ for my $i (0 .. @$folds_ref - 1) { next unless ref $folds_ref->[$i]; # Skip single-char folds push @has_multi_char_fold, $cp_ref->[$i]; - # Add to the the non-finals list each code point that is in a non-final + # Add to the non-finals list each code point that is in a non-final # position for my $j (0 .. @{$folds_ref->[$i]} - 2) { push @is_non_final_fold, $folds_ref->[$i][$j] @@ -204,7 +204,7 @@ for my $prop (qw( # that crosses the 255/256 boundary if it is one that matches the # property. For example, in the Word property, there is a range of code # points that start at U+00F8 and goes through U+02C1. Instead of - # artifically cutting that off at 256 because 256 is the first code point + # artificially cutting that off at 256 because 256 is the first code point # above Latin1, we let the range go to its natural ending. That gives us # extra information with no added space taken. But if the range that # crosses the boundary is one that doesn't match the property, we don't diff --git a/regen/reentr.pl b/regen/reentr.pl index 899e83b847..c5e7129f1b 100644 --- a/regen/reentr.pl +++ b/regen/reentr.pl @@ -177,7 +177,7 @@ my %seend; # the type of this function's "D" my %seenm; # all the types my %seenu; # the length of the argument list of this function -while (<DATA>) { # Read in the protypes. +while (<DATA>) { # Read in the protoypes. next if /^\s+$/; chomp; my ($func, $hdr, $type, @p) = split(/\s*\|\s*/, $_, -1); @@ -587,7 +587,7 @@ EOF my $GENFUNC = uc $genfunc; my $D = ifprotomatch($FUNC, grep {/D/} @p); my $d = $seend{$func}; - $d =~ s/\*$//; # snip: we need need the base type. + $d =~ s/\*$//; # snip: we need the base type. push @struct, <<EOF; $seent{$func} _${genfunc}_struct; # if $D diff --git a/regen/regcharclass.pl b/regen/regcharclass.pl index f5cf315a54..976582a7e1 100755 --- a/regen/regcharclass.pl +++ b/regen/regcharclass.pl @@ -71,7 +71,7 @@ that C<s> contains at least one character. =item C<is_WHATEVER_cp(cp)> Check to see if the string matches a given codepoint (hypothetically a -U32). The condition is constructed as as to "break out" as early as +U32). The condition is constructed as to "break out" as early as possible if the codepoint is out of range of the condition. IOW: @@ -307,7 +307,7 @@ sub __cond_join { # Each string is then stored in the 'strs' subhash as a hash record # made up of the results of __uni_latin1, using the keynames # 'low','latin1','utf8', as well as the synthesized 'LATIN1', 'high', and -# 'UTF8' which hold a merge of 'low' and their lowercase equivelents. +# 'UTF8' which hold a merge of 'low' and their lowercase equivalents. # # Size data is tracked per type in the 'size' subhash. # @@ -470,7 +470,7 @@ sub _optree { $else= 0 unless defined $else; $depth= 0 unless defined $depth; - # if we have an emptry string as a key it means we are in an + # if we have an empty string as a key it means we are in an # accepting state and unless we can match further on should # return the value of the '' key. if (exists $trie->{''} ) { @@ -491,7 +491,7 @@ sub _optree { # it means we are an accepting state (end of sequence). my @conds= sort { $a <=> $b } grep { length $_ } keys %$trie; - # if we havent any keys there is no further we can match and we + # if we haven't any keys there is no further we can match and we # can return the "else" value. return $else if !@conds; @@ -935,7 +935,7 @@ sub _cond_as_str { my @masks; if (@ranges > 1) { - # See if the entire set shares optimizable characterstics, and if so, + # See if the entire set shares optimizable characteristics, and if so, # return the optimization. We delay checking for this on sets with # just a single range, as there may be better optimizations available # in that case. @@ -1198,7 +1198,7 @@ sub make_macro { return $self->render( $optree, ($type =~ /^cp/) ? 1 : 0, \%opts, $def_fmt ); } -# if we arent being used as a module (highly likely) then process +# if we aren't being used as a module (highly likely) then process # the __DATA__ below and produce macros in regcharclass.h # if an argument is provided to the script then it is assumed to # be the path of the file to output to, if the arg is '-' outputs diff --git a/regen/regen_lib.pl b/regen/regen_lib.pl index a575c977d0..3abec2ffd7 100644 --- a/regen/regen_lib.pl +++ b/regen/regen_lib.pl @@ -76,7 +76,7 @@ sub close_and_rename { warn "changed '$name' to '$final_name'\n" if $Verbose > 0; push @Changed, $final_name unless $Verbose < 0; - # Some dosish systems can't rename over an existing file: + # Some DOSish systems can't rename over an existing file: safer_unlink $final_name; chmod 0600, $name if $Needs_Write; rename $name, $final_name or die "renaming $name to $final_name: $!"; |