def __contains__(self, other):
iset = self._iset<EOL>l = binsearch_left_start(iset, other[<NUM_LIT:0>] - self._maxlen, <NUM_LIT:0>, len(iset))<EOL>max_search = <NUM_LIT:8><EOL>if l == len(iset): return False<EOL>for left in iset[l:l + max_search]:<EOL><INDENT>if left[<NUM_LIT:1>] >= other[<NUM_LIT:0>] and left[<NUM_LIT:0>] <= other[<NUM_LIT:1>]: return True<EOL>if left[<NUM_LIT:0>] > other[<NUM_LIT:1>]: return False<EOL><DEDENT>r = binsearch_right_end(iset, other[<NUM_LIT:1>], <NUM_LIT:0>, len(iset))<EOL>return any(s[<NUM_LIT:0>] <= other[<NUM_LIT:1>] and s[<NUM_LIT:1>] >= other[<NUM_LIT:0>]<EOL>for s in iset[l + max_search:r])<EOL>
Indicate whether `other` overlaps any elements in the tree.