def match_any?(elements)
      queries = elements.map{|e| hash_to_range(e) }.sort
      match_internal?(queries, queries.size)
    end
def match_any?(elements)
      queries = elements.map{|e| hash_to_range(e) }.sort
      match_internal?(queries, queries.size)
    end
Checks if any of the given elements may be in the set. False positives are possible with probability 1/M per element checked.
 This is more efficient that checking Match on multiple elements separately.
 @param [Array] elements list of elements with binary format.
 @return [Boolean] whether element in set.