[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Chicken-hackers] [PATCH] More efficient numbers integration through
Re: [Chicken-hackers] [PATCH] More efficient numbers integration through "scratchspace"
Tue, 21 Apr 2015 16:02:36 -0400
Peter Bex scripsit:
> Can you please stop theorising and suggesting "improvements" to code
> you obviously haven't studied and don't understand?
I am making no suggestions whatever.
> This is very irritating.
By all means don't read my postings if they irritate you.
> More to the point: the scratch space size isn't truly fixed: it may
> grow to arbitrary sizes, while the internal number calculation routines
> do their thing. The gcd, karatsuba and burnikel-ziegler algorithms will
> allocate quite a lot of garbage while they run. Besides, the size is
> only checked at the start of a CPS function. If it calls a lot of
> inline allocating functions, it may not check the size for a long time.
Thanks for the explanation.
John Cowan http://www.ccil.org/~cowan address@hidden
Note that nobody these days would clamor for fundamental laws of *the theory
of kangaroos*, showing why pseudo-kangaroos are physically, logically,
metaphysically impossible. Kangaroos are wonderful, but not *that*
--Daniel Dennett on zombies
Re: [Chicken-hackers] [PATCH] More efficient numbers integration through "scratchspace", Felix Winkelmann, 2015/04/21
- Re: [Chicken-hackers] [PATCH] More efficient numbers integration through "scratchspace", (continued)