For a fixed and possibly large number of entries, a binary search might be theoretically fastest. But, in these modern times, I would be hard pressed not to turn to trusty SQLite... a public domain(!) flat file SQL database of known very good performance. All things considered, this is probably the best-all-around manageable strategy, with a rich choice of third-party tools available for maintaining the data.
In reply to Re: Lookup closest hash key
by Anonymous Monk
in thread Lookup closest hash key
by Just in
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |