Let\'s say I want all permutations of 2 letters out of a, b and c.
I can do:
my @perm = .combinations(2)».permutations;
say @perm;
# [((
my @perm = .combinations(2)».permutations;
dd [ @perm.map(*.Slip) ]
# OUTPUT«[("a", "b"), ("b", "a"), ("a", "c"), ("c", "a"), ("b", "c"), ("c", "b")]»
However, you may be better of to destructure the LoL when you use it later in the program. A map on a long list can take a jolly long time.