]j/ d dl mZmZ d dlmZmZ d dlmZ d dlm Z G d de
Z ej e ej e d d Z
d
ZdS ) )SequenceHashable)islicechain)Integral)plistc D e Zd ZdZdZd! fd Zed Zed Ze d Z
d Z d Z e Z
ed
Zd"d Zd"d
Ze d Zd Zd Zd Zd Zd Zd Zd Zd Ze d Zd Zd Z d Z d Z d Z d Z e Z!d Z"d Z#d Z$e%j& Z& xZ'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 t t | | }||_ ||_ ||_ |9t
|t st d |dk rt 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_listlengthmaxleninstance __class__s r/builddir/build/BUILD/imunify360-venv-2.6.3/opt/imunify360/venv/lib/python3.11/site-packages/pyrsistent/_pdeque.pyr zPDeque.__new__2 s %%--c22 ' ) ! fh//
D BCCCzz !>???! c L t | j | j S )z.
Rightmost element in dqueue.
)r
_tip_from_listsr r selfs r rightz PDeque.rightB s
%%d&6HHHr c L t | j | j S )z-
Leftmost element in dqueue.
)r
r r r r! s r leftz PDeque.leftI s
%%dot7GHHHr c F | r| j S |r|d S t d )NzNo elements in empty deque)first
IndexError) primary_listsecondary_lists r r zPDeque._tip_from_listsP s5 & % % &!"% %5666r c Z t | j | j S N)r r r reverser! s r __iter__zPDeque.__iter__Z s# T_d&6&>&>&@&@AAAr c d t | | j d | j nd S )Nzpdeque({0}{1})z , maxlen={0} )formatlistr r! s r __repr__zPDeque.__repr__] sE &&tDzzNRlNf~'<'<T\'J'J'Jlnp p pr c | j S )z.
Maximum length of the queue.
)r r! s r r z
PDeque.maxlenb s
|r c |dk r| | S t | j | j | \ }}t ||t | j |z
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" countnew_right_list
new_left_lists r popz
PDeque.popi sl 199<<'' '(.(9(9$:JDO]b(c(c%
m^S 9Mq5Q5QSWS_```r c |dk r| | S t | j | j | \ }}t ||t | j |z
d | j S )z
Return new deque with leftmost element removed. Otherwise functionally
equivalent to pop().
>>> pdeque([1, 2]).popleft()
pdeque([2])
r )r> r
r9 r r r: r
r )r" r; r= r< s r r8 zPDeque.popleft} sl 19988UF## #(.(9(9$/4K[]b(c(c%
~m^S 9Mq5Q5QSWS_```r c | }|}|dk rn|s|rj|dz }|j r|j }nL|r#| }t }n'| j }t }|dk r|h|j||fS Nr r6 )restr. r )r* r+ r; new_primary_listnew_secondary_lists r r9 zPDeque._pop_lists s ' +aii -i1Ci QJE $
-#3#8 !
-#5#=#=#?#? %*WW""#5#=#=#?#?#D %*WW" aii -i1Ci !333r c " | j o| j S r- )r r r! s r _is_emptyzPDeque._is_empty s ?";4+;';;r c z t |t st S t | t | k S r- )r r
NotImplementedtupler" others r __lt__z
PDeque.__lt__ s1 %(( "! !T{{U5\\))r c t |t st S t | t | k r$t | t | k sJ dS dS )NTF)r r
rH rI lenrJ s r __eq__z
PDeque.__eq__ sX %(( "! ! ;;%,, & &t99E
****4ur c : t t | S r- )hashrI r! s r __hash__zPDeque.__hash__ s U4[[!!!r c | j S r- )r
r! s r __len__zPDeque.__len__ s
|r c z | | 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" elemr= r<
new_lengths r appendz
PDeque.append s= 59LL RVRbdh4i4i1
~zm^Z NNNr c z | | j | j | \ }}}t |||| j S )z
Return new deque with elem as the leftmost element.
>>> pdeque([1, 2]).appendleft(3)
pdeque([3, 1, 2])
)rV r r r
r )r" rW r< r= rX s r
appendleftzPDeque.appendleft s> 59LLAQSWSbdh4i4i1
zm^Z NNNr c | j \| j | j k rL| j dk r||dfS t ||d \ }}|| | | j fS || | | j dz fS rA )r r
r
r9 cons)r" r* r+ rW rC rD s r rV zPDeque._append s < # (D(D|q #^Q66393D3D\Sacd3e3e 0 0#%7%<%<T%B%BDLP P^ 0 0 6 6 q8HHHr c L d}|D ] }| | } |dz
} | |fS rA )r] )the_listiterabler; rW s r _extend_listzPDeque._extend_list s< D }}T**H QJEE r c t || \ }}|}| j |z }| j 9|| j k r.|| j z
}t ||| \ }}||z }|||fS r- )r
ra r
r r9 ) r" r* r+ r` rC extend_countrD current_lenpop_lens r _extendzPDeque._extend s )/)<)<\8)T)T&, +l\1 < # dl(B(B!DL0G393D3DEWYikr3s3s 0 0 G #L !3\AAr c | | j | j | \ }}}t ||| j |z | 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])
)rf r r r
r
r )r" r` r< r= rc s r extendz
PDeque.extend sG 7;ll4CSUYUdfn6o6o3
|m^T\L5PRVR^___r c | | j | j | \ }}}t ||| j |z | 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])
)rf r r r
r
r )r" r` r= r< rc s r
extendleftzPDeque.extendleft sF 7;ll4?TXTdfn6o6o3
~|m^T\L5PRVR^___r c l | j | | j | z S )z
Return the number of elements equal to elem present in the queue
>>> pdeque([1, 2, 1]).count(1)
2
)r r; r )r" rW s r r; z PDeque.count s0 $$T**T-=-C-CD-I-IIIr c t | j | | j | j dz
S # t
$ r t | j | j | | j dz
cY S # t
$ r(}t d | |d}~ww xY ww xY w)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])
r6 z{0} not found in PDequeN)r
r remover r
r r. r2 )r" rW es r rm z
PDeque.remove s P$/00668H$,YZJZ[[ [ P P P
P do # / 7 7 9 9 @ @ F F N N P PRVR^abRbd d d d d
P
P
P !:!A!A$!G!GHHaO
P
Ps. 58
CAB C
C)#C CCc B 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! s r r. zPDeque.reverse s d& FFFr c | | }|dk r5| 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 )r> rj r r. rh )r" steps popped_deques r rotatez
PDeque.rotate) sb xx A:: **6$,,..%+H+HII I""6$#7#7888r c < t t | | j ffS r- )pdequer3 r r! s r
__reduce__zPDeque.__reduce__9 s T
DL111r c t |t r|j 4|j dk r)t t | | | j S | }|j "| |j | j z }|j *|
| j |j | j z z
}|S t |t s$t dt | j z |dk r| | j S t! | |z }|dk r0t# d |t! | | | j S )Nr6 )r z-'%s' object cannot be interpreted as an indexr z!pdeque index {0} out of range {1})r slicestepru rI r startr8 r
stopr> r r type__name__r% rN r) r2 )r" indexresultshifteds r __getitem__zPDeque.__getitem__= sE eU # # z%%*// eDkk% 0 FFFFF{& dl(BCCz% DLEJ 4M$NOOM%** d KdSXkkNb bcc c A::<<&&+ +d))e# Q;; 3::5#d))LL
||G$$))r r- )r6 )(r}
__module__ __qualname____doc__ __slots__r propertyr# r% staticmethodr r/ r4 __str__r r> r8 r9 rF rL rO rR rT rY r[ rV ra rf rh rj r; rm r. __reversed__rs rv r r r~
__classcell__)r s @r r
r
so ' 'P SI I I XI I I XI 7 7 \7B B Bp p p G
X a a a a( a a a a 4 4 \4"< < <* * * " " " O O OO O OI I I \ B B B` ` `
`
`
`J J JP P P& G G G L9 9 9 2 2 2* * *6
NEEEEEr r
Nc t | }| || d }t | }t |dz }t |d| }t ||d d }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. )rI rN intr r
)r` r tr pivotr% r# s r ru ru ^ s hA
vghhK
VVF
OOE 6E6 D !EFF)T * * *E $vv . ..r c t | S )z[
Return deque containing all arguments.
>>> dq(1, 2, 3)
pdeque([1, 2, 3])
)ru )elementss r dqr q s ( r )r N)collections.abcr r itertoolsr r numbersr pyrsistent._plistr objectr
registerru r r r r <module>r s . . . . . . . . # # # # # # # # # # # # # #Q Q Q Q QV Q Q Qf
& & / / / /& r