def intersects(self, key, include_self=False, exclusive=False, biggest_first=True, only=None):
possibles = self.topology if only is None else {k: self[k] for k in only}<EOL>if key == '<STR_LIT>' and '<STR_LIT>' not in self:<EOL><INDENT>return ['<STR_LIT>'] if '<STR_LIT>' in possibles else []<EOL><DEDENT>faces = self[key]<EOL>lst = [<EOL>(k, (len(v.intersection(faces)), len(v)))<EOL>for k, v in possibles.items()<EOL>if (faces.intersection(v))<EOL>]<EOL>return self._finish_filter(lst, key, include_self, exclusive, biggest_first)<EOL>
Get all locations that intersect this location.

        Note that sorting is done by first by number of faces intersecting ``key``; the total number of faces in the intersected region is only used to break sorting ties.

        If the ``resolved_row`` context manager is not used, ``RoW`` doesn't have a spatial definition, and therefore nothing intersects it. ``.intersects("RoW")`` returns a list with with ``RoW`` or nothing.