Your IP : 216.73.216.213

Current Path : /opt/alt/python35/lib64/python3.5/site-packages/pyrsistent/__pycache__/
Upload File :
Current File : //opt/alt/python35/lib64/python3.5/site-packages/pyrsistent/__pycache__/_pdeque.cpython-35.pyc



+�[�/�@s�ddlmZmZddlmZmZddlmZddlm	Z	Gdd�de
�Zeje�eje�fdd	d
�Z
dd�ZdS)
�)�Sequence�Hashable�)�islice�chain)�Integral)�plistcs�eZdZdZdAZd�fdd	�Zed
d��Zedd
��Ze	dd��Z
dd�Zdd�ZeZ
edd��Zddd�Zddd�Ze	dd��Zdd�Zdd �Zd!d"�Zd#d$�Zd%d&�Zd'd(�Zd)d*�Zd+d,�Ze	d-d.��Zd/d0�Zd1d2�Zd3d4�Zd5d6�Zd7d8�Zd9d:�Z e Z!d;d<�Z"d=d>�Z#d?d@�Z$e%j&Z&�S)B�PDequea�
    Persistent double ended queue (deque). Allows quick appends and pops in both ends. Implemented
    using two persistent lists.

    A maximum length can be specified to create a bounded queue.

    Fully supports the Sequence and Hashable protocols including indexing and slicing but
    if you need fast random access go for the PVector instead.

    Do not instantiate directly, instead use the factory functions :py:func:`dq` or :py:func:`pdeque` to
    create an instance.

    Some examples:

    >>> x = pdeque([1, 2, 3])
    >>> x.left
    1
    >>> x.right
    3
    >>> x[0] == x.left
    True
    >>> x[-1] == x.right
    True
    >>> x.pop()
    pdeque([1, 2])
    >>> x.pop() == x[:-1]
    True
    >>> x.popleft()
    pdeque([2, 3])
    >>> x.append(4)
    pdeque([1, 2, 3, 4])
    >>> x.appendleft(4)
    pdeque([4, 1, 2, 3])

    >>> y = pdeque([1, 2, 3], maxlen=3)
    >>> y.append(4)
    pdeque([2, 3, 4], maxlen=3)
    >>> y.appendleft(4)
    pdeque([4, 1, 2], maxlen=3)
    �
_left_list�_right_list�_length�_maxlen�__weakref__Ncstt|�j|�}||_||_||_|dk	rrt|t�sZtd��|dkrrt	d��||_
|S)Nz An integer is required as maxlenrzmaxlen must be non-negative)�superr	�__new__r
rr�
isinstancer�	TypeError�
ValueErrorr
)�clsZ	left_listZ
right_list�length�maxlen�instance)�	__class__��E/opt/alt/python35/lib64/python3.5/site-packages/pyrsistent/_pdeque.pyr2s				zPDeque.__new__cCstj|j|j�S)z.
        Rightmost element in dqueue.
        )r	�_tip_from_listsrr
)�selfrrr�rightBszPDeque.rightcCstj|j|j�S)z-
        Leftmost element in dqueue.
        )r	rr
r)rrrr�leftIszPDeque.leftcCs+|r
|jS|r|dStd��dS)NrzNo elements in empty deque���)�first�
IndexError)�primary_list�secondary_listrrrrPs
zPDeque._tip_from_listscCst|j|jj��S)N)rr
r�reverse)rrrr�__iter__ZszPDeque.__iter__cCs7djt|�|jdk	r0dj|j�nd�S)Nzpdeque({0}{1})z, maxlen={0}�)�format�listr
)rrrr�__repr__]szPDeque.__repr__cCs|jS)z.
        Maximum length of the queue.
        )r
)rrrrrbsz
PDeque.maxlenrcCsa|dkr|j|�Stj|j|j|�\}}t||t|j|d�|j�S)a�
        Return new deque with rightmost element removed. Popping the empty queue
        will return the empty queue. A optional count can be given to indicate the
        number of elements to pop. Popping with a negative index is the same as
        popleft. Executes in amortized O(k) where k is the number of elements to pop.

        >>> pdeque([1, 2]).pop()
        pdeque([1])
        >>> pdeque([1, 2]).pop(2)
        pdeque([])
        >>> pdeque([1, 2]).pop(-1)
        pdeque([2])
        r)�popleftr	�
_pop_listsrr
�maxrr
)r�count�new_right_list�
new_left_listrrr�popis!z
PDeque.popcCsa|dkr|j|�Stj|j|j|�\}}t||t|j|d�|j�S)z�
        Return new deque with leftmost element removed. Otherwise functionally
        equivalent to pop().

        >>> pdeque([1, 2]).popleft()
        pdeque([2])
        r)r0r	r+r
rr,rr
)rr-r/r.rrrr*}s!zPDeque.popleftcCs�|}|}xq|dkr|s'|r|d8}|jrF|j}q|rd|j�}t�}q|j�j}t�}qW||fS)Nrr)�restr$r)r"r#r-�new_primary_list�new_secondary_listrrrr+�s
	
zPDeque._pop_listscCs|jo|jS)N)r
r)rrrr�	_is_empty�szPDeque._is_emptycCs)t|t�stSt|�t|�kS)N)rr	�NotImplemented�tuple)r�otherrrr�__lt__�sz
PDeque.__lt__cCsQt|t�stSt|�t|�krMt|�t|�ksIt�dSdS)NTF)rr	r5r6�len�AssertionError)rr7rrr�__eq__�sz
PDeque.__eq__cCstt|��S)N)�hashr6)rrrr�__hash__�szPDeque.__hash__cCs|jS)N)r)rrrr�__len__�szPDeque.__len__cCs:|j|j|j|�\}}}t||||j�S)z�
        Return new deque with elem as the rightmost element.

        >>> pdeque([1, 2]).append(3)
        pdeque([1, 2, 3])
        )�_appendr
rr	r
)r�elemr/r.�
new_lengthrrr�append�s$z
PDeque.appendcCs:|j|j|j|�\}}}t||||j�S)z�
        Return new deque with elem as the leftmost element.

        >>> pdeque([1, 2]).appendleft(3)
        pdeque([3, 1, 2])
        )r?rr
r	r
)rr@r.r/rArrr�
appendleft�s$zPDeque.appendleftcCs�|jdk	rq|j|jkrq|jdkr=||dfStj||d�\}}||j|�|jfS||j|�|jdfS)Nrr)r
rr	r+�cons)rr"r#r@r2r3rrrr?�s!
zPDeque._appendcCs:d}x'|D]}|j|�}|d7}q
W||fS)Nrr)rD)Zthe_list�iterabler-r@rrr�_extend_list�s

zPDeque._extend_listc	Cs�tj||�\}}|}|j|}|jdk	r{||jkr{||j}tj|||�\}}||8}|||fS)N)r	rFrr
r+)	rr"r#rEr2�extend_countr3Zcurrent_lenZpop_lenrrr�_extend�s


zPDeque._extendcCsA|j|j|j|�\}}}t|||j||j�S)z�
        Return new deque with all elements of iterable appended to the right.

        >>> pdeque([1, 2]).extend([3, 4])
        pdeque([1, 2, 3, 4])
        )rHrr
r	rr
)rrEr.r/rGrrr�extend�s$z
PDeque.extendcCsA|j|j|j|�\}}}t|||j||j�S)a
        Return new deque with all elements of iterable appended to the left.

        NB! The elements will be inserted in reverse order compared to the order in the iterable.

        >>> pdeque([1, 2]).extendleft([3, 4])
        pdeque([4, 3, 1, 2])
        )rHr
rr	rr
)rrEr/r.rGrrr�
extendleft�s	$zPDeque.extendleftcCs |jj|�|jj|�S)z�
        Return the number of elements equal to elem present in the queue

        >>> pdeque([1, 2, 1]).count(1)
        2
        )r
r-r)rr@rrrr-�szPDeque.countcCs�y*t|jj|�|j|jd�SWnrtk
r�y6t|j|jj�j|�j�|jd�SWn'tk
r�tdj|���YnXYnXdS)z�
        Return new deque with first element from left equal to elem removed. If no such element is found
        a ValueError is raised.

        >>> pdeque([2, 1, 2]).remove(2)
        pdeque([1, 2])
        rz{0} not found in PDequeN)r	r
�removerrrr$r')rr@rrrrKs*
	-
z
PDeque.removecCst|j|j|j�S)z�
        Return reversed deque.

        >>> pdeque([1, 2, 3]).reverse()
        pdeque([3, 2, 1])

        Also supports the standard python reverse function.

        >>> reversed(pdeque([1, 2, 3]))
        pdeque([3, 2, 1])
        )r	rr
r)rrrrr$szPDeque.reversecCsN|j|�}|dkr7|jt|j�|��S|jt||��S)z�
        Return deque with elements rotated steps steps.

        >>> x = pdeque([1, 2, 3])
        >>> x.rotate(1)
        pdeque([3, 1, 2])
        >>> x.rotate(-2)
        pdeque([3, 1, 2])
        r)r0rJrr$rI)rZstepsZpopped_dequerrr�rotate)s
z
PDeque.rotatecCstt|�|jffS)N)�pdequer(r
)rrrr�
__reduce__9szPDeque.__reduce__cCs9t|t�r�|jdk	rJ|jdkrJtt|�|d|j�S|}|jdk	rx|j|j|j�}|j	dk	r�|j
|j|j	|j�}|St|t�s�tdt
|�j��|dkr�|j|�jSt|�|}|dkr)tdj|t|����|j|�jS)Nrrz-'%s' object cannot be interpreted as an indexrz!pdeque index {0} out of range {1})r�slice�steprMr6r
�startr*r�stopr0rr�type�__name__rr9r!r')r�index�resultZshiftedrrr�__getitem__=s$ zPDeque.__getitem__)r
rrr
r)'rT�
__module__�__qualname__�__doc__�	__slots__r�propertyrr�staticmethodrr%r)�__str__rr0r*r+r4r8r;r=r>rBrCr?rFrHrIrJr-rKr$�__reversed__rLrNrWrrUrr)rrr	sB(


		
	
r	NcCs�t|�}|dk	r)||d�}t|�}t|d�}t|d|��}t||d�dd�}t||||�S)a*
    Return deque containing the elements of iterable. If maxlen is specified then
    len(iterable) - maxlen elements are discarded from the left to if len(iterable) > maxlen.

    >>> pdeque([1, 2, 3])
    pdeque([1, 2, 3])
    >>> pdeque([1, 2, 3, 4], maxlen=2)
    pdeque([3, 4], maxlen=2)
    N�r$T)r6r9�intrr	)rEr�trZpivotrrrrrrM^s
rMcGs
t|�S)z[
    Return deque containing all arguments.

    >>> dq(1, 2, 3)
    pdeque([1, 2, 3])
    )rM)�elementsrrr�dqqsrd)�_compatrr�	itertoolsrr�numbersrZpyrsistent._plistr�objectr	�registerrMrdrrrr�<module>s�T