


from scipy.stats import pearsonr

import datasets


a : str		=				"\nPearson correlation coefficient and p-value for testing non-correlation.\nThe 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.\nThe 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.\n"


a : str		=				"\nArgs:\n    predictions (`list` of `int`): Predicted class labels, as returned by a model.\n    references (`list` of `int`): Ground truth labels.\n    return_pvalue (`boolean`): If `True`, returns the p-value, along with the correlation coefficient. If `False`, returns only the correlation coefficient. Defaults to `False`.\n\nReturns:\n    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.\n    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.\n\nExamples:\n\n    Example 1-A simple example using only predictions and references.\n        >>> pearsonr_metric = datasets.load_metric(\"pearsonr\")\n        >>> results = pearsonr_metric.compute(predictions=[10, 9, 2.5, 6, 4], references=[1, 2, 3, 4, 5])\n        >>> print(round(results['pearsonr'], 2))\n        -0.74\n\n    Example 2-The same as Example 1, but that also returns the `p-value`.\n        >>> pearsonr_metric = datasets.load_metric(\"pearsonr\")\n        >>> results = pearsonr_metric.compute(predictions=[10, 9, 2.5, 6, 4], references=[1, 2, 3, 4, 5], return_pvalue=True)\n        >>> print(sorted(list(results.keys())))\n        ['p-value', 'pearsonr']\n        >>> print(round(results['pearsonr'], 2))\n        -0.74\n        >>> print(round(results['p-value'], 2))\n        0.15\n"


a : Dict		=				"\n@article{2020SciPy-NMeth,\nauthor  = {Virtanen, Pauli and Gommers, Ralf and Oliphant, Travis E. and\n      Haberland, Matt and Reddy, Tyler and Cournapeau, David and\n      Burovski, Evgeni and Peterson, Pearu and Weckesser, Warren and\n      Bright, Jonathan and {van der Walt}, St{\'e}fan J. and\n      Brett, Matthew and Wilson, Joshua and Millman, K. Jarrod and\n      Mayorov, Nikolay and Nelson, Andrew R. J. and Jones, Eric and\n      Kern, Robert and Larson, Eric and Carey, C J and\n      Polat, Ilhan and Feng, Yu and Moore, Eric W. and\n      {VanderPlas}, Jake and Laxalde, Denis and Perktold, Josef and\n      Cimrman, Robert and Henriksen, Ian and Quintero, E. A. and\n      Harris, Charles R. and Archibald, Anne M. and\n      Ribeiro, Antonio H. and Pedregosa, Fabian and\n      {van Mulbregt}, Paul and {SciPy 1.0 Contributors}},\ntitle   = {{{SciPy} 1.0: Fundamental Algorithms for Scientific\n      Computing in Python}},\njournal = {Nature Methods},\nyear    = {2020},\nvolume  = {17},\npages   = {261--272},\nadsurl  = {https://rdcu.be/b08Wh},\ndoi = {10.1038/s41592-019-0686-2},\n}\n"
@datasets.utils.file_utils.add_start_docstrings(_DESCRIPTION     ,     _KWARGS_DESCRIPTION				)
class 	lowerCamelCase_       (				datasets.Metric				):



					'''simple docstring'''







					def A      (				self						)   ->			Union[str, Any]:







								'''simple docstring'''

								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 A      (				self ,       snake_case_ ,       snake_case_ ,       snake_case_=False						)   ->			Tuple:







								'''simple docstring'''

								if return_pvalue:
											__lowercase 					=   pearsonr(A__ ,       A__						)
											return {"pearsonr": results[0], "p-value": results[1]}
								else:
											return {"pearsonr": float(pearsonr(A__ ,       A__						)[0]						)}






import json
import os
from functools import lru_cache
from typing import List, Optional, Tuple

import regex as re

from ...tokenization_utils import AddedToken, PreTrainedTokenizer
from ...utils import logging


a : Union[str, Any]		=				logging.get_logger(__name__)


a : Union[str, Any]		=				{'''vocab_file''': '''vocab.json''', '''merges_file''': '''merges.txt'''}

a : Union[str, Any]		=				{
    '''vocab_file''': {
        '''allenai/longformer-base-4096''': '''https://huggingface.co/allenai/longformer-base-4096/resolve/main/vocab.json''',
        '''allenai/longformer-large-4096''': (
            '''https://huggingface.co/allenai/longformer-large-4096/resolve/main/vocab.json'''
        ),
        '''allenai/longformer-large-4096-finetuned-triviaqa''': (
            '''https://huggingface.co/allenai/longformer-large-4096-finetuned-triviaqa/resolve/main/vocab.json'''
        ),
        '''allenai/longformer-base-4096-extra.pos.embd.only''': (
            '''https://huggingface.co/allenai/longformer-base-4096-extra.pos.embd.only/resolve/main/vocab.json'''
        ),
        '''allenai/longformer-large-4096-extra.pos.embd.only''': (
            '''https://huggingface.co/allenai/longformer-large-4096-extra.pos.embd.only/resolve/main/vocab.json'''
        ),
    },
    '''merges_file''': {
        '''allenai/longformer-base-4096''': '''https://huggingface.co/allenai/longformer-base-4096/resolve/main/merges.txt''',
        '''allenai/longformer-large-4096''': (
            '''https://huggingface.co/allenai/longformer-large-4096/resolve/main/merges.txt'''
        ),
        '''allenai/longformer-large-4096-finetuned-triviaqa''': (
            '''https://huggingface.co/allenai/longformer-large-4096-finetuned-triviaqa/resolve/main/merges.txt'''
        ),
        '''allenai/longformer-base-4096-extra.pos.embd.only''': (
            '''https://huggingface.co/allenai/longformer-base-4096-extra.pos.embd.only/resolve/main/merges.txt'''
        ),
        '''allenai/longformer-large-4096-extra.pos.embd.only''': (
            '''https://huggingface.co/allenai/longformer-large-4096-extra.pos.embd.only/resolve/main/merges.txt'''
        ),
    },
}

a : Dict		=				{
    '''allenai/longformer-base-4096''': 4096,
    '''allenai/longformer-large-4096''': 4096,
    '''allenai/longformer-large-4096-finetuned-triviaqa''': 4096,
    '''allenai/longformer-base-4096-extra.pos.embd.only''': 4096,
    '''allenai/longformer-large-4096-extra.pos.embd.only''': 4096,
}


@lru_cache()
# Copied from transformers.models.roberta.tokenization_roberta.bytes_to_unicode
def 		lowercase_  (     ):


			'''simple docstring'''







			__lowercase 					=   (
			    list(range(ord('''!'''  )       ,			ord('''~'''  ) + 1  )  ) + list(range(ord('''¡'''  )       ,			ord('''¬'''  ) + 1  )  ) + list(range(ord('''®'''  )       ,			ord('''ÿ'''  ) + 1  )  )
			)
			__lowercase 					=   bs[:]
			__lowercase 					=   0
			for b in range(2**8  ):
						if b not in bs:
									bs.append(_UpperCamelCase  )
									cs.append(2**8 + n  )
									n += 1
			__lowercase 					=   [chr(_UpperCamelCase  ) for n in cs]
			return dict(zip(_UpperCamelCase       ,			_UpperCamelCase  )  )


def 		lowercase_  (     _UpperCamelCase  ):


			'''simple docstring'''







			__lowercase 					=   set()
			__lowercase 					=   word[0]
			for char in word[1:]:
						pairs.add((prev_char, char)  )
						__lowercase 					=   char
			return pairs





class 	lowerCamelCase_       (				lowerCAmelCase__				):



					'''simple docstring'''







					__UpperCAmelCase            =				VOCAB_FILES_NAMES
					__UpperCAmelCase            =				PRETRAINED_VOCAB_FILES_MAP
					__UpperCAmelCase            =				PRETRAINED_POSITIONAL_EMBEDDINGS_SIZES
					__UpperCAmelCase            =				["input_ids", "attention_mask"]






					def __init__(				self ,       snake_case_ ,       snake_case_ ,       snake_case_="replace" ,       snake_case_="<s>" ,       snake_case_="</s>" ,       snake_case_="</s>" ,       snake_case_="<s>" ,       snake_case_="<unk>" ,       snake_case_="<pad>" ,       snake_case_="<mask>" ,       snake_case_=False ,       **snake_case_ ,       )   ->			Optional[int]:







								'''simple docstring'''

								__lowercase 					=   AddedToken(snake_case_ ,       lstrip=snake_case_ ,       rstrip=snake_case_						) if isinstance(snake_case_ ,       snake_case_						) else bos_token
								__lowercase 					=   AddedToken(snake_case_ ,       lstrip=snake_case_ ,       rstrip=snake_case_						) if isinstance(snake_case_ ,       snake_case_						) else eos_token
								__lowercase 					=   AddedToken(snake_case_ ,       lstrip=snake_case_ ,       rstrip=snake_case_						) if isinstance(snake_case_ ,       snake_case_						) else sep_token
								__lowercase 					=   AddedToken(snake_case_ ,       lstrip=snake_case_ ,       rstrip=snake_case_						) if isinstance(snake_case_ ,       snake_case_						) else cls_token
								__lowercase 					=   AddedToken(snake_case_ ,       lstrip=snake_case_ ,       rstrip=snake_case_						) if isinstance(snake_case_ ,       snake_case_						) else unk_token
								__lowercase 					=   AddedToken(snake_case_ ,       lstrip=snake_case_ ,       rstrip=snake_case_						) if isinstance(snake_case_ ,       snake_case_						) else pad_token

								# Mask token behave like a normal word, i.e. include the space before it
								__lowercase 					=   AddedToken(snake_case_ ,       lstrip=snake_case_ ,       rstrip=snake_case_						) if isinstance(snake_case_ ,       snake_case_						) else mask_token

								super().__init__(
								    errors=snake_case_ ,       bos_token=snake_case_ ,       eos_token=snake_case_ ,       unk_token=snake_case_ ,       sep_token=snake_case_ ,       cls_token=snake_case_ ,       pad_token=snake_case_ ,       mask_token=snake_case_ ,       add_prefix_space=snake_case_ ,       **snake_case_ ,       )

								with open(snake_case_ ,       encoding='''utf-8'''						) as vocab_handle:
											__lowercase 					=   json.load(snake_case_						)
								__lowercase 					=   {v: k for k, v in self.encoder.items()}
								__lowercase 					=   errors  # how to handle errors in decoding
								__lowercase 					=   bytes_to_unicode()
								__lowercase 					=   {v: k for k, v in self.byte_encoder.items()}
								with open(snake_case_ ,       encoding='''utf-8'''						) as merges_handle:
											__lowercase 					=   merges_handle.read().split('''\n'''						)[1:-1]
								__lowercase 					=   [tuple(merge.split()						) for merge in bpe_merges]
								__lowercase 					=   dict(zip(snake_case_ ,       range(len(snake_case_						)						)						)						)
								__lowercase 					=   {}
								__lowercase 					=   add_prefix_space

								# Should have added re.IGNORECASE so BPE merges can happen for capitalized versions of contractions
								__lowercase 					=   re.compile(r'''\'s|\'t|\'re|\'ve|\'m|\'ll|\'d| ?\p{L}+| ?\p{N}+| ?[^\s\p{L}\p{N}]+|\s+(?!\S)|\s+'''						)






					@property
					def A      (				self						)   ->			List[str]:







								'''simple docstring'''

								return len(self.encoder						)






					def A      (				self						)   ->			Union[str, Any]:







								'''simple docstring'''

								return dict(self.encoder ,       **self.added_tokens_encoder						)






					def A      (				self ,       snake_case_						)   ->			List[str]:







								'''simple docstring'''

								if token in self.cache:
											return self.cache[token]
								__lowercase 					=   tuple(snake_case_						)
								__lowercase 					=   get_pairs(snake_case_						)

								if not pairs:
											return token

								while True:
											__lowercase 					=   min(snake_case_ ,       key=lambda snake_case_						: self.bpe_ranks.get(snake_case_ ,       float('''inf'''						)						)						)
											if bigram not in self.bpe_ranks:
														break
											__lowercase					, __lowercase 					=   bigram
											__lowercase 					=   []
											__lowercase 					=   0
											while i < len(snake_case_						):
														try:
																	__lowercase 					=   word.index(snake_case_ ,       snake_case_						)
														except ValueError:
																	new_word.extend(word[i:]						)
																	break
														else:
																	new_word.extend(word[i:j]						)
																	__lowercase 					=   j

														if word[i] == first and i < len(snake_case_						) - 1 and word[i + 1] == second:
																	new_word.append(first + second						)
																	i += 2
														else:
																	new_word.append(word[i]						)
																	i += 1
											__lowercase 					=   tuple(snake_case_						)
											__lowercase 					=   new_word
											if len(snake_case_						) == 1:
														break
											else:
														__lowercase 					=   get_pairs(snake_case_						)
								__lowercase 					=   ''' '''.join(snake_case_						)
								__lowercase 					=   word
								return word






					def A      (				self ,       snake_case_						)   ->			Union[str, Any]:







								'''simple docstring'''

								__lowercase 					=   []
								for token in re.findall(self.pat ,       snake_case_						):
											__lowercase 					=   ''''''.join(
											    self.byte_encoder[b] for b in token.encode('''utf-8'''						)						)  # Maps all our bytes to unicode strings, avoiding control tokens of the BPE (spaces in our case)
											bpe_tokens.extend(bpe_token for bpe_token in self.bpe(snake_case_						).split(''' '''						)						)
								return bpe_tokens






					def A      (				self ,       snake_case_						)   ->			Any:







								'''simple docstring'''

								return self.encoder.get(snake_case_ ,       self.encoder.get(self.unk_token						)						)






					def A      (				self ,       snake_case_						)   ->			Dict:







								'''simple docstring'''

								return self.decoder.get(snake_case_						)






					def A      (				self ,       snake_case_						)   ->			List[str]:







								'''simple docstring'''

								__lowercase 					=   ''''''.join(snake_case_						)
								__lowercase 					=   bytearray([self.byte_decoder[c] for c in text]						).decode('''utf-8''' ,       errors=self.errors						)
								return text






					def A      (				self ,       snake_case_ ,       snake_case_ = None						)   ->			Tuple[str]:







								'''simple docstring'''

								if not os.path.isdir(snake_case_						):
											logger.error(F'Vocabulary path ({save_directory}) should be a directory'						)
											return
								__lowercase 					=   os.path.join(
								    snake_case_ ,       (filename_prefix + '''-''' if filename_prefix else '''''') + VOCAB_FILES_NAMES['''vocab_file''']						)
								__lowercase 					=   os.path.join(
								    snake_case_ ,       (filename_prefix + '''-''' if filename_prefix else '''''') + VOCAB_FILES_NAMES['''merges_file''']						)

								with open(snake_case_ ,       '''w''' ,       encoding='''utf-8'''						) as f:
											f.write(json.dumps(self.encoder ,       indent=2 ,       sort_keys=snake_case_ ,       ensure_ascii=snake_case_						) + '''\n'''						)

								__lowercase 					=   0
								with open(snake_case_ ,       '''w''' ,       encoding='''utf-8'''						) as writer:
											writer.write('''#version: 0.2\n'''						)
											for bpe_tokens, token_index in sorted(self.bpe_ranks.items() ,       key=lambda snake_case_						: kv[1]						):
														if index != token_index:
																	logger.warning(
																	    F'Saving vocabulary to {merge_file}: BPE merge indices are not consecutive.'
																	    ''' Please check that the tokenizer is not corrupted!'''						)
																	__lowercase 					=   token_index
														writer.write(''' '''.join(snake_case_						) + '''\n'''						)
														index += 1

								return vocab_file, merge_file






					def A      (				self ,       snake_case_ ,       snake_case_ = None						)   ->			List[int]:







								'''simple docstring'''

								if token_ids_a is None:
											return [self.cls_token_id] + token_ids_a + [self.sep_token_id]
								__lowercase 					=   [self.cls_token_id]
								__lowercase 					=   [self.sep_token_id]
								return cls + token_ids_a + sep + sep + token_ids_a + sep






					def A      (				self ,       snake_case_ ,       snake_case_ = None ,       snake_case_ = False						)   ->			List[int]:







								'''simple docstring'''

								if already_has_special_tokens:
											return super().get_special_tokens_mask(
											    token_ids_a=snake_case_ ,       token_ids_a=snake_case_ ,       already_has_special_tokens=snake_case_						)

								if token_ids_a is None:
											return [1] + ([0] * len(snake_case_						)) + [1]
								return [1] + ([0] * len(snake_case_						)) + [1, 1] + ([0] * len(snake_case_						)) + [1]






					def A      (				self ,       snake_case_ ,       snake_case_ = None						)   ->			List[int]:







								'''simple docstring'''

								__lowercase 					=   [self.sep_token_id]
								__lowercase 					=   [self.cls_token_id]

								if token_ids_a is None:
											return len(cls + token_ids_a + sep						) * [0]
								return len(cls + token_ids_a + sep + sep + token_ids_a + sep						) * [0]






					def A      (				self ,       snake_case_ ,       snake_case_=False ,       **snake_case_						)   ->			Union[str, Any]:







								'''simple docstring'''

								__lowercase 					=   kwargs.pop('''add_prefix_space''' ,       self.add_prefix_space						)
								if (is_split_into_words or add_prefix_space) and (len(snake_case_						) > 0 and not text[0].isspace()):
											__lowercase 					=   ''' ''' + text
								return (text, kwargs)


