관리-도구
편집 파일: shape_base.cpython-37.pyc
B ��Fd�J � @ s� d dl mZmZmZ dddddddgZd d lmZ d d lmZm Z m Z d d l m Z d d� Z dd� Zdd� Zdd� Zdd� Zddd�ZG dd� de�Zdd� ZdS )� )�division�absolute_import�print_function� atleast_1d� atleast_2d� atleast_3d�block�hstack�stack�vstack� )�numeric)�array� asanyarray�newaxis)�normalize_axis_indexc G sZ g }x8| D ]0}t |�}|jdkr,|�d�}n|}|�|� q W t|�dkrR|d S |S dS )a% Convert inputs to arrays with at least one dimension. Scalar inputs are converted to 1-dimensional arrays, whilst higher-dimensional inputs are preserved. Parameters ---------- arys1, arys2, ... : array_like One or more input arrays. Returns ------- ret : ndarray An array, or list of arrays, each with ``a.ndim >= 1``. Copies are made only if necessary. See Also -------- atleast_2d, atleast_3d Examples -------- >>> np.atleast_1d(1.0) array([ 1.]) >>> x = np.arange(9.0).reshape(3,3) >>> np.atleast_1d(x) array([[ 0., 1., 2.], [ 3., 4., 5.], [ 6., 7., 8.]]) >>> np.atleast_1d(x) is x True >>> np.atleast_1d(1, [3, 4]) [array([1]), array([3, 4])] r r N)r �ndim�reshape�append�len)�arys�res�ary�result� r �H/opt/alt/python37/lib64/python3.7/site-packages/numpy/core/shape_base.pyr s ' c G sx g }xV| D ]N}t |�}|jdkr.|�dd�}n |jdkrJ|tdd�f }n|}|�|� q W t|�dkrp|d S |S dS )a` View inputs as arrays with at least two dimensions. Parameters ---------- arys1, arys2, ... : array_like One or more array-like sequences. Non-array inputs are converted to arrays. Arrays that already have two or more dimensions are preserved. Returns ------- res, res2, ... : ndarray An array, or list of arrays, each with ``a.ndim >= 2``. Copies are avoided where possible, and views with two or more dimensions are returned. See Also -------- atleast_1d, atleast_3d Examples -------- >>> np.atleast_2d(3.0) array([[ 3.]]) >>> x = np.arange(3.0) >>> np.atleast_2d(x) array([[ 0., 1., 2.]]) >>> np.atleast_2d(x).base is x True >>> np.atleast_2d(1, [1, 2], [[1, 2]]) [array([[1]]), array([[1, 2]]), array([[1, 2]])] r r N)r r r r r r )r r r r r r r r ? s % c G s� g }x|| D ]t}t |�}|jdkr0|�ddd�}nD|jdkrN|tdd�tf }n&|jdkrp|dd�dd�tf }n|}|�|� q W t|�dkr�|d S |S dS )a� View inputs as arrays with at least three dimensions. Parameters ---------- arys1, arys2, ... : array_like One or more array-like sequences. Non-array inputs are converted to arrays. Arrays that already have three or more dimensions are preserved. Returns ------- res1, res2, ... : ndarray An array, or list of arrays, each with ``a.ndim >= 3``. Copies are avoided where possible, and views with three or more dimensions are returned. For example, a 1-D array of shape ``(N,)`` becomes a view of shape ``(1, N, 1)``, and a 2-D array of shape ``(M, N)`` becomes a view of shape ``(M, N, 1)``. See Also -------- atleast_1d, atleast_2d Examples -------- >>> np.atleast_3d(3.0) array([[[ 3.]]]) >>> x = np.arange(3.0) >>> np.atleast_3d(x).shape (1, 3, 1) >>> x = np.arange(12.0).reshape(4,3) >>> np.atleast_3d(x).shape (4, 3, 1) >>> np.atleast_3d(x).base is x.base # x is a reshape, so not base itself True >>> for arr in np.atleast_3d([1, 2], [[1, 2]], [[[1, 2]]]): ... print(arr, arr.shape) ... [[[1] [2]]] (1, 2, 1) [[[1] [2]]] (1, 2, 1) [[[1 2]]] (1, 1, 2) r r N� )r r r r r r )r r r r r r r r s s 1 c C s t �dd� | D �d�S )a Stack arrays in sequence vertically (row wise). Take a sequence of arrays and stack them vertically to make a single array. Rebuild arrays divided by `vsplit`. This function continues to be supported for backward compatibility, but you should prefer ``np.concatenate`` or ``np.stack``. The ``np.stack`` function was added in NumPy 1.10. Parameters ---------- tup : sequence of ndarrays Tuple containing arrays to be stacked. The arrays must have the same shape along all but the first axis. Returns ------- stacked : ndarray The array formed by stacking the given arrays. See Also -------- stack : Join a sequence of arrays along a new axis. hstack : Stack arrays in sequence horizontally (column wise). dstack : Stack arrays in sequence depth wise (along third dimension). concatenate : Join a sequence of arrays along an existing axis. vsplit : Split array into a list of multiple sub-arrays vertically. block : Assemble arrays from blocks. Notes ----- Equivalent to ``np.concatenate(tup, axis=0)`` if `tup` contains arrays that are at least 2-dimensional. Examples -------- >>> a = np.array([1, 2, 3]) >>> b = np.array([2, 3, 4]) >>> np.vstack((a,b)) array([[1, 2, 3], [2, 3, 4]]) >>> a = np.array([[1], [2], [3]]) >>> b = np.array([[2], [3], [4]]) >>> np.vstack((a,b)) array([[1], [2], [3], [2], [3], [4]]) c S s g | ] }t |��qS r )r )�.0�_mr r r � <listcomp>� s zvstack.<locals>.<listcomp>r )�_nx� concatenate)�tupr r r r � s 7c C s< dd� | D �}|r,|d j dkr,t�|d�S t�|d�S dS )a� Stack arrays in sequence horizontally (column wise). Take a sequence of arrays and stack them horizontally to make a single array. Rebuild arrays divided by `hsplit`. This function continues to be supported for backward compatibility, but you should prefer ``np.concatenate`` or ``np.stack``. The ``np.stack`` function was added in NumPy 1.10. Parameters ---------- tup : sequence of ndarrays All arrays must have the same shape along all but the second axis. Returns ------- stacked : ndarray The array formed by stacking the given arrays. See Also -------- stack : Join a sequence of arrays along a new axis. vstack : Stack arrays in sequence vertically (row wise). dstack : Stack arrays in sequence depth wise (along third axis). concatenate : Join a sequence of arrays along an existing axis. hsplit : Split array along second axis. block : Assemble arrays from blocks. Notes ----- Equivalent to ``np.concatenate(tup, axis=1)`` if `tup` contains arrays that are at least 2-dimensional. Examples -------- >>> a = np.array((1,2,3)) >>> b = np.array((2,3,4)) >>> np.hstack((a,b)) array([1, 2, 3, 2, 3, 4]) >>> a = np.array([[1],[2],[3]]) >>> b = np.array([[2],[3],[4]]) >>> np.hstack((a,b)) array([[1, 2], [2, 3], [3, 4]]) c S s g | ] }t |��qS r )r )r r r r r r s zhstack.<locals>.<listcomp>r r N)r r r! )r" Zarrsr r r r � s 1 c s� dd� | D �} | st d��tdd� | D ��}t|�dkr@t d��| d jd }t||�}td �f| tjf � � fd d�| D �}tj||d �S ) a' Join a sequence of arrays along a new axis. The `axis` parameter specifies the index of the new axis in the dimensions of the result. For example, if ``axis=0`` it will be the first dimension and if ``axis=-1`` it will be the last dimension. .. versionadded:: 1.10.0 Parameters ---------- arrays : sequence of array_like Each array must have the same shape. axis : int, optional The axis in the result array along which the input arrays are stacked. Returns ------- stacked : ndarray The stacked array has one more dimension than the input arrays. See Also -------- concatenate : Join a sequence of arrays along an existing axis. split : Split array into a list of multiple sub-arrays of equal size. block : Assemble arrays from blocks. Examples -------- >>> arrays = [np.random.randn(3, 4) for _ in range(10)] >>> np.stack(arrays, axis=0).shape (10, 3, 4) >>> np.stack(arrays, axis=1).shape (3, 10, 4) >>> np.stack(arrays, axis=2).shape (3, 4, 10) >>> a = np.array([1, 2, 3]) >>> b = np.array([2, 3, 4]) >>> np.stack((a, b)) array([[1, 2, 3], [2, 3, 4]]) >>> np.stack((a, b), axis=-1) array([[1, 2], [2, 3], [3, 4]]) c S s g | ] }t |��qS r )r )r �arrr r r r \ s zstack.<locals>.<listcomp>z need at least one array to stackc s s | ] }|j V qd S )N)�shape)r r# r r r � <genexpr>` s zstack.<locals>.<genexpr>r z)all input arrays must have the same shaper Nc s g | ] }|� �qS r r )r r# )�slr r r h s )�axis) � ValueError�setr r r �slicer r r! )�arraysr' ZshapesZ result_ndimZexpanded_arraysr )r& r r ( s 4 c @ s> e Zd ZdZdd� Zdd� dd� dd� fdd �Zdd d �Zd S )� _Recurserz; Utility class for recursing over nested iterables c C s || _ d S )N)� recurse_if)�selfr- r r r �__init__p s z_Recurser.__init__c K s | S )Nr )�x�kwargsr r r �<lambda>s � z_Recurser.<lambda>c K s | S )Nr )r0 r1 r r r r2 t r3 c K s | S )Nr )r1 r r r r2 u r3 c s � ����fdd�� � |f|�S )a{ Iterate over the nested list, applying: * ``f_map`` (T -> U) to items * ``f_reduce`` (Iterable[U] -> U) to mapped items For instance, ``map_reduce([[1, 2], 3, 4])`` is:: f_reduce([ f_reduce([ f_map(1), f_map(2) ]), f_map(3), f_map(4) ]]) State can be passed down through the calls with `f_kwargs`, to iterables of mapped items. When kwargs are passed, as in ``map_reduce([[1, 2], 3, 4], **kw)``, this becomes:: kw1 = f_kwargs(**kw) kw2 = f_kwargs(**kw1) f_reduce([ f_reduce([ f_map(1), **kw2) f_map(2, **kw2) ], **kw1), f_map(3, **kw1), f_map(4, **kw1) ]], **kw) c s@ �� | �s�| f|�S �f |�� ��� fdd�| D �f|�S d S )Nc 3 s | ]}� |f��V qd S )Nr )r �xi)�f� next_kwargsr r r% � s z2_Recurser.map_reduce.<locals>.f.<locals>.<genexpr>)r- )r0 r1 )r5 �f_kwargs�f_map�f_reducer. )r6 r r5 � s z _Recurser.map_reduce.<locals>.fr )r. r0 r8 r9 r7 r1 r )r5 r7 r8 r9 r. r � map_reduces s $ z_Recurser.map_reducer c c sZ | � |�}|||fV |s dS x6t|�D ]*\}}x | �|||f �D ] }|V qDW q(W dS )aB Iterate over x, yielding (index, value, entering), where * ``index``: a tuple of indices up to this point * ``value``: equal to ``x[index[0]][...][index[-1]]``. On the first iteration, is ``x`` itself * ``entering``: bool. The result of ``recurse_if(value)`` N)r- � enumerate�walk)r. r0 �indexZ do_recurse�ir4 �vr r r r< � s z_Recurser.walkN)r )�__name__� __module__� __qualname__�__doc__r/ r: r< r r r r r, l s -r, c s, dd� � dd� }t dd� d�}d}d }x�|�| �D ]�\}}}t|�tkrZtd �||����|sht|�}n t|�d kr2t|�d }d }nq2|dk r�||kr�td�||||����|}q2W |r�td��|j| t t d�} |j| dd� t d�} t || ���| } |j| � �fdd�t d�} |j| dd� dd� | d�S )a9 Assemble an nd-array from nested lists of blocks. Blocks in the innermost lists are concatenated (see `concatenate`) along the last dimension (-1), then these are concatenated along the second-last dimension (-2), and so on until the outermost list is reached. Blocks can be of any dimension, but will not be broadcasted using the normal rules. Instead, leading axes of size 1 are inserted, to make ``block.ndim`` the same for all blocks. This is primarily useful for working with scalars, and means that code like ``np.block([v, 1])`` is valid, where ``v.ndim == 1``. When the nested list is two levels deep, this allows block matrices to be constructed from their components. .. versionadded:: 1.13.0 Parameters ---------- arrays : nested list of array_like or scalars (but not tuples) If passed a single ndarray or scalar (a nested list of depth 0), this is returned unmodified (and not copied). Elements shapes must match along the appropriate axes (without broadcasting), but leading 1s will be prepended to the shape as necessary to make the dimensions match. Returns ------- block_array : ndarray The array assembled from the given blocks. The dimensionality of the output is equal to the greatest of: * the dimensionality of all the inputs * the depth to which the input list is nested Raises ------ ValueError * If list depths are mismatched - for instance, ``[[a, b], c]`` is illegal, and should be spelt ``[[a, b], [c]]`` * If lists are empty - for instance, ``[[a, b], []]`` See Also -------- concatenate : Join a sequence of arrays together. stack : Stack arrays in sequence along a new dimension. hstack : Stack arrays in sequence horizontally (column wise). vstack : Stack arrays in sequence vertically (row wise). dstack : Stack arrays in sequence depth wise (along third dimension). vsplit : Split array into a list of multiple sub-arrays vertically. Notes ----- When called with only scalars, ``np.block`` is equivalent to an ndarray call. So ``np.block([[1, 2], [3, 4]])`` is equivalent to ``np.array([[1, 2], [3, 4]])``. This function does not enforce that the blocks lie on a fixed grid. ``np.block([[a, b], [c, d]])`` is not restricted to arrays of the form:: AAAbb AAAbb cccDD But is also allowed to produce, for some ``a, b, c, d``:: AAAbb AAAbb cDDDD Since concatenation happens along the last axis first, `block` is _not_ capable of producing the following directly:: AAAbb cccbb cccDD Matlab's "square bracket stacking", ``[A, B, ...; p, q, ...]``, is equivalent to ``np.block([[A, B, ...], [p, q, ...]])``. Examples -------- The most common use of this function is to build a block matrix >>> A = np.eye(2) * 2 >>> B = np.eye(3) * 3 >>> np.block([ ... [A, np.zeros((2, 3))], ... [np.ones((3, 2)), B ] ... ]) array([[ 2., 0., 0., 0., 0.], [ 0., 2., 0., 0., 0.], [ 1., 1., 3., 0., 0.], [ 1., 1., 0., 3., 0.], [ 1., 1., 0., 0., 3.]]) With a list of depth 1, `block` can be used as `hstack` >>> np.block([1, 2, 3]) # hstack([1, 2, 3]) array([1, 2, 3]) >>> a = np.array([1, 2, 3]) >>> b = np.array([2, 3, 4]) >>> np.block([a, b, 10]) # hstack([a, b, 10]) array([1, 2, 3, 2, 3, 4, 10]) >>> A = np.ones((2, 2), int) >>> B = 2 * A >>> np.block([A, B]) # hstack([A, B]) array([[1, 1, 2, 2], [1, 1, 2, 2]]) With a list of depth 2, `block` can be used in place of `vstack`: >>> a = np.array([1, 2, 3]) >>> b = np.array([2, 3, 4]) >>> np.block([[a], [b]]) # vstack([a, b]) array([[1, 2, 3], [2, 3, 4]]) >>> A = np.ones((2, 2), int) >>> B = 2 * A >>> np.block([[A], [B]]) # vstack([A, B]) array([[1, 1], [1, 1], [2, 2], [2, 2]]) It can also be used in places of `atleast_1d` and `atleast_2d` >>> a = np.array(0) >>> b = np.array([1]) >>> np.block([a]) # atleast_1d(a) array([0]) >>> np.block([b]) # atleast_1d(b) array([1]) >>> np.block([[a]]) # atleast_2d(a) array([[0]]) >>> np.block([[b]]) # atleast_2d(b) array([[1]]) c S s* t | �} t|| j d�}| d| tf S )Nr )N)r �maxr �Ellipsis)r0 r �diffr r r � atleast_ndJ s zblock.<locals>.atleast_ndc S s dd� dd� | D �� S )Nr+ � c s s | ]}d � |�V qdS )z[{}]N)�format)r r> r r r r% P s z.block.<locals>.format_index.<locals>.<genexpr>)�join)r= r r r � format_indexO s zblock.<locals>.format_indexc S s t | �tkS )N)�type�list)r0 r r r r2 R r3 zblock.<locals>.<lambda>)r- NFz{} is a tuple. Only lists can be used to arrange blocks, and np.block does not allow implicit conversion from tuple to ndarray.r r TzcList depths are mismatched. First element was at depth {}, but there is an element at depth {} ({})zLists cannot be empty)r8 r9 c S s | j S )N)r )r4 r r r r2 � r3 c s � | ��S )Nr )r4 )rG r r r r2 � r3 c S s t jt| �|d�S )N)r' )r r! rM )Zxsr' r r r r2 � r3 c S s t | d d�S )Nr )r' )�dict)r' r r r r2 � r3 )r9 r7 r' ) r, r< rL �tuple� TypeErrorrI r r( r: r rM rD ) r+ rK ZrecZ list_ndimZ any_emptyr= �valueZenteringZ curr_depthZ elem_ndimZ first_axisr )rG r r r � sR N)r )� __future__r r r �__all__rH r r r r r � multiarrayr r r r r r r �objectr, r r r r r �<module> s 44C99 DJ