New Set ByteMatcher type idea.

[nishihatapalmer]

Possibility of a new ByteMatcherSetMatcher - a Set composed of other ByteMatchers, rather than collapsing all the bytes into a single matcher. Simply iterate over the bytematchers, and return true if any of them match.

• Could well be more efficient than translating to a single matcher backed by a bitset or an array with a binary search. e.g. a bitmask and another byte = [&5e 7f] == two tests at most.
• Doesn't work well with the current compiler, which discards the parse tree before the optimiser kicks in, and turns it into collections of Bytes instead.

[nishihatapalmer]

Started a UnionByteMatcher in the incubator package of v3 which matches the union of a set of underlying ByteMatchers.

Could also have a SubtractionByteMatcher which matches all bytes in a first byte matcher, as long as they aren't in a second byte matcher, or IntersectionByteMatcher, which only matches the intersection of those matchers. However - it's unlikely that these would be more efficient than just calculating those sets and providing a Set byte matcher for the result.