Ńň
\ĐKc
@ sÔ d Z d d d d d d d d d d
g
Z d d k Z d d
k l Z d d d Z e e d Z e d Z
e d Z e d Z d Z
e d Z e e e d Z e d Z e d Z d S( sP
Set operations for 1D numeric arrays based on sorting.
:Contains:
ediff1d,
unique,
intersect1d,
setxor1d,
in1d,
union1d,
setdiff1d
:Deprecated:
unique1d,
intersect1d_nu,
setmember1d
:Notes:
For floating point arrays, inaccurate results may appear due to usual round-off
and floating point comparison issues.
Speed could be gained in some operations by an implementation of
sort(), that can provide directly the permutation vectors, avoiding
thus calls to argsort().
To do: Optionally return indices analogously to unique for all functions.
:Author: Robert Cimrman
t ediff1dt unique1dt intersect1dt intersect1d_nut setxor1dt setmember1dt union1dt setdiff1dt uniquet in1di˙˙˙˙N( t deprecatec C s t i | i } | d | d } | g } | d j o | i d | n | d j o | i | n t | d j o t i | } n | S( s:
The differences between consecutive elements of an array.
Parameters
----------
ary : array_like
If necessary, will be flattened before the differences are taken.
to_end : array_like, optional
Number(s) to append at the end of the returned differences.
to_begin : array_like, optional
Number(s) to prepend at the beginning of the returned differences.
Returns
-------
ed : ndarray
The differences. Loosely, this is ``ary.flat[1:] - ary.flat[:-1]``.
See Also
--------
diff, gradient
Notes
-----
When applied to masked arrays, this function drops the mask information
if the `to_begin` and/or `to_end` parameters are used.
Examples
--------
>>> x = np.array([1, 2, 4, 7, 0])
>>> np.ediff1d(x)
array([ 1, 2, 3, -7])
>>> np.ediff1d(x, to_begin=-99, to_end=np.array([88, 99]))
array([-99, 1, 2, 3, -7, 88, 99])
The returned array is always 1D.
>>> y = [[1, 2, 4], [1, 6, 24]]
>>> np.ediff1d(y)
array([ 1, 2, -3, 5, 18])
i i˙˙˙˙i N( t npt
asanyarrayt flatt Nonet insertt appendt lent hstack( t aryt to_endt to_begint edt arrays( ( s; /usr/lib64/python2.6/site-packages/numpy/lib/arraysetops.pyR % s +
c C sŢ y | i } WnX t j
oL | o( | o t t | } t i | St i | i } n X| i d j oj | o3 | o, | t i d t i t i d t i f S| p | o | t i d t i f S| Sn | p | oŻ | i
} | | } t i t g | d | d j f } | oV t i
| d } | i
} | o | | | | | | f S| | | | f SqÚ| | | | f Sn9 | i t i t g | d | d j f } | | Sd S( s,
Find the unique elements of an array.
Returns the sorted unique elements of an array. There are two optional
outputs in addition to the unique elements: the indices of the input array
that give the unique values, and the indices of the unique array that
reconstruct the input array.
Parameters
----------
ar : array_like
Input array. This will be flattened if it is not already 1-D.
return_index : bool, optional
If True, also return the indices of `ar` that result in the unique
array.
return_inverse : bool, optional
If True, also return the indices of the unique array that can be used
to reconstruct `ar`.
Returns
-------
unique : ndarray
The sorted unique values.
unique_indices : ndarray, optional
The indices of the unique values in the (flattened) original array.
Only provided if `return_index` is True.
unique_inverse : ndarray, optional
The indices to reconstruct the (flattened) original array from the
unique array. Only provided if `return_inverse` is True.
See Also
--------
numpy.lib.arraysetops : Module with a number of other functions for
performing set operations on arrays.
Examples
--------
>>> np.unique([1, 1, 2, 2, 3, 3])
array([1, 2, 3])
>>> a = np.array([[1, 1], [2, 3]])
>>> np.unique(a)
array([1, 2, 3])
Return the indices of the original array that give the unique values:
>>> a = np.array(['a', 'b', 'b', 'c', 'a'])
>>> u, indices = np.unique(a, return_index=True)
>>> u
array(['a', 'b', 'c'],
dtype='|S1')
>>> indices
array([0, 1, 3])
>>> a[indices]
array(['a', 'b', 'c'],
dtype='|S1')
Reconstruct the input array from the unique values:
>>> a = np.array([1, 2, 6, 4, 2, 3, 2])
>>> u, indices = np.unique(a, return_inverse=True)
>>> u
array([1, 2, 3, 4, 6])
>>> indices
array([0, 1, 4, 3, 1, 2, 1])
>>> u[indices]
array([1, 2, 6, 4, 2, 3, 2])
i i i˙˙˙˙N( t flattent AttributeErrort sortedt setR t asarrayR t sizet emptyt boolt argsortt concatenatet Truet cumsumt sort( t art return_indext return_inverset itemst permt auxt flagt iflagt iperm( ( s; /usr/lib64/python2.6/site-packages/numpy/lib/arraysetops.pyR _ s6 E,
&
&c C sX | p t | } t | } n t i | | f } | i | | d | d j S( sÉ
Find the intersection of two arrays.
Return the sorted, unique values that are in both of the input arrays.
Parameters
----------
ar1, ar2 : array_like
Input arrays.
assume_unique : bool
If True, the input arrays are both assumed to be unique, which
can speed up the calculation. Default is False.
Returns
-------
out : ndarray
Sorted 1D array of common and unique elements.
See Also
--------
numpy.lib.arraysetops : Module with a number of other functions for
performing set operations on arrays.
Examples
--------
>>> np.intersect1d([1, 3, 4, 3], [3, 1, 2, 1])
array([1, 3])
i i˙˙˙˙( R R R! R$ ( t ar1t ar2t
assume_uniqueR* ( ( s; /usr/lib64/python2.6/site-packages/numpy/lib/arraysetops.pyR É s
c C s | p t | } t | } n t i | | f } | i d j o | S| i t i t g | d | d j t g f } | d | d j } | | S( s
Find the set exclusive-or of two arrays.
Return the sorted, unique values that are in only one (not both) of the
input arrays.
Parameters
----------
ar1, ar2 : array_like
Input arrays.
assume_unique : bool
If True, the input arrays are both assumed to be unique, which
can speed up the calculation. Default is False.
Returns
-------
xor : ndarray
Sorted 1D array of unique values that are in only one of the input
arrays.
Examples
--------
>>> a = np.array([1, 2, 3, 2, 4])
>>> b = np.array([2, 3, 5, 7, 5])
>>> np.setxor1d(a,b)
array([1, 4, 5, 7])
i i i˙˙˙˙( R R R! R R$ R" ( R. R/ R0 R* R+ t flag2( ( s; /usr/lib64/python2.6/site-packages/numpy/lib/arraysetops.pyR ď s
,c
C sÎ | p. t i | d t \ } } t i | } n t i | | f } | i d d } | | } | d | d j } t i | t g f } | i d d t | } | o | | S| | | Sd S( s
Test whether each element of a 1D array is also present in a second array.
Returns a boolean array the same length as `ar1` that is True
where an element of `ar1` is in `ar2` and False otherwise.
Parameters
----------
ar1 : array_like, shape (M,)
Input array.
ar2 : array_like
The values against which to test each value of `ar1`.
assume_unique : bool, optional
If True, the input arrays are both assumed to be unique, which
can speed up the calculation. Default is False.
Returns
-------
mask : ndarray of bools, shape(M,)
The values `ar1[mask]` are in `ar2`.
See Also
--------
numpy.lib.arraysetops : Module with a number of other functions for
performing set operations on arrays.
Notes
-----
`in1d` can be considered as an element-wise function version of the
python keyword `in`, for 1D sequences. ``in1d(a, b)`` is roughly
equivalent to ``np.array([item in b for item in a])``.
.. versionadded:: 1.4.0
Examples
--------
>>> test = np.array([0, 1, 2, 5, 0])
>>> states = [0, 2]
>>> mask = np.in1d(test, states)
>>> mask
array([ True, False, True, False, True], dtype=bool)
>>> test[mask]
array([0, 2, 0])
R' t kindt mergesorti i˙˙˙˙N( R R R" R! R t FalseR (
R. R/ R0 t rev_idxR% t ordert sart equal_adjR+ t indx( ( s; /usr/lib64/python2.6/site-packages/numpy/lib/arraysetops.pyR s .
c C s t t i | | f S( sn
Find the union of two arrays.
Return the unique, sorted array of values that are in either of the two
input arrays.
Parameters
----------
ar1, ar2 : array_like
Input arrays. They are flattened if they are not already 1D.
Returns
-------
union : ndarray
Unique, sorted union of the input arrays.
See Also
--------
numpy.lib.arraysetops : Module with a number of other functions for
performing set operations on arrays.
Examples
--------
>>> np.union1d([-1, 0, 1], [-2, 0, 2])
array([-2, -1, 0, 1, 2])
( R R R! ( R. R/ ( ( s; /usr/lib64/python2.6/site-packages/numpy/lib/arraysetops.pyR \ s c C sh | p t | } t | } n t | | d t } | i d j o | St i | | d j Sd S( s:
Find the set difference of two arrays.
Return the sorted, unique values in `ar1` that are not in `ar2`.
Parameters
----------
ar1 : array_like
Input array.
ar2 : array_like
Input comparison array.
assume_unique : bool
If True, the input arrays are both assumed to be unique, which
can speed up the calculation. Default is False.
Returns
-------
difference : ndarray
Sorted 1D array of values in `ar1` that are not in `ar2`.
See Also
--------
numpy.lib.arraysetops : Module with a number of other functions for
performing set operations on arrays.
Examples
--------
>>> a = np.array([1, 2, 3, 2, 4, 1])
>>> b = np.array([3, 4, 5, 6])
>>> np.setdiff1d(a, b)
array([1, 2])
R0 i N( R R R" R R R ( R. R/ R0 R* ( ( s; /usr/lib64/python2.6/site-packages/numpy/lib/arraysetops.pyR z s " c
C sŹ | o d d k } | i d n t i | i } | i d j oj | o3 | o, | t i d t i t i d t i f S| p | o | t i d t i f S| Sn | p | oŻ | i } | | } t i t
g | d | d j f } | oV t i | d } | i } | o | | | | | | f S| | | | f Sq¨| | | | f Sn9 | i t i t
g | d | d j f } | | Sd S( s<
This function is deprecated. Use unique() instead.
i˙˙˙˙NsĄ The order of the output arguments for `return_index` has changed. Before, the output was (indices, unique_arr), but has now been reversed to be more consistent.i i (
t warningst warnR R R R R R R R! R" R# R$ (
R. R& R' R: R% R) R* R+ R, R- ( ( s; /usr/lib64/python2.6/site-packages/numpy/lib/arraysetops.pyR Ľ s0 ,
&
&c C sA t i t | t | f } | i | | d | d j S( sF
This function is deprecated. Use intersect1d()
instead.
i i˙˙˙˙( R R! R R$ ( R. R/ R* ( ( s; /usr/lib64/python2.6/site-packages/numpy/lib/arraysetops.pyR Í s !
c C s t i | | f } | i d d } | | } | d | d j } t i | t g f } | i d d t | } | | S( sQ
This function is deprecated. Use in1d(assume_unique=True)
instead.
R2 R3 i i˙˙˙˙( R R! R R4 R ( R. R/ R% R6 R7 R8 R+ R9 ( ( s; /usr/lib64/python2.6/site-packages/numpy/lib/arraysetops.pyR Ř s
( t __doc__t __all__t numpyR t numpy.lib.utilsR
R R R4 R R R R R R R R R ( ( ( s; /usr/lib64/python2.6/site-packages/numpy/lib/arraysetops.pyt s :j & , A +'