Edit File: helper.cpython-37.pyc
B ��Fd3% � @ s� d Z ddlmZmZmZ ddlZddlZddlmZ ddl m Z m Z m Z m Z mZmZ dddd gZeef Zdd d�Zdd d�Zdd d�Zddd �ZG dd� 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 C s� t | �}|j}|dkr$tt|��}nt|t�r4|f}|}xD|D ]<}|j| }|d d }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 �shaper r r ) �x�axes�tmpr �y�k�n�p2�mylist� r �C/opt/alt/python37/lib64/python3.7/site-packages/numpy/fft/helper.pyr s , c C s� t | �}|j}|dkr$tt|��}nt|t�r4|f}|}xH|D ]@}|j| }||d d }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.]]) Nr r ) r r r r r r r r r r ) r r r r r r r r r r r r r Q s " � �?c C sz t | t�std��d| | }t| t�}| d d d }td|td�}||d|�< t| d dtd�}|||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 �?r r r )�dtypeN)r r � ValueErrorr �intr )r �d�val�results�N�p1r r r r r � s $ c C s@ t | t�std��d| | }| d d }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 �?r r r )r" )r r r# r r$ )r r% r& r( r' r r r r � s + c @ s8 e Zd ZdZdd� 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. c C s( |d | _ || _t�� | _t�� | _d S )Ni )�_max_size_in_bytes�_max_item_count� collections� OrderedDict�_dict� threading�Lock�_lock)�selfZmax_size_in_mbZmax_item_countr r r �__init__� s z_FFTCache.__init__c C s\ | j �L y| j�|�}W n tk r0 g }Y nX |�|� || j|< | �� W dQ R X dS )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)r2 r/ �pop�KeyError�append� _prune_cache)r3 r Zfactors�valuer r r �put_twiddle_factors s z _FFTCache.put_twiddle_factorsc C sP | j �@ || jks | j| s dS | j�|�}|�� }|rB|| j|< |S Q R X dS )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)r2 r/ r5 )r3 r Z all_valuesr9 r r r �pop_twiddle_factors s z _FFTCache.pop_twiddle_factorsc C s> x8t | j�dkr8t | j�| jks(| �� r8| jjdd� qW d S )Nr F)�last)�lenr/ r, � _check_size�popitem)r3 r r r r8 7 s z_FFTCache._prune_cachec C s< dd� | j �� D �}|s dS t| jdt|� �}t|�|kS )Nc S s" g | ]}|rt d d� |D ���qS )c s s | ] }|j V qd S )N)�nbytes)�.0Z_jr r r � <genexpr>> s z3_FFTCache._check_size.<locals>.<listcomp>.<genexpr>)�sum)rA �_ir r r � <listcomp>> s z)_FFTCache._check_size.<locals>.<listcomp>Fg �?)r/ �values�maxr+ rC )r3 Z item_sizes�max_sizer r r r> = s z_FFTCache._check_sizeN) �__name__� __module__� __qualname__�__doc__r4 r: r; r8 r> r r r r r* � s r* )N)N)r! )r! )rL � __future__r r r r- r0 � numpy.compatr Z numpy.corer r r r r r �__all__r r r r �objectr* r r r r �<module> s ; 1 1 3