2004-04-22 Sebastien Pouliot <sebastien@ximian.com>

	* GcdBigTest.cs: Ajusted to changes in assembly.
	* ModInverseBigTest.cs: Ajusted to changes in assembly.
	* PrimeGenerationTest.cs: Ajusted to changes in assembly.
	* PrimeTestingTest.cs: Ajusted to changes in assembly.
	* SearchGeneratorTest.cs: Ajusted to changes in assembly.

svn path=/trunk/mcs/; revision=25865

6 files changed, 20 insertions, 12 deletions

diff --git a/mcs/class/Mono.Security/Test/Mono.Math/ChangeLog b/mcs/class/Mono.Security/Test/Mono.Math/ChangeLog
index 19734eaba64..0d045629d68 100644
--- a/mcs/class/Mono.Security/Test/Mono.Math/ChangeLog
+++ b/mcs/class/Mono.Security/Test/Mono.Math/ChangeLog
@@ -1,3 +1,11 @@
+2004-04-22  Sebastien Pouliot  <sebastien@ximian.com>
+
+	* GcdBigTest.cs: Ajusted to changes in assembly.
+	* ModInverseBigTest.cs: Ajusted to changes in assembly.
+	* PrimeGenerationTest.cs: Ajusted to changes in assembly.
+	* PrimeTestingTest.cs: Ajusted to changes in assembly.
+	* SearchGeneratorTest.cs: Ajusted to changes in assembly.
+
 2004-02-13  Sebastien Pouliot  <sebastien@ximian.com>
 
 	* PrimeTestingTest.cs: Added well known (and tested) primes from 
diff --git a/mcs/class/Mono.Security/Test/Mono.Math/GcdBigTest.cs b/mcs/class/Mono.Security/Test/Mono.Math/GcdBigTest.cs
index eec5d178fcc..121fe5b25c1 100644
--- a/mcs/class/Mono.Security/Test/Mono.Math/GcdBigTest.cs
+++ b/mcs/class/Mono.Security/Test/Mono.Math/GcdBigTest.cs
@@ -38,7 +38,7 @@ namespace MonoTests.Mono.Math {
 		[Test]
 		public void GcdPP()
 		{
-			Expect( A.gcd(B), aGcdB );
+			Expect (A.GCD (B), aGcdB);
 		}
 
 	}
diff --git a/mcs/class/Mono.Security/Test/Mono.Math/ModInverseBigTest.cs b/mcs/class/Mono.Security/Test/Mono.Math/ModInverseBigTest.cs
index 39d86a63a61..804a1fcb637 100644
--- a/mcs/class/Mono.Security/Test/Mono.Math/ModInverseBigTest.cs
+++ b/mcs/class/Mono.Security/Test/Mono.Math/ModInverseBigTest.cs
@@ -38,7 +38,7 @@ namespace MonoTests.Mono.Math {
 		[Test]
 		public void ModInvPP () 
 		{
-			Expect (A.modInverse (B), AmodinvB);
+			Expect (A.ModInverse (B), AmodinvB);
 		}
 	}
 	
diff --git a/mcs/class/Mono.Security/Test/Mono.Math/PrimeGenerationTest.cs b/mcs/class/Mono.Security/Test/Mono.Math/PrimeGenerationTest.cs
index 809eebca794..8345a89986c 100644
--- a/mcs/class/Mono.Security/Test/Mono.Math/PrimeGenerationTest.cs
+++ b/mcs/class/Mono.Security/Test/Mono.Math/PrimeGenerationTest.cs
@@ -34,7 +34,7 @@ namespace MonoTests.Mono.Math {
 		[Test]
 		public void GeneratePrime ()
 		{
-			BigInteger r = BigInteger.NextHightestPrime (s);
+			BigInteger r = BigInteger.NextHighestPrime (s);
 			Expect (r, e);
 		}
 	}
diff --git a/mcs/class/Mono.Security/Test/Mono.Math/PrimeTestingTest.cs b/mcs/class/Mono.Security/Test/Mono.Math/PrimeTestingTest.cs
index 08ca688c23b..f116cd1dc2b 100644
--- a/mcs/class/Mono.Security/Test/Mono.Math/PrimeTestingTest.cs
+++ b/mcs/class/Mono.Security/Test/Mono.Math/PrimeTestingTest.cs
@@ -81,12 +81,12 @@ namespace MonoTests.Mono.Math {
 
 		private void ExpectComposite (BigInteger bi)
 		{
-			Assertion.AssertEquals (false, bi.isProbablePrime ());
+			Assertion.AssertEquals (false, bi.IsProbablePrime ());
 		}
 
 		private void ExpectPrime (BigInteger bi)
 		{
-			Assertion.AssertEquals (true, bi.isProbablePrime ());
+			Assertion.AssertEquals (true, bi.IsProbablePrime ());
 		}
 	}
 
@@ -203,7 +203,7 @@ namespace MonoTests.Mono.Math {
 		{
 			string prime = "1552518092300708935130918131258481755631334049434514313202351194902966239949102107258669453876591642442910007680288864229150803718918046342632727613031282983744380820890196288509170691316593175367469551763119843371637221007210577919";
 			BigInteger bi = BigInteger.Parse (prime);
-			Assert ("isProbablePrime-768", bi.isProbablePrime ());
+			Assert ("isProbablePrime-768", bi.IsProbablePrime ());
 			AssertEquals ("ToString()", prime, bi.ToString ());
 		}
 
@@ -213,7 +213,7 @@ namespace MonoTests.Mono.Math {
 		{
 			string prime = "179769313486231590770839156793787453197860296048756011706444423684197180216158519368947833795864925541502180565485980503646440548199239100050792877003355816639229553136239076508735759914822574862575007425302077447712589550957937778424442426617334727629299387668709205606050270810842907692932019128194467627007";
 			BigInteger bi = BigInteger.Parse (prime);
-			Assert ("isProbablePrime-1024", bi.isProbablePrime ());
+			Assert ("isProbablePrime-1024", bi.IsProbablePrime ());
 			AssertEquals ("ToString()", prime, bi.ToString ());
 		}
 
@@ -225,7 +225,7 @@ namespace MonoTests.Mono.Math {
 		{
 			string prime = "2410312426921032588552076022197566074856950548502459942654116941958108831682612228890093858261341614673227141477904012196503648957050582631942730706805009223062734745341073406696246014589361659774041027169249453200378729434170325843778659198143763193776859869524088940195577346119843545301547043747207749969763750084308926339295559968882457872412993810129130294592999947926365264059284647209730384947211681434464714438488520940127459844288859336526896320919633919";
 			BigInteger bi = BigInteger.Parse (prime);
-			Assert ("isProbablePrime-1536", bi.isProbablePrime ());
+			Assert ("isProbablePrime-1536", bi.IsProbablePrime ());
 			AssertEquals ("ToString()", prime, bi.ToString ());
 		}
 	}
diff --git a/mcs/class/Mono.Security/Test/Mono.Math/SearchGeneratorTest.cs b/mcs/class/Mono.Security/Test/Mono.Math/SearchGeneratorTest.cs
index 4bd9e901b23..189dbd9d0df 100644
--- a/mcs/class/Mono.Security/Test/Mono.Math/SearchGeneratorTest.cs
+++ b/mcs/class/Mono.Security/Test/Mono.Math/SearchGeneratorTest.cs
@@ -38,7 +38,7 @@ namespace MonoTests.Mono.Math {
 			uint d = ctx.testData;
 
 			for (uint i = (uint)bits - 2; d > 0; i--, d >>= 1)
-				ret.setBit (i, (d&1) == 1);
+				ret.SetBit (i, (d&1) == 1);
 
 			return ret;
 			
@@ -52,7 +52,7 @@ namespace MonoTests.Mono.Math {
 
 		protected override bool IsPrimeAcceptable (BigInteger bi, object Context)
 		{
-			return bi.testBit (1);
+			return bi.TestBit (1);
 		}
 
 		[Test]
@@ -62,10 +62,10 @@ namespace MonoTests.Mono.Math {
 			for (int i = 0; i < 5; i++) {
 				ContextData ctx = new ContextData (128, (uint)r.Next (int.MinValue, int.MaxValue));
 				BigInteger p = GenerateNewPrime (128, ctx);
-				Assertion.Assert (p.testBit (1));
+				Assertion.Assert (p.TestBit (1));
 				uint d = ctx.testData;
 				for (uint j = 128 - 2; d > 0; j--, d >>= 1)
-					Assertion.AssertEquals ((d&1) == 1, p.testBit (j));
+					Assertion.AssertEquals ((d&1) == 1, p.TestBit (j));
 			}
 		}
 	}