a `]_/@srddlmZmZddlmZmZddlmZddlm Z Gddde Z e e e e d d d Z d d ZdS))SequenceHashable)islicechain)Integral)plistcs(eZdZdZdZd=fdd ZeddZedd Ze d d Z d d Z ddZ e Z eddZd>ddZd?ddZe ddZddZddZddZdd Zd!d"Zd#d$Zd%d&Zd'd(Ze d)d*Zd+d,Zd-d.Zd/d0Zd1d2Zd3d4Zd5d6Z e Z!d7d8Z"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||}||_||_||_|durLt|ts>> 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 )rcountnew_right_list new_left_listrrrpopis z PDeque.popcCsF|dkr|| St|j|j|\}}t||t|j|d|jS)z Return new deque with leftmost element removed. Otherwise functionally equivalent to pop(). >>> pdeque([1, 2]).popleft() pdeque([2]) r)r5rr0r r r1r r )rr2r4r3rrrr/}s zPDeque.popleftcCs\|}|}|dkrT|s|rT|d8}|jr.|j}q|rB|}t}q|j}t}q||fSNrr.)restr(r)r%r&r2new_primary_listnew_secondary_listrrrr0s zPDeque._pop_listscCs|j o|j Sr')r r rrrr _is_emptyszPDeque._is_emptycCst|tstSt|t|kSr'rrNotImplementedtuplerotherrrr__lt__s z PDeque.__lt__cCs&t|tstSt|t|kr"dSdS)NTFr;r>rrr__eq__s  z PDeque.__eq__cCs tt|Sr')hashr=rrrr__hash__szPDeque.__hash__cCs|jSr')r rrrr__len__szPDeque.__len__cCs(||j|j|\}}}t||||jS)z Return new deque with elem as the rightmost element. >>> pdeque([1, 2]).append(3) pdeque([1, 2, 3]) )_appendr r rr )relemr4r3 new_lengthrrrappendsz PDeque.appendcCs(||j|j|\}}}t||||jS)z Return new deque with elem as the leftmost element. >>> pdeque([1, 2]).appendleft(3) pdeque([3, 1, 2]) )rEr r rr )rrFr3r4rGrrr appendleftszPDeque.appendleftcCsd|jdurN|j|jkrN|jdkr*||dfSt||d\}}||||jfS||||jdfSr6)r r rr0cons)rr%r&rFr8r9rrrrEs   zPDeque._appendcCs(d}|D]}||}|d7}q||fSr6)rJ)Zthe_listiterabler2rFrrr _extend_lists   zPDeque._extend_listc Cs`t||\}}|}|j|}|jdurV||jkrV||j}t|||\}}||8}|||fSr')rrLr r r0) rr%r&rKr8 extend_countr9Z current_lenZpop_lenrrr_extends  zPDeque._extendcCs.||j|j|\}}}t|||j||jS)z Return new deque with all elements of iterable appended to the right. >>> pdeque([1, 2]).extend([3, 4]) pdeque([1, 2, 3, 4]) )rNr r rr r )rrKr3r4rMrrrextendsz PDeque.extendcCs.||j|j|\}}}t|||j||jS)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]) )rNr r rr r )rrKr4r3rMrrr extendlefts 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 r2r )rrFrrrr2sz PDeque.countc Cszt|j||j|jdWStyz*t|j|j||jdWYSty}ztd||WYd}~n d}~00Yn0dS)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)rr remover r rr(r+)rrFerrrrQs  z PDeque.removecCst|j|j|jS)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 r rrrrr(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)r5rPrr(rO)rZstepsZ popped_dequerrrrotate)s z PDeque.rotatecCstt||jffSr')pdequer,r rrrr __reduce__9szPDeque.__reduce__cCst|trz|jdur4|jdkr4tt|||jdS|}|jdurT||j|j}|j durv| |j|j |j}|St|t st dt |j|dkr||jSt||}|dkrtd|t|||jS)Nr.)rz-'%s' object cannot be interpreted as an indexrz!pdeque index {0} out of range {1})rslicesteprTr=r startr/r stopr5rrtype__name__r!lenr$r+)rindexresultZshiftedrrr __getitem__=s&      zPDeque.__getitem__)N)r.)r.)(r[ __module__ __qualname____doc__ __slots__rpropertyr r! staticmethodrr)r-__str__rr5r/r0r:r@rArCrDrHrIrErLrNrOrPr2rQr( __reversed__rSrUr_rr] __classcell__rrrrrsN(                 rrNcCsdt|}|dur|| d}t|}t|d}t|d|}t||ddd}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) NT)r()r=r\intrr)rKrtrZpivotr!r rrrrT^s  rTcGst|S)z[ Return deque containing all arguments. >>> dq(1, 2, 3) pdeque([1, 2, 3]) )rT)elementsrrrdqqsrm)rN)collections.abcrr itertoolsrrZnumbersrZpyrsistent._plistrobjectrregisterrTrmrrrrs  U