Add a JMH benchmark for ArrayDeque

Author: julienrf

benchmarks/time/src/main/scala/strawman/collection/mutable/ArrayDequeBenchmark.scala

@@ -1,45 +1,304 @@
 package strawman.collection.mutable
 
-import scala._
-import scala.collection.mutable
-import scala.Predef._
-
-import java.lang.System.nanoTime
-
-object ArrayDequeBenchmark extends App {
-  val candidates = Seq(
-    strawman.collection.mutable.ArrayDeque.empty[Int],
-    scala.collection.mutable.ArrayBuffer.empty[Int]
-  )
-
-  def benchmark[U](name: String, f: mutable.Buffer[Int] => U) = {
-    def profile(buffer: mutable.Buffer[Int]) = {
-      val t1 = nanoTime()
-      f(buffer)
-      (nanoTime() - t1)/1e6
-    }
-    println(s"===============[$name]=================")
-    candidates foreach (c =>
-      println(f"${c.getClass.getSimpleName}%12s: ${profile(c)}%8.2f ms")
-    )
-    candidates.sliding(2) foreach {case Seq(a, b) =>
-      assert(a == b, s"Operations are not same [$name] for ${a.getClass.getName} and ${b.getClass.getName}")
-    }
-  }
-
-  val range10m = (1 to 1e7.toInt).toArray
-
-  benchmark("Insert lots of items", _ ++= range10m)
-  benchmark("Drop some items from an head index", _.remove(5, 10000))
-  benchmark("Drop some items from a tail index", b => b.remove(b.length - 10000, 10000))
-  benchmark("Append lots of items one by one", b => range10m.foreach(b.+=))
-  benchmark("Prepend few items one by one", b => (1 to 1000).foreach(_ +=: b))
-  benchmark("Prepend lots of items at once", range10m ++=: _)
-  benchmark("Insert items near head", _.insertAll(1000, range10m))
-  benchmark("Reversal", _.reverse)
-  benchmark("Insert items near tail", b => b.insertAll(b.size - 1000, range10m))
-  benchmark("Sliding", _.sliding(size = 1000, step = 1000).size)
-  benchmark("Random indexing", b => range10m.foreach(i => if (b.isDefinedAt(i)) b(i)))
-  benchmark("toArray", _.toArray)
-  benchmark("Clear lots of items", _.clear())
-}
+import strawman.collection.arrayToArrayOps
+
+import java.util.concurrent.TimeUnit
+
+import org.openjdk.jmh.annotations._
+import org.openjdk.jmh.infra.Blackhole
+
+import scala.{Any, AnyRef, Int, Long, Unit, math}
+import scala.Predef.{intWrapper, $conforms}
+
+@BenchmarkMode(scala.Array(Mode.AverageTime))
+@OutputTimeUnit(TimeUnit.NANOSECONDS)
+@Fork(1)
+@Warmup(iterations = 8)
+@Measurement(iterations = 8)
+@State(Scope.Benchmark)
+class ArrayDequeBenchmark {
+  @Param(scala.Array("0", "1", "2", "3", "4", "7", "8", "15", "16", "17", "39", "282", "4096", "131070", "7312102"))
+  var size: Int = _
+
+  var xs: ArrayDeque[Long] = _
+  var zs: ArrayDeque[Long] = _
+  var zipped: ArrayDeque[(Long, Long)] = _
+  var randomIndices: scala.Array[Int] = _
+  def fresh(n: Int) = ArrayDeque((1 to n).map(_.toLong): _*)
+
+  @Setup(Level.Trial)
+  def initTrial(): Unit = {
+    xs = fresh(size)
+    zs = fresh((size / 1000) max 2).map(-_)
+    zipped = xs.map(x => (x, x))
+    if (size > 0) {
+      randomIndices = scala.Array.fill(1000)(scala.util.Random.nextInt(size))
+    }
+  }
+
+  @Benchmark
+  def create(bh: Blackhole): Unit = bh.consume(fresh(size))
+
+  @Benchmark
+  @OperationsPerInvocation(1000)
+  def expand_prepend(bh: Blackhole): Unit = {
+    val ys = xs
+    var i = 0L
+    while (i < 1000) {
+      ys.prepend(i)
+      i += 1
+    }
+    bh.consume(ys)
+  }
+
+  @Benchmark
+  @OperationsPerInvocation(1000)
+  def expand_prependTail(bh: Blackhole): Unit = {
+    var ys = xs
+    var i = 0L
+    while (i < 1000) {
+      ys.insert(0, i)
+      i += 1
+      ys = ys.tail
+    }
+    bh.consume(ys)
+  }
+
+  @Benchmark
+  @OperationsPerInvocation(1000)
+  def expand_append(bh: Blackhole): Unit = {
+    val ys = xs
+    var i = 0L
+    while (i < 1000) {
+      ys.addOne(i)
+      i += 1
+    }
+    bh.consume(ys)
+  }
+
+  @Benchmark
+  @OperationsPerInvocation(1000)
+  def expand_appendInit(bh: Blackhole): Unit = {
+    var ys = xs
+    var i = 0L
+    while (i < 1000) {
+      ys.addOne(i)
+      i += 1
+      ys = ys.init
+    }
+    bh.consume(ys)
+  }
+
+  @Benchmark
+  @OperationsPerInvocation(1000)
+  def expand_prependAppend(bh: Blackhole): Unit = {
+    val ys = xs
+    var i = 0L
+    while (i < 1000) {
+      if ((i & 1) == 1) ys.addOne(i)
+      else ys.insert(0, i)
+      i += 1
+    }
+    bh.consume(ys)
+  }
+
+  @Benchmark
+  @OperationsPerInvocation(1000)
+  def expand_prependAll(bh: Blackhole): Unit = {
+    val ys = xs
+    var i = 0L
+    while (i < 1000) {
+      ys.insertAll(0, zs)
+      i += 1
+    }
+    bh.consume(ys)
+  }
+
+  @Benchmark
+  @OperationsPerInvocation(1000)
+  def expand_appendAll(bh: Blackhole): Unit = {
+    val ys = xs
+    var i = 0L
+    while (i < 1000) {
+      ys.addAll(zs)
+      i += 1
+    }
+    bh.consume(ys)
+  }
+
+  @Benchmark
+  @OperationsPerInvocation(1000)
+  def expand_prependAllAppendAll(bh: Blackhole): Unit = {
+    val ys = xs
+    var i = 0L
+    while (i < 1000) {
+      if ((i & 1) == 1) ys.addAll(zs)
+      else ys.insertAll(0, zs)
+      i += 1
+    }
+    bh.consume(ys)
+  }
+
+  @Benchmark
+  def expand_padTo(bh: Blackhole): Unit = bh.consume(xs.padTo(size * 2, 42))
+
+  @Benchmark
+  def traverse_foreach(bh: Blackhole): Unit = xs.foreach(x => bh.consume(x))
+
+  @Benchmark
+  def traverse_headTail(bh: Blackhole): Unit = {
+    var ys = xs
+    while (ys.nonEmpty) {
+      bh.consume(ys.head)
+      ys = ys.tail
+    }
+  }
+
+  @Benchmark
+  def traverse_initLast(bh: Blackhole): Unit = {
+    var ys = xs
+    while (ys.nonEmpty) {
+      bh.consume(ys.last)
+      ys = ys.init
+    }
+  }
+
+  @Benchmark
+  def traverse_iterator(bh: Blackhole): Unit = {
+    val it = xs.iterator()
+    while (it.hasNext) {
+      bh.consume(it.next())
+    }
+  }
+
+  @Benchmark
+  def traverse_foldLeft(bh: Blackhole): Unit = bh.consume(xs.foldLeft(0) {
+    case (acc, n) =>
+      bh.consume(n)
+      acc + 1
+  })
+
+  @Benchmark
+  def traverse_foldRight(bh: Blackhole): Unit = bh.consume(xs.foldRight(0) {
+    case (n, acc) =>
+      bh.consume(n)
+      acc - 1
+  })
+
+  @Benchmark
+  @OperationsPerInvocation(1000)
+  def access_last(bh: Blackhole): Unit = {
+    var i = 0
+    while (i < 1000) {
+      bh.consume(xs(size - 1))
+      i += 1
+    }
+  }
+
+  @Benchmark
+  @OperationsPerInvocation(1000)
+  def access_random(bh: Blackhole): Unit = {
+    var i = 0
+    while (i < 1000) {
+      bh.consume(xs(randomIndices(i)))
+      i += 1
+    }
+  }
+
+  @Benchmark
+  def access_tail(bh: Blackhole): Unit = bh.consume(xs.tail)
+
+  @Benchmark
+  def access_init(bh: Blackhole): Unit = bh.consume(xs.init)
+
+  @Benchmark
+  @OperationsPerInvocation(100)
+  def access_slice(bh: Blackhole): Unit = {
+    var i = 0
+    while (i < 100) {
+      bh.consume(xs.slice(size - size / (i + 1), size))
+      i += 1
+    }
+  }
+
+  @Benchmark
+  @OperationsPerInvocation(1000)
+  def transform_updateLast(bh: Blackhole): Unit = {
+    var i = 0
+    while (i < 1000) {
+      bh.consume(xs.update(size - 1, i))
+      i += 1
+    }
+  }
+
+  @Benchmark
+  @OperationsPerInvocation(1000)
+  def transform_updateRandom(bh: Blackhole): Unit = {
+    var i = 0
+    while (i < 1000) {
+      bh.consume(xs.update(randomIndices(i), i))
+      i += 1
+    }
+  }
+
+  @Benchmark
+  @OperationsPerInvocation(100)
+  def transform_patch(bh: Blackhole): Unit = {
+    var i = 0
+    while (i < 100) {
+      val from = randomIndices(i)
+      val replaced = randomIndices(if (i > 0) i - 1 else math.min(i + 1, size - 1))
+      val length = randomIndices(if (i > 1) i - 2 else math.min(i + 2, size - 1))
+      bh.consume(xs.patchInPlace(from, xs.take(length), replaced))
+      i += 1
+    }
+  }
+
+  @Benchmark
+  def transform_distinct(bh: Blackhole): Unit = bh.consume(xs.distinct)
+
+  @Benchmark
+  def transform_distinctBy(bh: Blackhole): Unit = bh.consume(xs.distinctBy(_ % 2))
+
+  @Benchmark
+  def transform_map(bh: Blackhole): Unit = bh.consume(xs.map(x => x + 1))
+
+  @Benchmark
+  @OperationsPerInvocation(100)
+  def transform_span(bh: Blackhole): Unit = {
+    var i = 0
+    while (i < 100) {
+      val (xs1, xs2) = xs.span(x => x < randomIndices(i))
+      bh.consume(xs1)
+      bh.consume(xs2)
+      i += 1
+    }
+  }
+
+  @Benchmark
+  def transform_zip(bh: Blackhole): Unit = bh.consume(xs.zip(xs))
+
+  @Benchmark
+  def transform_zipMapTupled(bh: Blackhole): Unit = {
+    val f = (a: Long, b: Long) => (a, b)
+    bh.consume(xs.zip(xs).map(f.tupled))
+  }
+
+  @Benchmark
+  def transform_zipWithIndex(bh: Blackhole): Unit = bh.consume(xs.zipWithIndex)
+
+  @Benchmark
+  def transform_lazyZip(bh: Blackhole): Unit = bh.consume(xs.lazyZip(xs).map((_, _)))
+
+  @Benchmark
+  def transform_unzip(bh: Blackhole): Unit = bh.consume(zipped.unzip)
+
+  @Benchmark
+  def transform_reverse(bh: Blackhole): Unit = bh.consume(xs.reverse)
+
+  @Benchmark
+  def transform_groupBy(bh: Blackhole): Unit = {
+    val result = xs.groupBy(_ % 5)
+    bh.consume(result)
+  }
+}