/usr/local/lib64/python3.6/site-packages/numpy/lib/__pycache__
Edit: /usr/local/lib64/python3.6/site-packages/numpy/lib/__pycache__/arraysetops.cpython-36.pyc (21808B)
3
EgHa @ s6 d Z ddlZddlZddlmZ ejejddZdddd d
d d d
gZd+ddZ ee d,ddZ
dd Z d-ddZ ee d.dd Z
d/ddZd0ddZeed1ddZd2d d Zeed3d dZd4d d Zeed5d!d Zd6d"d#Zeed7d$d
Zd%d& Zeed'd Zd8d(d)Zeed9d*d
ZdS ):a
Set operations for arrays based on sorting.
:Contains:
unique,
isin,
ediff1d,
intersect1d,
setxor1d,
in1d,
union1d,
setdiff1d
: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
N) overridesnumpy)moduleediff1d intersect1dsetxor1dunion1d setdiff1duniquein1disinc C s
| ||fS )N )aryto_endto_beginr
r
A/usr/local/lib64/python3.6/site-packages/numpy/lib/arraysetops.py_ediff1d_dispatcher, s r c C sN t j| j } | j}|dkr<|dkr<| dd | dd S |dkrJd}n2t j|}t j||ddsltd|j }t|}|dkrd}n2t j|}t j||ddstd|j }t|}tt| d d}t j|| | | jd}| j |}|dkr||d|< |dkr |||| d< t j
| dd | dd |||| |S )
a?
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
-------
ediff1d : 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, ..., -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])
N r Z same_kind)ZcastingzQdtype of `to_end` must be compatible with input `ary` under the `same_kind` rule.)dtyper ) np
asanyarrayravelr Zcan_cast TypeErrorlenmaxemptyZ__array_wrap__subtract)r r r Z dtype_reqZl_beginZl_endZl_diffresultr
r
r r 0 s6 -
*c C s t | dkr| d S | S dS )z5 Unpacks one-element tuples for use as return values r r N)r )xr
r
r
_unpack_tuple s r c C s | fS )Nr
)ar return_indexreturn_inverse
return_countsaxisr
r
r _unique_dispatcher s r& Fc sV t j dkr(t |||}t|S yt j d W n$ t jk
r^ t j jY nX j j j d t j
dd t j d t j fddt
jd D }y0 jd dkrԈ j|}nt jt |d}W n, tk
r d}t|j jdY nX fd d
} t||||}
| |
d f|
dd }
t|
S ) ar
Find the unique elements of an array.
Returns the sorted unique elements of an array. There are three optional
outputs in addition to the unique elements:
* the indices of the input array that give the unique values
* the indices of the unique array that reconstruct the input array
* the number of times each unique value comes up in the input array
Parameters
----------
ar : array_like
Input array. Unless `axis` is specified, this will be flattened if it
is not already 1-D.
return_index : bool, optional
If True, also return the indices of `ar` (along the specified axis,
if provided, or in the flattened array) that result in the unique array.
return_inverse : bool, optional
If True, also return the indices of the unique array (for the specified
axis, if provided) that can be used to reconstruct `ar`.
return_counts : bool, optional
If True, also return the number of times each unique item appears
in `ar`.
.. versionadded:: 1.9.0
axis : int or None, optional
The axis to operate on. If None, `ar` will be flattened. If an integer,
the subarrays indexed by the given axis will be flattened and treated
as the elements of a 1-D array with the dimension of the given axis,
see the notes for more details. Object arrays or structured arrays
that contain objects are not supported if the `axis` kwarg is used. The
default is None.
.. versionadded:: 1.13.0
Returns
-------
unique : ndarray
The sorted unique values.
unique_indices : ndarray, optional
The indices of the first occurrences of the unique values in the
original array. Only provided if `return_index` is True.
unique_inverse : ndarray, optional
The indices to reconstruct the original array from the
unique array. Only provided if `return_inverse` is True.
unique_counts : ndarray, optional
The number of times each of the unique values comes up in the
original array. Only provided if `return_counts` is True.
.. versionadded:: 1.9.0
See Also
--------
numpy.lib.arraysetops : Module with a number of other functions for
performing set operations on arrays.
Notes
-----
When an axis is specified the subarrays indexed by the axis are sorted.
This is done by making the specified axis the first dimension of the array
(move the axis to the first dimension to keep the order of the other axes)
and then flattening the subarrays in C order. The flattened subarrays are
then viewed as a structured type with each element given a label, with the
effect that we end up with a 1-D array of structured types that can be
treated in the same way as any other 1-D array. The result is that the
flattened subarrays are sorted in lexicographic order starting with the
first element.
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 unique rows of a 2D array
>>> a = np.array([[1, 0, 0], [1, 0, 0], [2, 3, 4]])
>>> np.unique(a, axis=0)
array([[1, 0, 0], [2, 3, 4]])
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='
>> indices
array([0, 1, 3])
>>> a[indices]
array(['a', 'b', 'c'], dtype='>> 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])
Nr r )r c s g | ]}d j |d jfqS )zf{i})i)formatr ).0r' )r! r
r
s zunique..z;The axis argument to unique is not supported for dtype {dt})dtc s< t | }| j} | j|fdd } tj| d } | S )Nr r )r viewreshaper moveaxis)Zuniqn)r%
orig_dtype
orig_shaper
r reshape_uniq( s
z unique..reshape_uniq)r r _unique1dr r. Z AxisErrorndimshaper r- prodintpZascontiguousarrayranger, r r r r( ) r! r" r# r$ r% retr Z consolidatedmsgr2 outputr
)r! r% r0 r1 r r
s0 n
$
c C s t j| j } |p|}|r8| j|r&dndd}| | }n | j | }t j|jt jd}d|dd< |dd |dd k|dd< || f}|r||| f7 }|rt j|d } t j|jt j d}
| |
|< ||
f7 }|rt j
t j ||j gf } |t j
| f7 }|S ) z?
Find the unique elements of an array, ignoring shape.
mergesortZ quicksort)kind)r TNr r )r r flattenargsortsortr r5 Zbool_Zcumsumr7 concatenateZnonzerosizeZdiff) r! r" r# r$ Zoptional_indicesZpermauxmaskr9 ZimaskZinv_idxidxr
r
r r3 5 s,
r3 c C s | |fS )Nr
)ar1ar2
assume_uniquereturn_indicesr
r
r _intersect1d_dispatcherV s rJ c C s t j| } t j|}|sP|r>t| dd\} }t|dd\}}q`t| } t|}n| j } |j }t j| |f}|rt j|dd}|| }n|j |dd |dd k}|dd | } |r|dd | }
|dd | | j } | s||
}
|| } | |
| fS | S dS )
aj
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. Will be flattened if not already 1D.
assume_unique : bool
If True, the input arrays are both assumed to be unique, which
can speed up the calculation. Default is False.
return_indices : bool
If True, the indices which correspond to the intersection of the two
arrays are returned. The first instance of a value is used if there are
multiple. Default is False.
.. versionadded:: 1.15.0
Returns
-------
intersect1d : ndarray
Sorted 1D array of common and unique elements.
comm1 : ndarray
The indices of the first occurrences of the common values in `ar1`.
Only provided if `return_indices` is True.
comm2 : ndarray
The indices of the first occurrences of the common values in `ar2`.
Only provided if `return_indices` is True.
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])
To intersect more than two arrays, use functools.reduce:
>>> from functools import reduce
>>> reduce(np.intersect1d, ([1, 3, 4, 3], [3, 1, 2, 1], [6, 3, 4, 2]))
array([3])
To return the indices of the values common to the input arrays
along with the intersected values:
>>> x = np.array([1, 1, 2, 3, 4])
>>> y = np.array([2, 1, 4, 6])
>>> xy, x_ind, y_ind = np.intersect1d(x, y, return_indices=True)
>>> x_ind, y_ind
(array([0, 2, 4]), array([1, 0, 2]))
>>> xy, x[x_ind], y[y_ind]
(array([1, 2, 4]), array([1, 2, 4]), array([1, 2, 4]))
T)r" r< )r= r Nr r r )r r r
r rA r? r@ rB ) rF rG rH rI Zind1Zind2rC Zaux_sort_indicesrD Zint1dZ ar1_indicesZ ar2_indicesr
r
r r [ s2 =
c C s | |fS )Nr
)rF rG rH r
r
r _setxor1d_dispatcher s rK c C s| |st | } t |}tj| |f}|jdkr0|S |j tjdg|dd |dd kdgf}||dd |dd @ S )a
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
-------
setxor1d : 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])
r Tr Nr r )r
r rA rB r@ )rF rG rH rC flagr
r
r r s
(c C s | |fS )Nr
)rF rG rH invertr
r
r _in1d_dispatcher s rN c C sn t j| j } t j|j }| jjp*|jj}t|dt| d k sH|r|rzt jt| td}xF|D ]}|| |kM }qdW n,t jt| td}x|D ]}|| |kO }qW |S |st j | dd\} }t j |}t j
| |f}|j dd} || }
|r |
dd |
d d
k} n|
dd |
d d k} t j
| |gf} t j |j
td}
| |
| < |rb|
d t| S |
| S d S ) a
Test whether each element of a 1-D 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.
We recommend using :func:`isin` instead of `in1d` for new code.
Parameters
----------
ar1 : (M,) array_like
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.
invert : bool, optional
If True, the values in the returned array are inverted (that is,
False where an element of `ar1` is in `ar2` and True otherwise).
Default is False. ``np.in1d(a, b, invert=True)`` is equivalent
to (but is faster than) ``np.invert(in1d(a, b))``.
.. versionadded:: 1.8.0
Returns
-------
in1d : (M,) ndarray, bool
The values `ar1[in1d]` are in `ar2`.
See Also
--------
isin : Version of this function that preserves the
shape of ar1.
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 1-D sequences. ``in1d(a, b)`` is roughly
equivalent to ``np.array([item in b for item in a])``.
However, this idea fails if `ar2` is a set, or similar (non-sequence)
container: As ``ar2`` is converted to an array, in those cases
``asarray(ar2)`` is an object array rather than the expected array of
contained values.
.. 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])
>>> test[mask]
array([0, 2, 0])
>>> mask = np.in1d(test, states, invert=True)
>>> mask
array([False, True, False, True, False])
>>> test[mask]
array([1, 5])
g(\?)r T)r# r< )r= r Nr r )r asarrayr r Z hasobjectr ZonesboolZzerosr
rA r? r r5 )rF rG rH rM Zcontains_objectrD aZrev_idxr! orderZsarZbool_arrL r9 r
r
r r s6 C
c C s | |fS )Nr
)element
test_elementsrH rM r
r
r _isin_dispatcher` s rV c C s" t j| } t| |||dj| jS )a
Calculates `element in test_elements`, broadcasting over `element` only.
Returns a boolean array of the same shape as `element` that is True
where an element of `element` is in `test_elements` and False otherwise.
Parameters
----------
element : array_like
Input array.
test_elements : array_like
The values against which to test each value of `element`.
This argument is flattened if it is an array or array_like.
See notes for behavior with non-array-like parameters.
assume_unique : bool, optional
If True, the input arrays are both assumed to be unique, which
can speed up the calculation. Default is False.
invert : bool, optional
If True, the values in the returned array are inverted, as if
calculating `element not in test_elements`. Default is False.
``np.isin(a, b, invert=True)`` is equivalent to (but faster
than) ``np.invert(np.isin(a, b))``.
Returns
-------
isin : ndarray, bool
Has the same shape as `element`. The values `element[isin]`
are in `test_elements`.
See Also
--------
in1d : Flattened version of this function.
numpy.lib.arraysetops : Module with a number of other functions for
performing set operations on arrays.
Notes
-----
`isin` is an element-wise function version of the python keyword `in`.
``isin(a, b)`` is roughly equivalent to
``np.array([item in b for item in a])`` if `a` and `b` are 1-D sequences.
`element` and `test_elements` are converted to arrays if they are not
already. If `test_elements` is a set (or other non-sequence collection)
it will be converted to an object array with one element, rather than an
array of the values contained in `test_elements`. This is a consequence
of the `array` constructor's way of handling non-sequence collections.
Converting the set to a list usually gives the desired behavior.
.. versionadded:: 1.13.0
Examples
--------
>>> element = 2*np.arange(4).reshape((2, 2))
>>> element
array([[0, 2],
[4, 6]])
>>> test_elements = [1, 2, 4, 8]
>>> mask = np.isin(element, test_elements)
>>> mask
array([[False, True],
[ True, False]])
>>> element[mask]
array([2, 4])
The indices of the matched values can be obtained with `nonzero`:
>>> np.nonzero(mask)
(array([0, 1]), array([1, 0]))
The test can also be inverted:
>>> mask = np.isin(element, test_elements, invert=True)
>>> mask
array([[ True, False],
[False, True]])
>>> element[mask]
array([0, 6])
Because of how `array` handles sets, the following does not
work as expected:
>>> test_set = {1, 2, 4, 8}
>>> np.isin(element, test_set)
array([[False, False],
[False, False]])
Casting the set to a list gives the expected result:
>>> np.isin(element, list(test_set))
array([[False, True],
[ True, False]])
)rH rM )r rP r r- r5 )rT rU rH rM r
r
r r d s ^
c C s | |fS )Nr
)rF rG r
r
r _union1d_dispatcher s rW c C s t tj| |fddS )a=
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
-------
union1d : 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])
To find the union of more than two arrays, use functools.reduce:
>>> from functools import reduce
>>> reduce(np.union1d, ([1, 3, 4, 3], [3, 1, 2, 1], [6, 3, 4, 2]))
array([1, 2, 3, 4, 6])
N)r% )r
r rA )rF rG r
r
r r s "c C s | |fS )Nr
)rF rG rH r
r
r _setdiff1d_dispatcher s rX c C s8 |rt j| j } nt| } t|}| t| |ddd S )a
Find the set difference of two arrays.
Return the 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
-------
setdiff1d : ndarray
1D array of values in `ar1` that are not in `ar2`. The result
is sorted when `assume_unique=False`, but otherwise only sorted
if the input is sorted.
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])
T)rH rM )r rP r r
r )rF rG rH r
r
r r s
%)NN)NN)NNNN)FFFN)FFF)NN)FF)N)F)NN)FF)NN)FF)N)F)__doc__ functoolsr r Z
numpy.corer partialZarray_function_dispatch__all__r r r r& r
r3 rJ r rK r rN r rV r rW r rX r r
r
r
r sH
W
!
`
*
p
b%