comefrom: <doocs>1213.Intersection of Three Sorted Arrays_1.py
code: def find(arr, val):
      left, right = 0, len(arr) - 1
      while left < right:
          mid = (left + right) >> 1
          if arr[mid] >= val:
              right = mid
          else:
              left = mid + 1
      return arr[left] == val
masked: def sample_funcname ( var_0 , var_1 ) :
      var_3 , var_6 = 0 , len ( var_0 ) - 1
      while var_3 < var_6 :
          var_7 = ( var_3 + var_6 ) >> 1
          if var_0 [ var_7 ] >= var_1 :
              var_6 = var_7
          else :
              var_3 = var_7 + 1
      return var_0 [ var_3 ] == var_1
  