diff options
| author | Martin Baulig <martin@novell.com> | 2005-01-19 18:28:45 +0300 |
|---|---|---|
| committer | Martin Baulig <martin@novell.com> | 2005-01-19 18:28:45 +0300 |
| commit | d25f5928ab234242199d5f14522e6784d39e9591 (patch) | |
| tree | 3e11624f98350240bce84d53c372c56a8846fb91 /mcs/class/Mono.C5 | |
| parent | 9b1feaecdf0a8e169d0821737533cf5179191270 (diff) | |
2005-01-19 Martin Baulig <martin@ximian.com>
* Sorting.cs: 10000 elements is enough for us.
svn path=/trunk/mcs/; revision=39173
Diffstat (limited to 'mcs/class/Mono.C5')
| -rw-r--r-- | mcs/class/Mono.C5/Test/ChangeLog | 4 | ||||
| -rw-r--r-- | mcs/class/Mono.C5/Test/Sorting.cs | 8 |
2 files changed, 8 insertions, 4 deletions
diff --git a/mcs/class/Mono.C5/Test/ChangeLog b/mcs/class/Mono.C5/Test/ChangeLog index a7540e66539..6fb6a7810a7 100644 --- a/mcs/class/Mono.C5/Test/ChangeLog +++ b/mcs/class/Mono.C5/Test/ChangeLog @@ -1,5 +1,9 @@ 2005-01-19 Martin Baulig <martin@ximian.com> + * Sorting.cs: 10000 elements is enough for us. + +2005-01-19 Martin Baulig <martin@ximian.com> + * trees/RedBlackTreeSetTests.cs: Put the threading tests into a "Threading" category, so we can exclude them when running in the debugger. diff --git a/mcs/class/Mono.C5/Test/Sorting.cs b/mcs/class/Mono.C5/Test/Sorting.cs index 450ef012794..c88a7aa10f2 100644 --- a/mcs/class/Mono.C5/Test/Sorting.cs +++ b/mcs/class/Mono.C5/Test/Sorting.cs @@ -44,7 +44,7 @@ namespace nunit.SortingTests {
ic = new IC();
ran = new Random(3456);
- length = 100000;
+ length = 10000;
a = new int[length];
for (int i = 0; i < length; i++)
a[i] = ran.Next();
@@ -106,7 +106,7 @@ namespace nunit.SortingTests {
ic = new IC();
ran = new Random(3456);
- length = 100000;
+ length = 10000;
a = new int[length];
for (int i = 0; i < length; i++)
a[i] = ran.Next(3, 23);
@@ -165,7 +165,7 @@ namespace nunit.SortingTests public void Init()
{
ic = new IC();
- length = 100000;
+ length = 10000;
a = new int[length];
for (int i = 0; i < length; i++)
a[i] = i;
@@ -224,7 +224,7 @@ namespace nunit.SortingTests public void Init()
{
ic = new IC();
- length = 100000;
+ length = 10000;
a = new int[length];
for (int i = 0; i < length; i++)
a[i] = -i;
|