Beefy Boxes and Bandwidth Generously Provided by pair Networks
more useful options

Re^2: Hashing Memory Usage

by awkmonk (Monk)
on Jul 12, 2006 at 15:59 UTC ( #560728=note: print w/ replies, xml ) Need Help??

in reply to Re: Hashing Memory Usage
in thread Hashing Memory Usage

Ah, good point. This msaaivley cut down version still produces the same bloat.

Rewriting the code is an option, but not one I'd like to go into unless there is no other hope.

#!/usr/bin/perl -w use strict; my %a = (); my $res = `ps v $$`; print "$res\n"; for my $line ( 1 .. 19000 ){ for ( "AA" .. "DZ" ){ $a{$line}{"$_$line"} = $line; } } $res = `ps v $$`; print "$res\n"; exit 0;

'I think the problem lies in the fact that your data doesn't fit my program'.

Comment on Re^2: Hashing Memory Usage
Download Code
Re^3: Hashing Memory Usage
by derby (Abbot) on Jul 12, 2006 at 16:19 UTC

    Maybe with your cut down script, Devel::Size could provide some insight (at least give you a diff on the two architectures between the structure size and the structure+data size).


Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://560728]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (6)
As of 2015-07-02 01:14 GMT
Find Nodes?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...

    Results (25 votes), past polls