Permalink
Browse files

Fixed various typos in comments and error messages.

  • Loading branch information...
Util committed Jun 18, 2010
1 parent 30db218 commit 0b839037be4c41984d354394afe8127b86ef3dae
View
@@ -441,7 +441,7 @@ localtest: all Test.pir spectest_checkout t/localtest.data
localtest_loud: all Test.pir spectest_checkout t/localtest.data
@$(HARNESS_WITH_FUDGE) --tests-from-file=t/localtest.data --verbosity=1
-# Run many tests of your choise.
+# Run many tests of your choice.
# make sometests TESTFILES=t/foo/bar
sometests: all
@$(HARNESS_WITH_FUDGE_JOBS) $(TESTFILES)
@@ -110,7 +110,7 @@ Rakudo * will look for files matching Foo/Bar.pm and Foo/Bar.*.pm from
every starting point listed in @*INC. Rakudo will then open each file
in turn and partially (how?) parse the content to extract the first :ver
and :auth values, building a list of the results. Cacheing will
-probably be added soon after the initial implemention works, in order to
+probably be added soon after the initial implementation works, in order to
reduce the obvious overheads.
If the C<use> specified an C<:auth> or a C<:ver>, the values must match,
View
@@ -223,7 +223,7 @@ Rakudo provides two levels of hookage for creating new types of package
declarator. You will very likely only need this one, which is the HOW map,
%*HOW. This is simply a hash that maps the name of a scope declarator to the
name of the HOW to create. At the entry point to your derived grammar, you
-should temporize the curent HOW hash from the calling language, and add
+should temporize the current HOW hash from the calling language, and add
mappings from names of package declarators that you will introduce to the HOW
to use. By default, this hash contains things like:
View
@@ -1510,7 +1510,7 @@ method signature($/) {
$param.invocant(1);
}
else {
- $/.CURSOR.panic("Can not put ':' parameter seperator after first parameter");
+ $/.CURSOR.panic("Cannot put ':' parameter separator after first parameter");
}
}
if @*seps[$cur_param] eq ';;' {
View
@@ -72,7 +72,7 @@ for executable objects.
.end
-=item assumming()
+=item assuming()
Returns a curried version of self.
View
@@ -26,7 +26,7 @@ wrappable executable objects.
=over 4
-=item assumming()
+=item assuming()
Returns a curried version of self.
@@ -58,7 +58,7 @@ Returns a C<List> of C<Parameter> descriptors.
inc cur_param
unless cur_param < count goto param_done
- # Get all curent parameter info.
+ # Get all current parameter info.
.local pmc nom_type, cons_type, names, type_captures, default, sub_sig
.local int flags, optional, invocant, multi_invocant, slurpy, rw, parcel, capture, copy, named
.local string name, coerce_to
View
@@ -161,7 +161,7 @@ augment class Cool {
}
for @from Z @to -> $f, $t {
if %c.exists($f) && %c{$f} ne $t {
-# warn "Ambigious transliteration rule for '$f'; "
+# warn "Ambiguous transliteration rule for '$f'; "
# ~ "using the first one (transliteration to '$t')";
} else {
if $f.chars > 1 {
View
@@ -66,8 +66,8 @@ class Range is Iterable does Positional {
$min ~ $emin ~ ".." ~ $emax ~ $max;
}
- multi method fmt($format = '%s', $seperator = ' ') {
- self.map({ .fmt($format)}).join($seperator);
+ multi method fmt($format = '%s', $separator = ' ') {
+ self.map({ .fmt($format)}).join($separator);
}
multi method postcircumfix:<[ ]>(Int $index) { self.Seq[$index] }
View
@@ -134,7 +134,7 @@ static PMC *do_handles(PARROT_INTERP, PMC *cur_class, PMC *handlers, STRING *nam
}
}
- /* Restore stuff that might have got overwriten. */
+ /* Restore stuff that might have got overwritten. */
CURRENT_CONTEXT(interp) = ctx;
interp->current_cont = saved_ccont;
Parrot_pcc_set_signature(interp, ctx, saved_sig);
View
@@ -57,7 +57,7 @@ typedef struct candidate_info {
PMC **constraints; /* Refinement type constraints for each parameter
* (if there are many, this will be a junction). */
INTVAL num_types; /* Number of entries in the above two arrays. */
- INTVAL min_arity; /* The number of required positonal arguments. */
+ INTVAL min_arity; /* The number of required positional arguments. */
INTVAL max_arity; /* # of required and optional positional arguments. */
INTVAL bind_check; /* A true value if any parameters have constraints and/or are named. */
STRING *req_named; /* Name of one required named argument, if any. This is to allow us
@@ -655,7 +655,7 @@ static PMC* do_dispatch(PARROT_INTERP, PMC *self, candidate_info **candidates, P
Parrot_mmd_cache_store_by_values(interp, cache, "", capture, possibles[0]->sub);
}
- /* Perhaps we found nothing but have juncitonal arguments? */
+ /* Perhaps we found nothing but have junctional arguments? */
if (possibles_count == 0 && has_junctional_args(interp, capture)) {
/* Look up multi junction dispatcher, clone it, attach this multi-sub
* as a property and hand that back as the dispatch result. We also
@@ -794,7 +794,7 @@ static PMC *find_many_candidates_with_arg_list(PARROT_INTERP, PMC *SELF, PMC *ca
MMD_MANY_RESULTS, VTABLE_elements(interp, unsorted), NULL, cache);
}
- /* Restore stuff that might have got overwriten by calls during the
+ /* Restore stuff that might have got overwritten by calls during the
* dispatch algorithm. */
CURRENT_CONTEXT(interp) = ctx;
interp->current_cont = saved_ccont;
@@ -856,7 +856,7 @@ Unsorted list of all candidates.
=item candidates_sorted
-C array of canididate_info structures. It stores a sequence of candidates
+C array of candidate_info structures. It stores a sequence of candidates
length one or greater that are tied, followed by a NULL, followed by the next
bunch that are less narrow but tied and so forth. It is terminated by a double
NULL.
@@ -1013,7 +1013,7 @@ the Perl 6 MMD algorithm.
VTABLE_elements(interp, unsorted), (opcode_t *)next, cache);
}
- /* Restore stuff that might have got overwriten by calls during the
+ /* Restore stuff that might have got overwritten by calls during the
* dispatch algorithm. */
CURRENT_CONTEXT(interp) = ctx;
interp->current_cont = saved_ccont;
View
@@ -12,7 +12,7 @@ =head1 DESCRIPTION
automatically creates files with less 'skip' fudge directives, runs them
again, and if the
modified tests succeeds, it adds a patch to C<autounfudge.patch> that, when
-applied as C<< patch -p0 < autunfudge.patch >>, removes the superflous fudge
+applied as C<< patch -p0 < autounfudge.patch >>, removes the superfluous fudge
directives.
With the C<--untodo> option, C<todo> skip markers are also removed (where
@@ -28,7 +28,7 @@ =head1 WARNINGS
This tool assumes that all fudge directives are orthogonal,
which might not be the case in real world tests. So always make sure to
-run C<make spectest> before commiting the changes.
+run C<make spectest> before committing the changes.
Never blindly apply the automatically generated patch.
@@ -43,7 +43,7 @@ =head1 MISCELLANEA
C<--exclude> option) because certain tests loop (at the time of writing
C<t/spec/S04-statement-modifiers/while.t>), others because processing them
simply takes too long; C<t/spec/S05-mass/rx.t> contains more than 250
-fudge lines and thus would take about three hours to autoumatically unfudge.
+fudge lines and thus would take about three hours to automatically unfudge.
=cut
@@ -3,7 +3,7 @@
=head1 DESCRIPTION
-This tool runs all spectets, except those that C<make spectest> runs (that
+This tool runs all spectests, except those that C<make spectest> runs (that
means all tests of which we don't know yet if they will pass or not).
For each file that passes at least one test (criterion might change in future)

0 comments on commit 0b83903

Please sign in to comment.