Attempt to document nodemap

gistfile1.txt

=head2 method nodemap

Defined as:

    method nodemap(&block --> List) is nodal

C<nodemap> will apply C<&block> to each element and return a new C<List> with
the return values of C<&block>. In contrast to C<deepmap> it will B<not> descend
recursively into sublists if it finds elements which does the C<Iterable> role.

    say [[1,2,3], [[4,5],6,7], 7].nodemap(*+1);
    # OUTPUT: «(4, 4, 8)␤» 
    
    say [[2, 3], [4, [5, 6]]]».nodemap(*+1)
    # OUTPUT: «((3 4) (5 3))␤»
    
The examples above would have produced the exact same results if we had used
C<map> instead of C<nodemap>. The difference between the two lies in the 
fact that C<map> can handle L<slips|/type/Slip> something which C<nodemap>
can't.

    say [[2,3], [[4,5],6,7], 7].nodemap({.elems == 1 ?? $_ !! slip});
    # OUTPUT: «(() () 7)␤»
    say [[2,3], [[4,5],6,7], 7].map({.elems == 1 ?? $_ !! slip});
    # OUTPUT: «(7)␤»