

'''simple docstring'''





import datasets

from .evaluate import evaluate


UpperCamelCase_							=					"""\
@inproceedings{Rajpurkar2016SQuAD10,
  title={SQuAD: 100, 000+ Questions for Machine Comprehension of Text},
  author={Pranav Rajpurkar and Jian Zhang and Konstantin Lopyrev and Percy Liang},
  booktitle={EMNLP},
  year={2016}
}
"""

UpperCamelCase_							=					"""
This metric wrap the official scoring script for version 1 of the Stanford Question Answering Dataset (SQuAD).

Stanford Question Answering Dataset (SQuAD) is a reading comprehension dataset, consisting of questions posed by
crowdworkers on a set of Wikipedia articles, where the answer to every question is a segment of text, or span,
from the corresponding reading passage, or the question might be unanswerable.
"""

UpperCamelCase_							=					"""
Computes SQuAD scores (F1 and EM).
Args:
    predictions: List of question-answers dictionaries with the following key-values:
        - 'id': id of the question-answer pair as given in the references (see below)
        - 'prediction_text': the text of the answer
    references: List of question-answers dictionaries with the following key-values:
        - 'id': id of the question-answer pair (see above),
        - 'answers': a Dict in the SQuAD dataset format
            {
                'text': list of possible texts for the answer, as a list of strings
                'answer_start': list of start positions for the answer, as a list of ints
            }
            Note that answer_start values are not taken into account to compute the metric.
Returns:
    'exact_match': Exact match (the normalized answer exactly match the gold answer)
    'f1': The F-score of predicted tokens versus the gold answer
Examples:

    >>> predictions = [{'prediction_text': '1976', 'id': '56e10a3be3433e1400422b22'}]
    >>> references = [{'answers': {'answer_start': [97], 'text': ['1976']}, 'id': '56e10a3be3433e1400422b22'}]
    >>> squad_metric = datasets.load_metric(\"squad\")
    >>> results = squad_metric.compute(predictions=predictions, references=references)
    >>> print(results)
    {'exact_match': 100.0, 'f1': 100.0}
"""





@datasets.utils.file_utils.add_start_docstrings(_DESCRIPTION	,       _KWARGS_DESCRIPTION			)
class 		__SCREAMING_SNAKE_CASE       ( datasets.Metric			):







				def    lowerCamelCase_  (					self    :		List[Any]      ):
										'''simple docstring'''
										return datasets.MetricInfo(
										    description=_DESCRIPTION		,				citation=_CITATION		,				inputs_description=_KWARGS_DESCRIPTION		,				features=datasets.Features(
										        {
										            '''predictions''': {'''id''': datasets.Value('''string'''      ), '''prediction_text''': datasets.Value('''string'''      )},
										            '''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    lowerCamelCase_  (					self    :		str		,				UpperCAmelCase__    :		Union[str, Any]		,				UpperCAmelCase__    :		int      ):
										'''simple docstring'''
										lowercase   :       Dict								={prediction['''id''']: prediction['''prediction_text'''] for prediction in predictions}
										lowercase   :       str								=[
										    {
										        '''paragraphs''': [
										            {
										                '''qas''': [
										                    {
										                        '''answers''': [{'''text''': answer_text} for answer_text in ref['''answers''']['''text''']],
										                        '''id''': ref['''id'''],
										                    }
										                    for ref in references
										                ]
										            }
										        ]
										    }
										]
										lowercase   :       Dict								=evaluate(dataset=UpperCAmelCase__		,				predictions=UpperCAmelCase__      )
										return score








'''simple docstring'''





import mpmath  # for roots of unity
import numpy as np





class 		__SCREAMING_SNAKE_CASE       :







				def __init__(					self    :		Union[str, Any]		,				UpperCAmelCase__    :		List[Any]=None		,				UpperCAmelCase__    :		Optional[Any]=None      ):
										'''simple docstring'''
										# Input as list
										lowercase   :       Optional[int]								=list(poly_a or [0]      )[:]
										lowercase   :       Optional[Any]								=list(poly_b or [0]      )[:]

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

										while self.polyB[-1] == 0:
																self.polyB.pop()
										lowercase   :       Dict								=len(self.polyB      )

										# Add 0 to make lengths equal a power of 2
										lowercase   :       int								=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
										lowercase   :       Union[str, Any]								=complex(mpmath.root(x=1		,				n=self.c_max_length		,				k=1      )      )

										# The product
										lowercase   :       Tuple								=self.__multiply()







				def    lowerCamelCase_  (					self    :		Union[str, Any]		,				UpperCAmelCase__    :		Tuple      ):
										'''simple docstring'''
										lowercase   :       Union[str, 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]
										#
										lowercase   :       Any								=self.c_max_length // 2
										while next_ncol > 0:
																lowercase   :       Optional[int]								=[[] for i in range(UpperCAmelCase__      )]
																lowercase   :       Tuple								=self.root**next_ncol

																# First half of next step
																lowercase   :       str								=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
																lowercase   :       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
																lowercase   :       Dict								=new_dft
																lowercase   :       Tuple								=next_ncol // 2
										return dft[0]







				def    lowerCamelCase_  (					self    :		List[Any]      ):
										'''simple docstring'''
										lowercase   :       Any								=self.__dft('''A'''      )
										lowercase   :       Any								=self.__dft('''B'''      )
										lowercase   :       Optional[int]								=[[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
										lowercase   :       Optional[int]								=2
										while next_ncol <= self.c_max_length:
																lowercase   :       Optional[int]								=[[] for i in range(UpperCAmelCase__      )]
																lowercase   :       List[str]								=self.root ** (next_ncol // 2)
																lowercase   :       Optional[int]								=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
																lowercase   :       List[Any]								=new_inverse_c
																next_ncol *= 2
										# Unpack
										lowercase   :       Tuple								=[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    :		Any      ):
										'''simple docstring'''
										lowercase   :       Any								='''A = ''' + ''' + '''.join(
										    F'''{coef}*x^{i}''' for coef, i in enumerate(self.polyA[: self.len_A]      )      )
										lowercase   :       Tuple								='''B = ''' + ''' + '''.join(
										    F'''{coef}*x^{i}''' for coef, i in enumerate(self.polyB[: self.len_B]      )      )
										lowercase   :       List[str]								='''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()





