Anonymous user
Best shuffle: Difference between revisions
Improved D version
(Improved D version) |
(Improved D version) |
||
Line 307:
enum size_t NCHAR = cast(size_t)char.max + 1;
enum size_t MAX_VLA_SIZE = 1024;
if (len == 0)
return;
Line 330:
if ((len * size_t.sizeof) < MAX_VLA_SIZE)
ptr1 = cast(size_t*)alloca(len * size_t.sizeof);
size_t[] ndx1 = (ptr1 == null) ? new size_t[len] : ptr1[0
for (size_t ch = 0, i = 0; ch < NCHAR; ch++)
if (counts[ch])
Line 343:
if ((len * size_t.sizeof) < MAX_VLA_SIZE)
ptr2 = cast(size_t*)alloca(len * size_t.sizeof);
size_t[] ndx2 = (ptr2 == null) ? new size_t[len] : ptr2[0
for (size_t i = 0, n = 0, m = 0; i < len; i++) {
ndx2[i] = ndx1[n];
Line 354:
// how long can our cyclic groups be?
// how many of them are full length?
// rotate each group
for (size_t i = 0, j = 0; i < fmax; i++) {
foreach (size_t k; 1 .. glen)
ndx1[j + k - 1] = ndx2[j + k];
Line 380:
auto shuf = txt.dup;
bestShuffle(txt, shuf);
writefln("%s, %s, (%d)", txt, shuf, nequal);
}
| |||