
from scipy.stats import pearsonr

import datasets


_lowerCamelCase     ="""
Pearson correlation coefficient and p-value for testing non-correlation.
The Pearson correlation coefficient measures the linear relationship between two datasets. The calculation of the p-value relies on the assumption that each dataset is normally distributed. Like other correlation coefficients, this one varies between -1 and +1 with 0 implying no correlation. Correlations of -1 or +1 imply an exact linear relationship. Positive correlations imply that as x increases, so does y. Negative correlations imply that as x increases, y decreases.
The p-value roughly indicates the probability of an uncorrelated system producing datasets that have a Pearson correlation at least as extreme as the one computed from these datasets.
"""


_lowerCamelCase     ="""
Args:
    predictions (`list` of `int`): Predicted class labels, as returned by a model.
    references (`list` of `int`): Ground truth labels.
    return_pvalue (`boolean`): If `True`, returns the p-value, along with the correlation coefficient. If `False`, returns only the correlation coefficient. Defaults to `False`.

Returns:
    pearsonr (`float`): Pearson correlation coefficient. Minimum possible value is -1. Maximum possible value is 1. Values of 1 and -1 indicate exact linear positive and negative relationships, respectively. A value of 0 implies no correlation.
    p-value (`float`): P-value, which roughly indicates the probability of an The p-value roughly indicates the probability of an uncorrelated system producing datasets that have a Pearson correlation at least as extreme as the one computed from these datasets. Minimum possible value is 0. Maximum possible value is 1. Higher values indicate higher probabilities.

Examples:

    Example 1-A simple example using only predictions and references.
        >>> pearsonr_metric = datasets.load_metric(\"pearsonr\")
        >>> results = pearsonr_metric.compute(predictions=[10, 9, 2.5, 6, 4], references=[1, 2, 3, 4, 5])
        >>> print(round(results['pearsonr'], 2))
        -0.74

    Example 2-The same as Example 1, but that also returns the `p-value`.
        >>> pearsonr_metric = datasets.load_metric(\"pearsonr\")
        >>> results = pearsonr_metric.compute(predictions=[10, 9, 2.5, 6, 4], references=[1, 2, 3, 4, 5], return_pvalue=True)
        >>> print(sorted(list(results.keys())))
        ['p-value', 'pearsonr']
        >>> print(round(results['pearsonr'], 2))
        -0.74
        >>> print(round(results['p-value'], 2))
        0.15
"""


_lowerCamelCase     ="""
@article{2020SciPy-NMeth,
author  = {Virtanen, Pauli and Gommers, Ralf and Oliphant, Travis E. and
      Haberland, Matt and Reddy, Tyler and Cournapeau, David and
      Burovski, Evgeni and Peterson, Pearu and Weckesser, Warren and
      Bright, Jonathan and {van der Walt}, St{\'e}fan J. and
      Brett, Matthew and Wilson, Joshua and Millman, K. Jarrod and
      Mayorov, Nikolay and Nelson, Andrew R. J. and Jones, Eric and
      Kern, Robert and Larson, Eric and Carey, C J and
      Polat, Ilhan and Feng, Yu and Moore, Eric W. and
      {VanderPlas}, Jake and Laxalde, Denis and Perktold, Josef and
      Cimrman, Robert and Henriksen, Ian and Quintero, E. A. and
      Harris, Charles R. and Archibald, Anne M. and
      Ribeiro, Antonio H. and Pedregosa, Fabian and
      {van Mulbregt}, Paul and {SciPy 1.0 Contributors}},
title   = {{{SciPy} 1.0: Fundamental Algorithms for Scientific
      Computing in Python}},
journal = {Nature Methods},
year    = {2020},
volume  = {17},
pages   = {261--272},
adsurl  = {https://rdcu.be/b08Wh},
doi = {10.1038/s41592-019-0686-2},
}
"""





@datasets.utils.file_utils.add_start_docstrings(_DESCRIPTION    ,  _KWARGS_DESCRIPTION)
class 				A__						(      datasets.Metric):
      def 		UpperCamelCase__				( self ):
       return datasets.MetricInfo(
           description=_DESCRIPTION       ,    citation=_CITATION       ,    inputs_description=_KWARGS_DESCRIPTION       ,    features=datasets.Features(
               {
                   """predictions""": datasets.Value("""float""" ),
                   """references""": datasets.Value("""float""" ),
               } )       ,    reference_urls=["""https://docs.scipy.org/doc/scipy/reference/generated/scipy.stats.pearsonr.html"""]       ,    )






      def 		UpperCamelCase__				( self       ,    __magic_name__       ,    __magic_name__       ,    __magic_name__=False ):
       if return_pvalue:
        lowerCamelCase						:      str							     = pearsonr(__lowerCAmelCase       ,    __lowerCAmelCase )
        return {"pearsonr": results[0], "p-value": results[1]}
       else:
        return {"pearsonr": float(pearsonr(__lowerCAmelCase       ,    __lowerCAmelCase )[0] )}












import numpy as np
import torch
from torch.utils.data import Dataset

from utils import logger
class     lowerCamelCase_					(   lowerCamelCase			):







				def __init__(    self							,       __lowerCAmelCase							,       __lowerCAmelCase  ):
								"""simple docstring"""
								__magic_name__		:Optional[int]   =   params

								__magic_name__		:Any   =   np.array(__lowerCAmelCase  )
								__magic_name__		:Optional[Any]   =   np.array([len(__lowerCAmelCase  ) for t in data]  )

								self.check()
								self.remove_long_sequences()
								self.remove_empty_sequences()
								self.remove_unknown_sequences()
								self.check()
								self.print_statistics()







				def __getitem__(    self							,       __lowerCAmelCase  ):
								"""simple docstring"""
								return (self.token_ids[index], self.lengths[index])







				def __len__(    self  ):
								"""simple docstring"""
								return len(self.lengths  )







				def       A						(    self  ):
								"""simple docstring"""
								assert len(self.token_ids  ) == len(self.lengths  )
								assert all(self.lengths[i] == len(self.token_ids[i]  ) for i in range(len(self.lengths  )  )  )







				def       A						(    self  ):
								"""simple docstring"""
								__magic_name__		:Any   =   self.params.max_model_input_size
								__magic_name__		:int   =   self.lengths > max_len
								logger.info(F'''Splitting {sum(__lowerCAmelCase  )} too long sequences.'''  )

								def divide_chunks(__lowerCAmelCase							,       __lowerCAmelCase  ):
												return [l[i : i + n] for i in range(0							,       len(__lowerCAmelCase  )							,       __lowerCAmelCase  )]

								__magic_name__		:Optional[int]   =   []
								__magic_name__		:List[Any]   =   []
								if self.params.mlm:
												__magic_name__  ,					__magic_name__		:Optional[Any]   =   self.params.special_tok_ids['''cls_token'''], self.params.special_tok_ids['''sep_token''']
								else:
												__magic_name__  ,					__magic_name__		:Tuple   =   self.params.special_tok_ids['''bos_token'''], self.params.special_tok_ids['''eos_token''']

								for seq_, len_ in zip(self.token_ids							,       self.lengths  ):
												assert (seq_[0] == cls_id) and (seq_[-1] == sep_id), seq_
												if len_ <= max_len:
																new_tok_ids.append(seq_  )
																new_lengths.append(len_  )
												else:
																__magic_name__		:int   =   []
																for sub_s in divide_chunks(seq_							,       max_len - 2  ):
																				if sub_s[0] != cls_id:
																								__magic_name__		:List[Any]   =   np.insert(__lowerCAmelCase							,       0							,       __lowerCAmelCase  )
																				if sub_s[-1] != sep_id:
																								__magic_name__		:Union[str, Any]   =   np.insert(__lowerCAmelCase							,       len(__lowerCAmelCase  )							,       __lowerCAmelCase  )
																				assert len(__lowerCAmelCase  ) <= max_len
																				assert (sub_s[0] == cls_id) and (sub_s[-1] == sep_id), sub_s
																				sub_seqs.append(__lowerCAmelCase  )

																new_tok_ids.extend(__lowerCAmelCase  )
																new_lengths.extend([len(__lowerCAmelCase  ) for l in sub_seqs]  )

								__magic_name__		:Tuple   =   np.array(__lowerCAmelCase  )
								__magic_name__		:Optional[int]   =   np.array(__lowerCAmelCase  )







				def       A						(    self  ):
								"""simple docstring"""
								__magic_name__		:Optional[Any]   =   len(self  )
								__magic_name__		:int   =   self.lengths > 1_1
								__magic_name__		:List[str]   =   self.token_ids[indices]
								__magic_name__		:Union[str, Any]   =   self.lengths[indices]
								__magic_name__		:List[str]   =   len(self  )
								logger.info(F'''Remove {init_size - new_size} too short (<=11 tokens) sequences.'''  )







				def       A						(    self  ):
								"""simple docstring"""
								if "unk_token" not in self.params.special_tok_ids:
												return
								else:
												__magic_name__		:Tuple   =   self.params.special_tok_ids['''unk_token''']
								__magic_name__		:Dict   =   len(self  )
								__magic_name__		:Tuple   =   np.array([np.count_nonzero(a == unk_token_id  ) for a in self.token_ids]  )
								__magic_name__		:int   =   (unk_occs / self.lengths) < 0.5
								__magic_name__		:str   =   self.token_ids[indices]
								__magic_name__		:str   =   self.lengths[indices]
								__magic_name__		:Any   =   len(self  )
								logger.info(F'''Remove {init_size - new_size} sequences with a high level of unknown tokens (50%).'''  )







				def       A						(    self  ):
								"""simple docstring"""
								if not self.params.is_master:
												return
								logger.info(F'''{len(self  )} sequences'''  )
								# data_len = sum(self.lengths)
								# nb_unique_tokens = len(Counter(list(chain(*self.token_ids))))
								# logger.info(f'{data_len} tokens ({nb_unique_tokens} unique)')

								# unk_idx = self.params.special_tok_ids['unk_token']
								# nb_unknown = sum([(t==unk_idx).sum() for t in self.token_ids])
								# logger.info(f'{nb_unknown} unknown tokens (covering {100*nb_unknown/data_len:.2f}% of the data)')







				def       A						(    self							,       __lowerCAmelCase  ):
								"""simple docstring"""
								__magic_name__		:Optional[Any]   =   [t[0] for t in batch]
								__magic_name__		:List[Any]   =   [t[1] for t in batch]
								assert len(__lowerCAmelCase  ) == len(__lowerCAmelCase  )

								# Max for paddings
								__magic_name__		:Tuple   =   max(__lowerCAmelCase  )

								# Pad token ids
								if self.params.mlm:
												__magic_name__		:Any   =   self.params.special_tok_ids['''pad_token''']
								else:
												__magic_name__		:str   =   self.params.special_tok_ids['''unk_token''']
								__magic_name__		:Any   =   [list(t.astype(__lowerCAmelCase  )  ) + [pad_idx] * (max_seq_len_ - len(__lowerCAmelCase  )) for t in token_ids]
								assert len(tk_  ) == len(__lowerCAmelCase  )
								assert all(len(__lowerCAmelCase  ) == max_seq_len_ for t in tk_  )

								__magic_name__		:Optional[int]   =   torch.tensor(tk_  )  # (bs, max_seq_len_)
								__magic_name__		:Optional[int]   =   torch.tensor(__lowerCAmelCase  )  # (bs)
								return tk_t, lg_t






