seems fast enough to filter efficiently. But, is it really efficient? Especially when we consider look-up table memory footprint. In essence we do not need to mark all bytes in a look-up table. We have 256 different characters, and all we need to know is whether this(these) filter character(s) is/are in the black list. That’s all.