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;
# [((
See also "a better way to accomplish what I (OP) wanted".
See also "Some possible solutions" answer to "How can I completely flatten a Perl 6 list (of lists (of lists) … )" question.
my \perm = .combinations(2)».permutations;
say perm; # (((a b) (b a)) ((a c) (c a)) ((b c) (c b)))
say perm[*]; # (((a b) (b a)) ((a c) (c a)) ((b c) (c b)))
say perm[*;*]; # ((a b) (b a) (a c) (c a) (b c) (c b))
say perm[*;*;*] # (a b b a a c c a b c c b)
I used a non-sigil'd variable because I think it's a bit clearer what's going on for those who don't know Perl 6.
I didn't append the subscript to the original expression but I could have:
my \perm = .combinations(2)».permutations[*;*];
say perm; # ((a b) (b a) (a c) (c a) (b c) (c b))