Skip to content

Commit ae16c6a

Browse files
committed
fix some broken links
part of #4476
1 parent 6419d74 commit ae16c6a

File tree

5 files changed

+12
-12
lines changed

5 files changed

+12
-12
lines changed

doc/Language/signatures.rakudoc

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -391,7 +391,7 @@ known collectively as I<type smileys>:
391391
say $f ~~ Any:U; # OUTPUT: «False␤»
392392
say $f ~~ Any:_; # OUTPUT: «True␤»
393393

394-
The L<Classes and Objects|/language/classtut#Starting_with_class>
394+
The L<Classes and Objects|/language/classtut>
395395
document further elaborates on the concepts of instances and type
396396
objects and discovering them with the C<.DEFINITE> method.
397397

@@ -731,7 +731,7 @@ say zipi( "Hey "); # OUTPUT: «List => (Hey )␤»
731731
say zipi( 1...* ); # OUTPUT: «Seq => (...)␤»
732732

733733
Slurpy parameters have special behaviors when combined with some
734-
L<traits and modifiers|#Parameter_Traits_and_Modifiers>,
734+
L<traits and modifiers|#Parameter_traits_and_modifiers>,
735735
as described in
736736
L<the section on slurpy array parameters|/language/signatures#Types_of_slurpy_array_parameters>.
737737

doc/Language/structures.rakudoc

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -341,7 +341,7 @@ say @fibonacci[14]; # OUTPUT: «987␤»
341341
=end code
342342

343343
Above we were reifying a L<C<Seq>|/type/Seq> we created with the L<sequence
344-
operator|/language/operators#index-entry-%E2%80%A6_operators>, but other data
344+
operator|/language/operators#infix_...>, but other data
345345
structures use the concept as well. For example, an un-reified
346346
L<C<Range>|/type/Range> is just the two end points. In some languages, calculating
347347
the sum of a huge range is a lengthy and memory-consuming process, but Raku

doc/Language/subscripts.rakudoc

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -720,8 +720,8 @@ reuse them for any custom type that wants to provide access to data by
720720
index or key.
721721

722722
You don't have to manually overload the L<C<postcircumfix [ ]>|
723-
/routine/[ ]#postcircumfix_[_]> and L<C<postcircumfix { }>|
724-
/routine/{ }#postcircumfix_{_}> operators and re-implement all their magic,
723+
language/operators#postcircumfix_[_]> and L<C<postcircumfix { }>|
724+
language/operators#postcircumfix_{_}> operators and re-implement all their magic,
725725
to achieve that - instead, you can rely on the fact that their standard
726726
implementation dispatches to a well-defined set of low-level methods behind
727727
the scenes. For example:

doc/Language/syntax.rakudoc

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -566,7 +566,7 @@ String literals are surrounded by quotes:
566566
say "a string literal\nthat interprets escape sequences";
567567

568568
See L<quoting|/language/quoting> for many more options, including
569-
L<interpolation quoting C<q>|/language/quoting#Interpolation:_qql>. Raku uses
569+
L<interpolation quoting C<qq>|/language/quoting#Interpolation:_qq>. Raku uses
570570
the standard escape characters in literals: C<\0 \a \b \t \n \f \r \e>,
571571
with the same meaning as the ASCII escape codes, specified in
572572
L<the design document|https://design.raku.org/S02.html#Backslash_sequences>.

doc/Language/traps.rakudoc

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -492,7 +492,7 @@ say 12_345.contains("2_"); # OUTPUT: «False␤»
492492

493493
A common task is to retrieve one or more random elements from a collection,
494494
but C<List.rand> isn't the way to do that. L<C<Cool>|/type/Cool> provides
495-
L<rand|/type/Cool#routine_rand>, but that first coerces the L<C<List>|/type/List> into
495+
L<rand|/type/Cool#method_rand>, but that first coerces the L<C<List>|/type/List> into
496496
the number of items in the list, and returns a random real number
497497
between 0 and that value. To get random elements, see L<pick|/routine/pick>
498498
and L<roll|/routine/roll>.
@@ -1295,7 +1295,7 @@ say doesn't-return-ret;
12951295
# BAD: outputs «Nil» and a warning «Useless use of constant string "ret" in sink context (line 13)»
12961296
=end code
12971297

1298-
Code for C<returns-ret> and C<doesn't-return-ret> might look exactly the same, since in principle it does not matter where the L<C<CATCH>|/language/phasers#index-entry-Phasers__CATCH-CATCH> block goes. However, a block is an object and the last object in a C<sub> will be returned, so the C<doesn't-return-ret> will return L<C<Nil>|/type/Nil>, and, besides, since "ret" will be now in sink context, it will issue a warning. In case you want to place phasers last for conventional reasons, use the explicit form of C<return>.
1298+
Code for C<returns-ret> and C<doesn't-return-ret> might look exactly the same, since in principle it does not matter where the L<C<CATCH>|/language/phasers#CATCH> block goes. However, a block is an object and the last object in a C<sub> will be returned, so the C<doesn't-return-ret> will return L<C<Nil>|/type/Nil>, and, besides, since "ret" will be now in sink context, it will issue a warning. In case you want to place phasers last for conventional reasons, use the explicit form of C<return>.
12991299

13001300
=begin code
13011301
sub explicitly-return-ret () {
@@ -1309,7 +1309,7 @@ sub explicitly-return-ret () {
13091309
=head2 C<LEAVE> needs explicit return from a sub to run
13101310

13111311
As the documentation for the
1312-
L<C<LEAVE> phaser indicates|/language/phasers#index-entry-Phasers__LEAVE-LEAVE>
1312+
L<C<LEAVE> phaser indicates|/language/phasers#LEAVE>
13131313
C<LEAVE> runs when a block is exited, "... except when the program exits
13141314
abruptly". That is, unlike C<END>, it's going to be invoked only if the block
13151315
actually returns in an orderly way. This is why:
@@ -1482,7 +1482,7 @@ Died with the exception:
14821482

14831483
Resolving this is easy because C<.print> returns a promise that you
14841484
can await on. The solution is even more beautiful if you are
1485-
working in a L<react|/language/concurrency#index-entry-react> block:
1485+
working in a L<react|/language/concurrency#react> block:
14861486

14871487
=begin code :skip-test<$proc needs a complex initialization>
14881488
whenever $proc.print: “one\ntwo\nthree\nfour” {
@@ -1984,7 +1984,7 @@ kind of action in the map code block:
19841984
<þor oðin loki>.map: *.codes.say; # OUTPUT: «3␤4␤4␤»
19851985

19861986
The problem might arise when maps are nested and L<in a sink
1987-
context|/language/contexts#index-entry-sink_context>.
1987+
context|/language/contexts#Sink>.
19881988

19891989
<foo bar ber>.map: { $^a.comb.map: { $^b.say}}; # OUTPUT: «»
19901990

@@ -2035,7 +2035,7 @@ say @a.grep( *.Int ~~ 2 );
20352035
The error message does not make a lot of sense. It does, however, if you
20362036
put it in terms of the C<ACCEPTS> method: that code is equivalent to
20372037
C<2.ACCEPTS( *.Int )>, but C<*.Int> cannot be
2038-
L<coerced to L<C<Numeric>|/type/Numeric>|/routine/ACCEPTS#(Numeric)_method_ACCEPTS>,
2038+
L<coerced to L<C<Numeric>|/type/Numeric>|/type/Numeric#method_ACCEPTS>,
20392039
being as it is a L<C<Block>|/type/Block>.
20402040

20412041
Solution: don't use L<C<WhateverCode>|/type/WhateverCode> in the left hand side of a

0 commit comments

Comments
 (0)