merge -r 60814:60815

[mono.git] / mcs / class / Mono.C5 / Test / Sorting.cs

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