From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM autolearn=unavailable autolearn_force=no version=3.4.4 X-Received: by 10.236.17.138 with SMTP id j10mr43209564yhj.42.1433344578551; Wed, 03 Jun 2015 08:16:18 -0700 (PDT) X-Received: by 10.140.21.197 with SMTP id 63mr221931qgl.31.1433344578532; Wed, 03 Jun 2015 08:16:18 -0700 (PDT) Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!mx02.eternal-september.org!feeder.eternal-september.org!usenet.blueworldhosting.com!feeder01.blueworldhosting.com!peer02.iad.highwinds-media.com!news.highwinds-media.com!feed-me.highwinds-media.com!z60no86845qgd.1!news-out.google.com!k20ni45139qgd.0!nntp.google.com!z60no86842qgd.1!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail Newsgroups: comp.lang.ada Date: Wed, 3 Jun 2015 08:16:18 -0700 (PDT) In-Reply-To: Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=185.30.133.97; posting-account=hya6vwoAAADTA0O27Aq3u6Su3lQKpSMz NNTP-Posting-Host: 185.30.133.97 References: User-Agent: G2/1.0 MIME-Version: 1.0 Message-ID: Subject: Re: Mathpaqs release 30-May-2015 From: vincent Injection-Date: Wed, 03 Jun 2015 15:16:18 +0000 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable X-Received-Bytes: 2294 X-Received-Body-CRC: 1104342960 Xref: news.eternal-september.org comp.lang.ada:26159 Date: 2015-06-03T08:16:18-07:00 List-Id: Le mardi 2 juin 2015 14:27:48 UTC+2, gautier...@hotmail.com a =E9crit=A0: Thanks Gauthier for this interesting work ! I am really interested by your multiprecision integers. I am happy to see t= hat they are implemented in Ada.=20 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 ass= embly code to accelerate computations... Would this be useful ? I suppose t= he most important thing is the algorithm, isn't it ? What I would like to have is the euclidean division : =20 A div B =3D 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 i= mplementation ? Kind regards, Vincent =A0