[Mono-devel-list] CoreLib's HashTable CalcPrime() new code

[Sebastien Pouliot]

Also, there is a hardcoded prime number's table being used in ToPrime(),
which waistes lots of resources (IMHO) because it skips most of the primes
and new hash tables become overbloated. Why not use the
Mono.Math.BigInteger.smallPrimes[] instead? Wouldnt that be closer to the
spec? Although, i am not sure about dependencies because the Hashtable is in
the corlib, whereas BigInteger might not be.

[SP] BigInteger is part of corlib (as an internal classe) for cryptography.
  Sebastien Pouliot
  Security Architect, Motus Technologies, http://www.motus.com/
  work: spouliot at motus.com
  home: spouliot at videotron.ca
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.ximian.com/pipermail/mono-devel-list/attachments/20030901/07a4f73e/attachment.html