I'm searching for a LIFO implementation but can't find any suitable.
I tried BerkerleyDB::Recno (+ cursors), but the performances are far less than the BerkeleyDB::Queue. So I'm looking for an implementation that should be:
I know this sounds a bit demanding, but I can't believe such an important data structure implementation doesn't exists. Thanks for any help !
-- Nice photos of naked perl sources here !
In reply to Persistent stack implementation by jeteve
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |