Remove further references to forkjoin

Use j.u.c.Forkjoin directly in active and disabled tests

Remove bitrotted benchmarks code

I was going to update these to use `java.util.concurrent.ForkJoin`
directly, instead of our deprecated stubs.

But most of them don't compile anymore (e.g. scala.testing.Benchmark
has been removed, ClassTag imports missing).

While I'm all for benchmarks, we should have large swathes of code
checked in that isn't at compiled and run automatically.

I'm happy to help someone resurrect these in a suitable form.

1 files changed, 0 insertions, 65 deletions

diff --git a/test/benchmarking/TreeSetInsertRandom.scala b/test/benchmarking/TreeSetInsertRandom.scala
deleted file mode 100644
index 7f182548b7..0000000000
--- a/test/benchmarking/TreeSetInsertRandom.scala
+++ /dev/null
@@ -1,65 +0,0 @@
-
-object TreeSetInsertRandom {
-
-  def main(args: Array[String]): Unit = {
-    val n = 500000
-    new JavaUtilTS(n).main(args)
-    new MutableTS(n).main(args)
-    new ImmutableTS(n).main(args)
-  }
-}
-
-class Dummy(val a: Int) extends math.Ordered[Dummy] {
-    def compare(other: Dummy) = this.a - other.a
-
-    override def toString = a.toString
-  }
-
-
-class JavaUtilTS(val length: Int) extends testing.Benchmark {
-  var data: Array[Dummy] = util.Random.shuffle((0 until length) map { a => new Dummy(a) }) toArray
-  var t: java.util.TreeSet[Dummy] = null
-
-  def run = {
-    t = new java.util.TreeSet[Dummy]()
-    
-    var i = 0
-    while (i < length) {
-      val elem = data(i)
-      t add elem
-      i += 1
-    }
-  }
-}
-
-class MutableTS(val length: Int) extends testing.Benchmark {
-  var data: Array[Dummy] = util.Random.shuffle((0 until length) map { a => new Dummy(a) }) toArray
-  var t: collection.mutable.TreeSet[Dummy] = null
-
-  def run = {
-    t = collection.mutable.TreeSet[Dummy]()
-
-    var i = 0
-    while (i < length) {
-      val elem = data(i)
-      t += elem
-      i += 1
-    }
-  }
-}
-
-class ImmutableTS(val length: Int) extends testing.Benchmark {
-  var data: Array[Dummy] = util.Random.shuffle((0 until length) map { a => new Dummy(a) }) toArray
-  var t: collection.immutable.TreeSet[Dummy] = null
-
-  def run = {
-    t = collection.immutable.TreeSet[Dummy]()
-
-    var i = 0
-    while (i < length) {
-      val elem = data(i)
-      t += elem
-      i += 1
-    }
-  }
-}