For another approach, look at Tie::SubstrHash. You'd have to recast your problem as keys of constant length though. Still, it'd be interesting to see a timing comparison.
|Replies are listed 'Best First'.|
Re: Re: A (memory) poor man's <strike>hash</strike> lookup table.
by BrowserUk (Patriarch) on Nov 22, 2003 at 09:43 UTC