in reply to A memory efficient hash, trading off speed - does it already exist?
One option is to create an object that uses an array as its implementation. I have a version and I'm sure that CPAN does, as well. You can go ahead and make it one big array for all the objects, having the class keep track of where each object starts in the super-array. There's a bit of funkiness to it, but it's definitely do-able. (/msg me if you want more info)
------
We are the carpenters and bricklayers of the Information Age.
Don't go borrowing trouble. For programmers, this means Worry only about what you need to implement.
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re: Re: A memory efficient hash, trading off speed - does it already exist?
by JPaul (Hermit) on Feb 04, 2003 at 04:21 UTC | |
by dragonchild (Archbishop) on Feb 04, 2003 at 15:14 UTC |