Fixed a few broken links. AlexDaniel++

Author: Jan-Olof Hendig

doc/Language/performance.pod6

@@ -150,7 +150,7 @@ One of the most reliable techniques for making large performance improvements,
 regardless of language or compiler, is to pick a more appropriate algorithm.
 
 A classic example is
-L<Boyer-Moore|https://en.wikipedia.org/wikiBoyer%E2%80%93Moore_string_search_algorithm>.
+L<Boyer-Moore|https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string_search_algorithm>.
 To match a small string in a large string, one obvious way to do it is to
 compare the first character of the two strings and then, if they match, compare
 the second characters, or, if they don't match, compare the first character of

doc/Type/Array.pod6

@@ -252,7 +252,7 @@ Returns the default value of the invocant, i.e. the value which is returned
 when trying to access an element in the C<Array> which has not been
 previously initialized or when accessing an element which has explicitly
 been set to C<Nil>. Unless the C<Array> is declared as having a default
-value by using the L<is default|/routine/is default> trait the method returns
+value by using the L<is default|/routine/is default (Variable)> trait the method returns
 the type object C<(Any)>.
 
     my @a1 = 1, "two", 2.718;

doc/Type/Hash.pod6

@@ -564,7 +564,7 @@ Defined as:
 Returns the default value of the invocant, i.e. the value which is returned
 when a non existing key is used to access an element in the C<Hash>.
 Unless the C<Hash> is declared as having a default value by using the
-L<is default|/routine/is default> trait the method returns the type object
+L<is default|/routine/is default (Variable)> trait the method returns the type object
 C<(Any)>.
 
     my %h1 = 'apples' => 3, 'oranges' => 7;