diff options
| author | Martin Baulig <martin@novell.com> | 2005-01-19 18:36:39 +0300 |
|---|---|---|
| committer | Martin Baulig <martin@novell.com> | 2005-01-19 18:36:39 +0300 |
| commit | 207d95d3c6f5407cd2a2e8d30aed1c83b85a7c6e (patch) | |
| tree | 1a715660d87fd7e7466576251587f64df406840d /mcs/class/Mono.C5 | |
| parent | 489d6cb609cc35fa90ad254364214052796821a5 (diff) | |
2005-01-19 Martin Baulig <martin@ximian.com>
* Sorting.cs: 2000 elements is enough for us.
svn path=/trunk/mcs/; revision=39178
Diffstat (limited to 'mcs/class/Mono.C5')
| -rw-r--r-- | mcs/class/Mono.C5/Test/ChangeLog | 2 | ||||
| -rw-r--r-- | mcs/class/Mono.C5/Test/Sorting.cs | 8 |
2 files changed, 5 insertions, 5 deletions
diff --git a/mcs/class/Mono.C5/Test/ChangeLog b/mcs/class/Mono.C5/Test/ChangeLog index 6fb6a7810a7..4b96343acbe 100644 --- a/mcs/class/Mono.C5/Test/ChangeLog +++ b/mcs/class/Mono.C5/Test/ChangeLog @@ -1,6 +1,6 @@ 2005-01-19 Martin Baulig <martin@ximian.com> - * Sorting.cs: 10000 elements is enough for us. + * Sorting.cs: 2000 elements is enough for us. 2005-01-19 Martin Baulig <martin@ximian.com> diff --git a/mcs/class/Mono.C5/Test/Sorting.cs b/mcs/class/Mono.C5/Test/Sorting.cs index c88a7aa10f2..f5506f00787 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 = 10000;
+ length = 2000;
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 = 10000;
+ length = 2000;
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 = 10000;
+ length = 2000;
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 = 10000;
+ length = 2000;
a = new int[length];
for (int i = 0; i < length; i++)
a[i] = -i;
|