X-Git-Url: http://nitlanguage.org

diff --git a/tests/bench_complex_sort.nit b/tests/bench_complex_sort.nit
index 1dac6e4..2eef2cb 100644
--- a/tests/bench_complex_sort.nit
+++ b/tests/bench_complex_sort.nit
@@ -21,30 +21,30 @@ interface Elt
 end
 
 class A
-special Elt
-	var _a: Int
+	super Elt
+	var a: Int
 	redef fun val1: Int do return _a
 
 	init(i: Int) do _a = i
 end
 
 class Elt2
-special Elt
-	var _b: Int
+	super Elt
+	var b: Int
 	redef fun val1: Int do return _b/2
 	redef fun val2: Int do return _b
 	init initelt2(i: Int) do _b = i
 end
 
 class B
-special Elt2
+	super Elt2
 	init(i: Int) do initelt2(i)
 end
 
 class C
-special Elt
-	var _c: Int
-	var _d: Int
+	super Elt
+	var c: Int
+	var d: Int
 	redef fun val1: Int do return _c end
 	redef fun val2: Int do return _d end
 
@@ -55,8 +55,8 @@ special Elt
 end
 
 class D
-special A
-special Elt2
+	super A
+	super Elt2
 	redef fun val1: Int do return _a end
 	redef fun val2: Int do return _b end
 
@@ -67,15 +67,16 @@ special Elt2
 end
 
 class E
-special Elt2
+	super Elt2
 	redef fun val1: Int do return 5 end
 
 	init(i: Int) do initelt2(i)
 end
 
-class EltSorter
-special AbstractSorter[Elt]
-	redef fun compare(a: Elt, b: Elt): Int
+class EltComparator
+	super Comparator
+	redef type COMPARED: Elt
+	redef fun compare(a, b)
 	do
 		if _is_val1 then
 			return a.val1 <=> b.val1
@@ -89,7 +90,7 @@ special AbstractSorter[Elt]
 		_is_val1 = not _is_val1
 	end
 	
-	var _is_val1: Bool = false
+	var is_val1: Bool = false
 
 	init do end
 end
@@ -121,9 +122,9 @@ for i in [0..n[ do
 	array.push(generator)
 end
 
-var sorter = new EltSorter
+var comparator = new EltComparator
 for i in [0..n[ do
-	sorter.sort(array)
-	sorter.toggle
+	comparator.sort(array)
+	comparator.toggle
 end