This is like a simplified B-Tree, with hash you can easily do this yourself.
Don't want to do this yourself, then put this in a database, it will do this for you. You should use database any way.
In reply to Re: optimizing a linear search by Indexed or bucketed hashing
by Cop
in thread optimizing a linear search by Indexed or bucketed hashing
by princepawn
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |