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.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 107e1d,8ed7a0f640cd4797 X-Google-Attributes: gid107e1d,public X-Google-Thread: 103376,b97e032d415cd01a X-Google-Attributes: gid103376,public From: Gautier Subject: Re: Multiprecisions numbers Date: 2000/04/01 Message-ID: <38E5BFDD.AB9ED487@maths.unine.ch>#1/1 X-Deja-AN: 605179411 Content-Transfer-Encoding: 7bit References: <38E5A2FD.63BD@club-internet.fr> <8c36au$cm5$1@wanadoo.fr> X-Accept-Language: en Content-Type: text/plain; charset=us-ascii X-Trace: 1 Apr 2000 11:22:39 +0100, mac13-32.unine.ch Organization: Maths - Uni =?iso-8859-1?Q?Neuch=E2tel?= MIME-Version: 1.0 Newsgroups: comp.lang.ada,fr.comp.lang.ada Date: 2000-04-01T00:00:00+00:00 List-Id: Pascal Obry: > Do you have some benchmarks about the relative speed of these > implementations ? This would be very interesting (not time and equipment myself now) E.g. GMP and other known packages, being in C, must allocate, reallocate, deallocate memory for multi-integer. It consume time and the memory gets fragmented very fast, requiring garbage collection that can take longer than the computing itself. Reversely, pure Ada methods where functions can return a whole unconstrained array, can work only on stack with local variables. Anyway, using the "procedure with out parameter" variants give very quick results on OpenVMS (Compaq Ada V3.5-2) and PC (GNAT/DOS). No comparisons though from my side. _____________________________________________ Gautier -- http://members.xoom.com/gdemont/