From d25f5928ab234242199d5f14522e6784d39e9591 Mon Sep 17 00:00:00 2001 From: Martin Baulig Date: Wed, 19 Jan 2005 15:28:45 +0000 Subject: 2005-01-19 Martin Baulig * Sorting.cs: 10000 elements is enough for us. svn path=/trunk/mcs/; revision=39173 --- mcs/class/Mono.C5/Test/ChangeLog | 4 ++++ mcs/class/Mono.C5/Test/Sorting.cs | 8 ++++---- 2 files changed, 8 insertions(+), 4 deletions(-) (limited to 'mcs/class/Mono.C5') 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,3 +1,7 @@ +2005-01-19 Martin Baulig + + * Sorting.cs: 10000 elements is enough for us. + 2005-01-19 Martin Baulig * trees/RedBlackTreeSetTests.cs: Put the threading tests into a 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; -- cgit v1.2.3