def query(self, minhash, size):
for i, index in enumerate(self.indexes):<EOL><INDENT>u = self.uppers[i]<EOL>if u is None:<EOL><INDENT>continue<EOL><DEDENT>b, r = self._get_optimal_param(u, size)<EOL>for key in index[r]._query_b(minhash, b):<EOL><INDENT>yield key<EOL><DEDENT><DEDENT>
Giving the MinHash and size of the query set, retrieve
keys that references sets with containment with respect to
the query set greater than the threshold.

Args:
    minhash (datasketch.MinHash): The MinHash of the query set.
    size (int): The size (number of unique items) of the query set.

Returns:
    `iterator` of keys.