Skip to content

Commit c625923

Browse files
authored
Make does more palatable on a plural
Also make other linkable things in paragraph actual links readers could follow
1 parent da5a52a commit c625923

File tree

1 file changed

+5
-5
lines changed

1 file changed

+5
-5
lines changed

doc/Type/Any.pod6

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -191,9 +191,9 @@ Defined as:
191191
192192
method nodemap(&block --> List) is nodal
193193
194-
C<nodemap> will apply C<&block> to each element and return a new C<List> with
195-
the return values of C<&block>. In contrast to C<deepmap> it will B<not> descend
196-
recursively into sublists if it finds elements which does the C<Iterable> role.
194+
C<nodemap> will apply C<&block> to each element and return a new L<List> with
195+
the return values of C<&block>. In contrast to L<deepmap> it will B<not> descend
196+
recursively into sublists if it finds elements which L<does> the L<Iterable> role.
197197
198198
say [[1,2,3], [[4,5],6,7], 7].nodemap(*+1);
199199
# OUTPUT: «(4, 4, 8)␤»
@@ -202,8 +202,8 @@ recursively into sublists if it finds elements which does the C<Iterable> role.
202202
# OUTPUT: «((3 4) (5 3))␤»
203203
204204
The examples above would have produced the exact same results if we had used
205-
C<map> instead of C<nodemap>. The difference between the two lies in the
206-
fact that C<map> flattens out L<slips|/type/Slip> while C<nodemap> doesn't.
205+
L<map> instead of C<nodemap>. The difference between the two lies in the
206+
fact that L<map> flattens out L<slips|/type/Slip> while C<nodemap> doesn't.
207207
208208
say [[2,3], [[4,5],6,7], 7].nodemap({.elems == 1 ?? $_ !! slip});
209209
# OUTPUT: «(() () 7)␤»

0 commit comments

Comments
 (0)