

"""simple docstring"""


# Copyright 2023 The HuggingFace Team. All rights reserved.
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
#     http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
from typing import TYPE_CHECKING

from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_torch_available


a    :int			=       {
    "configuration_mgp_str": ["MGP_STR_PRETRAINED_CONFIG_ARCHIVE_MAP", "MgpstrConfig"],
    "processing_mgp_str": ["MgpstrProcessor"],
    "tokenization_mgp_str": ["MgpstrTokenizer"],
}

try:
  if not is_torch_available():
    raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
  pass
else:
  a    :Optional[int]			=       [
      "MGP_STR_PRETRAINED_MODEL_ARCHIVE_LIST",
      "MgpstrModel",
      "MgpstrPreTrainedModel",
      "MgpstrForSceneTextRecognition",
  ]

if TYPE_CHECKING:
  from .configuration_mgp_str import MGP_STR_PRETRAINED_CONFIG_ARCHIVE_MAP, MgpstrConfig
  from .processing_mgp_str import MgpstrProcessor
  from .tokenization_mgp_str import MgpstrTokenizer

  try:
    if not is_torch_available():
      raise OptionalDependencyNotAvailable()
  except OptionalDependencyNotAvailable:
    pass
  else:
    from .modeling_mgp_str import (
        MGP_STR_PRETRAINED_MODEL_ARCHIVE_LIST,
        MgpstrForSceneTextRecognition,
        MgpstrModel,
        MgpstrPreTrainedModel,
    )
else:
  import sys

  a    :Optional[int]			=       _LazyModule(__name__, globals()["__file__"], _import_structure, module_spec=__spec__)











from sympy import diff, lambdify, symbols
from sympy.functions import *  # noqa: F403




def 		lowerCAmelCase_    (  __UpperCAmelCase:			str		,   __UpperCAmelCase:			complex		,   __UpperCAmelCase:			str = "x"		,   __UpperCAmelCase:			float = 10**-10		,   __UpperCAmelCase:			int = 1		,   )      ->	complex:
    UpperCamelCase__							:				Optional[int]          =      symbols(__UpperCAmelCase      )
    UpperCamelCase__							:				Dict          =      lambdify(__UpperCAmelCase		,   __UpperCAmelCase      )
    UpperCamelCase__							:				List[str]          =      lambdify(__UpperCAmelCase		,   diff(__UpperCAmelCase		,   __UpperCAmelCase      )      )

    UpperCamelCase__							:				int          =      starting_point

    while True:
        if diff_function(__UpperCAmelCase      ) != 0:
            UpperCamelCase__							:				Optional[int]          =      prev_guess - multiplicity * func(__UpperCAmelCase      ) / diff_function(
                __UpperCAmelCase      )
        else:
            raise ZeroDivisionError('''Could not find root'''      ) from None

        # Precision is checked by comparing the difference of consecutive guesses
        if abs(next_guess - prev_guess      ) < precision:
            return next_guess

        UpperCamelCase__							:				Tuple          =      next_guess


# Let's Execute
if __name__ == "__main__":
  # Find root of trigonometric function
  # Find value of pi
  print(F'''The root of sin(x) = 0 is {newton_raphson("sin(x)", 2)}''')

  # Find root of polynomial
  # Find fourth Root of 5
  print(F'''The root of x**4 - 5 = 0 is {newton_raphson("x**4 -5", 0.4 +5J)}''')

  # Find value of e
  print(
      'The root of log(y) - 1 = 0 is ',
      F'''{newton_raphson("log(y) - 1", 2, variable="y")}''',
  )

  # Exponential Roots
  print(
      'The root of exp(x) - 1 = 0 is',
      F'''{newton_raphson("exp(x) - 1", 10, precision=0.005)}''',
  )

  # Find root of cos(x)
  print(F'''The root of cos(x) = 0 is {newton_raphson("cos(x)", 0)}''')

