Re: Mathpaqs release 30-May-2015

[vincent <vincent.diemunsch@gmail.com>]

Le mardi 2 juin 2015 14:27:48 UTC+2, gautier...@hotmail.com a écrit :
Thanks Gauthier for this interesting work !

I am really interested by your multiprecision integers. I am happy to see that they are implemented in Ada. 

I used to write a binding to GMP and MPFR but I only considered "Unbounded Integers", implemented as controlled types, just like unbounded_strings are implemented. Do you know how fast is your Library compared to GMP ?

If we had an Ada compiler based on LLVM, we could use "portable" inline assembly code to accelerate computations... Would this be useful ? I suppose the most important thing is the algorithm, isn't it ?

What I would like to have is the euclidean division :
 
A div B = if B > 0 then Floor(A,B) else Ceiling (A,B) end if;
Where Floor(A,B) is the floor of the rational number A/B.

A mod B the corresponding remainder, which is "mod" when B > 0.

These are the div and mod operators from Oberon for instance. I think they really lack in Ada. Would it be difficult to have them starting from your implementation ?

Kind regards,

Vincent