| Current File : //proc/self/root/proc/self/root/lib64/python2.7/site-packages/numpy/lib/function_base.pyc |
�
E�`Qc . @ s� d Z d d d d d d d d d d
d d d
d d d d d d d d d d d d d d d d d d d d! d" d# d$ d% d& d' d( d) d* d+ d, d- d. g. Z d/ d0 l Z d/ d0 l Z d/ d0 l Z d/ d0 l j j Z d/ d1 l m
Z
d/ d2 l m Z m Z m
Z
m Z m Z m Z m Z m Z m Z m Z m Z d/ d3 l m Z m Z m Z m Z m Z m Z m Z d/ d4 l m Z m Z m Z m! Z! m" Z" m# Z# m$ Z$ m% Z% m& Z& m' Z' m( Z( m) Z) m* Z* d/ d5 l+ m, Z, m- Z- m. Z. m/ Z/ m0 Z0 d/ d6 l1 m2 Z2 m3 Z3 d/ d7 l m4 Z4 m5 Z5 d/ d8 l6 m7 Z7 d/ d9 l8 m9 Z9 m: Z: d/ d: l8 m; Z; m< Z< m= Z> d/ d; l? m@ Z@ d/ d< lA mB ZB d/ d= l8 mC ZC d/ d0 lD ZE d> � ZF d? d0 eH d0 d0 d@ � ZI d? d0 eH d0 dA � ZJ d0 d0 eH dB � ZK d0 d0 dC � ZL dD � ZM dE dF � ZN dG dH � ZO dI � ZP dJ d/ dK � ZQ d0 d0 dL � Z= dE dM � ZR e d/ dN � ZS dO � ZT dP dQ � ZU d/ d0 l Z e jV dR k r�d/ dS lW mX ZY n eB dT � � ZZ dU � Z[ dV � Z\ d0 dW � Z] d0 dX � Z^ d0 dY � Z_ d0 dZ � Z` d0 d[ � Za d0 d\ � Zb d0 ec d] � Zd d ee f d^ � � YZf d0 dJ dE d0 d_ � Zg d0 dJ dE d0 d` � Zh da � Zi db � Zj dc � Zk dd � Zl de df dg dh di dj dk dl dm dn do dp dq dr ds dt du dv dw dx dy dz d{ d| d} d~ d d� d� d� g Zm d� d� d� d� d� d� d� d� d� d� d� d� d� d� d� d� d� d� d� d� d� d� d� d� d� g Zn d� � Zo d� � Zp d� � Zq d� � Zr d� � Zs d� � Zt d� � Zu d0 d0 eH d� � Zv d0 d0 eH d� � Zw d� � Zx d0 d� d/ d� � Zy d� � Zz d� � Z{ d0 d� � Z| d0 d� � Z} d0 d� � Z~ d0 S(� s restructuredtext ent selectt piecewiset
trim_zerost copyt iterablet
percentilet difft gradientt anglet unwrapt sort_complext dispt extractt placet nansumt nanmaxt nanargmaxt nanargmint nanmint vectorizet asarray_chkfinitet averaget histogramt histogramddt bincountt digitizet covt corrcoeft msortt mediant sinct hammingt hanningt bartlettt blackmant kaisert trapzt i0t
add_newdoct
add_docstringt meshgridt deletet insertt appendt interpt add_newdoc_ufunci����N( t linspace( t onest zerost aranget concatenatet arrayt asarrayt
asanyarrayt emptyt
empty_liket ndarrayt around( t
ScalarTypet dott wheret newaxist intpt integert isscalar(
t pit multiplyt addt arctan2t
frompyfunct isnant cost
less_equalt sqrtt sint modt expt log10( t ravelt nonzerot chooset sortt mean( t typecodest number( t
atleast_1dt
atleast_2d( t diag( t _insertR' ( R R R, ( t setdiff1d( t deprecate( R- c C s y t | � Wn d SXd S( sd
Check whether or not an object can be iterated over.
Parameters
----------
y : object
Input object.
Returns
-------
b : {0, 1}
Return 1 if the object has an iterator method or is a sequence,
and 0 otherwise.
Examples
--------
>>> np.iterable([1, 2, 3])
1
>>> np.iterable(2)
0
i i ( t iter( t y( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR # s
i
c C s� t | � } | d k r] t | � } t j | j | j k � rN t d � � n | j � } n | j � } | d k r� | \ } } | | k r� t d � � q� n t | � syt j | � r� | d k r� t d � � n | d k r| j
d k r� d } q| j � | j � f } n g | D] } | d ^ q\ } } | | k rZ| d 8} | d 7} n t
| | | d d t �} n6 t | � } t j | � d k j � r�t d � � n | d k r�t } n | j } t j | j | � }
d
} | d k rhxJt d t | � | � D]T } t | | | | !� }
|
t j |
j | d d � |
j | d d
� f 7}
q
Wn� t d d | �} x� t d t | � | � D]� } | | | | !} | | | | !} t j | � } | | }
| | } t j | g | j � f � } t j |
j | d d � |
j | d d
� f } |
| | 7}
q�Wt j |
� }
| d k r�| r�t t j | � t � } |
| |
j � | f S|
| f Sn@ | r�t t j | � t � } |
|
| j � | f S|
| f Sd S( s�
Compute the histogram of a set of data.
Parameters
----------
a : array_like
Input data. The histogram is computed over the flattened array.
bins : int or sequence of scalars, 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.
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.
normed : bool, optional
This keyword is deprecated in Numpy 1.6 due to confusing/buggy
behavior. It will be removed in Numpy 2.0. Use the density keyword
instead.
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 this latter behavior is
known to be buggy with unequal bin widths; use `density` instead.
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 `normed` 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.
Overrides the `normed` keyword if given.
Returns
-------
hist : array
The values of the histogram. See `normed` 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
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
s( weights should have the same shape as a.s/ max must be larger than min in range parameter.i s$ `bins` should be a positive integer.i g g �?t endpoints! bins must increase monotonically.i i����t leftt rightt dtypeN( i i ( R4 t Nonet npt anyt shapet
ValueErrorRN t AttributeErrorR R@ t sizet mint maxR. t TrueR t intR` R0 R1 t lenRQ t r_t searchsortedR3 t argsortR2 t cumsumt floatt sum( t at binst ranget normedt weightst densityt mnt mxt mit ntypet nt blockt it sat zerot tmp_at tmp_wt
sorting_indext swt cwt bin_indext db( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR ? sx T #
"
c C s y | j \ } } Wn5 t t f k
rJ t | � j } | j \ } } n Xt | t � } | d g } | d g } | d k r� t | � } n y+ t | � }
|
| k r� t d � � n Wn t
k
r� | | g } n X| d k rM| d k rt | � } t | � } q�t
t | j d � t � � } t
t | j d � t � � } nG t | � } t | � } x, t | � D] }
| |
\ | |
<| |
<qrWxU t t | � � D]A }
| |
| |
k r�| |
d | |
<| |
d | |
<q�q�Wx� t | � D]� }
t | |
� rm| |
d k r2t d |
� � n | |
d | |
<t | |
| |
| |
d � | |
<n/ t | |
t � | |
<t | |
� d | |
<t | |
� | |
<t j t j | |
� d k � r�t d � � q�q�Wt | � } | d k rt j | d � | f Si } x; t | � D]- }
t | d d � |
f | |
� | |
<q'Wx� t | � D]� }
| |
j � } t j | � set t | � � d } t t | d d � |
f | � t | |
d
| � k � d } | |
| c d 8<qeqeWt | t � j d
� } | j � } t | t � } xC t d | d � D]. }
| | | |
| | |
d j � 7} qCW| | | d
7} t | � d k r�t | d t � | f St | | � } t t | � � } | | | <| j t! | � � } xV t | j" � D]E }
| j � |
} | j# |
| � } | | | |
| |
<| | <q W| t$ d d
� g } | | } | r�| j% � } xL t | � D]> }
t | t � } | |
d | |
<| | |
j | � } q�W| | :} n | j | d k j � r�t& d � � n | | f S( sZ
Compute the multidimensional histogram of some data.
Parameters
----------
sample : array_like
The data to be histogrammed. It must be an (N,D) array or data
that can be converted to such. The rows of the resulting array
are the coordinates of points in a D dimensional polytope.
bins : sequence or int, optional
The bin specification:
* A sequence of arrays describing the 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 lower and upper bin edges to be used if the edges are
not given explicitely in `bins`. Defaults to the minimum and maximum
values along each dimension.
normed : bool, optional
If False, returns the number of samples in each bin. If True, returns
the bin density, ie, the bin count divided by the bin hypervolume.
weights : array_like (N,), optional
An array of values `w_i` weighing each sample `(x_i, y_i, z_i, ...)`.
Weights are normalized to 1 if normed is True. If normed 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 normed 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)
sE The dimension of bins must be equal to the dimension of the sample x.i g �?i s; Element at index %s in `bins` should be a positive integer.i si
Found bin edge of size <= 0. Did you specify `bins` with
non-monotonic sequence?Ni i����s Internal Shape Error(' Rd Rf Re RV t TR6 Rk Ra R4 Rl t TypeErrorR0 R/ RU R3 Rh Rq Ri R1 R@ R. R Rb Rc R t isinfRM R< R9 t reshapeRo t prodR RQ Rg t swapaxest sliceRr t RuntimeError( t sampleRt Ru Rv Rw t Nt Dt nbint edgest dedgest Mt smint smaxR t Ncountt mindifft decimalt on_edget histt nit xyt flatcountRs t jt coret sRd ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR � s� 4
!
)" +- ,
!
c C s� t | t j � s$ t j | � } n | d
k r^ | j | � } | j j | j | j � } n| d } t j | d | j d d �} | j
| j
k r'| d
k r� t d � � n | j d k r� t d � � n | j
d | j
| k r� t
d � � n t j | d d d | j �j d
| � } n | j d | � } | d k j � rZt d � � n t j | | � j | � | } | r�t j | d � | } | | f S| Sd
S( s�
Compute the weighted average along the specified axis.
Parameters
----------
a : array_like
Array containing data to be averaged. If `a` is not an array, a
conversion is attempted.
axis : int, optional
Axis along which to average `a`. If `None`, averaging is done over
the flattened array.
weights : array_like, optional
An array of weights associated with the values in `a`. Each value in
`a` contributes to the average according to its associated weight.
The weights array can either be 1-D (in which case its length must be
the size of `a` along the given axis) or of the same shape as `a`.
If `weights=None`, then all data in `a` are assumed to have a
weight equal to one.
returned : bool, optional
Default is `False`. If `True`, the tuple (`average`, `sum_of_weights`)
is returned, otherwise only the average is returned.
If `weights=None`, `sum_of_weights` is equivalent to the number of
elements over which the average is taken.
Returns
-------
average, [sum_of_weights] : {array_type, double}
Return the average along the specified axis. When returned is `True`,
return a tuple with the average as the first element and the sum
of the weights as the second element. The return type is `Float`
if `a` is of integer type, otherwise it is of the same type as `a`.
`sum_of_weights` is of the same type as `average`.
Raises
------
ZeroDivisionError
When all weights along axis are zero. See `numpy.ma.average` for a
version robust to this type of error.
TypeError
When the length of 1D `weights` is not the same as the shape of `a`
along axis.
See Also
--------
mean
ma.average : average for masked arrays -- useful if your data contains
"missing" values
Examples
--------
>>> data = range(1,5)
>>> data
[1, 2, 3, 4]
>>> np.average(data)
2.5
>>> np.average(range(1,11), weights=range(10,0,-1))
4.0
>>> data = np.arange(6).reshape((3,2))
>>> data
array([[0, 1],
[2, 3],
[4, 5]])
>>> np.average(data, axis=1, weights=[1./4, 3./4])
array([ 0.75, 2.75, 4.75])
>>> np.average(data, weights=[1./4, 3./4])
Traceback (most recent call last):
...
TypeError: Axis must be specified when shapes of a and weights differ.
g R` R i s; Axis must be specified when shapes of a and weights differ.i s8 1D weights expected when shapes of a and weights differ.s5 Length of weights not compatible with specified axis.t ndmini����t axiss( Weights sum to zero, can't be normalizedN( t
isinstanceRb t matrixR4 Ra RR R` t typeRg R3 Rd R� t ndimRe R� Rr Rc t ZeroDivisionErrorRB ( Rs R� Rw t returnedt avgt sclt wgt( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR � s6 J
-
c C sW t | d | d | �} | j j t d k rS t j | � j � rS t d � � n | S( sF
Convert the input to an array, checking for NaNs or Infs.
Parameters
----------
a : array_like
Input data, in any form that can be converted to an array. This
includes lists, lists of tuples, tuples, tuples of tuples, tuples
of lists and ndarrays. Success requires no NaNs or Infs.
dtype : data-type, optional
By default, the data-type is inferred from the input data.
order : {'C', 'F'}, optional
Whether to use row-major ('C') or column-major ('FORTRAN') memory
representation. Defaults to 'C'.
Returns
-------
out : ndarray
Array interpretation of `a`. No copy is performed if the input
is already an ndarray. If `a` is a subclass of ndarray, a base
class ndarray is returned.
Raises
------
ValueError
Raises ValueError if `a` contains NaN (Not a Number) or Inf (Infinity).
See Also
--------
asarray : Create and array.
asanyarray : Similar function which passes through subclasses.
ascontiguousarray : Convert input to a contiguous array.
asfarray : Convert input to a floating point ndarray.
asfortranarray : Convert input to an ndarray with column-major
memory order.
fromiter : Create an array from an iterator.
fromfunction : Construct an array by executing a function on grid
positions.
Examples
--------
Convert a list into an array. If all elements are finite
``asarray_chkfinite`` is identical to ``asarray``.
>>> a = [1, 2]
>>> np.asarray_chkfinite(a, dtype=float)
array([1., 2.])
Raises ValueError if array_like contains Nans or Infs.
>>> a = [1, 2, np.inf]
>>> try:
... np.asarray_chkfinite(a)
... except ValueError:
... print 'ValueError'
...
ValueError
R` t ordert AllFloats# array must not contain infs or NaNs( R4 R` t charRS Rb t isfinitet allRe ( Rs R` R� ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR s
<, c O s, t | � } t | � } t | � sK t | d t � pG t | d t � rW | g } n g | D] } t | d t �^ q^ } t | � } | | d k r� | d } x% t d | � D] } | | | O} q� W| j | � | d 7} n | | k r t
d � � n t }
| j d k r�| d } t }
g } xO t | � D]A } | | j d k rb| | d } n
| | } | j | � q8W| } n t | j | j � }
xu t | � D]g } | | } t | � s�| |
| | <q�| | | } | j d k r�| | | | � |
| | <q�q�W|
r(|
j � }
n |
S( sG
Evaluate a piecewise-defined function.
Given a set of conditions and corresponding functions, evaluate each
function on the input data wherever its condition is true.
Parameters
----------
x : ndarray
The input domain.
condlist : list of bool arrays
Each boolean array corresponds to a function in `funclist`. Wherever
`condlist[i]` is True, `funclist[i](x)` is used as the output value.
Each boolean array in `condlist` selects a piece of `x`,
and should therefore be of the same shape as `x`.
The length of `condlist` must correspond to that of `funclist`.
If one extra function is given, i.e. if
``len(funclist) - len(condlist) == 1``, then that extra function
is the default value, used wherever all conditions are false.
funclist : list of callables, f(x,*args,**kw), or scalars
Each function is evaluated over `x` wherever its corresponding
condition is True. It should take an array as input and give an array
or a scalar value as output. If, instead of a callable,
a scalar is provided then a constant function (``lambda x: scalar``) is
assumed.
args : tuple, optional
Any further arguments given to `piecewise` are passed to the functions
upon execution, i.e., if called ``piecewise(..., ..., 1, 'a')``, then
each function is called as ``f(x, 1, 'a')``.
kw : dict, optional
Keyword arguments used in calling `piecewise` are passed to the
functions upon execution, i.e., if called
``piecewise(..., ..., lambda=1)``, then each function is called as
``f(x, lambda=1)``.
Returns
-------
out : ndarray
The output is the same shape and type as x and is found by
calling the functions in `funclist` on the appropriate portions of `x`,
as defined by the boolean arrays in `condlist`. Portions not covered
by any condition have undefined values.
See Also
--------
choose, select, where
Notes
-----
This is similar to choose or select, except that functions are
evaluated on elements of `x` that satisfy the corresponding condition from
`condlist`.
The result is::
|--
|funclist[0](x[condlist[0]])
out = |funclist[1](x[condlist[1]])
|...
|funclist[n2](x[condlist[n2]])
|--
Examples
--------
Define the sigma function, which is -1 for ``x < 0`` and +1 for ``x >= 0``.
>>> x = np.arange(6) - 2.5
>>> np.piecewise(x, [x < 0, x >= 0], [-1, 1])
array([-1., -1., -1., 1., 1., 1.])
Define the absolute value, which is ``-x`` for ``x <0`` and ``x`` for
``x >= 0``.
>>> np.piecewise(x, [x < 0, x >= 0], [lambda x: -x, lambda x: x])
array([ 2.5, 1.5, 0.5, 0.5, 1.5, 2.5])
i R` i s1 function list and condition list must be the sameN( R5 Rl R@ R� t listR8 R4 t boolRu R+ Re t FalseR� Ra Rj R0 Rd R` t callableRg t squeeze( t xt condlistt funclistt argst kwt n2t cR} t totlistt kt zerodt newcondlistt conditionR\ t itemt vals( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR Q sN Q %
!i c C s� t | � } t | � } | | k r3 t d � � n | g | } d } d } xf t d | d � D]Q } | | | t | | d � 7} | | k r` | d t | | d � 9} q` q` Wt | � t k s� t t | � j � d k rvt d � } x, t | d � D] } | t | | � } q� Wt | � t k rT| t t | � j t | � � } qv| t t | � j | j � } n t
| t | � � S( s�
Return an array drawn from elements in choicelist, depending on conditions.
Parameters
----------
condlist : list of bool ndarrays
The list of conditions which determine from which array in `choicelist`
the output elements are taken. When multiple conditions are satisfied,
the first one encountered in `condlist` is used.
choicelist : list of ndarrays
The list of arrays from which the output elements are taken. It has
to be of the same length as `condlist`.
default : scalar, optional
The element inserted in `output` when all conditions evaluate to False.
Returns
-------
output : ndarray
The output at position m is the m-th element of the array in
`choicelist` where the m-th element of the corresponding array in
`condlist` is True.
See Also
--------
where : Return elements from one of two arrays depending on condition.
take, choose, compress, diag, diagonal
Examples
--------
>>> x = np.arange(10)
>>> condlist = [x<3, x>5]
>>> choicelist = [x, x**2]
>>> np.select(condlist, choicelist)
array([ 0, 1, 2, 0, 0, 0, 36, 49, 64, 81])
s7 list of cases must be same length as list of conditionsi i ( Rl Re Ru R4 R� R: Ri Rd R/ R` RP t tuple( R� t
choicelistt defaultR} R� t St pfacR� ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR � s( %
#- %"t Kc C s t | d | d t �S( s
Return an array copy of the given object.
Parameters
----------
a : array_like
Input data.
order : {'C', 'F', 'A', 'K'}, optional
Controls the memory layout of the copy. 'C' means C-order,
'F' means F-order, 'A' means 'F' if `a` is Fortran contiguous,
'C' otherwise. 'K' means match the layout of `a` as closely
as possible. (Note that this function and :meth:ndarray.copy are very
similar, but have different default values for their order=
arguments.)
Returns
-------
arr : ndarray
Array interpretation of `a`.
Notes
-----
This is equivalent to
>>> np.array(a, copy=True) #doctest: +SKIP
Examples
--------
Create an array x, with a reference y and a copy z:
>>> x = np.array([1, 2, 3])
>>> y = x
>>> z = np.copy(x)
Note that, when we modify x, y changes, but not z:
>>> x[0] = 10
>>> x[0] == y[0]
True
>>> x[0] == z[0]
False
R� R ( R3 Rj ( Rs R� ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR
s ,c G st t j | � } t | j � } t | � } | d k rF d g | } nG | d k rf | d g | } n' | | k r� t | � } n t d � � g } t d � g | } t d � g | } t d � g | } | j j } | d k r� d } n | d
k r| j j
j d d � } n | d k r,| j } n x)t | � D]}
t j
| d
| �} t d d � | |
<t d d � | |
<t d d � | |
<| | | | d | | <d | |
<d | |
<d | |
<| | | | | | <d | |
<d | |
<d | |
<| | | | | | <| j | | |
� t d � | |
<t d � | |
<t d � | |
<q9W| d k rl| d S| Sd S( s]
Return the gradient of an N-dimensional array.
The gradient is computed using central differences in the interior
and first differences at the boundaries. The returned gradient hence has
the same shape as the input array.
Parameters
----------
f : array_like
An N-dimensional array containing samples of a scalar function.
`*varargs` : scalars
0, 1, or N scalars specifying the sample distances in each direction,
that is: `dx`, `dy`, `dz`, ... The default distance is 1.
Returns
-------
gradient : ndarray
N arrays of the same shape as `f` giving the derivative of `f` with
respect to each dimension.
Examples
--------
>>> x = np.array([1, 2, 4, 7, 11, 16], dtype=np.float)
>>> np.gradient(x)
array([ 1. , 1.5, 2.5, 3.5, 4.5, 5. ])
>>> np.gradient(x, 2)
array([ 0.5 , 0.75, 1.25, 1.75, 2.25, 2.5 ])
>>> np.gradient(np.array([[1, 2, 6], [3, 4, 5]], dtype=np.float))
[array([[ 2., 2., -1.],
[ 2., 2., -1.]]),
array([[ 1. , 2.5, 4. ],
[ 1. , 1. , 1. ]])]
i g �?i s invalid number of argumentst ft dt FR� t mR� t datetimet timedeltaR` i����i i����g @N( R� R� R� R� R� R� ( Rb R5 Rl Rd R� t SyntaxErrorR� Ra R` R� t namet replaceRu R7 R+ ( R� t varargsR� R} t dxt outvalst slice1t slice2t slice3t otypeR� t out( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR = sV &
i c C s� | d k r | S| d k r5 t d t | � � � n t | � } t | j � } t d � g | } t d � g | } t d d � | | <t d d � | | <t | � } t | � } | d k r� t | | | | | d d | �S| | | | Sd S( s+
Calculate the n-th order discrete difference along given axis.
The first order difference is given by ``out[n] = a[n+1] - a[n]`` along
the given axis, higher order differences are calculated by using `diff`
recursively.
Parameters
----------
a : array_like
Input array
n : int, optional
The number of times values are differenced.
axis : int, optional
The axis along which the difference is taken, default is the last axis.
Returns
-------
diff : ndarray
The `n` order differences. The shape of the output is the same as `a`
except along `axis` where the dimension is smaller by `n`.
See Also
--------
gradient, ediff1d
Examples
--------
>>> x = np.array([1, 2, 4, 7, 0])
>>> np.diff(x)
array([ 1, 2, 3, -7])
>>> np.diff(x, n=2)
array([ 1, 1, -10])
>>> x = np.array([[1, 3, 6, 10], [0, 5, 6, 8]])
>>> np.diff(x)
array([[2, 3, 4],
[5, 1, 2]])
>>> np.diff(x, axis=0)
array([[-1, 2, 0, -2]])
i s# order must be non-negative but got i i����R� N( Re t reprR5 Rl Rd R� Ra R� R ( Rs R} R� t ndR� R� ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR � s + #c C s� t | t t t f � r7 t | g | | | | � j � St | t j � rw | j d k rw t | g | | | | � j � St | | | | | � Sd S( s�
One-dimensional linear interpolation.
Returns the one-dimensional piecewise linear interpolant to a function
with given values at discrete data-points.
Parameters
----------
x : array_like
The x-coordinates of the interpolated values.
xp : 1-D sequence of floats
The x-coordinates of the data points, must be increasing.
fp : 1-D sequence of floats
The y-coordinates of the data points, same length as `xp`.
left : float, optional
Value to return for `x < xp[0]`, default is `fp[0]`.
right : float, optional
Value to return for `x > xp[-1]`, defaults is `fp[-1]`.
Returns
-------
y : {float, ndarray}
The interpolated values, same shape as `x`.
Raises
------
ValueError
If `xp` and `fp` have different length
Notes
-----
Does not check that the x-coordinate sequence `xp` is increasing.
If `xp` is not increasing, the results are nonsense.
A simple check for increasingness is::
np.all(np.diff(xp) > 0)
Examples
--------
>>> xp = [1, 2, 3]
>>> fp = [3, 2, 0]
>>> np.interp(2.5, xp, fp)
1.0
>>> np.interp([0, 1, 1.5, 2.72, 3.14], xp, fp)
array([ 3. , 3. , 2.5 , 0.56, 0. ])
>>> UNDEF = -99.0
>>> np.interp(3.14, xp, fp, right=UNDEF)
-99.0
Plot an interpolant to the sine function:
>>> x = np.linspace(0, 2*np.pi, 10)
>>> y = np.sin(x)
>>> xvals = np.linspace(0, 2*np.pi, 50)
>>> yinterp = np.interp(xvals, x, y)
>>> import matplotlib.pyplot as plt
>>> plt.plot(x, y, 'o')
[<matplotlib.lines.Line2D object at 0x...>]
>>> plt.plot(xvals, yinterp, '-x')
[<matplotlib.lines.Line2D object at 0x...>]
>>> plt.show()
i N( R� Rq Rk RT t compiled_interpR� Rb R8 R� ( R� t xpt fpR^ R_ ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR, � s
E ! c C so | r d t } n d } t | � } t | j j t j � rR | j } | j } n d } | } t | | � | S( s�
Return the angle of the complex argument.
Parameters
----------
z : array_like
A complex number or sequence of complex numbers.
deg : bool, optional
Return angle in degrees if True, radians if False (default).
Returns
-------
angle : {ndarray, scalar}
The counterclockwise angle from the positive real axis on
the complex plane, with dtype as numpy.float64.
See Also
--------
arctan2
absolute
Examples
--------
>>> np.angle([1.0, 1.0j, 1+1j]) # in radians
array([ 0. , 1.57079633, 0.78539816])
>>> np.angle(1+1j, deg=True) # in degrees
45.0
i� g �?i (
RA R4 t
issubclassR` R� t _nxt complexfloatingt imagt realRD ( t zt degt factt zimagt zreal( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR 0 s
c C s� t | � } t | j � } t | d | �} t d d � g | } t d d � | | <t | t d t � t } t j | t d | t k | d k @�| | } t j | d d t
| � | k �t | d t d d �} | | | j
| � | | <| S(
s8
Unwrap by changing deltas between values to 2*pi complement.
Unwrap radian phase `p` by changing absolute jumps greater than
`discont` to their 2*pi complement along the given axis.
Parameters
----------
p : array_like
Input array.
discont : float, optional
Maximum discontinuity between values, default is ``pi``.
axis : int, optional
Axis along which unwrap will operate, default is the last axis.
Returns
-------
out : ndarray
Output array.
See Also
--------
rad2deg, deg2rad
Notes
-----
If the discontinuity in `p` is smaller than ``pi``, but larger than
`discont`, no unwrapping is done because taking the 2*pi complement
would only make the discontinuity larger.
Examples
--------
>>> phase = np.linspace(0, np.pi, num=5)
>>> phase[3:] += np.pi
>>> phase
array([ 0. , 0.78539816, 1.57079633, 5.49778714, 6.28318531])
>>> np.unwrap(phase)
array([ 0. , 0.78539816, 1.57079633, -0.78539816, 0. ])
R� i i R< i R R` R� N( R4 Rl Rd R R� Ra RK RA R� t copytot absR3 Rj Rp ( t pt discontR� R� t ddR� t ddmodt
ph_correctt up( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR ] s ) '
"c C s� t | d t �} | j � t | j j t j � s� | j j d k rS | j d � S| j j d k rr | j d � S| j d � Sn | Sd S( s�
Sort a complex array using the real part first, then the imaginary part.
Parameters
----------
a : array_like
Input array
Returns
-------
out : complex ndarray
Always returns a sorted complex array.
Examples
--------
>>> np.sort_complex([5, 3, 6, 2, 1])
array([ 1.+0.j, 2.+0.j, 3.+0.j, 5.+0.j, 6.+0.j])
>>> np.sort_complex([1 + 2j, 2 - 1j, 3 - 2j, 3 - 3j, 3 + 5j])
array([ 1.+2.j, 2.-1.j, 3.-3.j, 3.-2.j, 3.+5.j])
R t bhBHR� t gt GR� N(
R3 Rj RQ R� R` R� R� R� R� t astype( Rs t b( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR
� s
t fbc C s� d } | j � } d | k rL x+ | D] } | d k r; Pq% | d } q% Wn t | � } d | k r� x8 | d d d � D] } | d k r� Pqx | d } qx Wn | | | !S( s3
Trim the leading and/or trailing zeros from a 1-D array or sequence.
Parameters
----------
filt : 1-D array or sequence
Input array.
trim : str, optional
A string with 'f' representing trim from front and 'b' to trim from
back. Default is 'fb', trim zeros from both front and back of the
array.
Returns
-------
trimmed : 1-D array or sequence
The result of trimming the input. The input data type is preserved.
Examples
--------
>>> a = np.array((0, 0, 0, 1, 2, 3, 0, 2, 1, 0))
>>> np.trim_zeros(a)
array([1, 2, 3, 0, 2, 1])
>>> np.trim_zeros(a, 'b')
array([0, 0, 0, 1, 2, 3, 0, 2, 1])
The input data type is preserved, list/tuple in means list/tuple out.
>>> np.trim_zeros([0, 1, 2, 0])
[1, 2]
i R� g i t BNi����( t upperRl ( t filtt trimt firstR t last( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR � s !
i ( t Setc C s� yX | j � } | j d k r" | S| j � t t g | d | d k f � } | | SWn4 t k
r� t t | � � } | j � t | � SXd S( sW
This function is deprecated. Use numpy.lib.arraysetops.unique()
instead.
i i i����N( t flattenRg RQ R2 Rj Rf R� t setR4 ( R� t tmpt idxt items( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyt unique� s
#
c C s& t j t | � t t | � � d � S( sp
Return the elements of an array that satisfy some condition.
This is equivalent to ``np.compress(ravel(condition), ravel(arr))``. If
`condition` is boolean ``np.extract`` is equivalent to ``arr[condition]``.
Parameters
----------
condition : array_like
An array whose nonzero or True entries indicate the elements of `arr`
to extract.
arr : array_like
Input array of the same size as `condition`.
Returns
-------
extract : ndarray
Rank 1 array of values from `arr` where `condition` is True.
See Also
--------
take, put, copyto, compress
Examples
--------
>>> arr = np.arange(12).reshape((3, 4))
>>> arr
array([[ 0, 1, 2, 3],
[ 4, 5, 6, 7],
[ 8, 9, 10, 11]])
>>> condition = np.mod(arr, 3)==0
>>> condition
array([[ True, False, False, True],
[False, False, True, False],
[False, True, False, False]], dtype=bool)
>>> np.extract(condition, arr)
array([0, 3, 6, 9])
If `condition` is boolean:
>>> arr[condition]
array([0, 3, 6, 9])
i ( R� t takeRN RO ( R� t arr( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR � s .c C s t | | | � S( s�
Change elements of an array based on conditional and input values.
Similar to ``np.copyto(arr, vals, where=mask)``, the difference is that
`place` uses the first N elements of `vals`, where N is the number of
True values in `mask`, while `copyto` uses the elements where `mask`
is True.
Note that `extract` does the exact opposite of `place`.
Parameters
----------
arr : array_like
Array to put data into.
mask : array_like
Boolean mask array. Must have the same size as `a`.
vals : 1-D sequence
Values to put into `a`. Only the first N elements are used, where
N is the number of True values in `mask`. If `vals` is smaller
than N it will be repeated.
See Also
--------
copyto, put, take, extract
Examples
--------
>>> arr = np.arange(6).reshape(2, 3)
>>> np.place(arr, arr>2, [44, 55])
>>> arr
array([[ 0, 1, 2],
[44, 55, 44]])
( RX ( R
t maskR� ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR
* s #c C s� t | d t �} | j } t j | t j � sE t j | t j � rU | | d | �St | � } t j | | d | �| | d | �} | j d | � } | j
� r� t j | � r� t j } q� t j | | <n | S( s�
General operation on arrays with not-a-number values.
Parameters
----------
op : callable
Operation to perform.
fill : float
NaN values are set to fill before doing the operation.
a : array-like
Input array.
axis : {int, None}, optional
Axis along which the operation is computed.
By default the input is flattened.
Returns
-------
y : {ndarray, scalar}
Processed data.
t subokR� R< (
R3 Rj R` Rb t
issubdtypeR? t bool_RF R� R� Rc R@ t nan( t opt fillRs R� R\ t dtR t rest mask_all_along_axis( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyt _nanopO s * c C s t t j d | | � S( s�
Return the sum of array elements over a given axis treating
Not a Numbers (NaNs) as zero.
Parameters
----------
a : array_like
Array containing numbers whose sum is desired. If `a` is not an
array, a conversion is attempted.
axis : int, optional
Axis along which the sum is computed. The default is to compute
the sum of the flattened array.
Returns
-------
y : ndarray
An array with the same shape as a, with the specified axis removed.
If a is a 0-d array, or if axis is None, a scalar is returned with
the same dtype as `a`.
See Also
--------
numpy.sum : Sum across array including Not a Numbers.
isnan : Shows which elements are Not a Number (NaN).
isfinite: Shows which elements are not: Not a Number, positive and
negative infinity
Notes
-----
Numpy uses the IEEE Standard for Binary Floating-Point for Arithmetic
(IEEE 754). This means that Not a Number is not equivalent to infinity.
If positive or negative infinity are present the result is positive or
negative infinity. But if both positive and negative infinity are present,
the result is Not A Number (NaN).
Arithmetic is modular when using integer types (all elements of `a` must
be finite i.e. no elements that are NaNs, positive infinity and negative
infinity because NaNs are floating point types), and no error is raised
on overflow.
Examples
--------
>>> np.nansum(1)
1
>>> np.nansum([1])
1
>>> np.nansum([1, np.nan])
1.0
>>> a = np.array([[1, 1], [1, np.nan]])
>>> np.nansum(a)
3.0
>>> np.nansum(a, axis=0)
array([ 2., 1.])
When positive infinity and negative infinity are present
>>> np.nansum([1, np.nan, np.inf])
inf
>>> np.nansum([1, np.nan, np.NINF])
-inf
>>> np.nansum([1, np.nan, np.inf, np.NINF])
nan
i ( R Rb Rr ( Rs R� ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR ~ s Bc C sE t j | � } | d k r. t j j | | � St j j | j � Sd S( s�
Return the minimum of an array or minimum along an axis ignoring any NaNs.
Parameters
----------
a : array_like
Array containing numbers whose minimum is desired.
axis : int, optional
Axis along which the minimum is computed.The default is to compute
the minimum of the flattened array.
Returns
-------
nanmin : ndarray
A new array or a scalar array with the result.
See Also
--------
numpy.amin : Minimum across array including any Not a Numbers.
numpy.nanmax : Maximum across array ignoring any Not a Numbers.
isnan : Shows which elements are Not a Number (NaN).
isfinite: Shows which elements are not: Not a Number, positive and
negative infinity
Notes
-----
Numpy uses the IEEE Standard for Binary Floating-Point for Arithmetic
(IEEE 754). This means that Not a Number is not equivalent to infinity.
Positive infinity is treated as a very large number and negative infinity
is treated as a very small (i.e. negative) number.
If the input has a integer type the function is equivalent to np.min.
Examples
--------
>>> a = np.array([[1, 2], [3, np.nan]])
>>> np.nanmin(a)
1.0
>>> np.nanmin(a, axis=0)
array([ 1., 2.])
>>> np.nanmin(a, axis=1)
array([ 1., 3.])
When positive infinity and negative infinity are present:
>>> np.nanmin([1, 2, np.nan, np.inf])
1.0
>>> np.nanmin([1, 2, np.nan, np.NINF])
-inf
N( Rb R5 Ra t fmint reducet flat( Rs R� ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR � s 5 c C s t t j t j | | � S( sr
Return indices of the minimum values over an axis, ignoring NaNs.
Parameters
----------
a : array_like
Input data.
axis : int, optional
Axis along which to operate. By default flattened input is used.
Returns
-------
index_array : ndarray
An array of indices or a single index value.
See Also
--------
argmin, nanargmax
Examples
--------
>>> a = np.array([[np.nan, 4], [2, 3]])
>>> np.argmin(a)
0
>>> np.nanargmin(a)
2
>>> np.nanargmin(a, axis=0)
array([1, 1])
>>> np.nanargmin(a, axis=1)
array([1, 0])
( R Rb t argmint inf( Rs R� ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR � s !c C sE t j | � } | d k r. t j j | | � St j j | j � Sd S( s�
Return the maximum of an array or maximum along an axis ignoring any NaNs.
Parameters
----------
a : array_like
Array containing numbers whose maximum is desired. If `a` is not
an array, a conversion is attempted.
axis : int, optional
Axis along which the maximum is computed. The default is to compute
the maximum of the flattened array.
Returns
-------
nanmax : ndarray
An array with the same shape as `a`, with the specified axis removed.
If `a` is a 0-d array, or if axis is None, a ndarray scalar is
returned. The the same dtype as `a` is returned.
See Also
--------
numpy.amax : Maximum across array including any Not a Numbers.
numpy.nanmin : Minimum across array ignoring any Not a Numbers.
isnan : Shows which elements are Not a Number (NaN).
isfinite: Shows which elements are not: Not a Number, positive and
negative infinity
Notes
-----
Numpy uses the IEEE Standard for Binary Floating-Point for Arithmetic
(IEEE 754). This means that Not a Number is not equivalent to infinity.
Positive infinity is treated as a very large number and negative infinity
is treated as a very small (i.e. negative) number.
If the input has a integer type the function is equivalent to np.max.
Examples
--------
>>> a = np.array([[1, 2], [3, np.nan]])
>>> np.nanmax(a)
3.0
>>> np.nanmax(a, axis=0)
array([ 3., 2.])
>>> np.nanmax(a, axis=1)
array([ 2., 3.])
When positive infinity and negative infinity are present:
>>> np.nanmax([1, 2, np.nan, np.NINF])
2.0
>>> np.nanmax([1, 2, np.nan, np.inf])
inf
N( Rb R5 Ra t fmaxR R ( Rs R� ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR s 7 c C s t t j t j | | � S( sr
Return indices of the maximum values over an axis, ignoring NaNs.
Parameters
----------
a : array_like
Input data.
axis : int, optional
Axis along which to operate. By default flattened input is used.
Returns
-------
index_array : ndarray
An array of indices or a single index value.
See Also
--------
argmax, nanargmin
Examples
--------
>>> a = np.array([[np.nan, 4], [2, 3]])
>>> np.argmax(a)
0
>>> np.nanargmax(a)
1
>>> np.nanargmax(a, axis=0)
array([1, 0])
>>> np.nanargmax(a, axis=1)
array([1, 1])
( R Rb t argmaxR ( Rs R� ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR ] s !c C s] | d k r$ d d l } | j } n | r> | j d | � n | j d | � | j � d S( s7
Display a message on a device.
Parameters
----------
mesg : str
Message to display.
device : object
Device to write message. If None, defaults to ``sys.stdout`` which is
very similar to ``print``. `device` needs to have ``write()`` and
``flush()`` methods.
linefeed : bool, optional
Option whether to print a line feed or not. Defaults to True.
Raises
------
AttributeError
If `device` does not have a ``write()`` or ``flush()`` method.
Examples
--------
Besides ``sys.stdout``, a file-like object can also be used as it has
both required methods:
>>> from StringIO import StringIO
>>> buf = StringIO()
>>> np.disp('"Display" in a file', device=buf)
>>> buf.getvalue()
'"Display" in a file\n'
i����Ns %s
s %s( Ra t syst stdoutt writet flush( t mesgt devicet linefeedR ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR � s
c B s> e Z d Z d d d e d � Z d � Z d � Z d � Z RS( s+
vectorize(pyfunc, otypes='', doc=None, excluded=None, cache=False)
Generalized function class.
Define a vectorized function which takes a nested sequence
of objects or numpy arrays as inputs and returns a
numpy array as output. The vectorized function evaluates `pyfunc` over
successive tuples of the input arrays like the python map function,
except it uses the broadcasting rules of numpy.
The data type of the output of `vectorized` is determined by calling
the function with the first element of the input. This can be avoided
by specifying the `otypes` argument.
Parameters
----------
pyfunc : callable
A python function or method.
otypes : str or list of dtypes, optional
The output data type. It must be specified as either a string of
typecode characters or a list of data type specifiers. There should
be one data type specifier for each output.
doc : str, optional
The docstring for the function. If `None`, the docstring will be the
``pyfunc.__doc__``.
excluded : set, optional
Set of strings or integers representing the positional or keyword
arguments for which the function will not be vectorized. These will be
passed directly to `pyfunc` unmodified.
.. versionadded:: 1.7.0
cache : bool, optional
If `True`, then cache the first function call that determines the number
of outputs if `otypes` is not provided.
.. versionadded:: 1.7.0
Returns
-------
vectorized : callable
Vectorized function.
Examples
--------
>>> def myfunc(a, b):
... "Return a-b if a>b, otherwise return a+b"
... if a > b:
... return a - b
... else:
... return a + b
>>> vfunc = np.vectorize(myfunc)
>>> vfunc([1, 2, 3, 4], 2)
array([3, 4, 1, 2])
The docstring is taken from the input function to `vectorize` unless it
is specified
>>> vfunc.__doc__
'Return a-b if a>b, otherwise return a+b'
>>> vfunc = np.vectorize(myfunc, doc='Vectorized `myfunc`')
>>> vfunc.__doc__
'Vectorized `myfunc`'
The output type is determined by evaluating the first element of the input,
unless it is specified
>>> out = vfunc([1, 2, 3, 4], 2)
>>> type(out[0])
<type 'numpy.int32'>
>>> vfunc = np.vectorize(myfunc, otypes=[np.float])
>>> out = vfunc([1, 2, 3, 4], 2)
>>> type(out[0])
<type 'numpy.float64'>
The `excluded` argument can be used to prevent vectorizing over certain
arguments. This can be useful for array-like arguments of a fixed length
such as the coefficients for a polynomial as in `polyval`:
>>> def mypolyval(p, x):
... _p = list(p)
... res = _p.pop(0)
... while _p:
... res = res*x + _p.pop(0)
... return res
>>> vpolyval = np.vectorize(mypolyval, excluded=['p'])
>>> vpolyval(p=[1, 2, 3], x=[0, 1])
array([3, 6])
Positional arguments may also be excluded by specifying their position:
>>> vpolyval.excluded.add(0)
>>> vpolyval([1, 2, 3], x=[0, 1])
array([3, 6])
Notes
-----
The `vectorize` function is provided primarily for convenience, not for
performance. The implementation is essentially a for loop.
If `otypes` is not specified, then a call to the function with the first
argument will be used to determine the number of outputs. The results of
this call will be cached if `cache` is `True` to prevent calling the
function twice. However, to implement the cache, the original function must
be wrapped which will slow down subsequent calls, so only do this if your
function is expensive.
The new keyword argument interface and `excluded` argument support further
degrades performance.
t c C s! | | _ | | _ | d k r- | j | _ n | | _ t | t � r� | | _ x� | j D], } | t d k rX t d | f � � qX qX WnL t | � r� d j
g | D] } t j | � j
^ q� � | _ n t d � � | d k r� t � } n t | � | _ | j r | j r d | _ n d S( Nt Alls Invalid otype specified: %sR$ s Invalid otype specification( t pyfunct cacheRa t __doc__R� t strt otypesRS Re R t joinR� R` R� R t excludedt _ufunc( t selfR& R* t docR, R' R� R� ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyt __init__ s$ 4 c s � j } � r) | r) � j } | } n� t | � } g � D] } | | k r< | ^ q< � g t | � D] } | | k rg | ^ qg � t | � � � � � � � f d � } g � D] } | | ^ q� } | j g � D] } � | ^ q� � � j d | d | � S( s�
Return arrays with the results of `pyfunc` broadcast (vectorized) over
`args` and `kwargs` not in `excluded`.
c s[ x( t � � D] \ } } | | � | <q
W� j t � | t � � � � � j � � � S( N( t enumeratet updatet zipRl R& ( t vargst _nt _i( t indst kwargst namesR. t the_args( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyt funcH s R; R� ( R, R& Rl Ru R� t extendt _vectorize_call( R. R� R8 R, R; R4 t nargsR5 R6 ( ( R7 R8 R9 R. R: s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyt __call__6 s %+ $c s\ | s t � | j rv | j } t | � } � | j k rT | j d k rT | j } qRt � t | � | � } | _ n� g | D] } t | � j d ^ q} } � | � } | j r� | g � � � f d � } n � } t
| t � r� t | � } n d } | f } d j g t
| � D] }
t | |
� j j ^ q� } t | t | � | � } | | f S( s Return (ufunc, otypes).i c s � r � j � S� | � Sd S( N( t pop( R4 ( t _cacheR; ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyt _funcp s
i R$ N( t AssertionErrorR* Rl R& R- Ra RE R4 R R' R� R� R+ Ru R` R� ( R. R; R� R* t noutt ufunct _at inputst outputsRB t _k( ( RA R; s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyt _get_ufunc_and_otypesS s* "& /c C s� | s | � } n� | j d | d | � \ } } g | D]$ } t | d t d t d t �^ q7 } | | � } | j d k r� t | d t d t d | d �} nF t g t | | � D]* \ } }
t | d t d t d |
�^ q� � } | S( s1 Vectorized call to `func` over positional `args`.R; R� R R R` i i ( RJ R3 R� Rj t objectRD R� R3 ( R. R; R� t _resRE R* RF RG RH t _xt _t( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR= � s . @N( t __name__t
__module__R( Ra R� R0 R? RJ R= ( ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR � s
p 5c
C s� | d k r- | t | � k r- t d � � n t | d d d t �} | j d k ra t j | � S| j d d k r} d } n | r� d } t d � t f } n d } t t d � f } | d k r� t | d t
d d d t �} t | | f | � } n | | j d d | � | 8} | r,| j d } n
| j d } | d k rc| d k rZd } qcd } n t | | � } | s�t
| j | j � � | j � St
| | j j � � | j � Sd S(
sm
Estimate a covariance matrix, given data.
Covariance indicates the level to which two variables vary together.
If we examine N-dimensional samples, :math:`X = [x_1, x_2, ... x_N]^T`,
then the covariance matrix element :math:`C_{ij}` is the covariance of
:math:`x_i` and :math:`x_j`. The element :math:`C_{ii}` is the variance
of :math:`x_i`.
Parameters
----------
m : array_like
A 1-D or 2-D array containing multiple variables and observations.
Each row of `m` represents a variable, and each column a single
observation of all those variables. Also see `rowvar` below.
y : array_like, optional
An additional set of variables and observations. `y` has the same
form as that of `m`.
rowvar : int, optional
If `rowvar` is non-zero (default), then each row represents a
variable, with observations in the columns. Otherwise, the relationship
is transposed: each column represents a variable, while the rows
contain observations.
bias : int, optional
Default normalization is by ``(N - 1)``, where ``N`` is the number of
observations given (unbiased estimate). If `bias` is 1, then
normalization is by ``N``. These values can be overridden by using
the keyword ``ddof`` in numpy versions >= 1.5.
ddof : int, optional
.. versionadded:: 1.5
If not ``None`` normalization is by ``(N - ddof)``, where ``N`` is
the number of observations; this overrides the value implied by
``bias``. The default value is ``None``.
Returns
-------
out : ndarray
The covariance matrix of the variables.
See Also
--------
corrcoef : Normalized covariance matrix
Examples
--------
Consider two variables, :math:`x_0` and :math:`x_1`, which
correlate perfectly, but in opposite directions:
>>> x = np.array([[0, 2], [1, 1], [2, 0]]).T
>>> x
array([[0, 1, 2],
[2, 1, 0]])
Note how :math:`x_0` increases while :math:`x_1` decreases. The covariance
matrix shows this clearly:
>>> np.cov(x)
array([[ 1., -1.],
[-1., 1.]])
Note that element :math:`C_{0,1}`, which shows the correlation between
:math:`x_0` and :math:`x_1`, is negative.
Further, note how `x` and `y` are combined:
>>> x = [-2.1, -1, 4.3]
>>> y = [3, 1.1, 0.12]
>>> X = np.vstack((x,y))
>>> print np.cov(X)
[[ 11.71 -4.286 ]
[ -4.286 2.14413333]]
>>> print np.cov(x, y)
[[ 11.71 -4.286 ]
[ -4.286 2.14413333]]
>>> print np.cov(x)
11.71
s ddof must be integerR� i R` i i R R� N( Ra Rk Re R3 Rq Rg Rb Rd R� R= R� R2 RR R; R� t conjR� (
R� R\ t rowvart biast ddoft XR� t tupR� R� ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR � s6 P
c C sj t | | | | | � } | j d k r+ | Sy t | � } Wn t k
rO d SX| t t j | | � � S( s�
Return correlation coefficients.
Please refer to the documentation for `cov` for more detail. The
relationship between the correlation coefficient matrix, `P`, and the
covariance matrix, `C`, is
.. math:: P_{ij} = \frac{ C_{ij} } { \sqrt{ C_{ii} * C_{jj} } }
The values of `P` are between -1 and 1, inclusive.
Parameters
----------
x : array_like
A 1-D or 2-D array containing multiple variables and observations.
Each row of `m` represents a variable, and each column a single
observation of all those variables. Also see `rowvar` below.
y : array_like, optional
An additional set of variables and observations. `y` has the same
shape as `m`.
rowvar : int, optional
If `rowvar` is non-zero (default), then each row represents a
variable, with observations in the columns. Otherwise, the relationship
is transposed: each column represents a variable, while the rows
contain observations.
bias : int, optional
Default normalization is by ``(N - 1)``, where ``N`` is the number of
observations (unbiased estimate). If `bias` is 1, then
normalization is by ``N``. These values can be overridden by using
the keyword ``ddof`` in numpy versions >= 1.5.
ddof : {None, int}, optional
.. versionadded:: 1.5
If not ``None`` normalization is by ``(N - ddof)``, where ``N`` is
the number of observations; this overrides the value implied by
``bias``. The default value is ``None``.
Returns
-------
out : ndarray
The correlation coefficient matrix of the variables.
See Also
--------
cov : Covariance matrix
i i ( R Rg RW Re RI RB t outer( R� R\ RR RS RT R� R� ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR s /
c C s~ | d k r t g � S| d k r/ t d t � St d | � } d d t d t | | d � d t d t | | d � S( s�
Return the Blackman window.
The Blackman window is a taper formed by using the the first three
terms of a summation of cosines. It was designed to have close to the
minimal leakage possible. It is close to optimal, only slightly worse
than a Kaiser window.
Parameters
----------
M : int
Number of points in the output window. If zero or less, an empty
array is returned.
Returns
-------
out : ndarray
The window, with the maximum value normalized to one (the value one
appears only if the number of samples is odd).
See Also
--------
bartlett, hamming, hanning, kaiser
Notes
-----
The Blackman window is defined as
.. math:: w(n) = 0.42 - 0.5 \cos(2\pi n/M) + 0.08 \cos(4\pi n/M)
Most references to the Blackman window come from the signal processing
literature, where it is used as one of many windowing functions for
smoothing values. It is also known as an apodization (which means
"removing the foot", i.e. smoothing discontinuities at the beginning
and end of the sampled signal) or tapering function. It is known as a
"near optimal" tapering function, almost as good (by some measures)
as the kaiser window.
References
----------
Blackman, R.B. and Tukey, J.W., (1958) The measurement of power spectra,
Dover Publications, New York.
Oppenheim, A.V., and R.W. Schafer. Discrete-Time Signal Processing.
Upper Saddle River, NJ: Prentice-Hall, 1999, pp. 468-471.
Examples
--------
>>> np.blackman(12)
array([ -1.38777878e-17, 3.26064346e-02, 1.59903635e-01,
4.14397981e-01, 7.36045180e-01, 9.67046769e-01,
9.67046769e-01, 7.36045180e-01, 4.14397981e-01,
1.59903635e-01, 3.26064346e-02, -1.38777878e-17])
Plot the window and the frequency response:
>>> from numpy.fft import fft, fftshift
>>> window = np.blackman(51)
>>> plt.plot(window)
[<matplotlib.lines.Line2D object at 0x...>]
>>> plt.title("Blackman window")
<matplotlib.text.Text object at 0x...>
>>> plt.ylabel("Amplitude")
<matplotlib.text.Text object at 0x...>
>>> plt.xlabel("Sample")
<matplotlib.text.Text object at 0x...>
>>> plt.show()
>>> plt.figure()
<matplotlib.figure.Figure object at 0x...>
>>> A = fft(window, 2048) / 25.5
>>> mag = np.abs(fftshift(A))
>>> freq = np.linspace(-0.5, 0.5, len(A))
>>> response = 20 * np.log10(mag)
>>> response = np.clip(response, -100, 100)
>>> plt.plot(freq, response)
[<matplotlib.lines.Line2D object at 0x...>]
>>> plt.title("Frequency response of Blackman window")
<matplotlib.text.Text object at 0x...>
>>> plt.ylabel("Magnitude [dB]")
<matplotlib.text.Text object at 0x...>
>>> plt.xlabel("Normalized frequency [cycles per sample]")
<matplotlib.text.Text object at 0x...>
>>> plt.axis('tight')
(-0.5, 0.5, -100.0, ...)
>>> plt.show()
i i g�z�G��?g �?g @g{�G�z�?g @( R3 R/ Rq R1 RG RA ( R� R} ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR" N s Z
c C s{ | d k r t g � S| d k r/ t d t � St d | � } t t | | d d � d | | d d d | | d � S( s�
Return the Bartlett window.
The Bartlett window is very similar to a triangular window, except
that the end points are at zero. It is often used in signal
processing for tapering a signal, without generating too much
ripple in the frequency domain.
Parameters
----------
M : int
Number of points in the output window. If zero or less, an
empty array is returned.
Returns
-------
out : array
The triangular window, with the maximum value normalized to one
(the value one appears only if the number of samples is odd), with
the first and last samples equal to zero.
See Also
--------
blackman, hamming, hanning, kaiser
Notes
-----
The Bartlett window is defined as
.. math:: w(n) = \frac{2}{M-1} \left(
\frac{M-1}{2} - \left|n - \frac{M-1}{2}\right|
\right)
Most references to the Bartlett window come from the signal
processing literature, where it is used as one of many windowing
functions for smoothing values. Note that convolution with this
window produces linear interpolation. It is also known as an
apodization (which means"removing the foot", i.e. smoothing
discontinuities at the beginning and end of the sampled signal) or
tapering function. The fourier transform of the Bartlett is the product
of two sinc functions.
Note the excellent discussion in Kanasewich.
References
----------
.. [1] M.S. Bartlett, "Periodogram Analysis and Continuous Spectra",
Biometrika 37, 1-16, 1950.
.. [2] E.R. Kanasewich, "Time Sequence Analysis in Geophysics",
The University of Alberta Press, 1975, pp. 109-110.
.. [3] A.V. Oppenheim and R.W. Schafer, "Discrete-Time Signal
Processing", Prentice-Hall, 1999, pp. 468-471.
.. [4] Wikipedia, "Window function",
http://en.wikipedia.org/wiki/Window_function
.. [5] W.H. Press, B.P. Flannery, S.A. Teukolsky, and W.T. Vetterling,
"Numerical Recipes", Cambridge University Press, 1986, page 429.
Examples
--------
>>> np.bartlett(12)
array([ 0. , 0.18181818, 0.36363636, 0.54545455, 0.72727273,
0.90909091, 0.90909091, 0.72727273, 0.54545455, 0.36363636,
0.18181818, 0. ])
Plot the window and its frequency response (requires SciPy and matplotlib):
>>> from numpy.fft import fft, fftshift
>>> window = np.bartlett(51)
>>> plt.plot(window)
[<matplotlib.lines.Line2D object at 0x...>]
>>> plt.title("Bartlett window")
<matplotlib.text.Text object at 0x...>
>>> plt.ylabel("Amplitude")
<matplotlib.text.Text object at 0x...>
>>> plt.xlabel("Sample")
<matplotlib.text.Text object at 0x...>
>>> plt.show()
>>> plt.figure()
<matplotlib.figure.Figure object at 0x...>
>>> A = fft(window, 2048) / 25.5
>>> mag = np.abs(fftshift(A))
>>> freq = np.linspace(-0.5, 0.5, len(A))
>>> response = 20 * np.log10(mag)
>>> response = np.clip(response, -100, 100)
>>> plt.plot(freq, response)
[<matplotlib.lines.Line2D object at 0x...>]
>>> plt.title("Frequency response of Bartlett window")
<matplotlib.text.Text object at 0x...>
>>> plt.ylabel("Magnitude [dB]")
<matplotlib.text.Text object at 0x...>
>>> plt.xlabel("Normalized frequency [cycles per sample]")
<matplotlib.text.Text object at 0x...>
>>> plt.axis('tight')
(-0.5, 0.5, -100.0, ...)
>>> plt.show()
i i g @( R3 R/ Rq R1 R< RH ( R� R} ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR! � s c
c C s` | d k r t g � S| d k r/ t d t � St d | � } d d t d t | | d � S( s\
Return the Hanning window.
The Hanning window is a taper formed by using a weighted cosine.
Parameters
----------
M : int
Number of points in the output window. If zero or less, an
empty array is returned.
Returns
-------
out : ndarray, shape(M,)
The window, with the maximum value normalized to one (the value
one appears only if `M` is odd).
See Also
--------
bartlett, blackman, hamming, kaiser
Notes
-----
The Hanning window is defined as
.. math:: w(n) = 0.5 - 0.5cos\left(\frac{2\pi{n}}{M-1}\right)
\qquad 0 \leq n \leq M-1
The Hanning was named for Julius van Hann, an Austrian meterologist. It is
also known as the Cosine Bell. Some authors prefer that it be called a
Hann window, to help avoid confusion with the very similar Hamming window.
Most references to the Hanning window come from the signal processing
literature, where it is used as one of many windowing functions for
smoothing values. It is also known as an apodization (which means
"removing the foot", i.e. smoothing discontinuities at the beginning
and end of the sampled signal) or tapering function.
References
----------
.. [1] Blackman, R.B. and Tukey, J.W., (1958) The measurement of power
spectra, Dover Publications, New York.
.. [2] E.R. Kanasewich, "Time Sequence Analysis in Geophysics",
The University of Alberta Press, 1975, pp. 106-108.
.. [3] Wikipedia, "Window function",
http://en.wikipedia.org/wiki/Window_function
.. [4] W.H. Press, B.P. Flannery, S.A. Teukolsky, and W.T. Vetterling,
"Numerical Recipes", Cambridge University Press, 1986, page 425.
Examples
--------
>>> np.hanning(12)
array([ 0. , 0.07937323, 0.29229249, 0.57115742, 0.82743037,
0.97974649, 0.97974649, 0.82743037, 0.57115742, 0.29229249,
0.07937323, 0. ])
Plot the window and its frequency response:
>>> from numpy.fft import fft, fftshift
>>> window = np.hanning(51)
>>> plt.plot(window)
[<matplotlib.lines.Line2D object at 0x...>]
>>> plt.title("Hann window")
<matplotlib.text.Text object at 0x...>
>>> plt.ylabel("Amplitude")
<matplotlib.text.Text object at 0x...>
>>> plt.xlabel("Sample")
<matplotlib.text.Text object at 0x...>
>>> plt.show()
>>> plt.figure()
<matplotlib.figure.Figure object at 0x...>
>>> A = fft(window, 2048) / 25.5
>>> mag = np.abs(fftshift(A))
>>> freq = np.linspace(-0.5, 0.5, len(A))
>>> response = 20 * np.log10(mag)
>>> response = np.clip(response, -100, 100)
>>> plt.plot(freq, response)
[<matplotlib.lines.Line2D object at 0x...>]
>>> plt.title("Frequency response of the Hann window")
<matplotlib.text.Text object at 0x...>
>>> plt.ylabel("Magnitude [dB]")
<matplotlib.text.Text object at 0x...>
>>> plt.xlabel("Normalized frequency [cycles per sample]")
<matplotlib.text.Text object at 0x...>
>>> plt.axis('tight')
(-0.5, 0.5, -100.0, ...)
>>> plt.show()
i i g �?g @( R3 R/ Rq R1 RG RA ( R� R} ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR s [
c C s` | d k r t g � S| d k r/ t d t � St d | � } d d t d t | | d � S( sQ
Return the Hamming window.
The Hamming window is a taper formed by using a weighted cosine.
Parameters
----------
M : int
Number of points in the output window. If zero or less, an
empty array is returned.
Returns
-------
out : ndarray
The window, with the maximum value normalized to one (the value
one appears only if the number of samples is odd).
See Also
--------
bartlett, blackman, hanning, kaiser
Notes
-----
The Hamming window is defined as
.. math:: w(n) = 0.54 - 0.46cos\left(\frac{2\pi{n}}{M-1}\right)
\qquad 0 \leq n \leq M-1
The Hamming was named for R. W. Hamming, an associate of J. W. Tukey and
is described in Blackman and Tukey. It was recommended for smoothing the
truncated autocovariance function in the time domain.
Most references to the Hamming window come from the signal processing
literature, where it is used as one of many windowing functions for
smoothing values. It is also known as an apodization (which means
"removing the foot", i.e. smoothing discontinuities at the beginning
and end of the sampled signal) or tapering function.
References
----------
.. [1] Blackman, R.B. and Tukey, J.W., (1958) The measurement of power
spectra, Dover Publications, New York.
.. [2] E.R. Kanasewich, "Time Sequence Analysis in Geophysics", The
University of Alberta Press, 1975, pp. 109-110.
.. [3] Wikipedia, "Window function",
http://en.wikipedia.org/wiki/Window_function
.. [4] W.H. Press, B.P. Flannery, S.A. Teukolsky, and W.T. Vetterling,
"Numerical Recipes", Cambridge University Press, 1986, page 425.
Examples
--------
>>> np.hamming(12)
array([ 0.08 , 0.15302337, 0.34890909, 0.60546483, 0.84123594,
0.98136677, 0.98136677, 0.84123594, 0.60546483, 0.34890909,
0.15302337, 0.08 ])
Plot the window and the frequency response:
>>> from numpy.fft import fft, fftshift
>>> window = np.hamming(51)
>>> plt.plot(window)
[<matplotlib.lines.Line2D object at 0x...>]
>>> plt.title("Hamming window")
<matplotlib.text.Text object at 0x...>
>>> plt.ylabel("Amplitude")
<matplotlib.text.Text object at 0x...>
>>> plt.xlabel("Sample")
<matplotlib.text.Text object at 0x...>
>>> plt.show()
>>> plt.figure()
<matplotlib.figure.Figure object at 0x...>
>>> A = fft(window, 2048) / 25.5
>>> mag = np.abs(fftshift(A))
>>> freq = np.linspace(-0.5, 0.5, len(A))
>>> response = 20 * np.log10(mag)
>>> response = np.clip(response, -100, 100)
>>> plt.plot(freq, response)
[<matplotlib.lines.Line2D object at 0x...>]
>>> plt.title("Frequency response of Hamming window")
<matplotlib.text.Text object at 0x...>
>>> plt.ylabel("Magnitude [dB]")
<matplotlib.text.Text object at 0x...>
>>> plt.xlabel("Normalized frequency [cycles per sample]")
<matplotlib.text.Text object at 0x...>
>>> plt.axis('tight')
(-0.5, 0.5, -100.0, ...)
>>> plt.show()
i i gH�z�G�?gq=
ףp�?g @( R3 R/ Rq R1 RG RA ( R� R} ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR { s Z
g��4!�\T�g��}�b3�<g�� r넱�g�^�����<g��"P
�g'&&KF�5=g��bLa�g$ӛ�/��=g�j�z����g<t̾��=gV�����g4�T��&>g�0 ���K�g5dM�v;p>g�"�c쑾g��$��>g'd��o�ҾgY(��X?�>gZ �Y&+�g�|t�(?gR� ��B�g�u�Z?gI� ^�q�g����a��?g�!�N��g-��Ί>�?g�-4pK��g���w���?g��W��ӿg*�5�N��?g��T��`�g0�f�FV�g!����<g�A`��<g� ҫ `��g8��箸�g ��}��<g�攐�*�<g�be~���g2�hϙ]'�gE�_
�V=gs��k� [=g�&�GCi=gf�C��g�{~5���g%t9 Q��gO �$�=guo�� >g�["�d,->gm�ր�VX>gna����>g���+A�>gR��x�?gI�墌�k?g� ��b��?c C s^ | d } d } x? t d t | � � D]( } | } | } | | | | | } q& Wd | | S( Ni g i g �?( t xrangeRl ( R� R� t b0t b1R t b2( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyt _chbevl
s
c C s t | � t | d d t � S( Ng @i ( RL R\ t _i0A( R� ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyt _i0_1$
s c C s) t | � t d | d t � t | � S( Ng @@g @( RL R\ t _i0BRI ( R� ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyt _i0_2'
s c C s~ t | � j � } t | � } | d k } | | | | <| d k } t | | � | | <| } t | | � | | <| j � S( s0
Modified Bessel function of the first kind, order 0.
Usually denoted :math:`I_0`. This function does broadcast, but will *not*
"up-cast" int dtype arguments unless accompanied by at least one float or
complex dtype argument (see Raises below).
Parameters
----------
x : array_like, dtype float or complex
Argument of the Bessel function.
Returns
-------
out : ndarray, shape = x.shape, dtype = x.dtype
The modified Bessel function evaluated at each of the elements of `x`.
Raises
------
TypeError: array cannot be safely cast to required type
If argument consists exclusively of int dtypes.
See Also
--------
scipy.special.iv, scipy.special.ive
Notes
-----
We use the algorithm published by Clenshaw [1]_ and referenced by
Abramowitz and Stegun [2]_, for which the function domain is partitioned
into the two intervals [0,8] and (8,inf), and Chebyshev polynomial
expansions are employed in each interval. Relative error on the domain
[0,30] using IEEE arithmetic is documented [3]_ as having a peak of 5.8e-16
with an rms of 1.4e-16 (n = 30000).
References
----------
.. [1] C. W. Clenshaw, "Chebyshev series for mathematical functions", in
*National Physical Laboratory Mathematical Tables*, vol. 5, London:
Her Majesty's Stationery Office, 1962.
.. [2] M. Abramowitz and I. A. Stegun, *Handbook of Mathematical
Functions*, 10th printing, New York: Dover, 1964, pp. 379.
http://www.math.sfu.ca/~cbm/aands/page_379.htm
.. [3] http://kobesearch.cpan.org/htdocs/Math-Cephes/Math/Cephes.html
Examples
--------
>>> np.i0([0.])
array(1.0)
>>> np.i0([0., 1. + 2j])
array([ 1.00000000+0.j , 0.18785373+0.64616944j])
i g @( RU R R7 R^ R` R� ( R� R\ t indt ind2( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR% *
s 6 c C s} d d l m } | d k r, t j d g � St d | � } | d d } | | t d | | | d � � | t | � � S( s�
Return the Kaiser window.
The Kaiser window is a taper formed by using a Bessel function.
Parameters
----------
M : int
Number of points in the output window. If zero or less, an
empty array is returned.
beta : float
Shape parameter for window.
Returns
-------
out : array
The window, with the maximum value normalized to one (the value
one appears only if the number of samples is odd).
See Also
--------
bartlett, blackman, hamming, hanning
Notes
-----
The Kaiser window is defined as
.. math:: w(n) = I_0\left( \beta \sqrt{1-\frac{4n^2}{(M-1)^2}}
\right)/I_0(\beta)
with
.. math:: \quad -\frac{M-1}{2} \leq n \leq \frac{M-1}{2},
where :math:`I_0` is the modified zeroth-order Bessel function.
The Kaiser was named for Jim Kaiser, who discovered a simple approximation
to the DPSS window based on Bessel functions.
The Kaiser window is a very good approximation to the Digital Prolate
Spheroidal Sequence, or Slepian window, which is the transform which
maximizes the energy in the main lobe of the window relative to total
energy.
The Kaiser can approximate many other windows by varying the beta
parameter.
==== =======================
beta Window shape
==== =======================
0 Rectangular
5 Similar to a Hamming
6 Similar to a Hanning
8.6 Similar to a Blackman
==== =======================
A beta value of 14 is probably a good starting point. Note that as beta
gets large, the window narrows, and so the number of samples needs to be
large enough to sample the increasingly narrow spike, otherwise NaNs will
get returned.
Most references to the Kaiser window come from the signal processing
literature, where it is used as one of many windowing functions for
smoothing values. It is also known as an apodization (which means
"removing the foot", i.e. smoothing discontinuities at the beginning
and end of the sampled signal) or tapering function.
References
----------
.. [1] J. F. Kaiser, "Digital Filters" - Ch 7 in "Systems analysis by
digital computer", Editors: F.F. Kuo and J.F. Kaiser, p 218-285.
John Wiley and Sons, New York, (1966).
.. [2] E.R. Kanasewich, "Time Sequence Analysis in Geophysics", The
University of Alberta Press, 1975, pp. 177-178.
.. [3] Wikipedia, "Window function",
http://en.wikipedia.org/wiki/Window_function
Examples
--------
>>> np.kaiser(12, 14)
array([ 7.72686684e-06, 3.46009194e-03, 4.65200189e-02,
2.29737120e-01, 5.99885316e-01, 9.45674898e-01,
9.45674898e-01, 5.99885316e-01, 2.29737120e-01,
4.65200189e-02, 3.46009194e-03, 7.72686684e-06])
Plot the window and the frequency response:
>>> from numpy.fft import fft, fftshift
>>> window = np.kaiser(51, 14)
>>> plt.plot(window)
[<matplotlib.lines.Line2D object at 0x...>]
>>> plt.title("Kaiser window")
<matplotlib.text.Text object at 0x...>
>>> plt.ylabel("Amplitude")
<matplotlib.text.Text object at 0x...>
>>> plt.xlabel("Sample")
<matplotlib.text.Text object at 0x...>
>>> plt.show()
>>> plt.figure()
<matplotlib.figure.Figure object at 0x...>
>>> A = fft(window, 2048) / 25.5
>>> mag = np.abs(fftshift(A))
>>> freq = np.linspace(-0.5, 0.5, len(A))
>>> response = 20 * np.log10(mag)
>>> response = np.clip(response, -100, 100)
>>> plt.plot(freq, response)
[<matplotlib.lines.Line2D object at 0x...>]
>>> plt.title("Frequency response of Kaiser window")
<matplotlib.text.Text object at 0x...>
>>> plt.ylabel("Magnitude [dB]")
<matplotlib.text.Text object at 0x...>
>>> plt.xlabel("Normalized frequency [cycles per sample]")
<matplotlib.text.Text object at 0x...>
>>> plt.axis('tight')
(-0.5, 0.5, -100.0, ...)
>>> plt.show()
i����( R% i g �?i g @( t
numpy.dualR% Rb R3 R1 RI Rq ( R� t betaR% R} t alpha( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR# l
s x c C s9 t j | � } t t | d k d | � } t | � | S( s�
Return the sinc function.
The sinc function is :math:`\sin(\pi x)/(\pi x)`.
Parameters
----------
x : ndarray
Array (possibly multi-dimensional) of values for which to to
calculate ``sinc(x)``.
Returns
-------
out : ndarray
``sinc(x)``, which has the same shape as the input.
Notes
-----
``sinc(0)`` is the limit value 1.
The name sinc is short for "sine cardinal" or "sinus cardinalis".
The sinc function is used in various signal processing applications,
including in anti-aliasing, in the construction of a
Lanczos resampling filter, and in interpolation.
For bandlimited interpolation of discrete-time signals, the ideal
interpolation kernel is proportional to the sinc function.
References
----------
.. [1] Weisstein, Eric W. "Sinc Function." From MathWorld--A Wolfram Web
Resource. http://mathworld.wolfram.com/SincFunction.html
.. [2] Wikipedia, "Sinc function",
http://en.wikipedia.org/wiki/Sinc_function
Examples
--------
>>> x = np.arange(-20., 21.)/5.
>>> np.sinc(x)
array([ -3.89804309e-17, -4.92362781e-02, -8.40918587e-02,
-8.90384387e-02, -5.84680802e-02, 3.89804309e-17,
6.68206631e-02, 1.16434881e-01, 1.26137788e-01,
8.50444803e-02, -3.89804309e-17, -1.03943254e-01,
-1.89206682e-01, -2.16236208e-01, -1.55914881e-01,
3.89804309e-17, 2.33872321e-01, 5.04551152e-01,
7.56826729e-01, 9.35489284e-01, 1.00000000e+00,
9.35489284e-01, 7.56826729e-01, 5.04551152e-01,
2.33872321e-01, 3.89804309e-17, -1.55914881e-01,
-2.16236208e-01, -1.89206682e-01, -1.03943254e-01,
-3.89804309e-17, 8.50444803e-02, 1.26137788e-01,
1.16434881e-01, 6.68206631e-02, 3.89804309e-17,
-5.84680802e-02, -8.90384387e-02, -8.40918587e-02,
-4.92362781e-02, -3.89804309e-17])
>>> plt.plot(x, np.sinc(x))
[<matplotlib.lines.Line2D object at 0x...>]
>>> plt.title("Sinc Function")
<matplotlib.text.Text object at 0x...>
>>> plt.ylabel("Amplitude")
<matplotlib.text.Text object at 0x...>
>>> plt.xlabel("X")
<matplotlib.text.Text object at 0x...>
>>> plt.show()
It works in 2-D as well:
>>> x = np.arange(-200., 201.)/50.
>>> xx = np.outer(x, x)
>>> plt.imshow(np.sinc(xx))
<matplotlib.image.AxesImage object at 0x...>
i g#B� ���;( Rb R5 RA R< RJ ( R� R\ ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR �
s J c C s) t | d t d t �} | j d � | S( sk
Return a copy of an array sorted along the first axis.
Parameters
----------
a : array_like
Array to be sorted.
Returns
-------
sorted_array : ndarray
Array of the same type and shape as `a`.
See Also
--------
sort
Notes
-----
``np.msort(a)`` is equivalent to ``np.sort(a, axis=0)``.
R R i ( R3 Rj RQ ( Rs R� ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR 9 s
c C s | rD | d k r+ | j � } | j � qV | j d | � | } n t | d | �} | j d k ro | j � S| d k r� d } n t d � g | j } t | j | d � } | j | d d k r� t | | d � | | <n t | d | d � | | <t | | d | d | �S( s�
Compute the median along the specified axis.
Returns the median of the array elements.
Parameters
----------
a : array_like
Input array or object that can be converted to an array.
axis : int, optional
Axis along which the medians are computed. The default (axis=None)
is to compute the median along a flattened version of the array.
out : ndarray, optional
Alternative output array in which to place the result. It must
have the same shape and buffer length as the expected output,
but the type (of the output) will be cast if necessary.
overwrite_input : bool optional
If True, then allow use of memory of input array (a) for
calculations. The input array will be modified by the call to
median. This will save memory when you do not need to preserve
the contents of the input array. Treat the input as undefined,
but it will probably be fully or partially sorted. Default is
False. Note that, if `overwrite_input` is True and the input
is not already an ndarray, an error will be raised.
Returns
-------
median : ndarray
A new array holding the result (unless `out` is specified, in
which case that array is returned instead). If the input contains
integers, or floats of smaller precision than 64, then the output
data-type is float64. Otherwise, the output data-type is the same
as that of the input.
See Also
--------
mean, percentile
Notes
-----
Given a vector V of length N, the median of V is the middle value of
a sorted copy of V, ``V_sorted`` - i.e., ``V_sorted[(N-1)/2]``, when N is
odd. When N is even, it is the average of the two middle values of
``V_sorted``.
Examples
--------
>>> a = np.array([[10, 7, 4], [3, 2, 1]])
>>> a
array([[10, 7, 4],
[ 3, 2, 1]])
>>> np.median(a)
3.5
>>> np.median(a, axis=0)
array([ 6.5, 4.5, 2.5])
>>> np.median(a, axis=1)
array([ 7., 2.])
>>> m = np.median(a, axis=0)
>>> out = np.zeros_like(m)
>>> np.median(a, axis=0, out=m)
array([ 6.5, 4.5, 2.5])
>>> m
array([ 6.5, 4.5, 2.5])
>>> b = a.copy()
>>> np.median(b, axis=1, overwrite_input=True)
array([ 7., 2.])
>>> assert not np.all(a==b)
>>> b = a.copy()
>>> np.median(b, axis=None, overwrite_input=True)
3.5
>>> assert not np.all(a==b)
R� i i i R� N( ( Ra RN RQ Rd R� R� R� Rk RR ( Rs R� R� t overwrite_inputt sortedt indexert index( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR T s" J
c C s� t j | � } | d k r1 | j d | d | � S| d k rS | j d | d | � S| r� | d k r~ | j � } | j � q� | j d | � | } n t | d | �} | d k r� d } n t | | | | � S( s�
Compute the qth percentile of the data along the specified axis.
Returns the qth percentile of the array elements.
Parameters
----------
a : array_like
Input array or object that can be converted to an array.
q : float in range of [0,100] (or sequence of floats)
Percentile to compute which must be between 0 and 100 inclusive.
axis : int, optional
Axis along which the percentiles are computed. The default (None)
is to compute the median along a flattened version of the array.
out : ndarray, optional
Alternative output array in which to place the result. It must
have the same shape and buffer length as the expected output,
but the type (of the output) will be cast if necessary.
overwrite_input : bool, optional
If True, then allow use of memory of input array `a` for
calculations. The input array will be modified by the call to
median. This will save memory when you do not need to preserve
the contents of the input array. Treat the input as undefined,
but it will probably be fully or partially sorted.
Default is False. Note that, if `overwrite_input` is True and the
input is not already an array, an error will be raised.
Returns
-------
pcntile : ndarray
A new array holding the result (unless `out` is specified, in
which case that array is returned instead). If the input contains
integers, or floats of smaller precision than 64, then the output
data-type is float64. Otherwise, the output data-type is the same
as that of the input.
See Also
--------
mean, median
Notes
-----
Given a vector V of length N, the qth percentile of V is the qth ranked
value in a sorted copy of V. A weighted average of the two nearest
neighbors is used if the normalized ranking does not match q exactly.
The same as the median if ``q=50``, the same as the minimum if ``q=0``
and the same as the maximum if ``q=100``.
Examples
--------
>>> a = np.array([[10, 7, 4], [3, 2, 1]])
>>> a
array([[10, 7, 4],
[ 3, 2, 1]])
>>> np.percentile(a, 50)
3.5
>>> np.percentile(a, 0.5, axis=0)
array([ 6.5, 4.5, 2.5])
>>> np.percentile(a, 50, axis=1)
array([ 7., 2.])
>>> m = np.percentile(a, 50, axis=0)
>>> out = np.zeros_like(m)
>>> np.percentile(a, 50, axis=0, out=m)
array([ 6.5, 4.5, 2.5])
>>> m
array([ 6.5, 4.5, 2.5])
>>> b = a.copy()
>>> np.percentile(b, 50, axis=1, overwrite_input=True)
array([ 7., 2.])
>>> assert not np.all(a==b)
>>> b = a.copy()
>>> np.percentile(b, 50, axis=None, overwrite_input=True)
3.5
i R� R� id N( Rb R4 Rh Ri Ra RN RQ t _compute_qth_percentile( Rs t qR� R� Rf Rg ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR � s N
c C s� t | � sP g | D] } t | | | d � ^ q } | d k rL | | _ n | S| d } | d k sr | d k r� t d � � n t d � g | j } | j | } | | d } t | � } | | k r� t | | d � | | <t d � }
d } nm t | | d � | | <| d } t | | | | g t
� }
d g | j }
d |
| <|
|
_ |
j � } t j
| | |
d | d | �| S( Ng Y@i i s. percentile must be either in the range [0,100]g �?i R� R� ( R@ Rj Ra R Re R� R� Rd Rk R3 Rq Rr RC R ( Rg Rk R� R� t qiR� Rh t NxRi R Rw t sumvalR� t wshape( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyRj s2 %
g �?c
C sk t | � } | d k r! | } nl t | � } | j d k r{ t | � } d g | j } | j d | | <| j | � } n t | d | �} t | j � } t d � g | } t d � g | } t d d � | | <t d d � | | <y' | | | | | d j | � } WnU t k
rft
j | � } t
j | � } t j
| | | | | d | � } n X| S( s�
Integrate along the given axis using the composite trapezoidal rule.
Integrate `y` (`x`) along given axis.
Parameters
----------
y : array_like
Input array to integrate.
x : array_like, optional
If `x` is None, then spacing between all `y` elements is `dx`.
dx : scalar, optional
If `x` is None, spacing given by `dx` is assumed. Default is 1.
axis : int, optional
Specify the axis.
Returns
-------
trapz : float
Definite integral as approximated by trapezoidal rule.
See Also
--------
sum, cumsum
Notes
-----
Image [2]_ illustrates trapezoidal rule -- y-axis locations of points will
be taken from `y` array, by default x-axis distances between points will be
1.0, alternatively they can be provided with `x` array or with `dx` scalar.
Return value will be equal to combined area under the red lines.
References
----------
.. [1] Wikipedia page: http://en.wikipedia.org/wiki/Trapezoidal_rule
.. [2] Illustration image:
http://en.wikipedia.org/wiki/File:Composite_trapezoidal_rule_illustration.png
Examples
--------
>>> np.trapz([1,2,3])
4.0
>>> np.trapz([1,2,3], x=[4,6,8])
8.0
>>> np.trapz([1,2,3], dx=2)
8.0
>>> a = np.arange(6).reshape(2, 3)
>>> a
array([[0, 1, 2],
[3, 4, 5]])
>>> np.trapz(a, axis=0)
array([ 1.5, 2.5, 3.5])
>>> np.trapz(a, axis=1)
array([ 2., 8.])
i i R� i����g @N( R5 Ra R� R Rd R� Rl R� Rr Re Rb R4 RC R (
R\ R� R� R� R� Rd R� R� R� t ret( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR$ > s, ; '
*c B s� y� i } d | | f | Ue | e � rD e | | | j � � n� e | e � r~ e e | | | d � | d j � � nK e | e � r� x9 | D]. } e e | | | d � | d j � � q� Wn Wn n Xd S( s� Adds documentation to obj which is in module place.
If doc is a string add it to obj as a docstring
If doc is a tuple, then the first element is interpreted as
an attribute of obj and the second as the docstring
(method, docstring)
If doc is a list, then each element of the list should be a
sequence of length two --> [(method1, docstring1),
(method2, docstring2), ...]
This routine never raises an error.
This routine cannot modify read-only docstrings, as appear
in new-style classes or built-in functions. Because this
routine never raises an error the caller must check manually
that the docstrings were changed.
s from %s import %si i N( R� R) R' t stripR� t getattrR� ( R
t objR/ t newt val( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR& � s +
3c O s� t | � d k r= d t t | � d k � } t | � � n t j | � } t | � } | j d t � } | j d t � } | j d d � } | d k r� t d � � n d | } g t | � D]8 \ } }
|
j | | d | | d
d d � � ^ q� } g | D] }
|
j ^ q} | d k rxd d | d | d _ d d | d | d
_ | d
| d | d <| d
<n | r�| r�g | D] }
|
j
� ^ q�S| SnC | r�t j | d
t �}
g | D] }
|
|
^ q�St j | � Sd S( s
Return coordinate matrices from two or more coordinate vectors.
Make N-D coordinate arrays for vectorized evaluations of
N-D scalar/vector fields over N-D grids, given
one-dimensional coordinate arrays x1, x2,..., xn.
Parameters
----------
x1, x2,..., xn : array_like
1-D arrays representing the coordinates of a grid.
indexing : {'xy', 'ij'}, optional
Cartesian ('xy', default) or matrix ('ij') indexing of output.
See Notes for more details.
sparse : bool, optional
If True a sparse grid is returned in order to conserve memory.
Default is False.
copy : bool, optional
If False, a view into the original arrays are returned in
order to conserve memory. Default is True. Please note that
``sparse=False, copy=False`` will likely return non-contiguous arrays.
Furthermore, more than one element of a broadcast array may refer to
a single memory location. If you need to write to the arrays, make
copies first.
Returns
-------
X1, X2,..., XN : ndarray
For vectors `x1`, `x2`,..., 'xn' with lengths ``Ni=len(xi)`` ,
return ``(N1, N2, N3,...Nn)`` shaped arrays if indexing='ij'
or ``(N2, N1, N3,...Nn)`` shaped arrays if indexing='xy'
with the elements of `xi` repeated to fill the matrix along
the first dimension for `x1`, the second for `x2` and so on.
Notes
-----
This function supports both indexing conventions through the indexing keyword
argument. Giving the string 'ij' returns a meshgrid with matrix indexing,
while 'xy' returns a meshgrid with Cartesian indexing. In the 2-D case
with inputs of length M and N, the outputs are of shape (N, M) for 'xy'
indexing and (M, N) for 'ij' indexing. In the 3-D case with inputs of
length M, N and P, outputs are of shape (N, M, P) for 'xy' indexing and (M,
N, P) for 'ij' indexing. The difference is illustrated by the following
code snippet::
xv, yv = meshgrid(x, y, sparse=False, indexing='ij')
for i in range(nx):
for j in range(ny):
# treat xv[i,j], yv[i,j]
xv, yv = meshgrid(x, y, sparse=False, indexing='xy')
for i in range(nx):
for j in range(ny):
# treat xv[j,i], yv[j,i]
See Also
--------
index_tricks.mgrid : Construct a multi-dimensional "meshgrid"
using indexing notation.
index_tricks.ogrid : Construct an open multi-dimensional "meshgrid"
using indexing notation.
Examples
--------
>>> nx, ny = (3, 2)
>>> x = np.linspace(0, 1, nx)
>>> y = np.linspace(0, 1, ny)
>>> xv, yv = meshgrid(x, y)
>>> xv
array([[ 0. , 0.5, 1. ],
[ 0. , 0.5, 1. ]])
>>> yv
array([[ 0., 0., 0.],
[ 1., 1., 1.]])
>>> xv, yv = meshgrid(x, y, sparse=True) # make sparse output arrays
>>> xv
array([[ 0. , 0.5, 1. ]])
>>> yv
array([[ 0.],
[ 1.]])
`meshgrid` is very useful to evaluate functions on a grid.
>>> x = np.arange(-5, 5, 0.1)
>>> y = np.arange(-5, 5, 0.1)
>>> xx, yy = meshgrid(x, y, sparse=True)
>>> z = np.sin(xx**2 + yy**2) / (xx**2 + yy**2)
>>> h = plt.contourf(x,y,z)
i s/ meshgrid() takes 2 or more arguments (%d given)i R t sparset indexingR� t ijs. Valid values for `indexing` are 'xy' and 'ij'.i i����NR` ( s xyRx ( i ( i����( i i����( i ( i����i ( i ( Rl Rk Re Rb RU t getRj R� R1 R� Ra Rg Rd R R/ t broadcast_arrays( t xiR8 t msgR� R� t copy_Rv Rw t s0R R� t outputRd t mult_fact( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR( � s2 [
K c C s� d } t | � t k r< y
| j } Wq< t k
r8 q< Xn t | � } | j } | d k r� | d k rx | j � } n | j } | d } n | d k r� | r� | | � S| j � Sn t d � g | } | j
| } t | j
� } t | t
t t f � r�| d k r| | 7} n | d k s/| | k r>t d � � n | | c d 8<t | | j | j j � } t d | � | | <| | | | <t | d � | | <t d � g | } t | d d � | | <| | | | <n t | t � r�| j | � \ }
} } t t |
| | � � }
|
d k r@| r3| | � S| j � Sn | | c |
8<t | | j | j j � } |
d k rzn! t d |
� | | <| | | | <| | k r�nK t | |
d � | | <t d � g | } t | d � | | <| | | | <| d k rq�t |
| | d t �} t |
| d t �} t | | � } t |
| |
� | | <t d � g | } | | | <| | | | <nS t | d t d d d d �} t | d t �} t | | � } | | | <| | } | r�| | � S| Sd S( s�
Return a new array with sub-arrays along an axis deleted.
Parameters
----------
arr : array_like
Input array.
obj : slice, int or array of ints
Indicate which sub-arrays to remove.
axis : int, optional
The axis along which to delete the subarray defined by `obj`.
If `axis` is None, `obj` is applied to the flattened array.
Returns
-------
out : ndarray
A copy of `arr` with the elements specified by `obj` removed. Note
that `delete` does not occur in-place. If `axis` is None, `out` is
a flattened array.
See Also
--------
insert : Insert elements into an array.
append : Append elements at the end of an array.
Examples
--------
>>> arr = np.array([[1,2,3,4], [5,6,7,8], [9,10,11,12]])
>>> arr
array([[ 1, 2, 3, 4],
[ 5, 6, 7, 8],
[ 9, 10, 11, 12]])
>>> np.delete(arr, 1, 0)
array([[ 1, 2, 3, 4],
[ 9, 10, 11, 12]])
>>> np.delete(arr, np.s_[::2], 1)
array([[ 2, 4],
[ 6, 8],
[10, 12]])
>>> np.delete(arr, [1,3,5], None)
array([ 1, 3, 5, 7, 8, 9, 10, 11, 12])
i i s
invalid entryR` R R� N( Ra R� R8 t __array_wrap__Rf R4 R� RN R R� Rd R� R� Rk t longR? Re R6 R` t flagst fnct indicesRl RX R1 R> RY R3 ( R
Rs R� t wrapR� t slobjR� t newshapeRt t slobj2t startt stopt stept numtodelR� ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR) 8
s� -
c C s� d } t | � t k r< y
| j } Wq< t k
r8 q< Xn t | � } | j } | d k r� | d k rx | j � } n | j } | d } n | d k r� | j � } | | d <| r� | | � S| Sn t d � g | } | j
| } t | j
� } t | t
t t f � r�| d k r'| | 7} n | d k s?| | k r[t d | | | f � � n t | d t d | j �} t j | d | d � } | g | j
| } n1 t | t � r�t | j | � i t d 6� } n t | d t �} t | � } | t | � }
t t | | � |
� } | | c | 7<t | | j | j j � } t d � g | }
|
| | <| |
| <| | | <| | |
<| r�| | � S| S( s�
Insert values along the given axis before the given indices.
Parameters
----------
arr : array_like
Input array.
obj : int, slice or sequence of ints
Object that defines the index or indices before which `values` is
inserted.
values : array_like
Values to insert into `arr`. If the type of `values` is different
from that of `arr`, `values` is converted to the type of `arr`.
axis : int, optional
Axis along which to insert `values`. If `axis` is None then `arr`
is flattened first.
Returns
-------
out : ndarray
A copy of `arr` with `values` inserted. Note that `insert`
does not occur in-place: a new array is returned. If
`axis` is None, `out` is a flattened array.
See Also
--------
append : Append elements at the end of an array.
delete : Delete elements from an array.
Examples
--------
>>> a = np.array([[1, 1], [2, 2], [3, 3]])
>>> a
array([[1, 1],
[2, 2],
[3, 3]])
>>> np.insert(a, 1, 5)
array([1, 5, 1, 2, 2, 3, 3])
>>> np.insert(a, 1, 5, axis=1)
array([[1, 5, 1],
[2, 5, 2],
[3, 5, 3]])
>>> b = a.flatten()
>>> b
array([1, 1, 2, 2, 3, 3])
>>> np.insert(b, [2, 2], [5, 6])
array([1, 1, 5, 6, 2, 2, 3, 3])
>>> np.insert(b, slice(2, 4), [5, 6])
array([1, 1, 5, 2, 6, 2, 3, 3])
>>> np.insert(b, [2, 2], [7.13, False]) # type casting
array([1, 1, 7, 0, 2, 2, 3, 3])
>>> x = np.arange(8).reshape(2, 4)
>>> idx = (1, 3)
>>> np.insert(x, idx, 999, axis=1)
array([[ 0, 999, 1, 2, 999, 3],
[ 4, 999, 5, 6, 999, 7]])
i i .s6 index (%d) out of range (0<=index<=%d) in dimension %dR R� R` N( Ra R� R8 R� Rf R4 R� RN R R� Rd R� R� Rk R� R? Re R3 R� Rb t rollaxisR1 R� R> Rl RY R6 R` R� R� ( R
Rs t valuesR� R� R� R� R� R� t numnewt index1t index2Rt R� ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR* �
s` ?
"
c C sh t | � } | d k rR | j d k r6 | j � } n t | � } | j d } n t | | f d | �S( s�
Append values to the end of an array.
Parameters
----------
arr : array_like
Values are appended to a copy of this array.
values : array_like
These values are appended to a copy of `arr`. It must be of the
correct shape (the same shape as `arr`, excluding `axis`). If `axis`
is not specified, `values` can be any shape and will be flattened
before use.
axis : int, optional
The axis along which `values` are appended. If `axis` is not given,
both `arr` and `values` are flattened before use.
Returns
-------
append : ndarray
A copy of `arr` with `values` appended to `axis`. Note that `append`
does not occur in-place: a new array is allocated and filled. If
`axis` is None, `out` is a flattened array.
See Also
--------
insert : Insert elements into an array.
delete : Delete elements from an array.
Examples
--------
>>> np.append([1, 2, 3], [[4, 5, 6], [7, 8, 9]])
array([1, 2, 3, 4, 5, 6, 7, 8, 9])
When `axis` is specified, `values` must have the correct shape.
>>> np.append([[1, 2, 3], [4, 5, 6]], [[7, 8, 9]], axis=0)
array([[1, 2, 3],
[4, 5, 6],
[7, 8, 9]])
>>> np.append([[1, 2, 3], [4, 5, 6]], [7, 8, 9], axis=0)
Traceback (most recent call last):
...
ValueError: arrays must have same number of dimensions
i R� N( R5 Ra R� RN R2 ( R
R� R� ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyR+ 1 s . ( t
__docformat__t __all__t warningst typesR t numpy.core.numericR� t numericR� t
numpy.coreR. R/ R0 R1 R2 R3 R4 R5 R6 R7 R8 R9 R: R; R< R= R> R? R@ t numpy.core.umathRA RB RC RD RE RF RG RH RI RJ RK RL RM t numpy.core.fromnumericRN RO RP RQ RR t numpy.core.numerictypesRS RT RU RV t numpy.lib.twodim_baseRW t _compiled_baseRX R' R R R, R� t arraysetopsRY t utilsRZ R- t numpyRb R Ra R� R R R R R R R R R R R R
R t
hexversiont setsR R R R R
R R R R R R Rj R RK R R R R" R! R R R] R_ R\ R^ R` R% R# R R R R Rj R$ R& R( R) R* R+ ( ( ( s= /usr/lib64/python2.7/site-packages/numpy/lib/function_base.pyt <module> s
L4X( ��sB = 0 i=M -6 # . 0 % / D ; # = #*�x9 a j b d B N cd #V # � z