You've already forked linux-packaging-mono
Imported Upstream version 4.6.0.125
Former-commit-id: a2155e9bd80020e49e72e86c44da02a8ac0e57a4
This commit is contained in:
parent
a569aebcfd
commit
e79aa3c0ed
@@ -1,60 +0,0 @@
|
||||
2007-07-05 Sebastien Pouliot <sebastien@ximian.com>
|
||||
|
||||
* PrimeTestingTest.cs: Re-enable failing 20 digits primes (now that
|
||||
we have a workaround for them).
|
||||
|
||||
2007-07-04 Sebastien Pouliot <sebastien@ximian.com>
|
||||
|
||||
* BigIntegerTest.cs: A few more ModPow test cases to corner the
|
||||
small value bug (looks like a bad Barrett reduction).
|
||||
* PrimeTestingTest.cs: Add test cases for "small" primes between
|
||||
10 and 300 digits. 3 cases are failing for 20 digits primes.
|
||||
|
||||
2007-07-03 Sebastien Pouliot <sebastien@ximian.com>
|
||||
|
||||
* BigIntegerTest.cs: Add test cases for small values with
|
||||
IsProbablePrime. From bug #81857, subset from patch by Kazuki.
|
||||
|
||||
2005-01-03 Nick Drochak <ndrochak@gol.com>
|
||||
|
||||
* BigIntegerTest.cs: Make tests pass on MS DotNet
|
||||
|
||||
2004-12-03 Sebastien Pouliot <sebastien@ximian.com>
|
||||
|
||||
* BigIntegerTest.cs: Added tests for ModPow when power is 0, for a
|
||||
known case that was faling in classpath and when modulo is a power of
|
||||
two (bug #70169).
|
||||
|
||||
2004-10-19 Sebastien Pouliot <sebastien@ximian.com>
|
||||
|
||||
* BigIntegerTest.cs: New. General unit tests for BigInteger.
|
||||
|
||||
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
|
||||
RFC 2412 (http://www.faqs.org/rfcs/rfc2412.html) as suggested by
|
||||
Pieter Philippaerts (#51229).
|
||||
* SearchGeneratorTest.cs: Modified so this still use the (previous)
|
||||
SmallPrimeSppTest primality test - because RM doesn't work for
|
||||
small primes.
|
||||
|
||||
2004-02-09 Sebastien Pouliot <sebastien@ximian.com>
|
||||
|
||||
* ArithmeticBigTest.cs:
|
||||
* BigIntegerSetTest.cs:
|
||||
* BitwiseTest.cs:
|
||||
* GcdBigTest.cs:
|
||||
* ModInverseBigTest.cs:
|
||||
* ModRingTest.cs:
|
||||
* PrimeGenerationTest.cs:
|
||||
* PrimeTestingTest.cs:
|
||||
* SearchGeneratorTest.cs:
|
||||
New. Copied from corlib (where they cannot be executed because BigInteger is internal).
|
||||
Reference in New Issue
Block a user