
"""simple docstring"""




from cva import destroyAllWindows, imread, imshow, waitKey

def lowercase_  (   _snake_case						):
							# getting number of pixels in the image
							SCREAMING_SNAKE_CASE__      ,      SCREAMING_SNAKE_CASE__						:       List[str]           =   img.shape[0], img.shape[1]

							# converting each pixel's color to its negative
							for i in range(_snake_case						):
														for j in range(_snake_case						):
																					SCREAMING_SNAKE_CASE__						:       Union[str, Any]           =   [255, 255, 255] - img[i][j]

							return img


if __name__ == "__main__":
					# read original image
					UpperCAmelCase__      :    Union[str, Any]    							= imread('image_data/lena.jpg', 1)

					# convert to its negative
					UpperCAmelCase__      :    List[str]    							= convert_to_negative(img)

					# show result image
					imshow('negative of original image', img)
					waitKey(0)
					destroyAllWindows()










def      A      (      _SCREAMING_SNAKE_CASE ,_SCREAMING_SNAKE_CASE    )	-> Any:
       # "extended trapezoidal rule"
       # int(f) = dx/2 * (f1 + 2f2 + ... + fn)
       lowerCamelCase   :      str			 =					(boundary[1] - boundary[0]) / steps
       lowerCamelCase   :      List[str]			 =					boundary[0]
       lowerCamelCase   :      Union[str, Any]			 =					boundary[1]
       lowerCamelCase   :      int			 =					make_points(_SCREAMING_SNAKE_CASE ,_SCREAMING_SNAKE_CASE ,_SCREAMING_SNAKE_CASE    )
       lowerCamelCase   :      List[str]			 =					0.0
       y += (h / 2.0) * f(_SCREAMING_SNAKE_CASE    )
       for i in x_i:
              # print(i)
              y += h * f(_SCREAMING_SNAKE_CASE    )
       y += (h / 2.0) * f(_SCREAMING_SNAKE_CASE    )
       return y

def      A      (      _SCREAMING_SNAKE_CASE ,_SCREAMING_SNAKE_CASE ,_SCREAMING_SNAKE_CASE    )	-> int:
       lowerCamelCase   :      int			 =					a + h
       while x < (b - h):
              yield x
              lowerCamelCase   :      List[str]			 =					x + h

def      A      (      _SCREAMING_SNAKE_CASE    )	-> Optional[Any]:  # enter your function here
       lowerCamelCase   :      str			 =					(x - 0) * (x - 0)
       return y

def      A      (      )	-> int:
       lowerCamelCase   :      int			 =					0.0  # Lower bound of integration
       lowerCamelCase   :      int			 =					1.0  # Upper bound of integration
       lowerCamelCase   :      Dict			 =					10.0  # define number of steps or resolution
       lowerCamelCase   :      int			 =					[a, b]  # define boundary of integration
       lowerCamelCase   :      str			 =					method_a(_SCREAMING_SNAKE_CASE ,_SCREAMING_SNAKE_CASE    )
       print(f'''y = {y}'''    )


if __name__ == "__main__":
       main()






