in reply to Re^3: Matching data against non-consecutive range
in thread Matching data against non-consecutive range

It's probably time-efficient enough for most purposes. And the hash lookup is probably memory-efficient enough for most purposes.
  • Comment on Re^4: Matching data against non-consecutive range