


"""simple docstring"""





# Copyright 2021 The HuggingFace Inc. 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 packaging import version

from .. import __version__
from .constants import IMAGENET_DEFAULT_MEAN, IMAGENET_DEFAULT_STD, IMAGENET_STANDARD_MEAN, IMAGENET_STANDARD_STD
from .doc import (
    add_code_sample_docstrings,
    add_end_docstrings,
    add_start_docstrings,
    add_start_docstrings_to_model_forward,
    copy_func,
    replace_return_docstrings,
)
from .generic import (
    ContextManagers,
    ExplicitEnum,
    ModelOutput,
    PaddingStrategy,
    TensorType,
    add_model_info_to_auto_map,
    cached_property,
    can_return_loss,
    expand_dims,
    find_labels,
    flatten_dict,
    infer_framework,
    is_jax_tensor,
    is_numpy_array,
    is_tensor,
    is_tf_symbolic_tensor,
    is_tf_tensor,
    is_torch_device,
    is_torch_dtype,
    is_torch_tensor,
    reshape,
    squeeze,
    strtobool,
    tensor_size,
    to_numpy,
    to_py_obj,
    transpose,
    working_or_temp_dir,
)
from .hub import (
    CLOUDFRONT_DISTRIB_PREFIX,
    DISABLE_TELEMETRY,
    HF_MODULES_CACHE,
    HUGGINGFACE_CO_PREFIX,
    HUGGINGFACE_CO_RESOLVE_ENDPOINT,
    PYTORCH_PRETRAINED_BERT_CACHE,
    PYTORCH_TRANSFORMERS_CACHE,
    S3_BUCKET_PREFIX,
    TRANSFORMERS_CACHE,
    TRANSFORMERS_DYNAMIC_MODULE_NAME,
    EntryNotFoundError,
    PushToHubMixin,
    RepositoryNotFoundError,
    RevisionNotFoundError,
    cached_file,
    default_cache_path,
    define_sagemaker_information,
    download_url,
    extract_commit_hash,
    get_cached_models,
    get_file_from_repo,
    get_full_repo_name,
    has_file,
    http_user_agent,
    is_offline_mode,
    is_remote_url,
    move_cache,
    send_example_telemetry,
    try_to_load_from_cache,
)
from .import_utils import (
    ENV_VARS_TRUE_AND_AUTO_VALUES,
    ENV_VARS_TRUE_VALUES,
    TORCH_FX_REQUIRED_VERSION,
    USE_JAX,
    USE_TF,
    USE_TORCH,
    DummyObject,
    OptionalDependencyNotAvailable,
    _LazyModule,
    ccl_version,
    direct_transformers_import,
    get_torch_version,
    is_accelerate_available,
    is_apex_available,
    is_bitsandbytes_available,
    is_bsa_available,
    is_coloredlogs_available,
    is_cython_available,
    is_datasets_available,
    is_decord_available,
    is_detectrona_available,
    is_faiss_available,
    is_flax_available,
    is_ftfy_available,
    is_in_notebook,
    is_ipex_available,
    is_jieba_available,
    is_jumanpp_available,
    is_kenlm_available,
    is_keras_nlp_available,
    is_librosa_available,
    is_natten_available,
    is_ninja_available,
    is_onnx_available,
    is_openai_available,
    is_optimum_available,
    is_pandas_available,
    is_peft_available,
    is_phonemizer_available,
    is_protobuf_available,
    is_psutil_available,
    is_pyanvml_available,
    is_pyctcdecode_available,
    is_pytesseract_available,
    is_pytest_available,
    is_pytorch_quantization_available,
    is_rjieba_available,
    is_sacremoses_available,
    is_safetensors_available,
    is_sagemaker_dp_enabled,
    is_sagemaker_mp_enabled,
    is_scipy_available,
    is_sentencepiece_available,
    is_seqio_available,
    is_sklearn_available,
    is_soundfile_availble,
    is_spacy_available,
    is_speech_available,
    is_sudachi_available,
    is_tensorflow_probability_available,
    is_tensorflow_text_available,
    is_tfaonnx_available,
    is_tf_available,
    is_timm_available,
    is_tokenizers_available,
    is_torch_available,
    is_torch_bfaa_available,
    is_torch_bfaa_cpu_available,
    is_torch_bfaa_gpu_available,
    is_torch_compile_available,
    is_torch_cuda_available,
    is_torch_fx_available,
    is_torch_fx_proxy,
    is_torch_mps_available,
    is_torch_neuroncore_available,
    is_torch_tensorrt_fx_available,
    is_torch_tfaa_available,
    is_torch_tpu_available,
    is_torchaudio_available,
    is_torchdistx_available,
    is_torchdynamo_available,
    is_torchvision_available,
    is_training_run_on_sagemaker,
    is_vision_available,
    requires_backends,
    torch_only_method,
)


snake_case__						:   Tuple			 = '''pytorch_model.bin'''
snake_case__						:   Union[str, Any]			 = '''pytorch_model.bin.index.json'''
snake_case__						:   str			 = '''adapter_config.json'''
snake_case__						:   str			 = '''adapter_model.bin'''
snake_case__						:   Union[str, Any]			 = '''adapter_model.safetensors'''
snake_case__						:   Tuple			 = '''tf_model.h5'''
snake_case__						:   List[Any]			 = '''tf_model.h5.index.json'''
snake_case__						:   Optional[Any]			 = '''model.ckpt'''
snake_case__						:   List[str]			 = '''flax_model.msgpack'''
snake_case__						:   Dict			 = '''flax_model.msgpack.index.json'''
snake_case__						:   int			 = '''model.safetensors'''
snake_case__						:   Optional[Any]			 = '''model.safetensors.index.json'''
snake_case__						:   int			 = '''config.json'''
snake_case__						:   List[str]			 = '''preprocessor_config.json'''
snake_case__						:   List[str]			 = FEATURE_EXTRACTOR_NAME
snake_case__						:   Tuple			 = '''generation_config.json'''
snake_case__						:   List[str]			 = '''modelcard.json'''

snake_case__						:   List[str]			 = '''▁'''
snake_case__						:   Any			 = SENTENCEPIECE_UNDERLINE  # Kept for backward compatibility

snake_case__						:   List[str]			 = [
    [[0, 1, 0, 1], [1, 0, 0, 1]]
] * 2  # Needs to have 0s and 1s only since XLM uses it for langs too.
snake_case__						:   int			 = [[7, 6, 0, 0, 1], [1, 2, 3, 0, 0], [0, 0, 0, 4, 5]]
snake_case__						:   Union[str, Any]			 = [[1, 1, 1, 1, 1], [1, 1, 1, 0, 0], [0, 0, 0, 1, 1]]


def    _snake_case  (  _snake_case :	Optional[int]	):
      if version.parse(_snake_case	) < version.parse(_snake_case	):
            if "dev" in min_version:
                  lowerCAmelCase    :		Tuple				=      (
                      '''This example requires a source install from HuggingFace Transformers (see '''
                      '''`https://huggingface.co/docs/transformers/installation#install-from-source`),'''
                  )
            else:
                  lowerCAmelCase    :		Tuple				=      f'''This example requires a minimum version of {min_version},'''
            error_message += f''' but the version found is {__version__}.\n'''
            raise ImportError(
                error_message
                + '''Check out https://github.com/huggingface/transformers/tree/main/examples#important-note for the examples corresponding to other '''
                '''versions of HuggingFace Transformers.'''	)






"""simple docstring"""





import mpmath  # for roots of unity
import numpy as np



class 						snake_case_:






     def __init__(		self     :    str    , UpperCamelCase_     :    int=None    , UpperCamelCase_     :    List[str]=None ):
           # Input as list
           lowerCAmelCase    :		str				=      list(poly_a or [0] )[:]
           lowerCAmelCase    :		Any				=      list(poly_b or [0] )[:]

           # Remove leading zero coefficients
           while self.polyA[-1] == 0:
                 self.polyA.pop()
           lowerCAmelCase    :		Optional[int]				=      len(self.polyA )

           while self.polyB[-1] == 0:
                 self.polyB.pop()
           lowerCAmelCase    :		Union[str, Any]				=      len(self.polyB )

           # Add 0 to make lengths equal a power of 2
           lowerCAmelCase    :		str				=      int(
               2 ** np.ceil(np.loga(len(self.polyA ) + len(self.polyB ) - 1 ) ) )

           while len(self.polyA ) < self.c_max_length:
                 self.polyA.append(0 )
           while len(self.polyB ) < self.c_max_length:
                 self.polyB.append(0 )
           # A complex root used for the fourier transform
           lowerCAmelCase    :		int				=      complex(mpmath.root(x=1    , n=self.c_max_length    , k=1 ) )

           # The product
           lowerCAmelCase    :		int				=      self.__multiply()






     def    lowerCamelCase__   (		self     :    List[str]    , UpperCamelCase_     :    str ):
           lowerCAmelCase    :		Optional[Any]				=      [[x] for x in self.polyA] if which == '''A''' else [[x] for x in self.polyB]
           # Corner case
           if len(UpperCamelCase_ ) <= 1:
                 return dft[0]
           #
           lowerCAmelCase    :		Tuple				=      self.c_max_length // 2
           while next_ncol > 0:
                 lowerCAmelCase    :		Dict				=      [[] for i in range(UpperCamelCase_ )]
                 lowerCAmelCase    :		List[Any]				=      self.root**next_ncol

                 # First half of next step
                 lowerCAmelCase    :		Dict				=      1
                 for j in range(self.c_max_length // (next_ncol * 2) ):
                       for i in range(UpperCamelCase_ ):
                             new_dft[i].append(dft[i][j] + current_root * dft[i + next_ncol][j] )
                       current_root *= root
                 # Second half of next step
                 lowerCAmelCase    :		int				=      1
                 for j in range(self.c_max_length // (next_ncol * 2) ):
                       for i in range(UpperCamelCase_ ):
                             new_dft[i].append(dft[i][j] - current_root * dft[i + next_ncol][j] )
                       current_root *= root
                 # Update
                 lowerCAmelCase    :		Optional[Any]				=      new_dft
                 lowerCAmelCase    :		Union[str, Any]				=      next_ncol // 2
           return dft[0]






     def    lowerCamelCase__   (		self     :    List[Any] ):
           lowerCAmelCase    :		Optional[Any]				=      self.__dft('''A''' )
           lowerCAmelCase    :		Optional[int]				=      self.__dft('''B''' )
           lowerCAmelCase    :		Any				=      [[dft_a[i] * dft_b[i] for i in range(self.c_max_length )]]
           del dft_a
           del dft_b

           # Corner Case
           if len(inverce_c[0] ) <= 1:
                 return inverce_c[0]
           # Inverse DFT
           lowerCAmelCase    :		str				=      2
           while next_ncol <= self.c_max_length:
                 lowerCAmelCase    :		Union[str, Any]				=      [[] for i in range(UpperCamelCase_ )]
                 lowerCAmelCase    :		Optional[Any]				=      self.root ** (next_ncol // 2)
                 lowerCAmelCase    :		Tuple				=      1
                 # First half of next step
                 for j in range(self.c_max_length // next_ncol ):
                       for i in range(next_ncol // 2 ):
                             # Even positions
                             new_inverse_c[i].append(
                                 (
                                     inverce_c[i][j]
                                     + inverce_c[i][j + self.c_max_length // next_ncol]
                                 )
                                 / 2 )
                             # Odd positions
                             new_inverse_c[i + next_ncol // 2].append(
                                 (
                                     inverce_c[i][j]
                                     - inverce_c[i][j + self.c_max_length // next_ncol]
                                 )
                                 / (2 * current_root) )
                       current_root *= root
                 # Update
                 lowerCAmelCase    :		Any				=      new_inverse_c
                 next_ncol *= 2
           # Unpack
           lowerCAmelCase    :		Optional[int]				=      [round(x[0].real    , 8 ) + round(x[0].imag    , 8 ) * 1j for x in inverce_c]

           # Remove leading 0's
           while inverce_c[-1] == 0:
                 inverce_c.pop()
           return inverce_c






     def __str__(		self     :    int ):
           lowerCAmelCase    :		int				=      '''A = ''' + ''' + '''.join(
               F'''{coef}*x^{i}''' for coef, i in enumerate(self.polyA[: self.len_A] ) )
           lowerCAmelCase    :		str				=      '''B = ''' + ''' + '''.join(
               F'''{coef}*x^{i}''' for coef, i in enumerate(self.polyB[: self.len_B] ) )
           lowerCAmelCase    :		int				=      '''A*B = ''' + ''' + '''.join(
               F'''{coef}*x^{i}''' for coef, i in enumerate(self.product ) )

           return F'''{a}\n{b}\n{c}'''


# Unit tests
if __name__ == "__main__":
 import doctest

 doctest.testmod()


