Since the order matters in such a case, a hash might not be the best data structure, I would also go for a sorted array and a binary search.
In reply to Re: hashing intervals
by Laurent_R
in thread hashing intervals
by baxy77bax
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |