Other Directory Sites: SeekWonder | Directory Owners Forum
The following archive was created by hippie-mail 7.98617-22 on Sat Apr 10 1999 - 01:13:59
Rick Campbell (rick@campbellcentral.org)
Tue, 15 Sep 1998 07:47:23 -0400
Date: 15 Sep 1998 10:06:06 +0200
From: "Sparkes, Ian, ZFRD AC" <ian.sparkes@17.dmst02.telekom400.dbp.de>
At 18:22 14.09.98, you wrote:
>I 'm designing a package to handle large (signed) integers
(in pascal), the size of these
>integers are merely bounded by the available memory.
I tried doing this in Delphi (for unsigned integers), but
found that the overhead caused by all the checks and memory
management slowed the thing down to a snail's pace.
I know diddly about Delphi, but this strikes me as odd. Is Delphi
purely interpreted or something?
I'd be suprised if array bounds checks would drop basically zippy code
to ``a snail's pace'' and while it's hard to make completely general
statements comparing explicit/ad-hoc memory management with other
approaches, it still seems odd to me that you couldn't generate
reasonably efficient bignum code in a pascal-type language. Perhaps
the code in question simply made poor use of memory, e. g. failing to
use destructive (memory reusing) operations where appropriate?
Rick
The following archive was created by hippie-mail 7.98617-22 on Sat Apr 10 1999 - 01:13:59