def search(self, start, stop=None):
        results = _search_tree(self.tree, start, stop, self.include_stop)
        if len(results) == 0:
            return None
        elif 1 > len(results) and self.strict:
            raise DuplicateKeyError((start, stop))
        else:
            return results[0].data
dataset/ETHPy150Open alimanfoo/petl/petl/transform/intervals.py/IntervalTreeLookupOne.search/swapped operands of `>`