My approach with such things is to use a tied hash (Berkeley DB in my case)
Can you give me an idea on the speed of using a Berkeley DB? Before even bothering to try installing it, I'd like to know by how much it would slow down.
In reply to Re^2: How to create a compact data structure?
by bart
in thread How to create a compact data structure?
by bart
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |