From 51ddeb372b3f0b22041d9a51f3faee17acd7b749 Mon Sep 17 00:00:00 2001
From: aleksandar <aleksandar@lampmac14.epfl.ch>
Date: Thu, 12 Jan 2012 15:28:25 +0100
Subject: Add mutable tree sets to the standard library.

This implementation is based on AVL trees.
The current implementation is contributed by Lucien Pereira.

Fixes #4147.
---
 test/benchmarking/AVL-insert.scala | 67 ++++++++++++++++++++++++++++++++++++++
 1 file changed, 67 insertions(+)
 create mode 100644 test/benchmarking/AVL-insert.scala

(limited to 'test/benchmarking/AVL-insert.scala')

diff --git a/test/benchmarking/AVL-insert.scala b/test/benchmarking/AVL-insert.scala
new file mode 100644
index 0000000000..4f3ab390c9
--- /dev/null
+++ b/test/benchmarking/AVL-insert.scala
@@ -0,0 +1,67 @@
+package scala.collection
+
+
+
+
+
+class Dummy(val a: Int) extends math.Ordered[Dummy] {
+  def compare(other: Dummy) = this.a - other.a
+  override def toString = a.toString
+}
+
+
+object Global {
+  val sz = 500000
+  val data = (0 until sz) map { new Dummy(_) } toArray
+}
+
+
+import Global._
+
+
+object AVL extends testing.Benchmark {
+  
+  def run() {
+    val avl = new collection.mutable.TreeSet[Dummy]
+    
+    var i = 0
+    while (i < sz) {
+      val elem = data(i)
+      avl += elem
+      i += 1
+    }
+  }
+  
+}
+
+
+object ImmutableTreeSet extends testing.Benchmark {
+  
+  def run() {
+    var tree = new collection.immutable.TreeSet[Dummy]
+    
+    var i = 0
+    while (i < sz) {
+      val elem = data(i)
+      tree += elem
+      i += 1
+    }
+  }
+  
+}
+
+
+object JavaTreeSet extends testing.Benchmark {
+  
+  def run() {
+    val tree = new java.util.TreeSet[Dummy]
+    
+    var i = 0
+    while (i < sz) {
+      val elem = data(i)
+      tree add elem
+      i += 1
+    }
+  }
+  
+}
-- 
cgit v1.2.3