As BrowserUK pointed out, the data should be in the sane range, and it is. Since UPS only looks at the first 3 digits of a zip code, I would be looking at a little less than 1000 elements using a hash structure. However I'm intrigued by the Set::Infinite and Set::IntSpan modules, so I think I may try those before resorting to the hash.
Thanks again all!
In reply to Re: Matching data against non-consecutive range
by Popcorn Dave
in thread Matching data against non-consecutive range
by Popcorn Dave
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |