At 10:44 AM 9/6/2001 +0200, Bart Lateur wrote:
>On Mon, 03 Sep 2001 19:30:33 -0400, Dan Sugalski wrote:
>
> >The less real question, "Should pads be hashes or arrays", can be answered
> >by "whichever is ultimately cheaper". My bet is we'll probably keep the
> >array structure with embedded names, and do a linear search for those rare
> >times you're actually looking by name.
>
>Perhaps a lookup hash for the names, containing the offsets?
Considered that, but I don't know of any hash structure that's modifiable
that doesn't have absolute addresses to the current incarnation of the
structure in it. If we need to go this route, I expect I have some
literature diving to do.
Dan
--------------------------------------"it's like this"-------------------
Dan Sugalski even samurai
[EMAIL PROTECTED] have teddy bears and even
teddy bears get drunk
