�
�9Zc@`
sudZd
dl
mZmZmZ
d
dlmZ
d
dlmZ
d
dl	m
Z

dg
Zdef
d��YZ
dS(	s$

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.

i(tdivisiontabsolute_importtprint_function(
tmul(
treduce(
tlongtArrayteratorcB`
s\eZ
dZdd
�
Zd�Zd�Zd�Zed��
Z	ed��
Z
d�ZRS(	s�
    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)
    ...
    [[[[0 1]]]] (1, 1, 1, 2)

    cC`
ss|
|_||_
g|
jD]}d
^q|_g|
jD]}|^q;|_g|
jD]}d^qZ|_dS(Nii
(tvartbuf_sizetshapetstarttstoptstep(tselfRRtdim((sI/opt/alt/python27/lib64/python2.7/site-packages/numpy/lib/arrayterator.pyt__init__Ys

	
	

cC`
st|j
|
�S(
N(tgetattrR(R
tattr((sI/opt/alt/python27/lib64/python2.7/site-packages/numpy/lib/arrayterator.pyt__getattr__as
cC`
s�
t|
t
�s|
f
}
ng}t|
�
t|j�
}}x�|
D]�}|tkr�|jtd�
g
||d
�

t|�
}qDt|tt	f�r�|j
t||d
d
��

qD|j
|�

qDWt
|�
}
t|
�
|kr
|
td�
f
|t|
�
7}
n|j|j|j
�}x�tt|j|j|j|
��
D]�\}\}}	}
}||jps
d|j|<|
|jp�
d
|j|<||jp�
|	||j|<t|	|j|�|j|<qL
W|S(s-
        Return a new arrayterator.

        i
iN(t
isinstancettupletlenR	tEllipsistextendtslicetNonetintRtappendt	__class__RRt	enumeratetzipR
RRtmin(R
tindextfixedtlengthtdimstslice_toutt
iR
RR((sI/opt/alt/python27/lib64/python2.7/site-packages/numpy/lib/arrayterator.pyt__getitem__ds,






"


 


$

7



!
c
C`
s6td
�t
|j|j|j�D�
�
}
|j|
S(s-
        Return corresponding data.

        c
s`
s|]}
t|
�V
qdS(
N(
R(t.0t
t((sI/opt/alt/python27/lib64/python2.7/site-packages/numpy/lib/arrayterator.pys	<genexpr>�s(RRR
RRR(R
R$((sI/opt/alt/python27/lib64/python2.7/site-packages/numpy/lib/arrayterator.pyt	__array__�s

c
c`
s.x'|D]}
x|
jD]}|V
qWqWd
S(sF
        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 <type 'numpy.int32'>

        N(
tflat(R
tblocktvalue((sI/opt/alt/python27/lib64/python2.7/site-packages/numpy/lib/arrayterator.pyR+�s


c

C`
s)td
�t
|j|j|j�D�
�
S(sk
        The shape of the array to be iterated over.

        For an example, see `Arrayterator`.

        c
s`
s.|]$\}
}}||
d|dV
qd
S(i
N((R(R
RR((sI/opt/alt/python27/lib64/python2.7/site-packages/numpy/lib/arrayterator.pys	<genexpr>�s(RRR
RR(
R
((sI/opt/alt/python27/lib64/python2.7/site-packages/numpy/lib/arrayterator.pyR	�s	
c

c`
sg|jD]}
|
d
k
r
|
^q
r,dS|j
}|j}|j}t|jj�
}x�
tr|jp}tt	|j�}d
}x�t
|ddd�D]�}|d
kr�||d||<nG||j|k
r�|||||||<|}n|j|||<t|j|||�||<||j|}q�Wtd�t
|||�D�
�
}	|j|	V
||||<xht
|dd
d�D]P}|||j|kr�
|j
|||<||dc|j|d7<q�
q�
W|d
|jd
kr_dSq_WdS(Nii
i����c
s`
s|]}
t|
�V
qdS(
N(
R(R(R)((sI/opt/alt/python27/lib64/python2.7/site-packages/numpy/lib/arrayterator.pys	<genexpr>�s(R	R
RRRRtTrueRRRtrangeRRR(
R
RR
RRtndimstcounttrundimR&R$((sI/opt/alt/python27/lib64/python2.7/site-packages/numpy/lib/arrayterator.pyt__iter__�s6(






	




	

"




&

N(t__name__t
__module__t__doc__RRRR'R*tpropertyR+R	R3(((sI/opt/alt/python27/lib64/python2.7/site-packages/numpy/lib/arrayterator.pyRsC		 		N(R6t
__future__RR
RtoperatorRt	functoolsRtnumpy.compatRt__all__tobjectR(((sI/opt/alt/python27/lib64/python2.7/site-packages/numpy/lib/arrayterator.pyt<module>	s