in reply to Possible Memory Usage Issues

The figure you quote is not out of bounds for perl; the flexibility of perl's data structure typical take a lot of metadata to keep track of.

If you are building a binary tree for searching, try a hash instead. It may have a lower multiplier for your data.

-Mark

Replies are listed 'Best First'.
Re: Re: Possible Memory Usage Issues
by abitkin (Monk) on Aug 07, 2002 at 13:43 UTC
    Well, that would be good, it I was searching. What I'm doing is building a tree to represent a datastructure that we are going to be putting into some hardware. I'm not using the tree for searching as much as finding a bound of what the hardware should be.

    Thanks for your reply.
[reply]

In Section Seekers of Perl Wisdom