'''simple docstring'''

# Copyright 2023 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 ..models.auto import AutoModelForSeqaSeqLM, AutoTokenizer
from .base import PipelineTool


_lowerCamelCase :				Dict														= """Here is a text containing a lot of information: '''{text}'''.

Can you answer this question about the text: '{question}'"""




class    lowerCamelCase__  (   __snake_case     ):
   __UpperCAmelCase           =						"""google/flan-t5-base"""
   __UpperCAmelCase           =						(
       """This is a tool that answers questions related to a text. It takes two arguments named `text`, which is the """
       """text where to find the answer, and `question`, which is the question, and returns the answer to the question."""
   )
   __UpperCAmelCase           =						"""text_qa"""
   __UpperCAmelCase           =						AutoTokenizer
   __UpperCAmelCase           =						AutoModelForSeqaSeqLM

   __UpperCAmelCase           =						["""text""", """text"""]
   __UpperCAmelCase           =						["""text"""]



   def  _UpperCamelCase		(    self					,      lowerCAmelCase__					,      lowerCAmelCase__     )				->     Optional[int]:
        """simple docstring"""





        _UpperCamelCase  :str       =QA_PROMPT.format(text=lowerCAmelCase__					,      question=lowerCAmelCase__     )
        return self.pre_processor(lowerCAmelCase__					,      return_tensors="""pt"""     )



   def  _UpperCamelCase		(    self					,      lowerCAmelCase__     )				->     Optional[Any]:
        """simple docstring"""





        _UpperCamelCase  :str       =self.model.generate(**lowerCAmelCase__     )

        _UpperCamelCase       ,      _UpperCamelCase  :List[str]       =inputs["""input_ids"""].shape
        _UpperCamelCase  :List[str]       =output_ids.shape[0]

        return output_ids.reshape(lowerCAmelCase__					,      out_b // in_b					,      *output_ids.shape[1:]     )[0][0]




   def  _UpperCamelCase		(    self					,      lowerCAmelCase__     )				->     Any:
        """simple docstring"""





        return self.pre_processor.decode(lowerCAmelCase__					,      skip_special_tokens=lowerCAmelCase__					,      clean_up_tokenization_spaces=lowerCAmelCase__     )





import datasets

from .evaluate import (
    apply_no_ans_threshold,
    find_all_best_thresh,
    get_raw_scores,
    make_eval_dict,
    make_qid_to_has_ans,
    merge_eval,
)


__lowerCAmelCase						:							Optional[int]			     =						'\\n@inproceedings{Rajpurkar2016SQuAD10,\n  title={SQuAD: 100, 000+ Questions for Machine Comprehension of Text},\n  author={Pranav Rajpurkar and Jian Zhang and Konstantin Lopyrev and Percy Liang},\n  booktitle={EMNLP},\n  year={2016}\n}\n'

__lowerCAmelCase						:							str			     =						'\nThis metric wrap the official scoring script for version 2 of the Stanford Question\nAnswering Dataset (SQuAD).\n\nStanford Question Answering Dataset (SQuAD) is a reading comprehension dataset, consisting of questions posed by\ncrowdworkers on a set of Wikipedia articles, where the answer to every question is a segment of text, or span,\nfrom the corresponding reading passage, or the question might be unanswerable.\n\nSQuAD2.0 combines the 100,000 questions in SQuAD1.1 with over 50,000 unanswerable questions\nwritten adversarially by crowdworkers to look similar to answerable ones.\nTo do well on SQuAD2.0, systems must not only answer questions when possible, but also\ndetermine when no answer is supported by the paragraph and abstain from answering.\n'

__lowerCAmelCase						:							Optional[Any]			     =						'\nComputes SQuAD v2 scores (F1 and EM).\nArgs:\n    predictions: List of triple for question-answers to score with the following elements:\n        - the question-answer \'id\' field as given in the references (see below)\n        - the text of the answer\n        - the probability that the question has no answer\n    references: List of question-answers dictionaries with the following key-values:\n            - \'id\': id of the question-answer pair (see above),\n            - \'answers\': a list of Dict {\'text\': text of the answer as a string}\n    no_answer_threshold: float\n        Probability threshold to decide that a question has no answer.\nReturns:\n    \'exact\': Exact match (the normalized answer exactly match the gold answer)\n    \'f1\': The F-score of predicted tokens versus the gold answer\n    \'total\': Number of score considered\n    \'HasAns_exact\': Exact match (the normalized answer exactly match the gold answer)\n    \'HasAns_f1\': The F-score of predicted tokens versus the gold answer\n    \'HasAns_total\': Number of score considered\n    \'NoAns_exact\': Exact match (the normalized answer exactly match the gold answer)\n    \'NoAns_f1\': The F-score of predicted tokens versus the gold answer\n    \'NoAns_total\': Number of score considered\n    \'best_exact\': Best exact match (with varying threshold)\n    \'best_exact_thresh\': No-answer probability threshold associated to the best exact match\n    \'best_f1\': Best F1 (with varying threshold)\n    \'best_f1_thresh\': No-answer probability threshold associated to the best F1\nExamples:\n\n    >>> predictions = [{\'prediction_text\': \'1976\', \'id\': \'56e10a3be3433e1400422b22\', \'no_answer_probability\': 0.}]\n    >>> references = [{\'answers\': {\'answer_start\': [97], \'text\': [\'1976\']}, \'id\': \'56e10a3be3433e1400422b22\'}]\n    >>> squad_v2_metric = datasets.load_metric("squad_v2")\n    >>> results = squad_v2_metric.compute(predictions=predictions, references=references)\n    >>> print(results)\n    {\'exact\': 100.0, \'f1\': 100.0, \'total\': 1, \'HasAns_exact\': 100.0, \'HasAns_f1\': 100.0, \'HasAns_total\': 1, \'best_exact\': 100.0, \'best_exact_thresh\': 0.0, \'best_f1\': 100.0, \'best_f1_thresh\': 0.0}\n'




@datasets.utils.file_utils.add_start_docstrings(_DESCRIPTION       ,			_KWARGS_DESCRIPTION  )
class        snake_case__				(datasets.Metric  ):
				"""simple docstring"""



				def 				__UpperCAmelCase				( self							:	List[str]				)   ->	Union[str, Any]:
							return datasets.MetricInfo(
							    description=_DESCRIPTION   , citation=_CITATION   , inputs_description=_KWARGS_DESCRIPTION   , features=datasets.Features(
							        {
							            "predictions": {
							                "id": datasets.Value("string"				),
							                "prediction_text": datasets.Value("string"				),
							                "no_answer_probability": datasets.Value("float32"				),
							            },
							            "references": {
							                "id": datasets.Value("string"				),
							                "answers": datasets.features.Sequence(
							                    {"text": datasets.Value("string"				), "answer_start": datasets.Value("int32"				)}				),
							            },
							        }				)   , codebase_urls=["https://rajpurkar.github.io/SQuAD-explorer/"]   , reference_urls=["https://rajpurkar.github.io/SQuAD-explorer/"]   , )





				def 				__UpperCAmelCase				( self							:	List[str]   , __lowerCamelCase							:	Tuple   , __lowerCamelCase							:	Optional[Any]   , __lowerCamelCase							:	Dict=1.0				)   ->	List[str]:
							a       =     {p["id"]: p["no_answer_probability"] for p in predictions}
							a       =     [{"paragraphs": [{"qas": references}]}]
							a       =     {p["id"]: p["prediction_text"] for p in predictions}

							a       =     make_qid_to_has_ans(__lowerCamelCase				)  # maps qid to True/False
							a       =     [k for k, v in qid_to_has_ans.items() if v]
							a       =     [k for k, v in qid_to_has_ans.items() if not v]

							a       ,						a       =     get_raw_scores(__lowerCamelCase   , __lowerCamelCase				)
							a       =     apply_no_ans_threshold(__lowerCamelCase   , __lowerCamelCase   , __lowerCamelCase   , __lowerCamelCase				)
							a       =     apply_no_ans_threshold(__lowerCamelCase   , __lowerCamelCase   , __lowerCamelCase   , __lowerCamelCase				)
							a       =     make_eval_dict(__lowerCamelCase   , __lowerCamelCase				)

							if has_ans_qids:
										a       =     make_eval_dict(__lowerCamelCase   , __lowerCamelCase   , qid_list=__lowerCamelCase				)
										merge_eval(__lowerCamelCase   , __lowerCamelCase   , "HasAns"				)
							if no_ans_qids:
										a       =     make_eval_dict(__lowerCamelCase   , __lowerCamelCase   , qid_list=__lowerCamelCase				)
										merge_eval(__lowerCamelCase   , __lowerCamelCase   , "NoAns"				)
							find_all_best_thresh(__lowerCamelCase   , __lowerCamelCase   , __lowerCamelCase   , __lowerCamelCase   , __lowerCamelCase   , __lowerCamelCase				)
							return dict(__lowerCamelCase				)






