code: def get_filter_bitno_probes(bloom_filter, key):
      """
      Apply num_probes_k hash functions to key.
      Generate the array index and bitmask corresponding to each result
      """
  
      # This one assumes key is either bytes or str (or other list of integers)
  
      if hasattr(key, "__divmod__"):
          int_list = []
          temp = key
          while temp:
              quotient, remainder = divmod(temp, 256)
              int_list.append(remainder)
              temp = quotient
      elif isinstance(key, (list, tuple, str, bytes)) and not key:
          int_list = []
  
      elif isinstance(key, (list, tuple)):
          int_list = []
          for v in key:
              if isinstance(v, str):
                  int_list.extend([ord(char) for char in v])
              elif hasattr(v, "__divmod__"):
                  int_list.append(v)
              else:
                  raise TypeError(
                      "Sorry, I do not know how to hash this type"
                  )
      elif isinstance(key[0], str):
          int_list = [ord(char) for char in key]
      else:
          raise TypeError("Sorry, I do not know how to hash this type")
  
      hash_value1 = hash1(int_list)
      hash_value2 = hash2(int_list)
      probe_value = hash_value1
  
      for _ in range(1, bloom_filter.num_probes_k + 1):
          probe_value *= hash_value1
          probe_value += hash_value2
          probe_value %= MERSENNES1[2]
          yield probe_value % bloom_filter.num_bits_m
  
imports: import array
  import math
  import os
  import random
label_desc: Use image node_id 5 for calling a global function with example usage: get_filter_bitno_probes(bloom_filter, key) without return types