doc Any.duckmap

Author: gfldex

doc/Type/Any.pod6

@@ -171,6 +171,21 @@ For those elements C<deepmap> will descend recursively into the sublist.
     dd [[1,2,3],[[4,5],6,7]].deepmap(*+1);
     # OUTPUT«[[2, 3, 4], [[5, 6], 7, 8]]␤»
 
+=head2 method duckmap
+
+Defined as:
+
+    method duckmap(&block) is rw is nodal
+
+C<duckmap> will apply C<&block> on each element and return a new list with
+defined return values of the block. For undefined return values, C<duckmap>
+will try to descend into the element if that element is inplementing
+C<Iterable>.
+
+    my @a = [1,[2,3],4];
+    dd @a.duckmap({ $_ ~~ Int ?? $_++ !! Any });
+    # OUTPUT«(1, (2, 3), 4)␤»
+
 =head2 method flat
 
 Interprets the invocant as a list, flattens it, and returns that list.  Please