...but oh, the cost! This is a search algorithm, and the "trick" is to avoid having to search a node twice; the underlying game is "Spider", and there is a lot of repetitions between positions. So the hash lookup gets done *a lot*. By making it a tie, now not only do I have to do something fancy to invoke the tie, but I'm going to be bogged down my disk access.
Of course, the thrashing means I'm bogged down by disk access as well, so... | [reply] |
open(DATA, '<+:mmap', 'game.dbm')
my $db = DBM::Deep->new( { fh => \*DATA } );
Update: Have benchmarked. No appreciable benefits with the above :-|
Now looking at the storage => ... option.
| [reply]
[d/l] |
