!7

// Typical results: Can do 40M characters with -Xmx10G
// ~8 us per character

p {
  noRegularGC();
  twice { print(); go(); }
}

svoid go {
  int n = parseIntOr(first(args), 1);
  for (; n <= 100*oneMillion(); n += (n < tenMillion() ? tenMillion() : n)) {
    consoleStatus("n=" + n);
    Random random = repeatableRandomizer();
    long time = sysNow();
    S input = stringFromRepF(() -> charPlus('a', randomInt(random, 3)), n);
    new LineCompCompressor compressor;
    compressor.verboseStats = true;
    LineCompedSingle<Char> lc = lineComp_compressTextAsChars(compressor, input);
    time = sysNow()-time;
    printBenchResult("complexity: " + lcRoughComplexity(lc), time, n);
  }
}