X-Git-Url: http://wien.tomnetworks.com/gitweb/?a=blobdiff_plain;f=mcs%2Fclass%2FMono.C5%2FTest%2FSorting.cs;h=38deb379c3ca9aa614327bb715b540b087085734;hb=0ca4c0c5ef6ba0bf13fd721deb36e7b501ec5829;hp=c88a7aa10f22836fb25343f9cc37b8cdd53b1fd8;hpb=d25f5928ab234242199d5f14522e6784d39e9591;p=mono.git

diff --git a/mcs/class/Mono.C5/Test/Sorting.cs b/mcs/class/Mono.C5/Test/Sorting.cs
index c88a7aa10f2..38deb379c3c 100644
--- a/mcs/class/Mono.C5/Test/Sorting.cs
+++ b/mcs/class/Mono.C5/Test/Sorting.cs
@@ -1,6 +1,5 @@
-#if NET_2_0
 /*
- Copyright (c) 2003-2004 Niels Kokholm <kokholm@itu.dk> and Peter Sestoft <sestoft@dina.kvl.dk>
+ Copyright (c) 2003-2006 Niels Kokholm and Peter Sestoft
  Permission is hereby granted, free of charge, to any person obtaining a copy
  of this software and associated documentation files (the "Software"), to deal
  in the Software without restriction, including without limitation the rights
@@ -23,9 +22,9 @@
 using System;
 using C5;
 using NUnit.Framework;
-using MSG = System.Collections.Generic;
+using SCG = System.Collections.Generic;
 
-namespace nunit.SortingTests
+namespace C5UnitTests.SortingTests
 {
 	[TestFixture]
 	public class SortRandom
@@ -44,7 +43,7 @@ namespace nunit.SortingTests
 		{
 			ic = new IC();
 			ran = new Random(3456);
-			length = 10000;
+			length = 100000;
 			a = new int[length];
 			for (int i = 0; i < length; i++)
 				a[i] = ran.Next();
@@ -106,7 +105,7 @@ namespace nunit.SortingTests
 		{
 			ic = new IC();
 			ran = new Random(3456);
-			length = 10000;
+			length = 100000;
 			a = new int[length];
 			for (int i = 0; i < length; i++)
 				a[i] = ran.Next(3, 23);
@@ -165,7 +164,7 @@ namespace nunit.SortingTests
 		public void Init()
 		{
 			ic = new IC();
-			length = 10000;
+			length = 100000;
 			a = new int[length];
 			for (int i = 0; i < length; i++)
 				a[i] = i;
@@ -224,7 +223,7 @@ namespace nunit.SortingTests
 		public void Init()
 		{
 			ic = new IC();
-			length = 10000;
+			length = 100000;
 			a = new int[length];
 			for (int i = 0; i < length; i++)
 				a[i] = -i;
@@ -266,5 +265,4 @@ namespace nunit.SortingTests
 		[TearDown]
 		public void Dispose() { ic = null; a = null; }
 	}
-}
-#endif
+}
\ No newline at end of file