On Sat, May 20, 2000 at 08:01:36PM +0100, Malcolm Beattie wrote:
Matt Sergeant writes:
On Fri, 19 May 2000, David Larkin wrote:
I require a large array of ints in a real application, just stripped
problem down to bear bones for demo.
Is your array sparse by any chance? If not
On Fri, 19 May 2000, David Larkin wrote:
I require a large array of ints in a real application, just stripped
problem down to bear bones for demo.
Is your array sparse by any chance? If not your modperl daemon is going to
get _much_ larger after you populate that array. If it's sparse,
Hi there,
On Fri, 19 May 2000, David Larkin wrote:
Can anyone help explain why PERL gives such a large memory
footprint advise how to get around it.
In addition to the other suggestions, you might want to try
use integer;
in the bits of your Perl code that manipulate integers.
I guess
[EMAIL PROTECTED] (G.W. Haywood) wrote:
Hi there,
On Fri, 19 May 2000, David Larkin wrote:
Can anyone help explain why PERL gives such a large memory
footprint advise how to get around it.
My general philosophy (well, at least in these matters) is that large
chunks of reference data should
Matt Sergeant writes:
On Fri, 19 May 2000, David Larkin wrote:
I require a large array of ints in a real application, just stripped
problem down to bear bones for demo.
Is your array sparse by any chance? If not your modperl daemon is going to
get _much_ larger after you populate that
On Fri, 19 May 2000, David Larkin wrote:
Can anyone help explain why PERL gives such a large memory
footprint advise how to get around it.
Running the simple script below, I get a footprint of 63 MB
about 22 bytes per int.
The C program only 11748 K ... 4 bytes per int
On Fri, 19 May 2000, David Larkin wrote:
Can anyone help explain why PERL gives such a large memory
footprint advise how to get around it.
Your array might be smaller if you pre-extend it to the size you need (see
perldata). You could also look at some of the sneaky bit vector modules
on
