





from typing import TYPE_CHECKING

from ...utils import (
    OptionalDependencyNotAvailable,
    _LazyModule,
    is_tf_available,
    is_tokenizers_available,
    is_torch_available,
)


__lowercase  :   str						      ={
    """configuration_longformer""": [
        """LONGFORMER_PRETRAINED_CONFIG_ARCHIVE_MAP""",
        """LongformerConfig""",
        """LongformerOnnxConfig""",
    ],
    """tokenization_longformer""": ["""LongformerTokenizer"""],
}

try:
     if not is_tokenizers_available():
          raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
     pass
else:
     __lowercase  :   str						      =["""LongformerTokenizerFast"""]

try:
     if not is_torch_available():
          raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
     pass
else:
     __lowercase  :   List[Any]						      =[
         """LONGFORMER_PRETRAINED_MODEL_ARCHIVE_LIST""",
         """LongformerForMaskedLM""",
         """LongformerForMultipleChoice""",
         """LongformerForQuestionAnswering""",
         """LongformerForSequenceClassification""",
         """LongformerForTokenClassification""",
         """LongformerModel""",
         """LongformerPreTrainedModel""",
         """LongformerSelfAttention""",
     ]

try:
     if not is_tf_available():
          raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
     pass
else:
     __lowercase  :   Optional[Any]						      =[
         """TF_LONGFORMER_PRETRAINED_MODEL_ARCHIVE_LIST""",
         """TFLongformerForMaskedLM""",
         """TFLongformerForMultipleChoice""",
         """TFLongformerForQuestionAnswering""",
         """TFLongformerForSequenceClassification""",
         """TFLongformerForTokenClassification""",
         """TFLongformerModel""",
         """TFLongformerPreTrainedModel""",
         """TFLongformerSelfAttention""",
     ]


if TYPE_CHECKING:
     from .configuration_longformer import (
         LONGFORMER_PRETRAINED_CONFIG_ARCHIVE_MAP,
         LongformerConfig,
         LongformerOnnxConfig,
     )
     from .tokenization_longformer import LongformerTokenizer

     try:
          if not is_tokenizers_available():
               raise OptionalDependencyNotAvailable()
     except OptionalDependencyNotAvailable:
          pass
     else:
          from .tokenization_longformer_fast import LongformerTokenizerFast

     try:
          if not is_torch_available():
               raise OptionalDependencyNotAvailable()
     except OptionalDependencyNotAvailable:
          pass
     else:
          from .modeling_longformer import (
              LONGFORMER_PRETRAINED_MODEL_ARCHIVE_LIST,
              LongformerForMaskedLM,
              LongformerForMultipleChoice,
              LongformerForQuestionAnswering,
              LongformerForSequenceClassification,
              LongformerForTokenClassification,
              LongformerModel,
              LongformerPreTrainedModel,
              LongformerSelfAttention,
          )

     try:
          if not is_tf_available():
               raise OptionalDependencyNotAvailable()
     except OptionalDependencyNotAvailable:
          pass
     else:
          from .modeling_tf_longformer import (
              TF_LONGFORMER_PRETRAINED_MODEL_ARCHIVE_LIST,
              TFLongformerForMaskedLM,
              TFLongformerForMultipleChoice,
              TFLongformerForQuestionAnswering,
              TFLongformerForSequenceClassification,
              TFLongformerForTokenClassification,
              TFLongformerModel,
              TFLongformerPreTrainedModel,
              TFLongformerSelfAttention,
          )

else:
     import sys

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











import math_equivalence  # From: git+https://github.com/hendrycks/math.git

import datasets


__lowercase  :   int						      ="""\
@article{hendrycksmath2021,
  title={Measuring Mathematical Problem Solving With the MATH Dataset},
  author={Dan Hendrycks
    and Collin Burns
    and Saurav Kadavath
    and Akul Arora
    and Steven Basart
    and Eric Tang
    and Dawn Song
    and Jacob Steinhardt},
  journal={arXiv preprint arXiv:2103.03874},
  year={2021}
}
"""


__lowercase  :   List[Any]						      ="""\
This metric is used to assess performance on the Mathematics Aptitude Test of Heuristics (MATH) dataset.
It first canonicalizes the inputs (e.g., converting \"1/2\" to \"\\frac{1}{2}\") and then computes accuracy.
"""


__lowercase  :   str						      =R"""
Calculates accuracy after canonicalizing inputs.

Args:
    predictions: list of predictions to score. Each prediction
        is a string that contains natural language and LaTex.
    references: list of reference for each prediction. Each
        reference is a string that contains natural language
        and LaTex.
Returns:
    accuracy: accuracy after canonicalizing inputs
        (e.g., converting \"1/2\" to \"\\frac{1}{2}\")

Examples:
    >>> metric = datasets.load_metric(\"competition_math\")
    >>> results = metric.compute(references=[\"\\frac{1}{2}\"], predictions=[\"1/2\"])
    >>> print(results)
    {'accuracy': 1.0}
"""

@datasets.utils.file_utils.add_end_docstrings(_DESCRIPTION		,      _KWARGS_DESCRIPTION						)
class      A       (	datasets.Metric						):



      def 	lowerCAmelCase__    (	self:						Any       )						->    Optional[Any]:
         '''simple docstring'''

         return datasets.MetricInfo(
             description=_DESCRIPTION		,  citation=_CITATION		,  inputs_description=_KWARGS_DESCRIPTION		,  features=datasets.Features(
                 {
                     "predictions": datasets.Value("string"       ),
                     "references": datasets.Value("string"       ),
                 }       )		,  homepage="https://github.com/hendrycks/math"		,  codebase_urls=["https://github.com/hendrycks/math"]		,  )






      def 	lowerCAmelCase__    (	self:						Any		,  _lowerCAmelCase:						Tuple		,  _lowerCAmelCase:						Union[str, Any]       )						->    Dict:
         '''simple docstring'''

         UpperCAmelCase_											=0.0
         for i, j in zip(_lowerCAmelCase		,  _lowerCAmelCase       ):
            n_correct += 1.0 if math_equivalence.is_equiv(_lowerCAmelCase		,  _lowerCAmelCase       ) else 0.0
         UpperCAmelCase_											=n_correct / len(_lowerCAmelCase       )
         return {
             "accuracy": accuracy,
         }




