def find(self, other):
iset = self._iset<EOL>l = binsearch_left_start(iset, other[<NUM_LIT:0>] - self._maxlen, <NUM_LIT:0>, len(iset))<EOL>r = binsearch_right_end(iset, other[<NUM_LIT:1>], <NUM_LIT:0>, len(iset))<EOL>iopts = iset[l:r]<EOL>iiter = (s for s in iopts if s[<NUM_LIT:0>] <= other[<NUM_LIT:1>] and s[<NUM_LIT:1>] >= other[<NUM_LIT:0>])<EOL>for o in iiter: yield o<EOL>
Return an interable of elements that overlap other in the tree.