
def 						lowerCamelCase__							(      a	,	a	,	a	,	a   )   ->     int:
   _A:						Tuple	    = int((lower_bound + upper_bound) // 2   )
   if array[r] == value:
      return r
   if lower_bound >= upper_bound:
      return -1
   if array[r] < value:
      return binary_search(a	,	r + 1	,	a	,	a   )
   else:
      return binary_search(a	,	a	,	r - 1	,	a   )






def 						lowerCamelCase__							(      a	,	a   )   ->     list:
   _A:						Tuple	    = 0
   if matrix[index][0] == value:
      return [index, 0]
   while index < len(a   ) and matrix[index][0] < value:
      _A:						List[str]	    = binary_search(matrix[index]	,	0	,	len(matrix[index]   ) - 1	,	a   )
      if r != -1:
         return [index, r]
      index += 1
   return [-1, -1]


if __name__ == "__main__":
   import doctest

   doctest.testmod()





import pytest

from datasets.utils.version import Version






@pytest.mark.parametrize(
    '''other, expected_equality'''	,	[
        (Version('''1.0.0'''   ), True),
        ('''1.0.0''', True),
        (Version('''2.0.0'''   ), False),
        ('''2.0.0''', False),
        ('''1''', False),
        ('''a''', False),
        (1, False),
        (None, False),
    ]	,	)
def 						lowerCamelCase__							(      a	,	a   )   ->     str:
   _A:						Tuple	    = Version('''1.0.0'''   )
   assert (version == other) is expected_equality
   assert (version != other) is not expected_equality
   assert (hash(a   ) == hash(a   )) is expected_equality



