




from .configuration_bert_masked import MaskedBertConfig
from .modeling_bert_masked import (
    MaskedBertForMultipleChoice,
    MaskedBertForQuestionAnswering,
    MaskedBertForSequenceClassification,
    MaskedBertForTokenClassification,
    MaskedBertModel,
)
from .modules import *


'''simple docstring'''




def    lowerCamelCase__		(    SCREAMING_SNAKE_CASE   : List[Any]							, SCREAMING_SNAKE_CASE   : Union[str, Any]    ):
  # "extended trapezoidal rule"
  # int(f) = dx/2 * (f1 + 2f2 + ... + fn)
  UpperCAmelCase    				=						(boundary[1] - boundary[0]) / steps
  UpperCAmelCase    				=						boundary[0]
  UpperCAmelCase    				=						boundary[1]
  UpperCAmelCase    				=						make_points(SCREAMING_SNAKE_CASE							, SCREAMING_SNAKE_CASE							, SCREAMING_SNAKE_CASE    )
  UpperCAmelCase    				=						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    lowerCamelCase__		(    SCREAMING_SNAKE_CASE   : Tuple							, SCREAMING_SNAKE_CASE   : Dict							, SCREAMING_SNAKE_CASE   : Tuple    ):
  UpperCAmelCase    				=						a + h
  while x < (b - h):
    yield x
    UpperCAmelCase    				=						x + h


def    lowerCamelCase__		(    SCREAMING_SNAKE_CASE   : Optional[Any]    ):  # enter your function here
  UpperCAmelCase    				=						(x - 0) * (x - 0)
  return y


def    lowerCamelCase__		(    ):
  UpperCAmelCase    				=						0.0  # Lower bound of integration
  UpperCAmelCase    				=						1.0  # Upper bound of integration
  UpperCAmelCase    				=						10.0  # define number of steps or resolution
  UpperCAmelCase    				=						[a, b]  # define boundary of integration
  UpperCAmelCase    				=						method_a(SCREAMING_SNAKE_CASE							, SCREAMING_SNAKE_CASE    )
  print(f'''y = {y}'''    )


if __name__ == "__main__":
  main()


