def main()

in cassovary-benchmarks/src/main/scala/com/twitter/cassovary/SubsetSamplingBenchmarks.scala [31:75]
38 lines of code
4 McCabe index (conditional complexity)

  def main(args: Array[String]): Unit = {
    flags.parseArgs(args)

    if (helpFlag()) {
      println(flags.usage)
    } else {
      performBenchmarks(subsetSizeFlag(), numFlag(), repsFlag())
    }

    abstract case class SubsetSamplingBenchmark(size: Int, maxElement: Int)
      extends OperationBenchmark

    def performBenchmarks(size: Int, maxElement: Int, reps: Int) {
      val benchmarks = List(
        new SubsetSamplingBenchmark(size, maxElement) {
          override def name = "Array based sampling with sampling array generated in advance"

          val array = (1 to maxElement).toArray

          override def operation(): Unit = {
            Sampling.randomSubset(size, array, rng)
          }
        },
        new SubsetSamplingBenchmark(size, maxElement) {
          override def name = "Array based sampling with array generation for each sample"

          override def operation(): Unit = {
            Sampling.randomSubset(size, (1 to maxElement).toArray, rng)
          }
        },
        new SubsetSamplingBenchmark(size, maxElement) {
          override def name = "Range based sampling"

          override def operation(): Unit = {
            Sampling.randomSubset(size, 1 to maxElement, rng)
          }
        }
      )
      for (benchmark <- benchmarks) {
        printf("Sampling %d from 1..%d using %s\n", benchmark.size, benchmark.maxElement, benchmark.name)
        val duration = benchmark.run(reps)
        printf("\tAvg time over %d repetitions: %s.\n", reps, duration)
      }
    }
  }