I am revisiting Chapel implementation of Factorial – clearly a quasi- toy problem, but… As we know factorial of anything greater than 23(- ish) cannot be stored in 64-bit hardware integers, making hardware integers useless. This is not a totally trivial issue since large swathes of financial and bioinformatics computing relies of these big numbers and so relies on non-hardware integers. Python handles this well.
For C++ I use GMP and there is a GMP module for Chapel, which is great.
However, GMP integers are not integers according to the Chapel
compiler. The expression:
one..n
where one and n are BigInt, results in:
error: Bounds of 'low..high' must be integers of compatible
types.
which seems very strange. Or am I just missing something simple?
--
Russel.
=============================================================================
Dr Russel Winder t: +44 20 7585 2200 voip: sip:[email protected]
41 Buckmaster Road m: +44 7770 465 077 xmpp: [email protected]
London SW11 1EN, UK w: www.russel.org.uk skype: russel_winder
signature.asc
Description: This is a digitally signed message part
------------------------------------------------------------------------------
_______________________________________________ Chapel-users mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/chapel-users
