o

���g���	@s8
dZd
dl
Z
d
dlZd
dlZd
dlZd
dlZd
dlmZ
gd�
Z	ej
ejdd�ZeZ
dd�Zd	d
�Zdd�Zd
d�Zdd�Zdd�Zdd�Zdd�Zdd�Zeeeeeeeed�Zdd�Zdd�Zdd�Zd d!�Zd"d#�Zd1d$d%�
Zee�
d2d'd(�
�
Z	d3d)d*�
Zee�
d4d+d,�
�
Z 		d3d-d.�
Z!ee!�
d4d/d0�
�
Z"dS)5z
Histogram-related functions
�N)
�	overrides)�	histogram�histogramdd�histogram_bin_edges�numpy)
�modulec

Cst|�
�|���S)
a
Peak-to-peak value of x.

    This implementation avoids the problem of signed integer arrays having a
    peak-to-peak value that cannot be represented with the array's data type.
    This function returns an unsigned value for signed integer arrays.
    )�_unsigned_subtract�max�min)
�
x�r�?/usr/local/lib/python3.10/dist-packages/numpy/lib/histograms.py�_ptpsrcCs~
t|�
t
�|j�
S)
a~

    Square root histogram bin estimator.

    Bin width is inversely proportional to the data size. Used by many
    programs for its simplicity.

    Parameters
    ----------
    x : array_like
        Input data that is to be histogrammed, trimmed to range. May not
        be empty.

    Returns
    -------
    h : An estimate of the optimal bin width for the given data.
    )r�np�sqrt�size�r�rangerrr
�_hist_bin_sqrt s
rcCs~
t|�
t
�|j�
d
S)a
    Sturges histogram bin estimator.

    A very simplistic estimator based on the assumption of normality of
    the data. This estimator has poor performance for non-normal data,
    which becomes especially obvious for large data sets. The estimate
    depends only on size of the data.

    Parameters
    ----------
    x : array_like
        Input data that is to be histogrammed, trimmed to range. May not
        be empty.

    Returns
    -------
    h : An estimate of the optimal bin width for the given data.
    ��?)rr�log2rrrrr
�_hist_bin_sturges5s
rcCs~
t|�
d
|j
dS)aI
    Rice histogram bin estimator.

    Another simple estimator with no normality assumption. It has better
    performance for large data than Sturges, but tends to overestimate
    the number of bins. The number of bins is proportional to the cube
    root of data size (asymptotically optimal). The estimate depends
    only on size of the data.

    Parameters
    ----------
    x : array_like
        Input data that is to be histogrammed, trimmed to range. May not
        be empty.

    Returns
    -------
    h : An estimate of the optimal bin width for the given data.
    �@�UUUUUU�?)rrrrrr
�_hist_bin_riceLs
rcCs$~
d
tj
d|jdt�|�
S)a�

    Scott histogram bin estimator.

    The binwidth is proportional to the standard deviation of the data
    and inversely proportional to the cube root of data size
    (asymptotically optimal).

    Parameters
    ----------
    x : array_like
        Input data that is to be histogrammed, trimmed to range. May not
        be empty.

    Returns
    -------
    h : An estimate of the optimal bin width for the given data.
    g8@��?r)r�pir�stdrrrr
�_hist_bin_scottds"
rcs~�j�t
��
�
�d
k
s�
dkrdS��
��fdd�}tdtt���
�
�}ttd
|d
�|d�}||kr;tj	dt
dd	�
�
|S)
a6
    Histogram bin estimator based on minimizing the estimated integrated squared error (ISE).

    The number of bins is chosen by minimizing the estimated ISE against the unknown true distribution.
    The ISE is estimated using cross-validation and can be regarded as a generalization of Scott's rule.
    https://en.wikipedia.org/wiki/Histogram#Scott.27s_normal_reference_rule

    This paper by Stone appears to be the origination of this rule.
    http://digitalassets.lib.berkeley.edu/sdtr/ucb/text/34.pdf

    Parameters
    ----------
    x : array_like
        Input data that is to be histogrammed, trimmed to range. May not
        be empty.
    range : (float, float)
        The lower and upper range of the bins.

    Returns
    -------
    h : An estimate of the optimal bin width for the given data.
    �
r
c
s:�
|}
tj
�|�d
�d�}d�d|�|�
|
S)N)�binsrr
�r)rr�dot)�nbins�hh�p_k��
n�ptp_xrrrr
�jhat�s


z_hist_bin_stone.<locals>.jhat�d)
�keyz/The number of bins estimated may be suboptimal.��
�
stacklevel)rrr	�intrrr
�_range�warnings�warn�RuntimeWarning)rrr)�nbins_upper_boundr#rr&r
�_hist_bin_stonezs






�r5cCs�~
|jd
krUt
�d|jd
|jd|jd�
}t
�|�
}|dkrU|t
�|�
}t
�|||�
t
�|d|�
t
�|�
}t|�
dt
�|j�
t
�dt
�	|�
|�
SdS)a�

    Doane's histogram bin estimator.

    Improved version of Sturges' formula which works better for
    non-normal data. See
    stats.stackexchange.com/questions/55134/doanes-formula-for-histogram-binning

    Parameters
    ----------
    x : array_like
        Input data that is to be histogrammed, trimmed to range. May not
        be empty.

    Returns
    -------
    h : An estimate of the optimal bin width for the given data.
    r!g@rr,g)
rrrr�mean�true_divide�powerrr�absolute)rr�sg1�sigma�temp�g1rrr
�_hist_bin_doane�s

(









�r>cCs*~
tj
t�|d
dg��}d||jdS)a=
    The Freedman-Diaconis histogram bin estimator.

    The Freedman-Diaconis rule uses interquartile range (IQR) to
    estimate binwidth. It is considered a variation of the Scott rule
    with more robustness as the IQR is less affected by outliers than
    the standard deviation. However, the IQR depends on fewer points
    than the standard deviation, so it is less accurate, especially for
    long tailed distributions.

    If the IQR is 0, this function returns 0 for the bin width.
    Binwidth is inversely proportional to the cube root of data size
    (asymptotically optimal).

    Parameters
    ----------
    x : array_like
        Input data that is to be histogrammed, trimmed to range. May not
        be empty.

    Returns
    -------
    h : An estimate of the optimal bin width for the given data.
    �K�rgUUUUUUտ)r�subtract�
percentiler)rr�iqrrrr
�_hist_bin_fd�s

rDcCs(t||
�}t
||
�}~
|rt||�S|S)
a�
    Histogram bin estimator that uses the minimum width of the
    Freedman-Diaconis and Sturges estimators if the FD bin width is non-zero.
    If the bin width from the FD estimator is 0, the Sturges estimator is used.

    The FD estimator is usually the most robust method, but its width
    estimate tends to be too large for small `x` and bad for data with limited
    variance. The Sturges estimator is quite good for small (<1000) datasets
    and is the default in the R language. This method gives good off-the-shelf
    behaviour.

    .. versionchanged:: 1.15.0
    If there is limited variance the IQR can be 0, which results in the
    FD bin width being 0 too. This is not a valid bin width, so
    ``np.histogram_bin_edges`` chooses 1 bin instead, which may not be optimal.
    If the IQR is 0, it's unlikely any variance-based estimators will be of
    use, so we revert to the Sturges estimator, which only uses the size of the
    dataset in its calculation.

    Parameters
    ----------
    x : array_like
        Input data that is to be histogrammed, trimmed to range. May not
        be empty.

    Returns
    -------
    h : An estimate of the optimal bin width for the given data.

    See Also
    --------
    _hist_bin_fd, _hist_bin_sturges
    )rDrr
)rr�fd_bw�
sturges_bwrrr
�_hist_bin_auto�s
"





rG)�stone�auto�doane�fd�rice�scottr�sturgescCs|t�
|�
}|jtjkrtjd
�|jtj�tdd�
|�	tj�
}|
du
r6t�
|
�
}
|
j
|j
kr2td�
�
|
��}
|��}||
fS)z: Check a and weights have matching shapes, and ravel both z1Converting input from {} to {} for compatibility.r,r-Nz(weights should have the same shape as a.)
r�asarray�dtype�bool_r1r2�format�uint8r3�astype�shape�
ValueError�ravel)�
a�weightsrrr
�_ravel_and_check_weights
s 



�




�

rZcCs�|
d
u
r#|
\}}||krtd�
�
t
�|�
rt
�|�
s"td�||��
�
n%|jdkr-d\}}n|��|��}}t
�|�
r@t
�|�
sHtd�||��
�
||krT|d}|d}||fS)z^
    Determine the outer bin edges to use, from either the data or the range
    argument
    Nz/max must be larger than min in range parameter.z(supplied range of [{}, {}] is not finiter
)r
rz,autodetected range of [{}, {}] is not finiter)rVr�isfiniterRrr
r	)rXr�
first_edge�	last_edgerrr
�_get_outer_edges0
s,



�


��





�

r^c
Cs|tj
tjtjtjtjtjtjtjtj	tj
i}t�||
�}z||j}Wnt
y4


tj||
|d
�YSwtj||
d|d�S)z�
    Subtract two values where a >= b, and produce an unsigned result

    This is needed when finding the difference between the upper and lower
    bound of an int16 histogram
    �
rP�unsafe)�castingrP)r�byte�ubyte�short�ushort�intc�uintc�int_�uint�longlong�	ulonglong�result_type�type�KeyErrorrA)rX�
b�signed_to_unsigned�dtrrr
rN
s	



�



�rc

Cs�
d
}d
}t|
t
�r`|
}|tv
rtd�|�
�
�
|d
u
rtd�
�
t||�\}}|d
u
r=||k}	|	||k
M}	tj�	|	�
s=||	}|j
dkrEd}not||||f�}
|
r]tt�t
||�|
�
�
}nWd}nTt�|
�
dkr�zt�|
�
}Wnty
}
ztd�
|�d
}~w
w|dkr�td�
�
t||�\}}n$t�|
�
dkr�t�|
�
}t�|d
d�|dd
�k�
r�td	�
�
ntd
�
�
|d
u
r�t�|||�}t�|tj�r�t�|t�}tj|||dd|d�}||||ffS|d
fS)
a
    Computes the bins used internally by `histogram`.

    Parameters
    ==========
    a : ndarray
        Ravelled data array
    bins, range
        Forwarded arguments from `histogram`.
    weights : ndarray, optional
        Ravelled weights array, or None

    Returns
    =======
    bin_edges : ndarray
        Array of bin edges
    uniform_bins : (Number, Number, int):
        The upper bound, lowerbound, and number of bins, used in the optimized
        implementation of `histogram` that works on uniform bins.
    Nz({!r} is not a valid estimator for `bins`zMAutomated estimation of the number of bins is not supported for weighted datar
rz0`bins` must be an integer, a string, or an arrayz(`bins` must be positive, when an integer���z1`bins` must increase monotonically, when an arrayz `bins` must be 1d, when an arrayT)�endpointrP)�
isinstance�str�_hist_bin_selectorsrVrR�	TypeErrorr^r�logical_and�reducerr/�ceilr�ndim�operator�indexrO�anyrl�
issubdtype�integer�float�linspace)
rXr rrY�n_equal_bins�	bin_edges�bin_namer\r]�keep�width�
e�bin_typerrr
�_get_bin_edgesh
sl




�













�
���





��




�r�cCs.t�
|�|
d
d�d�|�|
dd
�d�f�
S)z�
    Like `searchsorted`, but where the last item in `v` is placed on the right.

    In the context of a histogram, this makes the last bin edge inclusive
    Nrr�left�right)r�concatenate�searchsorted)rX�
vrrr
�_search_sorted_inclusive�
s

�r�cCs
||
|fS�
Nr)rXr rrYrrr
�_histogram_bin_edges_dispatcher�
s

r��
cCs$t||�\}}t
||
||�\}}|S)
aY
    Function to calculate only the edges of the bins used by the `histogram`
    function.

    Parameters
    ----------
    a : array_like
        Input data. The histogram is computed over the flattened array.
    bins : int or sequence of scalars or str, optional
        If `bins` is an int, it defines the number of equal-width
        bins in the given range (10, by default). If `bins` is a
        sequence, it defines the bin edges, including the rightmost
        edge, allowing for non-uniform bin widths.

        If `bins` is a string from the list below, `histogram_bin_edges` will use
        the method chosen to calculate the optimal bin width and
        consequently the number of bins (see `Notes` for more detail on
        the estimators) from the data that falls within the requested
        range. While the bin width will be optimal for the actual data
        in the range, the number of bins will be computed to fill the
        entire range, including the empty portions. For visualisation,
        using the 'auto' option is suggested. Weighted data is not
        supported for automated bin size selection.

        'auto'
            Maximum of the 'sturges' and 'fd' estimators. Provides good
            all around performance.

        'fd' (Freedman Diaconis Estimator)
            Robust (resilient to outliers) estimator that takes into
            account data variability and data size.

        'doane'
            An improved version of Sturges' estimator that works better
            with non-normal datasets.

        'scott'
            Less robust estimator that takes into account data variability
            and data size.

        'stone'
            Estimator based on leave-one-out cross-validation estimate of
            the integrated squared error. Can be regarded as a generalization
            of Scott's rule.

        'rice'
            Estimator does not take variability into account, only data
            size. Commonly overestimates number of bins required.

        'sturges'
            R's default method, only accounts for data size. Only
            optimal for gaussian data and underestimates number of bins
            for large non-gaussian datasets.

        'sqrt'
            Square root (of data size) estimator, used by Excel and
            other programs for its speed and simplicity.

    range : (float, float), optional
        The lower and upper range of the bins.  If not provided, range
        is simply ``(a.min(), a.max())``.  Values outside the range are
        ignored. The first element of the range must be less than or
        equal to the second. `range` affects the automatic bin
        computation as well. While bin width is computed to be optimal
        based on the actual data within `range`, the bin count will fill
        the entire range including portions containing no data.

    weights : array_like, optional
        An array of weights, of the same shape as `a`.  Each value in
        `a` only contributes its associated weight towards the bin count
        (instead of 1). This is currently not used by any of the bin estimators,
        but may be in the future.

    Returns
    -------
    bin_edges : array of dtype float
        The edges to pass into `histogram`

    See Also
    --------
    histogram

    Notes
    -----
    The methods to estimate the optimal number of bins are well founded
    in literature, and are inspired by the choices R provides for
    histogram visualisation. Note that having the number of bins
    proportional to :math:`n^{1/3}` is asymptotically optimal, which is
    why it appears in most estimators. These are simply plug-in methods
    that give good starting points for number of bins. In the equations
    below, :math:`h` is the binwidth and :math:`n_h` is the number of
    bins. All estimators that compute bin counts are recast to bin width
    using the `ptp` of the data. The final bin count is obtained from
    ``np.round(np.ceil(range / h))``. The final bin width is often less
    than what is returned by the estimators below.

    'auto' (maximum of the 'sturges' and 'fd' estimators)
        A compromise to get a good value. For small datasets the Sturges
        value will usually be chosen, while larger datasets will usually
        default to FD.  Avoids the overly conservative behaviour of FD
        and Sturges for small and large datasets respectively.
        Switchover point is usually :math:`a.size \approx 1000`.

    'fd' (Freedman Diaconis Estimator)
        .. math:: h = 2 \frac{IQR}{n^{1/3}}

        The binwidth is proportional to the interquartile range (IQR)
        and inversely proportional to cube root of a.size. Can be too
        conservative for small datasets, but is quite good for large
        datasets. The IQR is very robust to outliers.

    'scott'
        .. math:: h = \sigma \sqrt[3]{\frac{24 \sqrt{\pi}}{n}}

        The binwidth is proportional to the standard deviation of the
        data and inversely proportional to cube root of ``x.size``. Can
        be too conservative for small datasets, but is quite good for
        large datasets. The standard deviation is not very robust to
        outliers. Values are very similar to the Freedman-Diaconis
        estimator in the absence of outliers.

    'rice'
        .. math:: n_h = 2n^{1/3}

        The number of bins is only proportional to cube root of
        ``a.size``. It tends to overestimate the number of bins and it
        does not take into account data variability.

    'sturges'
        .. math:: n_h = \log _{2}(n) + 1

        The number of bins is the base 2 log of ``a.size``.  This
        estimator assumes normality of data and is too conservative for
        larger, non-normal datasets. This is the default method in R's
        ``hist`` method.

    'doane'
        .. math:: n_h = 1 + \log_{2}(n) +
                        \log_{2}\left(1 + \frac{|g_1|}{\sigma_{g_1}}\right)

            g_1 = mean\left[\left(\frac{x - \mu}{\sigma}\right)^3\right]

            \sigma_{g_1} = \sqrt{\frac{6(n - 2)}{(n + 1)(n + 3)}}

        An improved version of Sturges' formula that produces better
        estimates for non-normal datasets. This estimator attempts to
        account for the skew of the data.

    'sqrt'
        .. math:: n_h = \sqrt n

        The simplest and fastest estimator. Only takes into account the
        data size.

    Examples
    --------
    >>> arr = np.array([0, 0, 0, 1, 2, 3, 3, 4, 5])
    >>> np.histogram_bin_edges(arr, bins='auto', range=(0, 1))
    array([0.  , 0.25, 0.5 , 0.75, 1.  ])
    >>> np.histogram_bin_edges(arr, bins=2)
    array([0. , 2.5, 5. ])

    For consistency with histogram, an array of pre-computed bins is
    passed through unmodified:

    >>> np.histogram_bin_edges(arr, [1, 2])
    array([1, 2])

    This function allows one set of bins to be computed, and reused across
    multiple histograms:

    >>> shared_bins = np.histogram_bin_edges(arr, bins='auto')
    >>> shared_bins
    array([0., 1., 2., 3., 4., 5.])

    >>> group_id = np.array([0, 1, 1, 0, 1, 1, 0, 1, 1])
    >>> hist_0, _ = np.histogram(arr[group_id == 0], bins=shared_bins)
    >>> hist_1, _ = np.histogram(arr[group_id == 1], bins=shared_bins)

    >>> hist_0; hist_1
    array([1, 1, 0, 1, 0])
    array([2, 0, 1, 1, 2])

    Which gives more easily comparable results than using separate bins for
    each histogram:

    >>> hist_0, bins_0 = np.histogram(arr[group_id == 0], bins='auto')
    >>> hist_1, bins_1 = np.histogram(arr[group_id == 1], bins='auto')
    >>> hist_0; hist_1
    array([1, 1, 1])
    array([2, 1, 1, 2])
    >>> bins_0; bins_1
    array([0., 1., 2., 3.])
    array([0.  , 1.25, 2.5 , 3.75, 5.  ])

    )rZr�)rXr rrYr��
_rrr
r�
sG

rcCs
||
|fSr�r)rXr r�densityrYrrr
�_histogram_dispatcher�s
r�c Cst||�\}}t
||
||�\}}|d
urt�tj�
}n|j}d}|d
up2t�|jtj�p2t�|jt�}	|d
u
r�|	r�|\}
}}t�||�}
|}t	||
�}t
dt|�
|�D]�}||||�}|d
urdd
}n||||�}||
k}|||k
M}tj�
|�
s�||}|d
u
r�||}|j|jdd�}t	||
�||}|�tj�
}|||kd8<|||k}||d8<|||dk||dk@}||d7<|jdkr�|
jtj||j|d�7_|
jtj||j|d�7_qS|
tj|||d��|�
7}
qSntt�|j|�}|d
u�
r)t
dt|�
|�D]}t�||||��
}|t||�7}�
qnDtjd|d	�}t
dt|�
|�D]4}||||�}||||�}t�|�
}||}||}t�||��f�
}t||�}|||7}�
q8t�|�
}
|�
r�t�t�|�
t�}|
||
��|fS|
|fS)
a�
    Compute the histogram of a dataset.

    Parameters
    ----------
    a : array_like
        Input data. The histogram is computed over the flattened array.
    bins : int or sequence of scalars or str, optional
        If `bins` is an int, it defines the number of equal-width
        bins in the given range (10, by default). If `bins` is a
        sequence, it defines a monotonically increasing array of bin edges,
        including the rightmost edge, allowing for non-uniform bin widths.

        .. versionadded:: 1.11.0

        If `bins` is a string, it defines the method used to calculate the
        optimal bin width, as defined by `histogram_bin_edges`.

    range : (float, float), optional
        The lower and upper range of the bins.  If not provided, range
        is simply ``(a.min(), a.max())``.  Values outside the range are
        ignored. The first element of the range must be less than or
        equal to the second. `range` affects the automatic bin
        computation as well. While bin width is computed to be optimal
        based on the actual data within `range`, the bin count will fill
        the entire range including portions containing no data.
    weights : array_like, optional
        An array of weights, of the same shape as `a`.  Each value in
        `a` only contributes its associated weight towards the bin count
        (instead of 1). If `density` is True, the weights are
        normalized, so that the integral of the density over the range
        remains 1.
    density : bool, optional
        If ``False``, the result will contain the number of samples in
        each bin. If ``True``, the result is the value of the
        probability *density* function at the bin, normalized such that
        the *integral* over the range is 1. Note that the sum of the
        histogram values will not be equal to 1 unless bins of unity
        width are chosen; it is not a probability *mass* function.

    Returns
    -------
    hist : array
        The values of the histogram. See `density` and `weights` for a
        description of the possible semantics.
    bin_edges : array of dtype float
        Return the bin edges ``(length(hist)+1)``.


    See Also
    --------
    histogramdd, bincount, searchsorted, digitize, histogram_bin_edges

    Notes
    -----
    All but the last (righthand-most) bin is half-open.  In other words,
    if `bins` is::

      [1, 2, 3, 4]

    then the first bin is ``[1, 2)`` (including 1, but excluding 2) and
    the second ``[2, 3)``.  The last bin, however, is ``[3, 4]``, which
    *includes* 4.


    Examples
    --------
    >>> np.histogram([1, 2, 1], bins=[0, 1, 2, 3])
    (array([0, 2, 1]), array([0, 1, 2, 3]))
    >>> np.histogram(np.arange(4), bins=np.arange(5), density=True)
    (array([0.25, 0.25, 0.25, 0.25]), array([0, 1, 2, 3, 4]))
    >>> np.histogram([[1, 2, 1], [1, 0, 1]], bins=[0,1,2,3])
    (array([1, 4, 1]), array([0, 1, 2, 3]))

    >>> a = np.arange(5)
    >>> hist, bin_edges = np.histogram(a, density=True)
    >>> hist
    array([0.5, 0. , 0.5, 0. , 0. , 0.5, 0. , 0.5, 0. , 0.5])
    >>> hist.sum()
    2.4999999999999996
    >>> np.sum(hist * np.diff(bin_edges))
    1.0

    .. versionadded:: 1.11.0

    Automated Bin Selection Methods example, using 2 peak random data
    with 2000 points:

    >>> import matplotlib.pyplot as plt
    >>> rng = np.random.RandomState(10)  # deterministic random data
    >>> a = np.hstack((rng.normal(size=1000),
    ...                rng.normal(loc=5, scale=2, size=1000)))
    >>> _ = plt.hist(a, bins='auto')  # arguments are passed to np.histogram
    >>> plt.title("Histogram with 'auto' bins")
    Text(0.5, 1.0, "Histogram with 'auto' bins")
    >>> plt.show()

    Ni
r
F)
�copyr�
c)rY�	minlengthr_)rZr�rrP�intp�can_cast�double�complex�zerosrr0�lenrxryrT�kind�real�bincount�imagrU�sortr��argsortr��cumsum�diff�arrayr��sum) rXr rr�rYr��uniform_bins�ntype�BLOCK�simple_weightsr\r]r�r'�norm_numerator�
norm_denom�
i�tmp_a�tmp_wr��	f_indices�indices�	decrement�	increment�cum_n�sa�zero�
sorting_index�sw�cw�	bin_index�dbrrr
r�s�d

��











�



�



�
�

�
��/




�













rccs\�t|d
�r
|V
n|EdH
t
�t�
�

|
EdH
Wd�
n1s$w



Y
|V
dS)NrU)�hasattr�
contextlib�suppressrw)�sampler rr�rYrrr
�_histogramdd_dispatcherzs�




�
r�cs.z�
j\}}Wnt
tfy


t��
�
j�
�
j\}}Yn
wt�|tj�}|d
g
�|d
g
}|d
u
r8t�|�
}zt	|
�
}	|	|krEtd�
�
Wnt
yT


||
g
}
Yn
w|d
ur^d|}n
t	|�
|krhtd�
�
t|�
D]�}
t�|
|
�
dkr�|
|
dkr�td�
|
�
�
�
t�
d
d
�|
f||
�\}}z	t�|
|
�
}
Wnt
y�
}
zt
d�
|
�
�
|�d
}~w
wt�|||
d��|
<n4t�|
|
�
dkr�t�|
|
�
�|
<t��|
d
d	��|
dd
�k�
r�td
�
|
�
�
�
ntd�
|
�
�
�
t	�|
�
d||
<t��|
�
||
<qlt��
fdd
�t|�
D�
�
}t|�
D]}
�
d
d
�|
f�|
d	k}||
|d8<�
qt�||�}tj|||��d�}|�|�
}|jtdd�}|tdd	�f
}||}|�
r�|��}t|�
D]}
t�|t�}||
d||
<|||
�|�
}�
qf||}|j|dk���
r�td�
�
|�fS)ab	
    Compute the multidimensional histogram of some data.

    Parameters
    ----------
    sample : (N, D) array, or (N, D) array_like
        The data to be histogrammed.

        Note the unusual interpretation of sample when an array_like:

        * When an array, each row is a coordinate in a D-dimensional space -
          such as ``histogramdd(np.array([p1, p2, p3]))``.
        * When an array_like, each element is the list of values for single
          coordinate - such as ``histogramdd((X, Y, Z))``.

        The first form should be preferred.

    bins : sequence or int, optional
        The bin specification:

        * A sequence of arrays describing the monotonically increasing bin
          edges along each dimension.
        * The number of bins for each dimension (nx, ny, ... =bins)
        * The number of bins for all dimensions (nx=ny=...=bins).

    range : sequence, optional
        A sequence of length D, each an optional (lower, upper) tuple giving
        the outer bin edges to be used if the edges are not given explicitly in
        `bins`.
        An entry of None in the sequence results in the minimum and maximum
        values being used for the corresponding dimension.
        The default, None, is equivalent to passing a tuple of D None values.
    density : bool, optional
        If False, the default, returns the number of samples in each bin.
        If True, returns the probability *density* function at the bin,
        ``bin_count / sample_count / bin_volume``.
    weights : (N,) array_like, optional
        An array of values `w_i` weighing each sample `(x_i, y_i, z_i, ...)`.
        Weights are normalized to 1 if density is True. If density is False,
        the values of the returned histogram are equal to the sum of the
        weights belonging to the samples falling into each bin.

    Returns
    -------
    H : ndarray
        The multidimensional histogram of sample x. See density and weights
        for the different possible semantics.
    edges : list
        A list of D arrays describing the bin edges for each dimension.

    See Also
    --------
    histogram: 1-D histogram
    histogram2d: 2-D histogram

    Examples
    --------
    >>> r = np.random.randn(100,3)
    >>> H, edges = np.histogramdd(r, bins = (5, 8, 4))
    >>> H.shape, edges[0].size, edges[1].size, edges[2].size
    ((5, 8, 4), 6, 9, 5)

    NzEThe dimension of bins must be equal to the dimension of the sample x.r�z0range argument must have one entry per dimensionr
rz,`bins[{}]` must be positive, when an integerz,`bins[{}]` must be an integer, when a scalarrrz:`bins[{}]` must be monotonically increasing, when an arrayz'`bins[{}]` must be a scalar or 1d arrayc
3s0�|]}
tj
�|
�
dd�|
fd
d�V
qdS)Nr�)
�side)rr�)�.0r���edgesr�rr
�	<genexpr>s
��
�zhistogramdd.<locals>.<genexpr>)
r��safe)
rar!zInternal Shape Error) rU�AttributeErrorrVr�
atleast_2d�
T�emptyr�rOr�rwr0r{rRr^r|r}r�r~r��tuple�ravel_multi_indexr��prod�reshaperTr��slicer��onesr/�RuntimeError)r�r rr�rY�
N�
D�nbin�dedges�
Mr��smin�smaxr'r��Ncount�on_edge�xy�hist�core�
srUrr�r
r�s�B

�










���







�



����

&



��
�
�	








�r)NNN)r�NN)NNNN)r�NNN)#�__doc__r��	functoolsr|r1rr�
numpy.corer�__all__�partial�array_function_dispatchrr0rrrrrr5r>rDrGrvrZr^rr�r�r�rr�rr�rrrrr
�<module>
sb




�
*#,






�
^

L
�
T

�