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.42.178.136 with SMTP id bm8mr49482882icb.13.1433346108115; Wed, 03 Jun 2015 08:41:48 -0700 (PDT) X-Received: by 10.140.19.76 with SMTP id 70mr441216qgg.21.1433346108087; Wed, 03 Jun 2015 08:41:48 -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!feeder.erje.net!us.feeder.erje.net!news.glorb.com!h15no2562702igd.0!news-out.google.com!k20ni45139qgd.0!nntp.google.com!z60no90480qgd.1!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail Newsgroups: comp.lang.ada Date: Wed, 3 Jun 2015 08:41:47 -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: <5edab958-045b-467f-b7ff-af628884e442@googlegroups.com> Subject: Re: Mathpaqs release 30-May-2015 From: vincent.diemunsch@gmail.com Injection-Date: Wed, 03 Jun 2015 15:41:48 +0000 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable Xref: news.eternal-september.org comp.lang.ada:26160 Date: 2015-06-03T08:41:47-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 !=20 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 ?=20 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 ?=20 Kind regards,=20 Vincent