+ n9e/^RIHtHt^RIHtHt^RIHt^RIH t H t ^RI H t ] !RRR7t !R R ] ] ,4t]P!]4]P!]4RR ltR tR #))SequenceHashable)islicechain)Integral)TypeVarGeneric)plistT_coT) covariantcDaa]tRt^ toRtRtR V3Rllt]R4t]R4t ] R4t Rt Rt ] t]R4tR!R ltR!R lt] R 4tR tR tRtRtRtRtRtRt] R4tRtRtRtRtRt Rt!]!t"Rt#Rt$Rt%]&PNt'Rt(Vt)V;t*#)"PDequeab 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) c<\\V` V4pWnW%nW5nVe4\ V\4'g \R4hV^8d \R4hWEn V#)Nz An integer is required as maxlenzmaxlen must be non-negative) superr__new__ _left_list _right_list_length isinstancer TypeError ValueError_maxlen)cls left_list right_listlengthmaxleninstance __class__s&&&&& 4/usr/lib/python3/dist-packages/pyrsistent/_pdeque.pyrPDeque.__new__5sc-c2')!  fh// BCCz !>??!c V\PVPVP4#)z Rightmost element in dqueue. )r_tip_from_listsrrselfs&r right PDeque.rightEs! %%d&6&6HHr"c V\PVPVP4#)z Leftmost element in dqueue. )rr$rrr%s&r left PDeque.leftLs! %%doot7G7GHHr"cbV'd VP#V'd VR,#\R4h)zNo elements in empty deque)first IndexError) primary_listsecondary_lists&&r r$PDeque._tip_from_listsSs+ %% % !"% %566r"c^\VPVPP44#N)rrrreverser%s&r __iter__PDeque.__iter__]s"T__d&6&6&>&>&@AAr"cRP\V4VPe RPVP44#R4#)zpdeque({0}{1})z , maxlen={0})formatlistrr%s&r __repr__PDeque.__repr__`sG&&tDzNRllNf~'<'>> pdeque([1, 2]).pop() pdeque([1]) >>> pdeque([1, 2]).pop(2) pdeque([]) >>> pdeque([1, 2]).pop(-1) pdeque([2]) )popleftr _pop_listsrrmaxrr)r&countnew_right_list new_left_lists&& r pop PDeque.poplsd 19<<' '(.(9(9$:J:JDOO]b(c%mS9Mq5QSWS_S_``r"c V^8dVPV)4#\PVPVPV4wr#\W#\ VP V, ^4VP4#)z Return new deque with leftmost element removed. Otherwise functionally equivalent to pop(). >>> pdeque([1, 2]).popleft() pdeque([2]) )rHrrCrrrDrr)r&rErGrFs&& r rBPDeque.popleftsd 1988UF# #(.(9(9$//4K[K[]b(c% mS9Mq5QSWS_S_``r"c$TpTpV^8dV'g V'dtV^,pVP'dVPpK@V'dVP4p\4pKdVP4Pp\4pKW43#r)restr6r )r1r2rEnew_primary_listnew_secondary_lists&&& r rCPDeque._pop_listss|'+ai-1C QJE$$$#3#8#8 !#5#=#=#? %*W"#5#=#=#?#D#D %*W"33r"cVVP'*;'dVP'*#r5)rrr%s&r _is_emptyPDeque._is_emptys ??";;4+;+;';;r"ch\V\4'g\#\V4\V48#r5)rrNotImplementedtupler&others&&r __lt__ PDeque.__lt__s(%((! !T{U5\))r"c\V\4'g\#\V4\V48Xd\ V4\ V48XgQhR#R#)TF)rrrVrWlenrXs&&r __eq__ PDeque.__eq__sA%((! ! ;%, &t9E * **r"c*\\V44#r5)hashrWr%s&r __hash__PDeque.__hash__sE$K  r"cVP#r5)rr%s&r __len__PDeque.__len__s ||r"c VPVPVPV4wr#p\W#W@P4#)zf Return new deque with elem as the rightmost element. >>> pdeque([1, 2]).append(3) pdeque([1, 2, 3]) )_appendrrrr)r&elemrGrF new_lengths&& r append PDeque.appends859LLRVRbRbdh4i1 zmZNNr"c VPVPVPV4wr#p\W2W@P4#)zi Return new deque with elem as the leftmost element. >>> pdeque([1, 2]).appendleft(3) pdeque([3, 1, 2]) )rhrrrr)r&rirFrGrjs&& r appendleftPDeque.appendlefts:59LLAQAQSWSbSbdh4i1zmZNNr"c0VPefVPVP8XdKVP^8XdW^3#\PW^4wrEWEP V4VP3#WP V4VP^,3#r5)rrrrCcons)r&r1r2rirOrPs&&&& r rhPDeque._appends << #  (D||q #Q66393D3D\cd3e 0 #%<%>> pdeque([1, 2]).extend([3, 4]) pdeque([1, 2, 3, 4]) )r|rrrrr)r&rurFrGrys&& r extend PDeque.extendsH7;ll4CSCSUYUdUdfn6o3|mT\\L5PRVR^R^__r"c VPVPVPV4wr#p\W#VPV,VP 4#)z 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]) )r|rrrrr)r&rurGrFrys&& r extendleftPDeque.extendleftsF7;ll4??TXTdTdfn6o3 |mT\\L5PRVR^R^__r"c xVPPV4VPPV4,#)zd Return the number of elements equal to elem present in the queue >>> pdeque([1, 2, 1]).count(1) 2 )rrEr)r&ris&&r rE PDeque.counts/$$T*T-=-=-C-CD-IIIr"c \VPPV4VPVP^, 4# \ d\TPTPP 4PT4P 4TP^, 4u# \ d!p\ RPT44ThRp?ii;ii;i)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]) z{0} not found in PDequeN)rrremoverrrr6r;)r&ries&& r r PDeque.remove s P$//0068H8H$,,YZJZ[ [ P Pdoo"..668??EMMOQUQ]Q]`aQacc P !:!A!A$!GHaO P  Ps1AA CAB.+C. C9CCCc X\VPVPVP4#)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]) )rrrrr%s&r r6PDeque.reverses!d&&FFr"c VPV4pV^8d*VP\VP4V44#VP \W)44#)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]) )rHrrr6r)r&steps popped_deques&& r rotate PDeque.rotate,sNxx A:**6$,,.%+HI I""6$#788r"c<\\V4VP33#r5)pdequer<rr%s&r __reduce__PDeque.__reduce__<sT DLL111r"c6\V\4'dVPe9VP^8wd(\\ V4V,VP R7#TpVP e-VPVP VP,4pVPe>VPVPVPVP,, 4pV#\V\4'g&\R\V4P,4hV^8dVPV4P#\!V4V,pV^8d%\#RP%V\!V444hVPV4P#)N)rz-'%s' object cannot be interpreted as an indexz!pdeque index {0} out of range {1})rslicesteprrWrstartrBrstoprHrrtype__name__r*r]r0r;)r&indexresultshifteds&& r __getitem__PDeque.__getitem__@s, eU # #zz%%**/eDk%0FFF{{& dll(BCzz%DLLEJJ4M$NOM%**KdSXkNbNbbc c A:<<&++ +d)e# Q;3::5#d)L ||G$)))r")rrrr __weakref__r5)r-)+r __module__ __qualname____firstlineno____doc__ __slots__rpropertyr'r* staticmethodr$r7r=__str__rrHrBrCrSrZr^rbrerkrnrhrvr|rrrErr6 __reversed__rrrrr__static_attributes____classdictcell__ __classcell__)r __classdict__s@@r rr s#'PSI II II 77BpG  a( a44"<* !OOI B` `JP& GL9 2*6 NNEEr"rNc\V4pVeW!)Rp\V4p\V^, 4p\VRV4p\W$RRR7p\ WVW14#)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) NT)r6)rWr]intr r)rurtrpivotr*r's&& r rrasa hA  ghK VF  OE 6E D !F)T *E $v ..r"c\V4#)zK Return deque containing all arguments. >>> dq(1, 2, 3) pdeque([1, 2, 3]) )r)elementss*r dqrts ( r")rN)collections.abcrr itertoolsrrnumbersrtypingrr pyrsistent._plistr r rregisterrrrr"r rs[.###v&QWT]Qf  &&/&r"