o 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||}||_||_||_|dur&t|tstd|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_listlengthmaxleninstance __class__4/usr/lib/python3/dist-packages/pyrsistent/_pdeque.pyr2s zPDeque.__new__cCt|j|jS)z. Rightmost element in dqueue. )r_tip_from_listsr r selfrrrrightBz PDeque.rightcCr)z- Leftmost element in dqueue. )rrr r rrrrleftIr"z PDeque.leftcCs|r|jS|r |dStd)NzNo elements in empty deque)first IndexError) primary_listsecondary_listrrrrPs zPDeque._tip_from_listscCst|j|jSN)rr r reverserrrr__iter__ZszPDeque.__iter__cCs(dt||jdurd|jSdS)Nzpdeque({0}{1})z , maxlen={0})formatlistr rrrr__repr__]s zPDeque.__repr__cC|jS)z. Maximum length of the queue. )r rrrrrbsz PDeque.maxlencCsF|dkr || St|j|j|\}}t||t|j|d|jS)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_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)r8rr3r r r4r r )r r5r7r6rrrr2}s zPDeque.popleftcCsj|}|}|dkr1|s |r1|d8}|jr|j}n|r!|}t}n|j}t}|dkr1|s |s ||fSNrr1)restr*r)r'r(r5new_primary_listnew_secondary_listrrrr3s  zPDeque._pop_listscCs|j o|j Sr))r r rrrr _is_emptyszPDeque._is_emptycCst|tstSt|t|kSr))rrNotImplementedtupler otherrrr__lt__s z PDeque.__lt__cCs:t|tstSt|t|krt|t|ksJdSdS)NTF)rrr>r?lenr@rrr__eq__s z PDeque.__eq__cCs tt|Sr))hashr?rrrr__hash__s zPDeque.__hash__cCr0r))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 )r elemr7r6 new_lengthrrrappendz 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]) )rHr r rr )r rIr6r7rJrrr appendleftrLzPDeque.appendleftcCsd|jdur'|j|jkr'|jdkr||dfSt||d\}}||||jfS||||jdfSr9)r r rr3cons)r r'r(rIr;r<rrrrHs   zPDeque._appendcCs(d}|D] }||}|d7}q||fSr9)rN)the_listiterabler5rIrrr _extend_lists   zPDeque._extend_listc Cs`t||\}}|}|j|}|jdur+||jkr+||j}t|||\}}||8}|||fSr))rrQr r r3) r r'r(rPr; extend_countr< current_lenpop_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]) )rUr r rr r )r rPr6r7rRrrrextendsz 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]) )rUr r rr r )r rPr7r6rRrrr 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 r5r )r rIrrrr5sz PDeque.countc Cszt|j||j|jdWSty@zt|j|j||jdWYSty?}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 r rr*r-)r rIerrrrXs  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)r8rWrr*rV)r steps popped_dequerrrrotate)s z PDeque.rotatecCstt||jffSr))pdequer.r rrrr __reduce__9szPDeque.__reduce__cCst|tr=|jdur|jdkrtt|||jdS|}|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})rslicestepr]r?r startr2r stopr8rrtype__name__r#rCr&r-)r indexresultshiftedrrr __getitem__=s&       zPDeque.__getitem__r))r1)(rd __module__ __qualname____doc__ __slots__rpropertyr!r# staticmethodrr+r/__str__rr8r2r3r=rBrDrFrGrKrMrHrQrUrVrWr5rXr* __reversed__r\r^rhrre __classcell__rrrrrsP(                 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?rCintrr)rPrtrpivotr#r!rrrr]^s  r]cGst|S)z[ Return deque containing all arguments. >>> dq(1, 2, 3) pdeque([1, 2, 3]) )r])elementsrrrdqqsrw)rN)collections.abcrr itertoolsrrnumbersrpyrsistent._plistrobjectrregisterr]rwrrrrs   U