Premature Optimization

I spent a lot of time and effort writing a really good cache algorithm for Tie::File
It is very sophisticated
It uses a heap data structure to implement a least-recently-used queue
Old records are expired from the cache when it becomes full
A very nice piece of programming
Unfortunately, it makes Tie::File slower, not faster
At least I got my pony