在升序数组 nums 中寻找目标值 target，给定如下Python二分查找代码，补全其中空缺的语句：

class Search(object):
    def search(self, nums, target):
        left, right = 0, len(nums) - 1
        while left <= right:
            _________________
            if nums[mid] == target:
                return mid
            elif nums[mid] > target:
                right = mid - 1
            else:
                left = mid + 1
        return -1