import numpy as np

import datasets


__lowercase											=      '''
Compute the Mahalanobis Distance

Mahalonobis distance is the distance between a point and a distribution.
And not between two distinct points. It is effectively a multivariate equivalent of the Euclidean distance.
It was introduced by Prof. P. C. Mahalanobis in 1936
and has been used in various statistical applications ever since
[source: https://www.machinelearningplus.com/statistics/mahalanobis-distance/]
'''

__lowercase											=      '''\
@article{de2000mahalanobis,
  title={The mahalanobis distance},
  author={De Maesschalck, Roy and Jouan-Rimbaud, Delphine and Massart, D{\'e}sir{\'e} L},
  journal={Chemometrics and intelligent laboratory systems},
  volume={50},
  number={1},
  pages={1--18},
  year={2000},
  publisher={Elsevier}
}
'''

__lowercase											=      '''
Args:
    X: List of datapoints to be compared with the `reference_distribution`.
    reference_distribution: List of datapoints from the reference distribution we want to compare to.
Returns:
    mahalanobis: The Mahalonobis distance for each datapoint in `X`.
Examples:

    >>> mahalanobis_metric = datasets.load_metric("mahalanobis")
    >>> results = mahalanobis_metric.compute(reference_distribution=[[0, 1], [1, 0]], X=[[0, 1]])
    >>> print(results)
    {\'mahalanobis\': array([0.5])}
'''


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






    '''simple docstring'''






    def     UpperCamelCase__     (			self) ->			Dict:
        return datasets.MetricInfo(
            description=_DESCRIPTION				,				citation=_CITATION				,				inputs_description=_KWARGS_DESCRIPTION				,				features=datasets.Features(
                {
                    '''X''': datasets.Sequence(datasets.Value('''float'''				,				id='''sequence''')				,				id='''X'''),
                })				,				)







    def     UpperCamelCase__     (			self				,				__lowercase				,				__lowercase) ->			Tuple:
        # convert to numpy arrays
        __UpperCamelCase  :Optional[int]    						=	np.array(snake_case__)
        __UpperCamelCase  :Any    						=	np.array(snake_case__)

        # Assert that arrays are 2D
        if len(X.shape) != 2:
            raise ValueError('''Expected `X` to be a 2D vector''')
        if len(reference_distribution.shape) != 2:
            raise ValueError('''Expected `reference_distribution` to be a 2D vector''')
        if reference_distribution.shape[0] < 2:
            raise ValueError(
                '''Expected `reference_distribution` to be a 2D vector with more than one element in the first dimension''')

        # Get mahalanobis distance for each prediction
        __UpperCamelCase  :Any    						=	X - np.mean(snake_case__)
        __UpperCamelCase  :int    						=	np.cov(reference_distribution.T)
        try:
            __UpperCamelCase  :Any    						=	np.linalg.inv(snake_case__)
        except np.linalg.LinAlgError:
            __UpperCamelCase  :Dict    						=	np.linalg.pinv(snake_case__)
        __UpperCamelCase  :Optional[int]    						=	np.dot(snake_case__				,				snake_case__)
        __UpperCamelCase  :str    						=	np.dot(snake_case__				,				X_minus_mu.T).diagonal()

        return {"mahalanobis": mahal_dist}






import time
from dataclasses import dataclass
from multiprocessing import Pool
from unittest import TestCase
from unittest.mock import patch

import multiprocess
import numpy as np
import pytest

from datasets.utils.py_utils import (
    NestedDataStructure,
    asdict,
    iflatmap_unordered,
    map_nested,
    temp_seed,
    temporary_assignment,
    zip_dict,
)

from .utils import require_tf, require_torch



def lowerCamelCase						(     SCREAMING_SNAKE_CASE			):  # picklable for multiprocessing
    '''simple docstring'''







    return x.sum()



def lowerCamelCase						(     SCREAMING_SNAKE_CASE			):  # picklable for multiprocessing
    '''simple docstring'''







    return i + 1


@dataclass
class 			lowerCamelCase_  :






    '''simple docstring'''






    a__			:		int
    a__			:		str


class 			lowerCamelCase_  (     UpperCAmelCase_				):






    '''simple docstring'''






    def     UpperCamelCase__     (			self) ->			int:
        __UpperCamelCase  :Dict    						=	{}
        __UpperCamelCase  :int    						=	[]
        __UpperCamelCase  :int    						=	1
        __UpperCamelCase  :int    						=	[1, 2]
        __UpperCamelCase  :Optional[Any]    						=	{'''a''': 1, '''b''': 2}
        __UpperCamelCase  :Dict    						=	{'''a''': [1, 2], '''b''': [3, 4]}
        __UpperCamelCase  :Optional[int]    						=	{'''a''': {'''1''': 1}, '''b''': 2}
        __UpperCamelCase  :Optional[Any]    						=	{'''a''': 1, '''b''': 2, '''c''': 3, '''d''': 4}
        __UpperCamelCase  :str    						=	{}
        __UpperCamelCase  :Any    						=	[]
        __UpperCamelCase  :Optional[Any]    						=	2
        __UpperCamelCase  :Optional[int]    						=	[2, 3]
        __UpperCamelCase  :List[Any]    						=	{'''a''': 2, '''b''': 3}
        __UpperCamelCase  :List[str]    						=	{'''a''': [2, 3], '''b''': [4, 5]}
        __UpperCamelCase  :int    						=	{'''a''': {'''1''': 2}, '''b''': 3}
        __UpperCamelCase  :Union[str, Any]    						=	{'''a''': 2, '''b''': 3, '''c''': 4, '''d''': 5}
        self.assertEqual(map_nested(__lowercase				,				__lowercase)				,				__lowercase)
        self.assertEqual(map_nested(__lowercase				,				__lowercase)				,				__lowercase)
        self.assertEqual(map_nested(__lowercase				,				__lowercase)				,				__lowercase)
        self.assertEqual(map_nested(__lowercase				,				__lowercase)				,				__lowercase)
        self.assertEqual(map_nested(__lowercase				,				__lowercase)				,				__lowercase)
        self.assertEqual(map_nested(__lowercase				,				__lowercase)				,				__lowercase)
        self.assertEqual(map_nested(__lowercase				,				__lowercase)				,				__lowercase)
        self.assertEqual(map_nested(__lowercase				,				__lowercase)				,				__lowercase)

        __UpperCamelCase  :Optional[Any]    						=	2
        self.assertEqual(map_nested(__lowercase				,				__lowercase				,				num_proc=__lowercase)				,				__lowercase)
        self.assertEqual(map_nested(__lowercase				,				__lowercase				,				num_proc=__lowercase)				,				__lowercase)
        self.assertEqual(map_nested(__lowercase				,				__lowercase				,				num_proc=__lowercase)				,				__lowercase)
        self.assertEqual(map_nested(__lowercase				,				__lowercase				,				num_proc=__lowercase)				,				__lowercase)
        self.assertEqual(map_nested(__lowercase				,				__lowercase				,				num_proc=__lowercase)				,				__lowercase)
        self.assertEqual(map_nested(__lowercase				,				__lowercase				,				num_proc=__lowercase)				,				__lowercase)
        self.assertEqual(map_nested(__lowercase				,				__lowercase				,				num_proc=__lowercase)				,				__lowercase)
        self.assertEqual(map_nested(__lowercase				,				__lowercase				,				num_proc=__lowercase)				,				__lowercase)

        __UpperCamelCase  :Dict    						=	{'''a''': np.eye(2), '''b''': np.zeros(3), '''c''': np.ones(2)}
        __UpperCamelCase  :Optional[Any]    						=	{'''a''': 2, '''b''': 0, '''c''': 2}
        __UpperCamelCase  :Optional[int]    						=	{
            '''a''': np.eye(2).astype(__lowercase),
            '''b''': np.zeros(3).astype(__lowercase),
            '''c''': np.ones(2).astype(__lowercase),
        }
        self.assertEqual(map_nested(__lowercase				,				__lowercase				,				map_numpy=__lowercase)				,				__lowercase)
        self.assertEqual(
            {k: v.tolist() for k, v in map_nested(__lowercase				,				__lowercase				,				map_numpy=__lowercase).items()}				,				{k: v.tolist() for k, v in expected_map_nested_sna_int.items()}				,				)
        self.assertEqual(map_nested(__lowercase				,				__lowercase				,				map_numpy=__lowercase				,				num_proc=__lowercase)				,				__lowercase)
        self.assertEqual(
            {k: v.tolist() for k, v in map_nested(__lowercase				,				__lowercase				,				map_numpy=__lowercase				,				num_proc=__lowercase).items()}				,				{k: v.tolist() for k, v in expected_map_nested_sna_int.items()}				,				)
        with self.assertRaises(__lowercase):  # can't pickle a local lambda
            map_nested(lambda __lowercase: x + 1				,				__lowercase				,				num_proc=__lowercase)







    def     UpperCamelCase__     (			self) ->			List[Any]:
        __UpperCamelCase  :List[str]    						=	{'''a''': 1, '''b''': 2}
        __UpperCamelCase  :int    						=	{'''a''': 3, '''b''': 4}
        __UpperCamelCase  :List[str]    						=	{'''a''': 5, '''b''': 6}
        __UpperCamelCase  :List[Any]    						=	sorted([('''a''', (1, 3, 5)), ('''b''', (2, 4, 6))])
        self.assertEqual(sorted(zip_dict(__lowercase				,				__lowercase				,				__lowercase))				,				__lowercase)







    def     UpperCamelCase__     (			self) ->			List[Any]:


        class 			lowerCamelCase_  :






            '''simple docstring'''






            a__			:		int      			=   """bar"""
        __UpperCamelCase  :List[str]    						=	Foo()
        self.assertEqual(foo.my_attr				,				'''bar''')
        with temporary_assignment(__lowercase				,				'''my_attr'''				,				'''BAR'''):
            self.assertEqual(foo.my_attr				,				'''BAR''')
        self.assertEqual(foo.my_attr				,				'''bar''')



@pytest.mark.parametrize(
    '''iterable_length, num_proc, expected_num_proc'''						,    [
        (1, None, 1),
        (1, 1, 1),
        (2, None, 1),
        (2, 1, 1),
        (2, 2, 1),
        (2, 3, 1),
        (3, 2, 1),
        (16, 16, 16),
        (16, 17, 16),
        (17, 16, 16),
    ]						,    )
def lowerCamelCase						(     SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE			):
    '''simple docstring'''







    with patch('''datasets.utils.py_utils._single_map_nested'''			) as mock_single_map_nested, patch(
        '''datasets.parallel.parallel.Pool'''			) as mock_multiprocessing_pool:
        __UpperCamelCase  :Union[str, Any]    						=	{f"""{i}""": i for i in range(SCREAMING_SNAKE_CASE			)}
        __UpperCamelCase  :Dict    						=	map_nested(lambda SCREAMING_SNAKE_CASE			: x + 10						,    SCREAMING_SNAKE_CASE						,    num_proc=SCREAMING_SNAKE_CASE						,    parallel_min_length=16			)
        if expected_num_proc == 1:
            assert mock_single_map_nested.called
            assert not mock_multiprocessing_pool.called
        else:
            assert not mock_single_map_nested.called
            assert mock_multiprocessing_pool.called
            assert mock_multiprocessing_pool.call_args[0][0] == expected_num_proc


class 			lowerCamelCase_  (     UpperCAmelCase_				):






    '''simple docstring'''






    @require_tf
    def     UpperCamelCase__     (			self) ->			Optional[int]:
        import tensorflow as tf
        from tensorflow.keras import layers

        __UpperCamelCase  :Optional[Any]    						=	layers.Dense(2)

        def gen_random_output():
            __UpperCamelCase  :Optional[Any]    						=	tf.random.uniform((1, 3))
            return model(__lowercase).numpy()

        with temp_seed(42				,				set_tensorflow=__lowercase):
            __UpperCamelCase  :Tuple    						=	gen_random_output()
        with temp_seed(42				,				set_tensorflow=__lowercase):
            __UpperCamelCase  :int    						=	gen_random_output()
        __UpperCamelCase  :List[str]    						=	gen_random_output()

        np.testing.assert_equal(__lowercase				,				__lowercase)
        self.assertGreater(np.abs(outa - outa).sum()				,				0)







    @require_torch
    def     UpperCamelCase__     (			self) ->			List[str]:
        import torch

        def gen_random_output():
            __UpperCamelCase  :List[Any]    						=	torch.nn.Linear(3				,				2)
            __UpperCamelCase  :Optional[Any]    						=	torch.rand(1				,				3)
            return model(__lowercase).detach().numpy()

        with temp_seed(42				,				set_pytorch=__lowercase):
            __UpperCamelCase  :Union[str, Any]    						=	gen_random_output()
        with temp_seed(42				,				set_pytorch=__lowercase):
            __UpperCamelCase  :List[str]    						=	gen_random_output()
        __UpperCamelCase  :Dict    						=	gen_random_output()

        np.testing.assert_equal(__lowercase				,				__lowercase)
        self.assertGreater(np.abs(outa - outa).sum()				,				0)







    def     UpperCamelCase__     (			self) ->			str:
        def gen_random_output():
            return np.random.rand(1				,				3)

        with temp_seed(42):
            __UpperCamelCase  :List[Any]    						=	gen_random_output()
        with temp_seed(42):
            __UpperCamelCase  :Optional[Any]    						=	gen_random_output()
        __UpperCamelCase  :Optional[Any]    						=	gen_random_output()

        np.testing.assert_equal(__lowercase				,				__lowercase)
        self.assertGreater(np.abs(outa - outa).sum()				,				0)



@pytest.mark.parametrize('''input_data'''						,    [{}]			)
def lowerCamelCase						(     SCREAMING_SNAKE_CASE			):
    '''simple docstring'''







    __UpperCamelCase  :List[str]    						=	NestedDataStructure(SCREAMING_SNAKE_CASE			).data
    assert output_data == input_data



@pytest.mark.parametrize(
    '''data, expected_output'''						,    [
        ({}, []),
        ([], []),
        ('''foo''', ['''foo''']),
        (['''foo''', '''bar'''], ['''foo''', '''bar''']),
        ([['''foo''', '''bar''']], ['''foo''', '''bar''']),
        ([[['''foo'''], ['''bar''']]], ['''foo''', '''bar''']),
        ([[['''foo'''], '''bar''']], ['''foo''', '''bar''']),
        ({'''a''': 1, '''b''': 2}, [1, 2]),
        ({'''a''': [1, 2], '''b''': [3, 4]}, [1, 2, 3, 4]),
        ({'''a''': [[1, 2]], '''b''': [[3, 4]]}, [1, 2, 3, 4]),
        ({'''a''': [[1, 2]], '''b''': [3, 4]}, [1, 2, 3, 4]),
        ({'''a''': [[[1], [2]]], '''b''': [[[3], [4]]]}, [1, 2, 3, 4]),
        ({'''a''': [[[1], [2]]], '''b''': [[3, 4]]}, [1, 2, 3, 4]),
        ({'''a''': [[[1], [2]]], '''b''': [3, 4]}, [1, 2, 3, 4]),
        ({'''a''': [[[1], [2]]], '''b''': [3, [4]]}, [1, 2, 3, 4]),
        ({'''a''': {'''1''': 1}, '''b''': 2}, [1, 2]),
        ({'''a''': {'''1''': [1]}, '''b''': 2}, [1, 2]),
        ({'''a''': {'''1''': [1]}, '''b''': [2]}, [1, 2]),
    ]						,    )
def lowerCamelCase						(     SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE			):
    '''simple docstring'''







    __UpperCamelCase  :Dict    						=	NestedDataStructure(SCREAMING_SNAKE_CASE			).flatten()
    assert output == expected_output



def lowerCamelCase						(     ):
    '''simple docstring'''







    __UpperCamelCase  :Union[str, Any]    						=	A(x=1						,    y='''foobar'''			)
    __UpperCamelCase  :Dict    						=	{'''x''': 1, '''y''': '''foobar'''}
    assert asdict(SCREAMING_SNAKE_CASE			) == expected_output

    __UpperCamelCase  :str    						=	{'''a''': {'''b''': A(x=10						,    y='''foo'''			)}, '''c''': [A(x=20						,    y='''bar'''			)]}
    __UpperCamelCase  :List[Any]    						=	{'''a''': {'''b''': {'''x''': 10, '''y''': '''foo'''}}, '''c''': [{'''x''': 20, '''y''': '''bar'''}]}
    assert asdict(SCREAMING_SNAKE_CASE			) == expected_output

    with pytest.raises(SCREAMING_SNAKE_CASE			):
        asdict([1, A(x=10						,    y='''foo'''			)]			)



def lowerCamelCase						(     SCREAMING_SNAKE_CASE			):
    '''simple docstring'''







    return text.split()



def lowerCamelCase						(     SCREAMING_SNAKE_CASE			):
    '''simple docstring'''







    yield (time.time(), content)
    time.sleep(2			)
    yield (time.time(), content)



def lowerCamelCase						(     ):
    '''simple docstring'''







    with Pool(2			) as pool:
        __UpperCamelCase  :Tuple    						=	list(iflatmap_unordered(SCREAMING_SNAKE_CASE						,    _split_text						,    kwargs_iterable=[{'''text''': '''hello there'''}] * 10			)			)
        assert out.count('''hello'''			) == 10
        assert out.count('''there'''			) == 10
        assert len(SCREAMING_SNAKE_CASE			) == 20

    # check multiprocess from pathos (uses dill for pickling)
    with multiprocess.Pool(2			) as pool:
        __UpperCamelCase  :Any    						=	list(iflatmap_unordered(SCREAMING_SNAKE_CASE						,    _split_text						,    kwargs_iterable=[{'''text''': '''hello there'''}] * 10			)			)
        assert out.count('''hello'''			) == 10
        assert out.count('''there'''			) == 10
        assert len(SCREAMING_SNAKE_CASE			) == 20

    # check that we get items as fast as possible
    with Pool(2			) as pool:
        __UpperCamelCase  :Dict    						=	[]
        for yield_time, content in iflatmap_unordered(
            SCREAMING_SNAKE_CASE						,    _aseconds_generator_of_aitems_with_timing						,    kwargs_iterable=[{'''content''': '''a'''}, {'''content''': '''b'''}]			):
            assert yield_time < time.time() + 0.1, "we should each item directly after it was yielded"
            out.append(SCREAMING_SNAKE_CASE			)
        assert out.count('''a'''			) == 2
        assert out.count('''b'''			) == 2
        assert len(SCREAMING_SNAKE_CASE			) == 4





