It might be more appropriate to do the shuffle before the uniq if the OP wants the duplicate values to have a greater chance of being selected - as suggested by the name @weighteddiv.
use List::Util 'shuffle';
use List::MoreUtils 'uniq';
use strict;
my @weighteddiv = (
(1..50),
(1..10) x 10,
);
my @shuffle1 = shuffle( uniq @weighteddiv );
my @shuffle2 = uniq( shuffle @weighteddiv );
printf "shuffle1: %s\n", join(', ', sort {$a <=> $b} @shuffle1[0..10])
+;
printf "shuffle2: %s\n", join(', ', sort {$a <=> $b} @shuffle2[0..10])
+;
Output:
shuffle1: 2, 5, 16, 17, 23, 25, 26, 27, 39, 42, 43
shuffle2: 1, 3, 4, 5, 6, 8, 9, 10, 13, 40, 50
This approach is appropriate for the current implementation of uniq, which preserves the original order while removing duplicates.
| 