Author: Util Date: 2010-01-16 17:13:28 +0100 (Sat, 16 Jan 2010) New Revision: 29541
Modified: docs/Perl6/API/macros.pod docs/Perl6/Spec/S19-commandline.pod docs/Perl6/Spec/S32-setting-library/Containers.pod Log: Typos Modified: docs/Perl6/API/macros.pod =================================================================== --- docs/Perl6/API/macros.pod 2010-01-16 06:47:34 UTC (rev 29540) +++ docs/Perl6/API/macros.pod 2010-01-16 16:13:28 UTC (rev 29541) @@ -79,7 +79,7 @@ =item postcircumfix Postcircumfix macros take two parameters. The first a C<Value>. The -second is an C<Expression> that comes inside of the circumfix delimeters. +second is an C<Expression> that comes inside of the circumfix delimiters. =item regex_metachar Modified: docs/Perl6/Spec/S19-commandline.pod =================================================================== --- docs/Perl6/Spec/S19-commandline.pod 2010-01-16 06:47:34 UTC (rev 29540) +++ docs/Perl6/Spec/S19-commandline.pod 2010-01-16 16:13:28 UTC (rev 29541) @@ -291,7 +291,7 @@ =item * -Eager matching semantics are used, so the first closing delimeter found +Eager matching semantics are used, so the first closing delimiter found completes the match. =item * Modified: docs/Perl6/Spec/S32-setting-library/Containers.pod =================================================================== --- docs/Perl6/Spec/S32-setting-library/Containers.pod 2010-01-16 06:47:34 UTC (rev 29540) +++ docs/Perl6/Spec/S32-setting-library/Containers.pod 2010-01-16 16:13:28 UTC (rev 29541) @@ -829,7 +829,7 @@ An immutable hash value, viewable either as a (constant) hash or as a sequence of C<Enum>s. The keys may not contain duplicates, while -the values may. The implemention of C<EnumMap> associativity is not +the values may. The implementation of C<EnumMap> associativity is not guaranteed to be as efficient as a C<Hash> lookup. (A brute force linear scan for the matching key is allowed. Optimization is also allowed.) @@ -841,7 +841,7 @@ A hash value that is mutable only in values, differing from a normal hash insofar as the key set is frozen. It may be accessed either as a frozen hash or as a sequence of C<Pair>s. The keys may not contain -duplicates, while the values may. The implemention of C<PairMap> +duplicates, while the values may. The implementation of C<PairMap> associativity is not guaranteed to be as efficient as a C<Hash> lookup. (A brute force linear scan for the matching key is allowed. Optimization to something like an ordered hash is also allowed.)
