code: @Benchmark long baselineIteration(int reps) {
      int badHash = 0;
      for (int i = 0; i < reps; i++) {
        for (int n = 0; n < bitString.length; n++) {
          badHash += bitString[n];
        }
      }
      return badHash;
    }
docs: This benchmark attempts to measure the baseline cost of both
  {@link #charsToBitSet(int)} and {@link #charsToMask(int)}.
  It does this by unconditionally summing the character values of the char[].
  This is as close to a no-op case as we can expect to get without unwanted
  over-optimization.