






'''simple docstring'''
def 	_a(					UpperCamelCase__			:  Tuple,		UpperCamelCase__			:  Any							):




      '''simple docstring'''






      SCREAMING_SNAKE_CASE__       :			List[str]													=0
      SCREAMING_SNAKE_CASE__       :			List[Any]													=len(UpperCamelCase__							) - 1

      while left <= right:
            # avoid divided by 0 during interpolation
            if sorted_collection[left] == sorted_collection[right]:
                  if sorted_collection[left] == item:
                        return left
                  else:
                        return None

            SCREAMING_SNAKE_CASE__       :			Any													=left + ((item - sorted_collection[left]) * (right - left)) // (
                sorted_collection[right] - sorted_collection[left]
            )

            # out of range check
            if point < 0 or point >= len(UpperCamelCase__							):
                  return None

            SCREAMING_SNAKE_CASE__       :			Optional[int]													=sorted_collection[point]
            if current_item == item:
                  return point
            else:
                  if point < left:
                        SCREAMING_SNAKE_CASE__       :			Tuple													=left
                        SCREAMING_SNAKE_CASE__       :			Optional[Any]													=point
                  elif point > right:
                        SCREAMING_SNAKE_CASE__       :			str													=right
                        SCREAMING_SNAKE_CASE__       :			Optional[int]													=point
                  else:
                        if item < current_item:
                              SCREAMING_SNAKE_CASE__       :			Tuple													=point - 1
                        else:
                              SCREAMING_SNAKE_CASE__       :			Any													=point + 1
      return None





def 	_a(					UpperCamelCase__			:  int,		UpperCamelCase__			:  int,		UpperCamelCase__			:  Tuple,		UpperCamelCase__			:  List[str]							):




      '''simple docstring'''






      if sorted_collection[left] == sorted_collection[right]:
            if sorted_collection[left] == item:
                  return left
            else:
                  return None

      SCREAMING_SNAKE_CASE__       :			Tuple													=left + ((item - sorted_collection[left]) * (right - left)) // (
          sorted_collection[right] - sorted_collection[left]
      )

      # out of range check
      if point < 0 or point >= len(UpperCamelCase__							):
            return None

      if sorted_collection[point] == item:
            return point
      elif point < left:
            return interpolation_search_by_recursion(UpperCamelCase__,		UpperCamelCase__,		UpperCamelCase__,		UpperCamelCase__							)
      elif point > right:
            return interpolation_search_by_recursion(UpperCamelCase__,		UpperCamelCase__,		UpperCamelCase__,		UpperCamelCase__							)
      else:
            if sorted_collection[point] > item:
                  return interpolation_search_by_recursion(
                      UpperCamelCase__,		UpperCamelCase__,		UpperCamelCase__,		point - 1							)
            else:
                  return interpolation_search_by_recursion(
                      UpperCamelCase__,		UpperCamelCase__,		point + 1,		UpperCamelCase__							)





def 	_a(					UpperCamelCase__			:  Union[str, Any]							):




      '''simple docstring'''






      if collection != sorted(UpperCamelCase__							):
            raise ValueError('''Collection must be ascending sorted'''							)
      return True


if __name__ == "__main__":
  import sys
  a_					=	0
  if debug == 1:
    a_					=	[1_0, 3_0, 4_0, 4_5, 5_0, 6_6, 7_7, 9_3]
    try:
      __assert_sorted(collection)
    except ValueError:
      sys.exit('Sequence must be ascending sorted to apply interpolation search')
    a_					=	6_7

  a_					=	interpolation_search(collection, target)
  if result is not None:
    print(F'''{target} found at positions: {result}''')
  else:
    print('Not found')







'''simple docstring'''
from scipy.stats import pearsonr

import datasets


a_					=	'\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_					=	'\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_					=	'\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        __SCREAMING_SNAKE_CASE (     datasets.Metric			):




 def        __magic_name__		( self		:							List[Any] )		->  Any:
       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        __magic_name__		( self		:							Optional[int]   , __lowercase		:							List[Any]   , __lowercase		:							List[Any]   , __lowercase		:							str=False )		->  int:
       if return_pvalue:
             SCREAMING_SNAKE_CASE__       :			List[str]													=pearsonr(__lowercase   , __lowercase )
             return {"pearsonr": results[0], "p-value": results[1]}
       else:
             return {"pearsonr": float(pearsonr(__lowercase   , __lowercase )[0] )}