Best shuffle: Difference between revisions

int countSamePositions(in dchar[] r1, dchar[] r2, intsize_t len) {

for (intsize_t i; i < len; i++) {

const size_t len = s1.length;

dchar[]auto s2 = s1.dup;

autoif (problemChar = sort!("a[1] > b[1]"len / 2)(array(group(s2)))[0]; {

if (( int j, numToRemove = problemChar[1] - (len /- 2problemChar[1]) > 0) { ;

int numToRemove = problemChar[1] -foreach (lenref -c; problemChar[1]s2);

for (int i, j; iif < len && j <(c numToRemove;== i++problemChar[0]) {

if (s2[i] == problemChar[0]) {c = '-';

s2[i]if (++j >= '-'numToRemove) break;

for (intsize_t i = len; i > 1; i--) {

swap(s2[i - 1], s2[uniform(0, i)]);

for} while (countSamePositions(ints1, i; i <s2, len; i++) {> 0);

foreach (ref c; s2[i]) = problemChar[0];

}if (c == '-') c = problemChar[0];