Ralf Hemmecke wrote:
>
> > Of course logically 'exactQuotient' makes sense, but I am a bit
> > reluctant given that 'quo' has equivalent effect and for clarity
> > one can do
> >
> > exactQuotient(x, y) ==> x quo y
>
> Well, maybe currently not relevant, but apart from avoiding needless
> wrapping in Union or computing the remainder and throwing it away, there
> is also the fact that a colleague of mine developed an algorithm for
> doing exact division faster.
>
> https://www.sciencedirect.com/science/article/pii/S0747717183710126
>
> It's also in GMP.
> https://gmplib.org/manual/Exact-Division.html
Yes, I know. The problem is how much effort we should put into
hypotetical improvements as opposed to real ones? Extra code
has its cost (effort) and it is better to have some real
gain for the work done.
--
Waldek Hebisch
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/fricas-devel.
For more options, visit https://groups.google.com/d/optout.
