sclass BenchWeightlessShuffledIteratorWithSeed {
  settable int seed = 0; // 0 will use the faster WeightlessShuffledIterator
  
  run {
    for (bool goodCase : falseTrue()) {
      for (int bits = 24; bits <= 28; bits++) {
        int n = (1 << bits)-(goodCase ? 1 : 0);
        printVars(+seed, +goodCase, n := n2(n));
      
        var timed = returnTimed(->  {
          if (seed != 0) {
            var it = WeightlessShuffledIteratorWithSeed(n, seed);
            while (it.nextIndex() >= 0);
          } else {
            var it = WeightlessShuffledIterator(n);
            while (it.nextIndex() >= 0);
          }
        });
      
        print("Nanoseconds per step: " + formatDouble(doubleRatio(timed.nanos(), n), 3));
      }
    }
  }
}