Name	Size	Mode	Actions
arraypad.cpython-36.pyc	21827	0644	editdlrm
arraysetops.cpython-36.pyc	21808	0644	editdlrm
arrayterator.cpython-36.pyc	7021	0644	editdlrm
financial.cpython-36.pyc	30060	0644	editdlrm
format.cpython-36.pyc	25179	0644	editdlrm
function_base.cpython-36.pyc	137226	0644	editdlrm
histograms.cpython-36.pyc	32023	0644	editdlrm
index_tricks.cpython-36.pyc	27910	0644	editdlrm
mixins.cpython-36.pyc	7112	0644	editdlrm
nanfunctions.cpython-36.pyc	54460	0644	editdlrm
npyio.cpython-36.pyc	67062	0644	editdlrm
polynomial.cpython-36.pyc	38177	0644	editdlrm
recfunctions.cpython-36.pyc	47325	0644	editdlrm
scimath.cpython-36.pyc	15349	0644	editdlrm
setup.cpython-36.pyc	550	0644	editdlrm
shape_base.cpython-36.pyc	35848	0644	editdlrm
stride_tricks.cpython-36.pyc	8315	0644	editdlrm
twodim_base.cpython-36.pyc	28023	0644	editdlrm
type_check.cpython-36.pyc	19237	0644	editdlrm
ufunclike.cpython-36.pyc	7841	0644	editdlrm
user_array.cpython-36.pyc	11338	0644	editdlrm
utils.cpython-36.pyc	24641	0644	editdlrm
_datasource.cpython-36.pyc	20400	0644	editdlrm
_iotools.cpython-36.pyc	25903	0644	editdlrm
_version.cpython-36.pyc	4819	0644	editdlrm
__init__.cpython-36.pyc	1570	0644	editdlrm

3 �Eg��@s4dZd
dl
mZ
d
dlmZ
dg
ZGdd�d�ZdS)a$
A buffered iterator for big arrays. This module solves the problem of iterating over a big file-based array without having to read it into memory. The `Arrayterator` class wraps an array object, and when iterated it will return sub-arrays with at most a user-specified number of elements. �)
�mul)
�reduce�Arrayteratorc@sReZ
dZd
Zddd�
Zdd�Zdd�Zd d �Zedd��
Z ed d��
Z dd�ZdS)ra� Buffered iterator for big arrays. `Arrayterator` creates a buffered iterator for reading big arrays in small contiguous blocks. The class is useful for objects stored in the file system. It allows iteration over the object *without* reading everything in memory; instead, small blocks are read and iterated over. `Arrayterator` can be used with any object that supports multidimensional slices. This includes NumPy arrays, but also variables from Scientific.IO.NetCDF or pynetcdf for example. Parameters ---------- var : array_like The object to iterate over. buf_size : int, optional The buffer size. If `buf_size` is supplied, the maximum amount of data that will be read into memory is `buf_size` elements. Default is None, which will read as many element as possible into memory. Attributes ---------- var buf_size start stop step shape flat See Also -------- ndenumerate : Multidimensional array iterator. flatiter : Flat array iterator. memmap : Create a memory-map to an array stored in a binary file on disk. Notes ----- The algorithm works by first finding a "running dimension", along which the blocks will be extracted. Given an array of dimensions ``(d1, d2, ..., dn)``, e.g. if `buf_size` is smaller than ``d1``, the first dimension will be used. If, on the other hand, ``d1 < buf_size < d1*d2`` the second dimension will be used, and so on. Blocks are extracted along this dimension, and when the last block is returned the process continues from the next dimension, until all elements have been read. Examples -------- >>> a = np.arange(3 * 4 * 5 * 6).reshape(3, 4, 5, 6) >>> a_itor = np.lib.Arrayterator(a, 2) >>> a_itor.shape (3, 4, 5, 6) Now we can iterate over ``a_itor``, and it will return arrays of size two. Since `buf_size` was smaller than any dimension, the first dimension will be iterated over first: >>> for subarr in a_itor: ... if not subarr.all(): ... print(subarr, subarr.shape) # doctest: +SKIP >>> # [[[[0 1]]]] (1, 1, 1, 2) NcCsF|
|_||_
d
d�|
jD�
|_dd�|
jD�
|_dd�|
jD�
|_dS)Nc
Ssg|]}
d�qS)
r
�)�.0�dimrr�B/usr/local/lib64/python3.6/site-packages/numpy/lib/arrayterator.py� Xsz)Arrayterator.__init__..c
Ssg|]}
|
�qSrr)rrrrrr Ysc
Ssg|]}
d�qS)
�
r)rrrrrr Zs)�var�buf_size�shape�start�stop�step)�selfrrrrr�__init__Ts



zArrayterator.__init__cCst|j
|
�S)
N)�getattrr)r�attrrrr�__getattr__\s
zArrayterator.__getattr__cCsX
t|
t
�s|
f
}
g}t|
�
|j}}xf|
D]^}|tkr\|jtd
�
g
||d�

t|�
}q*t|t�r~|jt||dd��

q*|j|�

q*Wt
|�
}
t|
�
|kr�|
td
�
f
|t|
�
7}
|j |j |j�}x�tt |j|j|j|
��
D]l\}\}} } }||j�
pd|j|<| |j�
pd|j|<||j�
p0| ||j|<t| |j|�|j|<q�W|S)z- Return a new arrayterator. Nr r
)� isinstance�tuple�len�ndim�Ellipsis�extend�slice�int�append� __class__rr� enumerate�ziprrr�min)r�indexZfixed�lengthZdims�slice_�out�
irrrrrr�__getitem___s,













&




zArrayterator.__getitem__c
Cs*td
d�t
|j|j|j�D�
�
}
|j|
S)z- Return corresponding data. c
ss|]}
t|
�V
qdS)
N)
r)r�
trrr� �sz)Arrayterator.__array__..)rr!rrrr)rr%rrr� __array__s

zArrayterator.__array__c
csx|D]}
|
jEd
H
qWd
S)aG A 1-D flat iterator for Arrayterator objects. This iterator returns elements of the array to be iterated over in `Arrayterator` one by one. It is similar to `flatiter`. See Also -------- Arrayterator flatiter Examples -------- >>> a = np.arange(3 * 4 * 5 * 6).reshape(3, 4, 5, 6) >>> a_itor = np.lib.Arrayterator(a, 2) >>> for subarr in a_itor.flat: ... if not subarr: ... print(subarr, type(subarr)) ... 0 N)
�flat)r�blockrrrr,�s
zArrayterator.flatc

Cs td
d�t
|j|j|j�D�
�
S)zk The shape of the array to be iterated over. For an example, see `Arrayterator`. c
ss(|] \}
}}||
d|dV
qd
S)r Nr)rrrrrrrr*�sz%Arrayterator.shape..)rr!rrr)
rrrrr �s
zArrayterator.shapec
cs�
d
d�|jD�
rdS|j
dd�}
|jdd�}|jdd�}|jj}�
xR|jpZtt|j�}d}x�t |ddd�D]~}|dkr�|
|d||<n:||j|k
r�|
||||||<|}n|j|||<t |j|||�||<||j|}qrWtdd�t|
||�D�
�
}|j|V
|||
|<xZt |ddd �D]F}|
||j|k�
r8|j
||
|<|
|d|j|d7<�
q8W|
d|jdkrJdSqJWdS) Nc
Ssg|]}
|
dk
r|
�qS)
r
r)rrrrrr �sz)Arrayterator.__iter__..r
r c
ss|]}
t|
�V
qdS)
N)
r)rr)rrrr*�sz(Arrayterator.__iter__..�����r.r.) r rrrrrrrr�ranger"rr!) rrrrZndims�countZrundimr'r%rrr�__iter__�s6















$

zArrayterator.__iter__)
N)�__name__� __module__�__qualname__�__doc__rrr(r+�propertyr,r r1rrrrrsB   N)r5�operatorr� functoolsr�__all__rrrrr� s