B

<�Fd3%�@s�dZd
dl
mZmZmZ
d
dlZd
dlZd
dlmZ
d
dl	m
Z
mZmZm
Z
mZmZ
dddd	gZeef
Zdd
d�
Zddd�
Zdd
d�
Zddd	�
ZGdd�de�ZdS)z*
Discrete Fourier Transforms - helper.py

�)�division�absolute_import�print_functionN)
�
integer_types)�asarray�concatenate�arange�take�integer�empty�fftshift�	ifftshift�fftfreq�rfftfreqc	Cs�t|�
}|j
}|
d
kr$tt|�
�
}
nt|
t�r4|
f
}
|}xD|
D]<}|j|}|dd}tt||�t|�
f�
}t	|||�}q>W|S)as
    Shift the zero-frequency component to the center of the spectrum.

    This function swaps half-spaces for all axes listed (defaults to all).
    Note that ``y[0]`` is the Nyquist component only if ``len(x)`` is even.

    Parameters
    ----------
    x : array_like
        Input array.
    axes : int or shape tuple, optional
        Axes over which to shift.  Default is None, which shifts all axes.

    Returns
    -------
    y : ndarray
        The shifted array.

    See Also
    --------
    ifftshift : The inverse of `fftshift`.

    Examples
    --------
    >>> freqs = np.fft.fftfreq(10, 0.1)
    >>> freqs
    array([ 0.,  1.,  2.,  3.,  4., -5., -4., -3., -2., -1.])
    >>> np.fft.fftshift(freqs)
    array([-5., -4., -3., -2., -1.,  0.,  1.,  2.,  3.,  4.])

    Shift the zero-frequency component only along the second axis:

    >>> freqs = np.fft.fftfreq(9, d=1./9).reshape(3, 3)
    >>> freqs
    array([[ 0.,  1.,  2.],
           [ 3.,  4., -4.],
           [-3., -2., -1.]])
    >>> np.fft.fftshift(freqs, axes=(1,))
    array([[ 2.,  0.,  1.],
           [-4.,  3.,  4.],
           [-1., -3., -2.]])

    N�
�)
r�ndim�list�range�
isinstancer�shaperrr	)	�
x�axes�tmpr�
y�
k�
n�p2�mylist�r�C/opt/alt/python37/lib64/python3.7/site-packages/numpy/fft/helper.pyrs,














c	Cs�t|�
}|j
}|
d
kr$tt|�
�
}
nt|
t�r4|
f
}
|}xH|
D]@}|j|}||dd}tt||�t|�
f�
}t	|||�}q>W|S)a/
    The inverse of `fftshift`. Although identical for even-length `x`, the
    functions differ by one sample for odd-length `x`.

    Parameters
    ----------
    x : array_like
        Input array.
    axes : int or shape tuple, optional
        Axes over which to calculate.  Defaults to None, which shifts all axes.

    Returns
    -------
    y : ndarray
        The shifted array.

    See Also
    --------
    fftshift : Shift zero-frequency component to the center of the spectrum.

    Examples
    --------
    >>> freqs = np.fft.fftfreq(9, d=1./9).reshape(3, 3)
    >>> freqs
    array([[ 0.,  1.,  2.],
           [ 3.,  4., -4.],
           [-3., -2., -1.]])
    >>> np.fft.ifftshift(np.fft.fftshift(freqs))
    array([[ 0.,  1.,  2.],
           [ 3.,  4., -4.],
           [-3., -2., -1.]])

    Nrr)
rrrrrrrrrr	)	rrrrrrrrrrrr r
Qs"














��?cCszt|t
�std
�
�
d||
}t|t�}|ddd}td|td�}||d|�<t|ddtd�}|||d�<||S)a6
    Return the Discrete Fourier Transform sample frequencies.

    The returned float array `f` contains the frequency bin centers in cycles
    per unit of the sample spacing (with zero at the start).  For instance, if
    the sample spacing is in seconds, then the frequency unit is cycles/second.

    Given a window length `n` and a sample spacing `d`::

      f = [0, 1, ...,   n/2-1,     -n/2, ..., -1] / (d*n)   if n is even
      f = [0, 1, ..., (n-1)/2, -(n-1)/2, ..., -1] / (d*n)   if n is odd

    Parameters
    ----------
    n : int
        Window length.
    d : scalar, optional
        Sample spacing (inverse of the sampling rate). Defaults to 1.

    Returns
    -------
    f : ndarray
        Array of length `n` containing the sample frequencies.

    Examples
    --------
    >>> signal = np.array([-2, 8, 6, 4, 1, 0, 3, 5], dtype=float)
    >>> fourier = np.fft.fft(signal)
    >>> n = signal.size
    >>> timestep = 0.1
    >>> freq = np.fft.fftfreq(n, d=timestep)
    >>> freq
    array([ 0.  ,  1.25,  2.5 ,  3.75, -5.  , -3.75, -2.5 , -1.25])

    zn should be an integerg�?rrr
)
�dtypeN)rr�
ValueErrorr�intr)r�
d�val�results�
NZp1rrrr r�s$










cCs@t|t
�std
�
�
d||
}|dd}td|td�}||S)aR
    Return the Discrete Fourier Transform sample frequencies
    (for usage with rfft, irfft).

    The returned float array `f` contains the frequency bin centers in cycles
    per unit of the sample spacing (with zero at the start).  For instance, if
    the sample spacing is in seconds, then the frequency unit is cycles/second.

    Given a window length `n` and a sample spacing `d`::

      f = [0, 1, ...,     n/2-1,     n/2] / (d*n)   if n is even
      f = [0, 1, ..., (n-1)/2-1, (n-1)/2] / (d*n)   if n is odd

    Unlike `fftfreq` (but like `scipy.fftpack.rfftfreq`)
    the Nyquist frequency component is considered to be positive.

    Parameters
    ----------
    n : int
        Window length.
    d : scalar, optional
        Sample spacing (inverse of the sampling rate). Defaults to 1.

    Returns
    -------
    f : ndarray
        Array of length ``n//2 + 1`` containing the sample frequencies.

    Examples
    --------
    >>> signal = np.array([-2, 8, 6, 4, 1, 0, 3, 5, -3, 4], dtype=float)
    >>> fourier = np.fft.rfft(signal)
    >>> n = signal.size
    >>> sample_rate = 100
    >>> freq = np.fft.fftfreq(n, d=1./sample_rate)
    >>> freq
    array([  0.,  10.,  20.,  30.,  40., -50., -40., -30., -20., -10.])
    >>> freq = np.fft.rfftfreq(n, d=1./sample_rate)
    >>> freq
    array([  0.,  10.,  20.,  30.,  40.,  50.])

    zn should be an integerg�?rrr
)
r")rrr#rr$)rr%r&r(r'rrr r�s+





c@s8eZ
dZd
Zdd�Zdd�Zdd�Zdd	�Zd
d�ZdS)
�	_FFTCachea
    Cache for the FFT twiddle factors as an LRU (least recently used) cache.

    Parameters
    ----------
    max_size_in_mb : int
        Maximum memory usage of the cache before items are being evicted.
    max_item_count : int
        Maximum item count of the cache before items are being evicted.

    Notes
    -----
    Items will be evicted if either limit has been reached upon getting and
    setting. The maximum memory usages is not strictly the given
    ``max_size_in_mb`` but rather
    ``max(max_size_in_mb, 1.5 * size_of_largest_item)``. Thus the cache will
    never be completely cleared - at least one item will remain and a single
    large item can cause the cache to retain several smaller items even if the
    given maximum cache size has been exceeded.
    cCs(|
d
|_||_
t��|_t��|_dS)Ni)�_max_size_in_bytes�_max_item_count�collections�OrderedDict�_dict�	threadingZLock�_lock)�selfZmax_size_in_mbZmax_item_countrrr �__init__�s





z_FFTCache.__init__c	Cs\|j�L
y|j
�|
�
}Wntk
r0


g}YnX|�|�

||j
|
<|��
Wd
QRXd
S)aI

        Store twiddle factors for an FFT of length n in the cache.

        Putting multiple twiddle factors for a certain n will store it multiple
        times.

        Parameters
        ----------
        n : int
            Data length for the FFT.
        factors : ndarray
            The actual twiddle values.
        N)r0r.�pop�KeyError�append�_prune_cache)r1rZfactors�valuerrr �put_twiddle_factors

s








z_FFTCache.put_twiddle_factorsc	CsP|j�@
|
|j
ks|j
|
s d
S|j
�|
�
}|��}|rB||j
|
<|SQRXd
S)a�

        Pop twiddle factors for an FFT of length n from the cache.

        Will return None if the requested twiddle factors are not available in
        the cache.

        Parameters
        ----------
        n : int
            Data length for the FFT.

        Returns
        -------
        out : ndarray or None
            The retrieved twiddle factors if available, else None.
        N)r0r.r3)r1rZ
all_valuesr7rrr �pop_twiddle_factors
s





z_FFTCache.pop_twiddle_factorsc

Cs>x8t|j
�
d
kr8t|j
�
|jks(|��r8|j
jdd�

qWdS)NrF)
Zlast)�lenr.r+�_check_size�popitem)
r1rrr r67
s

z_FFTCache._prune_cachec
Cs<d
d�|j�
�D�
}
|
sdSt|jdt|
�
�}t|
�
|kS)Nc
Ss"g|]}
|
rtdd
�|
D�
�
�qS)c
ss|]}
|
jV
qdS)
N)
�nbytes)�.0Z_jrrr �	<genexpr>>
sz3_FFTCache._check_size.<locals>.<listcomp>.<genexpr>)
�sum)r>Z_irrr �
<listcomp>>
s
z)_FFTCache._check_size.<locals>.<listcomp>Fg�?)r.�values�maxr*r@)r1Z
item_sizesZmax_sizerrr r;=
s





z_FFTCache._check_sizeN)	�__name__�
__module__�__qualname__�__doc__r2r8r9r6r;rrrr r)�s
r))
N)
N)
r!)
r!)rGZ
__future__rrrr,r/Znumpy.compatrZ
numpy.corerrrr	r
r�__all__rr
rr�objectr)rrrr �<module>s


 

;
1
1
3